scientific article; zbMATH DE number 2084783
From MaRDI portal
Publication:4735941
zbMATH Open1052.90060MaRDI QIDQ4735941FDOQ4735941
Authors: David 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
Title of this publication is not available (Why is that?)
Recommendations
- A recursive branch-and-bound algorithm for constrained homogeneous T-shape cutting patterns
- Minimum \(T\)-cuts and optimal \(T\)-pairings
- Extended formulations for the \(A\)-cut problem
- A constrained minimum cost \(s\)-\(t\) cutset problem
- On structural parameterizations of the matching cut problem
- On packing \(T\)-cuts
- A paradigm for listing \((s,t)\)-cuts in graphs
- A constraint programming approach to cutset problems
- scientific article; zbMATH DE number 2050721
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)
Cited In (35)
- Properties of bundle valuations in carrier collaboration
- Engineering branch-and-cut algorithms for the equicut problem
- Generating subtour elimination constraints for the TSP from pure integer solutions
- Finding the right cutting planes for the TSP
- Local cuts revisited
- Multi-goal motion planning using traveling salesman problem in belief space
- A note on the relationship between the graphical traveling salesman polyhedron, the Symmetric Traveling Salesman Polytope, and the metric cone
- Further results on an abstract model for branching and its application to mixed integer programming
- A cutting plane procedure for the travelling salesman problem on road networks
- Speeding up IP-based algorithms for constrained quadratic 0-1 optimization
- On the graphical relaxation of the symmetric traveling salesman polytope
- A tutorial on branch and cut algorithms for the maximum stable set problem
- Local cuts for mixed-integer programming
- A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support
- Generating partitions of a graph into a fixed number of minimum weight cuts
- Dubins traveling salesman problem with neighborhoods: a graph-based approach
- A branch and cut solver for the maximum stable set problem
- An integrated local-search/set-partitioning refinement heuristic for the capacitated vehicle routing problem
- An outer approximation algorithm for generating the Edgeworth-Pareto hull of multi-objective mixed-integer linear programming problems
- The strength of multi-row models
- Two- and three-index formulations of the minimum cost multicommodity \(k\)-splittable flow problem
- On the facial structure of symmetric and graphical traveling salesman polyhedra
- Title not available (Why is that?)
- On the exact separation of mixed integer knapsack cuts
- A parallel optimisation approach for the realisation problem in intensity modulated radiotherapy treatment planning
- Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation
- Lifting, tilting and fractional programming revisited
- Cut-and-solve: An iterative search strategy for combinatorial optimization problems
- Efficient filtering for the resource-cost alldifferent constraint
- The GeoSteiner software package for computing Steiner trees in the plane: an updated computational study
- Decomposition and dynamic cut generation in integer linear programming
- Modeling and solving the two-level generalized median tour problem
- On the domino-parity inequalities for the STSP
- A Hierarchy of Subgraph Projection-Based Semidefinite Relaxations for Some NP-Hard Graph Optimization Problems
- Three enhancements for optimization-based bound tightening
Uses Software
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4735941)
