Calculating the best dual bound for problems with multiple Lagrangian relaxations

DOI10.1134/S1064230710060109zbMath1276.90070OpenAlexW2077535380MaRDI QIDQ2391512

J. Rangel, Igor S. Litvinchev, Miguel Mata

Publication date: 31 July 2013

Published in: Journal of Computer and Systems Sciences International (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1064230710060109

zbMATH Keywords

best boundconstraints generation scheme

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Uses Software

• AMPL

Cites Work

• About Lagrangian methods in integer optimization
• Assignment problems: a golden anniversary survey
• Lower bounds for the two-stage uncapacitated facility location problem
• Uncapacitated facility location: General solution procedure and computational experience
• On the coordination of product and by-product flows in two-level distribution networks: Model formulations and solution procedures
• Robust optimization-methodology and applications
• Lagrangean relaxation. (With comments and rejoinder).
• Column Generation
• The omnipresence of Lagrange
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Calculating the best dual bound for problems with multiple Lagrangian relaxations