Polyhedral techniques in combinatorial optimization II: applications and computations

DOI10.1111/1467-9574.00104zbMath0934.90062OpenAlexW2077603408MaRDI QIDQ4262981

Karen Aardal, Stan P. M. 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

branch-and-cut algorithmconvex hulllinear relaxationfacetspolyhedral approachcutting plane algorithmsstrong valid inequalitiesinteger combinatorial optimization

Mathematics Subject Classification ID

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

Related Items (7)

On the \(m\)-clique free interval subgraphs polytope: polyhedral analysis and applications ⋮ The Boolean Quadric Polytope ⋮ Theory and methods of Euclidian combinatorial optimization: current status and prospects ⋮ Branch and cut methods for network optimization ⋮ Graphs and Algorithms in Communication Networks on Seven League Boots ⋮ Unrelated Parallel Machine Scheduling Problem with Precedence Constraints: Polyhedral Analysis and Branch-and-Cut ⋮ A polyhedral approach to solving multicriterion combinatorial optimization problems over sets of polyarrangements

Uses Software

• TSPLIB

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