Connections in Networks: Hardness of Feasibility Versus Optimality
From MaRDI portal
Publication:3612404
DOI10.1007/978-3-540-72397-4_2zbMath1214.90127OpenAlexW1647263661MaRDI QIDQ3612404
Willem-Jan van Hoeve, Jordan F. Suter, Ashish Sabharwal, Jon M. Conrad, Carla P. Gomes
Publication date: 10 March 2009
Published in: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-72397-4_2
Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Abstract computational complexity for mathematical programming problems (90C60) Logic programming (68N17)
Related Items (8)
The unrooted set covering connected subgraph problem differentiating between HIV envelope sequences ⋮ Optimal connected subgraphs: Integer programming formulations and polyhedra ⋮ The min-Knapsack problem with compactness constraints and applications in statistics ⋮ Solving Steiner trees: Recent advances, challenges, and perspectives ⋮ A vertex-separator-based integer linear programming formulation for the partitioned Steiner tree problem ⋮ Vertex covering with capacitated trees ⋮ Wildlife reserve design with connectivity and buffer requirements ⋮ On the performance of MaxSAT and MinSAT solvers on 2SAT-MaxOnes
This page was built for publication: Connections in Networks: Hardness of Feasibility Versus Optimality
