Lower bounds for the two-stage uncapacitated facility location problem

DOI10.1016/J.EJOR.2005.04.052MaRDI QIDQ864032zbMATH OpenOpenAlexFDO

Authors Alfredo Marín

Publication date 12 February 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.2005.04.052

zbMATH Keywords

integer programmingLagrangian relaxationdiscrete location

Mathematics Subject Classification ID

Integer programming (90C10) Discrete location and assignment (90B80)

Recommendations

• Lagrangian heuristic for the two-stage capacitated facility location problem
• A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem
• scientific article; zbMATH DE number 1189254
• Applying Lagrangian relaxation to the resolution of two-stage location problems
• An LP-based heuristic for two-stage capacitated facility location problems

Cites work

• scientific article; zbMATH DE number 3470175 (Why is no real title available?)
• scientific article; zbMATH DE number 3614502 (Why is no real title available?)
• scientific article; zbMATH DE number 1253065 (Why is no real title available?)
• A Dual-Based Procedure for Uncapacitated Facility Location
• A comparison of heuristics and relaxations for the capacitated plant location problem
• Applying Lagrangian relaxation to the resolution of two-stage location problems
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• On the coordination of product and by-product flows in two-level distribution networks: Model formulations and solution procedures
• Production, Transportation, and Distribution Planning in a Multi-Commodity Tri-Echelon System
• Uncapacitated facility location: General solution procedure and computational experience

Cited in

(18)

• New facets for the two-stage uncapacitated facility location polytope
• Solving a class of two-dimensional uncapacitated location-allocation problems by dynamic programming
• An extended covering model for flexible discrete and equity location problems
• The vendor location problem
• scientific article; zbMATH DE number 711782 (Why is no real title available?)
• Comparison of formulations for the two-level uncapacitated facility location problem with single assignment constraints
• Discrete location for bundled demand points
• Lower Bounds for the Capacitated Facility Location Problem Based on Column Generation
• Lagrangian heuristic for the two-stage capacitated facility location problem
• Lower and upper bounds for a two-stage capacitated facility location problem with handling costs
• A flexible model and efficient solution strategies for discrete location problems
• Calculating the best dual bound for problems with multiple Lagrangian relaxations
• Formulations and relaxations for a multi-echelon capacitated location-distribution problem
• An improved evolutionary algorithm for the two-stage transportation problem with fixed charge at depots
• Multi-level facility location problems
• Facility location problems with user cooperation
• A branch and bound algorithm for the two-level uncapacitated facility location problem with some side constraints
• scientific article; zbMATH DE number 1189254 (Why is no real title available?)

This page was built for publication: Lower bounds for the two-stage uncapacitated facility location problem

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