New valid inequalities and facets for the simple plant location problem
From MaRDI portal
Publication:1749485
DOI10.1016/j.ejor.2018.03.009zbMath1388.90065OpenAlexW2791926981WikidataQ130049319 ScholiaQ130049319MaRDI QIDQ1749485
Laura Galli, Sebastian J. Miller, Adam N. Letchford
Publication date: 17 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://eprints.lancs.ac.uk/id/eprint/123879/1/splp_facets.pdf
Programming involving graphs or networks (90C35) Integer programming (90C10) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items
Plant location factors: a field research, New variants of the simple plant location problem and applications, Adding incompatibilities to the simple plant location problem: formulation, facets and computational experience, A separation algorithm for the simple plant location problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An exact cooperative method for the uncapacitated facility location problem
- A class of facet producing graphs for vertex packing polyhedra
- Capacitated facility location: Separation algorithms and computational experience
- On certain polytopes associated with graphs
- Neighborhood search heuristics for the uncapacitated facility location problem
- On the facets of the simple plant location packing polytope
- An aggressive reduction scheme for the simple plant location problem
- Solving the simple plant location problem by genetic algorithm
- 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
- Integer Programming: Methods, Uses, Computations
- Uncapacitated and Capacitated Facility Location Problems
- Combinatorial optimization. Theory and algorithms.
- New facets for the set packing polytope
