New variants of the simple plant location problem and applications
From MaRDI portal
Publication:6106762
DOI10.1016/j.ejor.2022.10.027MaRDI QIDQ6106762
Publication date: 3 July 2023
Published in: European Journal of Operational Research (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Clustering through continuous facility location problems
- Facility location models for distribution system design
- A class of facet producing graphs for vertex packing polyhedra
- Capacitated facility location: Separation algorithms and computational experience
- Adding incompatibilities to the simple plant location problem: formulation, facets and computational experience
- New valid inequalities and facets for the simple plant location problem
- Location analysis: a synthesis and survey
- The simple plant location problem: Survey and synthesis
- On the facets of the simple plant location packing polytope
- The double-assignment plant location problem with co-location
- Finding the root graph through minimum edge deletion
- A bibliography for some fundamental problem categories in discrete location science
- On the Uncapacitated Plant Location Problem. I: Valid Inequalities and Facets
- On the Uncapacitated Plant Location Problem. II: Facets and Lifting Theorems
- A NEW CLUSTERING MODEL OF WIRELESS SENSOR NETWORKS USING FACILITY LOCATION THEORY
- Fractional vertices, cuts and facets of the simple plant location problem
- Some facets of the simple plant location polytope
- Set Partitioning: A survey
- Further facet generating procedures for vertex packing polytopes
- The Plant Location Problem: New Models and Research Prospects
- Facet Obtaining Procedures for Set Packing Problems
- Properties of vertex packing and independence system polyhedra
- Fault-tolerant facility location
- On the facial structure of set packing polyhedra
- Location Science
- New facets for the set packing polytope