A strengthened formulation for the simple plant location problem with order
From MaRDI portal
Publication:2643785
DOI10.1016/j.orl.2006.01.012zbMath1149.90363OpenAlexW2045648264MaRDI QIDQ2643785
Sergio García, Martine Labbé, Lázaro Cánovas, Alfredo Marín
Publication date: 27 August 2007
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2006.01.012
Related Items (27)
The maximin HAZMAT routing problem ⋮ An extended covering model for flexible discrete and equity location problems ⋮ Facility location under service level constraints for heterogeneous customers ⋮ A matheuristic for solving the bilevel approach of the facility location problem with cardinality constraints and preferences ⋮ Cut generation algorithm for the discrete competitive facility location problem ⋮ Discrete location for bundled demand points ⋮ Discrete facility location in machine learning ⋮ Product line optimization with multiples sites ⋮ Revisiting Stackelberg p-median problem with user preferences ⋮ Approximating solutions to a bilevel capacitated facility location problem with customer's patronization toward a list of preferences ⋮ Dynamically second-preferred \(p\)-center problem ⋮ The joint impact of environmental awareness and system infrastructure on e-waste collection ⋮ Closest assignment constraints in discrete location problems ⋮ Solving the bilevel facility location problem under preferences by a Stackelberg-evolutionary algorithm ⋮ Randomized local search for the discrete competitive facility location problem ⋮ The rank pricing problem: models and branch-and-cut algorithms ⋮ Approximation of the competitive facility location problem with MIPs ⋮ Robust strategic planning for mobile medical units with steerable and unsteerable demands ⋮ The rank pricing problem with ties ⋮ Single-allocation ordered median hub location problems ⋮ The double-assignment plant location problem with co-location ⋮ A comparison of formulations and solution methods for the minimum-envy location problem ⋮ A Cut Generation Algorithm of Finding an Optimal Solution in a Market Competition ⋮ \(\varepsilon\)-Constraint method for bi-objective competitive facility location problem with uncertain demand scenario ⋮ A flexible model and efficient solution strategies for discrete location problems ⋮ Metaheuristic methods for solving the Bilevel Uncapacitated Facility Location Problem with Clients' Preferences ⋮ Computational complexity of the discrete competitive facility location problem
Uses Software
Cites Work
- Unnamed Item
- A note on duality gap in the simple plant location problem
- A branch-and-cut method for the obnoxious \(p\)-median problem
- COBRA: A new formulation of the classic \(p\)-median location problem
- Branch and peg algorithms for the simple plant location problem
- On the Uncapacitated Plant Location Problem. I: Valid Inequalities and Facets
- On the Uncapacitated Plant Location Problem. II: Facets and Lifting Theorems
- Competitive Location on a Network
- Closest assignment constraints and location models: Properties and structure
This page was built for publication: A strengthened formulation for the simple plant location problem with order
