A strengthened formulation for the simple plant location problem with order
From MaRDI portal
Publication:2643785
DOI10.1016/J.ORL.2006.01.012zbMATH Open1149.90363OpenAlexW2045648264MaRDI QIDQ2643785FDOQ2643785
Authors: Lázaro Cánovas, Sergio García, Martine Labbé, 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
Recommendations
- Polyhedral study of simple plant location problem with order
- Location with preferences
- New valid inequalities and facets for the simple plant location problem
- A computational comparison of several models for the exact solution of the capacity and distance constrained plant location problem
- A NEW FORMULATION AND RELAXATION OF THE SIMPLE PLANT LOCATION PROBLEM
Cites Work
- COBRA: A new formulation of the classic \(p\)-median location problem
- Competitive Location on a Network
- Closest assignment constraints and location models: Properties and structure
- A branch-and-cut method for the obnoxious \(p\)-median problem
- On the Uncapacitated Plant Location Problem. I: Valid Inequalities and Facets
- On the Uncapacitated Plant Location Problem. II: Facets and Lifting Theorems
- A note on duality gap in the simple plant location problem
- Branch and peg algorithms for the simple plant location problem
- Title not available (Why is that?)
Cited In (32)
- The rank pricing problem: models and branch-and-cut algorithms
- Approximation of the competitive facility location problem with MIPs
- Supplier selection under disruption risk with hybrid procurement
- A facility location problem for extracurricular workshop planning: bi-level model and metaheuristics
- Discrete facility location in machine learning
- Polyhedral study of simple plant location problem with order
- Randomized local search for the discrete competitive facility location problem
- Robust strategic planning for mobile medical units with steerable and unsteerable demands
- The rank pricing problem with ties
- A cut generation algorithm of finding an optimal solution in a market competition
- The maximin HAZMAT routing problem
- Metaheuristic methods for solving the bilevel uncapacitated facility location problem with clients' preferences
- Solving the bilevel facility location problem under preferences by a Stackelberg-evolutionary algorithm
- The joint impact of environmental awareness and system infrastructure on e-waste collection
- Location with preferences
- Closest assignment constraints in discrete location problems
- Single-allocation ordered median hub location problems
- The double-assignment plant location problem with co-location
- Facility location under service level constraints for heterogeneous customers
- Revisiting Stackelberg p-median problem with user preferences
- Discrete location for bundled demand points
- Computational complexity of the discrete competitive facility location problem
- A matheuristic for solving the bilevel approach of the facility location problem with cardinality constraints and preferences
- A comparison of formulations and solution methods for the minimum-envy location problem
- Cut generation algorithm for the discrete competitive facility location problem
- A flexible model and efficient solution strategies for discrete location problems
- Product line optimization with multiples sites
- Approximating solutions to a bilevel capacitated facility location problem with customer's patronization toward a list of preferences
- Dynamically second-preferred \(p\)-center problem
- \(\varepsilon\)-Constraint method for bi-objective competitive facility location problem with uncertain demand scenario
- An extended covering model for flexible discrete and equity location problems
- A NEW FORMULATION AND RELAXATION OF THE SIMPLE PLANT LOCATION PROBLEM
Uses Software
This page was built for publication: A strengthened formulation for the simple plant location problem with order
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2643785)
