Solving integer programs with a few important binary gub constraints

DOI10.1007/BF02024842zbMath0784.90050OpenAlexW2047354342MaRDI QIDQ1309895

Bjørn Nygreen

Publication date: 21 March 1994

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02024842

zbMATH Keywords

branch-and-boundbinary gub constraintsimultanous estimation

Mathematics Subject Classification ID

Integer programming (90C10)

Uses Software

• SCICONIC

Cites Work

• Branch and bound with estimation based on pseudo-shadow-prices
• Some branch and bound techniques for nonlinear optimization
• A possible way to reduce degeneracy in integer programming computations
• Computer Codes for Problems of Integer Programming
• Analysis of mathematical programming problems prior to applying the simplex algorithm
• Branch and Bound Methods for Mathematical Programming Systems

This page was built for publication: Solving integer programs with a few important binary gub constraints