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
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
Speeding up IP-based algorithms for constrained quadratic 0-1 optimization, Local cuts for mixed-integer programming, On the graphical relaxation of the symmetric traveling salesman polytope, Lifting, tilting and fractional programming revisited, A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support, A Hierarchy of Subgraph Projection-Based Semidefinite Relaxations for Some NP-Hard Graph Optimization Problems, Multi-goal motion planning using traveling salesman problem in belief space, Efficient filtering for the resource-cost alldifferent constraint, Generating partitions of a graph into a fixed number of minimum weight cuts, Unnamed Item, Cut-and-solve: An iterative search strategy for combinatorial optimization problems, Dubins traveling salesman problem with neighborhoods: a graph-based approach, A branch and cut solver for the maximum stable set problem, Further results on an abstract model for branching and its application to mixed integer programming, The GeoSteiner software package for computing Steiner trees in the plane: an updated computational study, Three enhancements for optimization-based bound tightening, A tutorial on branch and cut algorithms for the maximum stable set problem, On the exact separation of mixed integer knapsack cuts, Decomposition and dynamic cut generation in integer linear programming, A note on the relationship between the graphical traveling salesman polyhedron, the Symmetric Traveling Salesman Polytope, and the metric cone, On the domino-parity inequalities for the STSP, Local cuts revisited, The strength of multi-row models, 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, Engineering Branch-and-Cut Algorithms for the Equicut Problem, 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, An integrated local-search/set-partitioning refinement heuristic for the capacitated vehicle routing problem
Uses Software
