Solving integer programs with a few important binary gub constraints

DOI10.1007/BF02024842MaRDI QIDQ1309895zbMATH OpenOpenAlexFDO

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

Recommendations

• Branch and bound with estimation based on pseudo-shadow-prices
• scientific article; zbMATH DE number 232396
• scientific article; zbMATH DE number 3908168
• Technical Note—A Langrangian Algorithm for the Multiple Choice Integer Program
• Some Lessons in Solving Practical Integer Programs

Cites work

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

Describes a project that uses

Uses Software

• SCICONIC

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

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