A strengthened formulation for the simple plant location problem with order
From MaRDI portal
Publication:2643785
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
- scientific article; zbMATH DE number 3559283 (Why is no real title available?)
- A branch-and-cut method for the obnoxious \(p\)-median problem
- A note on duality gap in the simple plant location problem
- Branch and peg algorithms for the simple plant location problem
- COBRA: A new formulation of the classic \(p\)-median location problem
- Closest assignment constraints and location models: Properties and structure
- Competitive Location on a Network
- On the Uncapacitated Plant Location Problem. I: Valid Inequalities and Facets
- On the Uncapacitated Plant Location Problem. II: Facets and Lifting Theorems
Cited in
(32)- Single-allocation ordered median hub location problems
- Metaheuristic methods for solving the bilevel uncapacitated facility location problem with clients' preferences
- Revisiting Stackelberg p-median problem with user preferences
- An extended covering model for flexible discrete and equity location problems
- A comparison of formulations and solution methods for the minimum-envy location problem
- Polyhedral study of simple plant location problem with order
- The double-assignment plant location problem with co-location
- The rank pricing problem: models and branch-and-cut algorithms
- Approximation of the competitive facility location problem with MIPs
- Discrete location for bundled demand points
- A NEW FORMULATION AND RELAXATION OF THE SIMPLE PLANT LOCATION PROBLEM
- Approximating solutions to a bilevel capacitated facility location problem with customer's patronization toward a list of preferences
- A flexible model and efficient solution strategies for discrete location problems
- Randomized local search for the discrete competitive facility location problem
- Discrete facility location in machine learning
- Dynamically second-preferred \(p\)-center problem
- Cut generation algorithm for the discrete competitive facility location problem
- Solving the bilevel facility location problem under preferences by a Stackelberg-evolutionary algorithm
- 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
- Computational complexity of the discrete competitive facility location problem
- The joint impact of environmental awareness and system infrastructure on e-waste collection
- Product line optimization with multiples sites
- \(\varepsilon\)-Constraint method for bi-objective competitive facility location problem with uncertain demand scenario
- A matheuristic for solving the bilevel approach of the facility location problem with cardinality constraints and preferences
- The maximin HAZMAT routing problem
- Facility location under service level constraints for heterogeneous customers
- Location with preferences
- Supplier selection under disruption risk with hybrid procurement
- A facility location problem for extracurricular workshop planning: bi-level model and metaheuristics
- Closest assignment constraints in discrete location problems
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)
