scientific article; zbMATH DE number 2086919

zbMATH Open1049.90523MaRDI QIDQ4737524FDOQ4737524

Authors: Sanjeeb Dash 

Publication date: 11 August 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2337/23370145.htm

Title of this publication is not available (Why is that?)

Recommendations

• Exponential Lower Bounds on the Lengths of Some Classes of Branch-and-Cut Proofs
• On the complexity of cutting-plane proofs using split cuts
• Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II
• Lifted Cover Inequalities for 0-1 Integer Programs: Complexity
• Cutting planes cannot approximate some integer programs

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60) Boolean programming (90C09)

Cited In (11)

• Exponential Lower Bounds on the Lengths of Some Classes of Branch-and-Cut Proofs
• Simple lifted cover inequalities and hard knapsack problems
• Branch-and-bound solves random binary IPs in poly\((n)\)-time
• Complexity of branch-and-bound and cutting planes in mixed-integer optimization
• Cutting planes cannot approximate some integer programs
• Several notes on the power of Gomory-Chvátal cuts
• Lifting lower bounds for tree-like proofs
• An abstract model for branch-and-cut
• Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II
• Complexity of optimizing over the integers
• Bounds on the size of branch-and-bound proofs for integer knapsacks

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 Q4737524)