Solving Steiner trees: Recent advances, challenges, and perspectives
I Ljubić - Networks, 2021 - Wiley Online Library
The Steiner tree problem (STP) in graphs is one of the most studied problems in
combinatorial optimization. Since its inception in 1970, numerous articles published in the …
combinatorial optimization. Since its inception in 1970, numerous articles published in the …
Solving mixed integer programs using neural networks
Mixed Integer Programming (MIP) solvers rely on an array of sophisticated heuristics
developed with decades of research to solve large-scale MIP instances encountered in …
developed with decades of research to solve large-scale MIP instances encountered in …
Computational sustainability: Computational methods for a sustainable environment, economy, and society
CP Gomes - Frontiers of Engineering: Reports on Leading-Edge …, 2010 - books.google.com
The dramatic depletion of natural resources in the last century now threatens our planet and
the livelihood of future generations. Our Common Future, a report by the World Commission …
the livelihood of future generations. Our Common Future, a report by the World Commission …
Solving connected subgraph problems in wildlife conservation
B Dilkina, CP Gomes - International conference on integration of artificial …, 2010 - Springer
We investigate mathematical formulations and solution techniques for a variant of the
Connected Subgraph Problem. Given a connected graph with costs and profits associated …
Connected Subgraph Problem. Given a connected graph with costs and profits associated …
Upgrading shortest paths in networks
B Dilkina, KJ Lai, CP Gomes - Integration of AI and OR Techniques in …, 2011 - Springer
Abstract We introduce the Upgrading Shortest Paths Problem, a new combinatorial problem
for improving network connectivity with a wide range of applications from multicast …
for improving network connectivity with a wide range of applications from multicast …
Faster algorithms for Steiner tree and related problems: From theory to practice
D Rehfeldt - International Conference on Operations Research, 2022 - Springer
The Steiner tree problem in graphs (SPG) is a classic-hard problem. Many applications can
be modeled as SPG or closely related problems. This article describes a state-of-the-art …
be modeled as SPG or closely related problems. This article describes a state-of-the-art …
Scalable Primal Heuristics Using Graph Neural Networks for Combinatorial Optimization
By examining the patterns of solutions obtained for various instances, one can gain insights
into the structure and behavior of combinatorial optimization (CO) problems and develop …
into the structure and behavior of combinatorial optimization (CO) problems and develop …
Connections in networks: A hybrid approach
This paper extends our previous work by exploring the use of a hybrid solution method for
solving the connection subgraph problem. We employ a two phase solution method, which …
solving the connection subgraph problem. We employ a two phase solution method, which …
[HTML][HTML] The min-Knapsack problem with compactness constraints and applications in statistics
In the min-Knapsack problem, one is given a set of items, each having a certain cost and
weight. The objective is to select a subset with minimum cost, such that the sum of the …
weight. The objective is to select a subset with minimum cost, such that the sum of the …
Robust network design for multispecies conservation
Our work is motivated by an important network design application in computational
sustainability concerning wildlife conservation. In the face of human development and …
sustainability concerning wildlife conservation. In the face of human development and …