Calculating the best dual bound for problems with multiple Lagrangian relaxations

DOI10.1134/S1064230710060109zbMATH Open1276.90070OpenAlexW2077535380MaRDI QIDQ2391512FDOQ2391512

Authors: J. Rangel, I. 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

Recommendations

• Lagrangean relaxation. (With comments and rejoinder).
• The omnipresence of Lagrange
• scientific article; zbMATH DE number 2084780
• Applying Lagrangian relaxation to the resolution of two-stage location problems
• An improved Lagrangian relaxation and dual ascent approach to facility location problems

zbMATH Keywords

best boundconstraints generation scheme

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Cites Work

• Assignment problems: a golden anniversary survey
• Title not available (Why is that?)
• The omnipresence of Lagrange
• Robust optimization-methodology and applications
• Column Generation
• Lagrangean relaxation. (With comments and rejoinder).
• About Lagrangian methods in integer optimization
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• Lower bounds for the two-stage uncapacitated facility location problem

Uses Software

• AMPL

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2391512)