Publication:4735941
From MaRDI portal
zbMath1052.90060MaRDI QIDQ4735941
David L. Applegate, Vašek Chvátal, Robert E. Bixby, William Cook
Publication date: 9 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2241/22410261.htm
90C35: Programming involving graphs or networks
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90C27: Combinatorial optimization
90-02: Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming
Related Items
Unnamed Item, A tutorial on branch and cut algorithms for the maximum stable set problem, A Hierarchy of Subgraph Projection-Based Semidefinite Relaxations for Some NP-Hard Graph Optimization Problems, A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support, A branch and cut solver for the maximum stable set problem, Three enhancements for optimization-based bound tightening, On the exact separation of mixed integer knapsack cuts, Lifting, tilting and fractional programming revisited, A note on the relationship between the graphical traveling salesman polyhedron, the Symmetric Traveling Salesman Polytope, and the metric cone, On the graphical relaxation of the symmetric traveling salesman polytope, On the domino-parity inequalities for the STSP, Local cuts revisited, Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation, Two- and three-index formulations of the minimum cost multicommodity \(k\)-splittable flow problem, Efficient filtering for the resource-cost alldifferent constraint, Dubins traveling salesman problem with neighborhoods: a graph-based approach, The GeoSteiner software package for computing Steiner trees in the plane: an updated computational study, Generating partitions of a graph into a fixed number of minimum weight cuts, An integrated local-search/set-partitioning refinement heuristic for the capacitated vehicle routing problem, Multi-goal motion planning using traveling salesman problem in belief space, Further results on an abstract model for branching and its application to mixed integer programming, On the facial structure of symmetric and graphical traveling salesman polyhedra, A parallel optimisation approach for the realisation problem in intensity modulated radiotherapy treatment planning, Local cuts for mixed-integer programming, Cut-and-solve: An iterative search strategy for combinatorial optimization problems, Decomposition and dynamic cut generation in integer linear programming, The strength of multi-row models, Speeding up IP-based algorithms for constrained quadratic 0-1 optimization, Engineering Branch-and-Cut Algorithms for the Equicut Problem
Uses Software
