Adding incompatibilities to the simple plant location problem: formulation, facets and computational experience
From MaRDI portal
Publication:1725611
DOI10.1016/j.cor.2018.12.018zbMath1458.90480OpenAlexW2904224710WikidataQ128777331 ScholiaQ128777331MaRDI QIDQ1725611
Publication date: 14 February 2019
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2018.12.018
Applications of mathematical programming (90C90) Integer programming (90C10) Discrete location and assignment (90B80)
Related Items (3)
Discrete facility location in machine learning ⋮ New variants of the simple plant location problem and applications ⋮ The double-assignment plant location problem with co-location
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Capacitated facility location: Separation algorithms and computational experience
- New valid inequalities and facets for the simple plant location problem
- The simple plant location problem: Survey and synthesis
- On the facets of the simple plant location packing polytope
- Integer Programming
- On the Uncapacitated Plant Location Problem. I: Valid Inequalities and Facets
- On the Uncapacitated Plant Location Problem. II: Facets and Lifting Theorems
- Fractional vertices, cuts and facets of the simple plant location problem
- Some facets of the simple plant location polytope
- Technical Note—A Note on Zero-One Programming
- 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
- Algorithm 457: finding all cliques of an undirected graph
- New facets for the set packing polytope
This page was built for publication: Adding incompatibilities to the simple plant location problem: formulation, facets and computational experience
