New facets for the two-stage uncapacitated facility location polytope
From MaRDI portal
Publication:2655408
DOI10.1007/s10589-008-9165-xzbMath1187.90177OpenAlexW2049302102MaRDI QIDQ2655408
Mercedes Landete, Alfredo Marín
Publication date: 25 January 2010
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-008-9165-x
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items (8)
Exactly solving a two-level location problem with modular node capacities ⋮ A new mixed integer linear programming model for the multi level uncapacitated facility location problem ⋮ When centers can fail: a close second opportunity ⋮ Comparison of formulations for the two-level uncapacitated facility location problem with single assignment constraints ⋮ Dynamically second-preferred \(p\)-center problem ⋮ Semi-Lagrangian relaxation applied to the uncapacitated facility location problem ⋮ An effective hybrid approach to the two-stage capacitated facility location problem ⋮ Multi-level facility location problems
Cites Work
- Unnamed Item
- Unnamed Item
- A branch and bound algorithm for the two-level uncapacitated facility location problem with some side constraints
- Lower bounds for the two-stage uncapacitated facility location problem
- A class of facet producing graphs for vertex packing polyhedra
- The capacitated distribution and waste disposal problem
- Upper and lower bounds for the two-level simple plant location problem
- Applying Lagrangian relaxation to the resolution of two-stage location problems
- Lagrangian heuristics for the two-echelon, single-source, capacitated facility location problem
- The return plant location problem: Modelling and resolution
- 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
- A branch-and-bound algorithm for the transportation problem with location of \(p\) transshipment points
- A parallel branch-and-bound algorithm for multicommodity location with balancing requirements
- Wheel inequalities for stable set polytopes
- A multi-commodity, multi-plant, capacitated facility location problem: Formulation and efficient heuristic solution.
- A multiperiod two-echelon multicommodity capacitated plant location problem
- A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem
- An approximation algorithm for the maximization version of the two level uncapacitated facility location problem
- An LP-based heuristic for two-stage capacitated facility location problems
- On the Uncapacitated Plant Location Problem. I: Valid Inequalities and Facets
- Fractional vertices, cuts and facets of the simple plant location problem
- A dual-based optimization procedure for the two-echelon uncapacitated facility location problem
- Multicommodity Distribution System Design by Benders Decomposition
- Technical Note—A Note on Zero-One Programming
- A Plant and Warehouse Location Problem
- A branch-and-bound algorithm for depot location and container fleet management
- Dual-Ascent Procedures for Multicommodity Location-Allocation Problems with Balancing Requirements
- Compositions of Graphs and Polyhedra II: Stable Sets
- Production, Transportation, and Distribution Planning in a Multi-Commodity Tri-Echelon System
- Facet Obtaining Procedures for Set Packing Problems
- A Profit-maximizing Plant-loading Model with Demand Fill-rate Constraints
- Properties of vertex packing and independence system polyhedra
- On the facial structure of set packing polyhedra
- Site Location via Mixed-integer Programming
- On the Two-Level Uncapacitated Facility Location Problem
- New facets for the set packing polytope
This page was built for publication: New facets for the two-stage uncapacitated facility location polytope
