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

DOI10.1016/S0167-6377(99)00072-3zbMath0955.90093OpenAlexW2170338945WikidataQ127411852 ScholiaQ127411852MaRDI QIDQ1977646

Robert F. Dell, Gerald G. Brown, 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)

Cites Work

• Dynamic factorization in large-scale optimization
• Generalized upper bounding techniques
• Solving Large-Scale Zero-One Linear Programming Problems
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Solving Airline Crew Scheduling Problems by Branch-and-Cut
• Technical Note—An Improved Branch-and-Bound Method for Integer Programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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