A possible way to reduce degeneracy in integer programming computations

DOI10.1016/0167-6377(87)90009-5zbMath0646.90062OpenAlexW1989720506MaRDI QIDQ1104240

Bjørn Nygreen

Publication date: 1987

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

Full work available at URL: https://doi.org/10.1016/0167-6377(87)90009-5

zbMATH Keywords

branch and bounddegeneracyshadow pricesrelaxations as lower bounds

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Linear programming (90C05)

Related Items (3)

Solving integer programs with a few important binary gub constraints ⋮ Selected bibliography on degeneracy ⋮ Branch and bound with estimation based on pseudo-shadow-prices

Uses Software

• SCICONIC

Cites Work

• 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: A possible way to reduce degeneracy in integer programming computations