A monotonic, dual-based bounding procedure for integer programs
From MaRDI portal
Publication:1894724
DOI10.1016/0305-0548(94)00037-9zbMath0830.90109MaRDI QIDQ1894724
Publication date: 24 July 1995
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0305-0548(94)00037-9
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Column generation applied to linear programs in course registration
- A dual ascent approach for steiner tree problems on a directed graph
- Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- A Dual-Based Procedure for Uncapacitated Facility Location
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- A Dual-Based Procedure for Dynamic Facility Location
- An Algorithm for Large Set Partitioning Problems
- A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design
- Validation of subgradient optimization