Branch and bound with estimation based on pseudo-shadow-prices
From MaRDI portal
Publication:805497
DOI10.1007/BF01582880zbMath0728.90059MaRDI QIDQ805497
Publication date: 1991
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Integer programming (90C10) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (2)
Dynamic location of modular manufacturing facilities with relocation of individual modules ⋮ Solving integer programs with a few important binary gub constraints
Uses Software
Cites Work
- 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: Branch and bound with estimation based on pseudo-shadow-prices