Valid integer polytope (VIP) penalties for branch-and-bound enumeration

DOI10.1016/S0167-6377(99)00072-3MaRDI QIDQ1977646zbMATH OpenOpenAlexWikidataFDO

Authors Gerald G. Brown, Robert Dell, Michael P. Olson

Publication date 4 March 2001

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0167-6377(99)00072-3

zbMATH Keywords

branch-and-boundinteger-linear programmingvalid integer polytope penalities

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Technical Note—An Improved Branch-and-Bound Method for Integer Programming
• On the calculation of true and pseudo penalties in multiple choice integer programming
• An algorithm and new penalties for concave integer minimization over a polyhedron
• scientific article; zbMATH DE number 1383421

Cites work

• Dynamic factorization in large-scale optimization
• Generalized upper bounding techniques
• scientific article; zbMATH DE number 3427118 (Why is no real title available?)
• scientific article; zbMATH DE number 193499 (Why is no real title available?)
• scientific article; zbMATH DE number 3526452 (Why is no real title available?)
• scientific article; zbMATH DE number 3561083 (Why is no real title available?)
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Solving Airline Crew Scheduling Problems by Branch-and-Cut
• Solving Large-Scale Zero-One Linear Programming Problems
• Technical Note—An Improved Branch-and-Bound Method for Integer Programming

Cited in

(1)

• On the calculation of true and pseudo penalties in multiple choice integer programming

This page was built for publication: Valid integer polytope (VIP) penalties for branch-and-bound enumeration

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