A monotonic, dual-based bounding procedure for integer programs

DOI10.1016/0305-0548(94)00037-9zbMath0830.90109OpenAlexW2101263229MaRDI QIDQ1894724

Jayaram K. Sankaran

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

zbMATH Keywords

integer linear programs

Mathematics Subject Classification ID

Integer programming (90C10) Linear programming (90C05)

Uses Software

• LINDO

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

This page was built for publication: A monotonic, dual-based bounding procedure for integer programs