A monotonic, dual-based bounding procedure for integer programs
From MaRDI portal
Recommendations
Cites work
- A dual ascent approach for steiner tree problems on a directed graph
- A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design
- A Dual-Based Procedure for Dynamic Facility Location
- A Dual-Based Procedure for Uncapacitated Facility Location
- An Algorithm for Large Set Partitioning Problems
- Column generation applied to linear programs in course registration
- scientific article; zbMATH DE number 3568354 (Why is no real title available?)
- scientific article; zbMATH DE number 3614502 (Why is no real title available?)
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Validation of subgradient optimization
Cited in
(4)
This page was built for publication: A monotonic, dual-based bounding procedure for integer programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1894724)