Polyhedral techniques in combinatorial optimization II: applications and computations
From MaRDI portal
Publication:4262981
DOI10.1111/1467-9574.00104zbMath0934.90062MaRDI QIDQ4262981
Stan P. M. van Hoesel, Karen Aardal
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
branch-and-cut algorithm; convex hull; linear relaxation; facets; polyhedral approach; cutting plane algorithms; strong valid inequalities; integer combinatorial optimization
Uses Software