A separation algorithm for the simple plant location problem
Year of publication: |
2021
|
---|---|
Authors: | Galli, Laura ; Letchford, Adam N. |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 49.2021, 4, p. 610-615
|
Subject: | Branch-and-cut | Combinatorial optimisation | Facility location | Betriebliche Standortwahl | Firm location choice | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm | Standorttheorie | Location theory | Branch-and-Bound | Branch and Bound |
-
A branch-and-bound algorithm for the maximum capture problem with random utilities
Freire, Alexandre S., (2016)
-
The incremental connected facility location problem
Arulselvan, Ashwin, (2019)
-
Branch-and-bound algorithm for a competitive facility location problem
Beresnev, Vladimir, (2013)
- More ...
-
Complexity results for the gap inequalities for the max-cut problem
Galli, Laura, (2012)
-
Gap inequalities for non-convex mixed-integer quadratic programs
Galli, Laura, (2011)
-
Small bipartite subgraph polytopes
Galli, Laura, (2010)
- More ...