A note on duality gap in the simple plant location problem

DOI10.1016/j.ejor.2004.12.022zbMath1116.90072OpenAlexW1986453324MaRDI QIDQ858326

Pierre Hansen, Nenad Mladenović, Jack Brimberg

Publication date: 9 January 2007

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2004.12.022

zbMATH Keywords

duality gapsimple plant location problem

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Discrete location and assignment (90B80)

Related Items (5)

A strengthened formulation for the simple plant location problem with order ⋮ Semi-Lagrangian relaxation applied to the uncapacitated facility location problem ⋮ An exact cooperative method for the uncapacitated facility location problem ⋮ Fast bounding procedures for large instances of the simple plant location problem ⋮ An acceleration of Erlenkotter-Körkel's algorithms for the uncapacitated facility location problem

Uses Software

• SITATION
• MOD-DIST
• MENU-OKF

Cites Work

• Facility siting and integer-friendly programming
• The maximum return-on-investment plant location problem
• Probabilistic Analysis of a Relaxation for the k-Median Problem
• A Dual-Based Procedure for Uncapacitated Facility Location
• Worst-Case and Probabilistic Analysis of a Geometric Location Problem
• The Plant Location Problem: New Models and Research Prospects
• Cooperative facility location games
• Integer Programming: Methods, Uses, Computations
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on duality gap in the simple plant location problem