Polyhedral techniques in combinatorial optimization II: applications and computations

DOI10.1111/1467-9574.00104MaRDI QIDQ4262981zbMATH OpenOpenAlexFDO

Authors Karen Aardal, Stan Van Hoesel

Publication date 25 April 2000

Published in Statistica Neerlandica (Search for Journal in Brave)

Full work available at URL https://cris.maastrichtuniversity.nl/en/publications/0efb621c-c744-47a5-b116-10ef1fd53619

zbMATH Keywords

convex hullfacetslinear relaxationbranch-and-cut algorithmpolyhedral approachcutting plane algorithmsstrong valid inequalitiesinteger combinatorial optimization

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Recommendations

• Polyhedral techniques in combinatorial optimization I: Theory
• Polyhedral Combinatorics in Combinatorial Optimization
• Polyhedral and semidefinite programming methods in combinatorial optimization
• Polyhedral combinatorics and combinatorial optimization
• Polyhedral proof methods in combinatorial optimization
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• A polyhedral approach to the solution of a class of vector problems of combinatorial optimization
• scientific article; zbMATH DE number 702975
• Polyhedral aspects of cardinality constrained combinatorial optimization problems

Cited in

(18)

• Polyhedral approaches
• scientific article; zbMATH DE number 4145668 (Why is no real title available?)
• On the m-clique free interval subgraphs polytope: polyhedral analysis and applications
• scientific article; zbMATH DE number 5539506 (Why is no real title available?)
• DECOMPOSITION AND PARALLELIZATION TECHNIQUES FOR ENUMERATING THE FACETS OF COMBINATORIAL POLYTOPES
• Polyhedral and semidefinite programming methods in combinatorial optimization
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• On disjunctive cuts for combinatorial optimization
• Polyhedral techniques in combinatorial optimization I: Theory
• scientific article; zbMATH DE number 2159269 (Why is no real title available?)
• Graphs and algorithms in communication networks on seven league boots
• Polyhedral proof methods in combinatorial optimization
• Theory and methods of Euclidian combinatorial optimization: current status and prospects
• scientific article; zbMATH DE number 219017 (Why is no real title available?)
• Branch and cut methods for network optimization
• Unrelated parallel machine scheduling problem with precedence constraints: polyhedral analysis and branch-and-cut
• The Boolean quadric polytope
• A polyhedral approach to solving multicriterion combinatorial optimization problems over sets of polyarrangements

Describes a project that uses

Uses Software

• TSPLIB

This page was built for publication: Polyhedral techniques in combinatorial optimization II: applications and computations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4262981)