Publication:4737524
From MaRDI portal
zbMath1049.90523MaRDI QIDQ4737524
Publication date: 11 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2337/23370145.htm
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90C60: Abstract computational complexity for mathematical programming problems
90C27: Combinatorial optimization
90C09: Boolean programming
Related Items
Several notes on the power of Gomory-Chvátal cuts, Simple lifted cover inequalities and hard knapsack problems
