A simple but usually fast branch-and-bound algorithm for the capacitated facility location problem
Year of publication: |
2012
|
---|---|
Authors: | Görtz, Simon ; Klose, Andreas |
Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 24.2012, 4, p. 597-610
|
Subject: | Betriebliche Standortwahl | Firm location choice | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm | Branch-and-Bound | Branch and Bound |
-
A branch-and-Benders-cut algorithm for a bi-objective stochastic facility location problem
Parragh, Sophie N., (2022)
-
Rostami, Mohammad, (2020)
-
Branch, Bound & Cut Algorithm for the Competitive Facility Location Problem with Income Targeting
Beresnev, Vladimir, (2023)
- More ...
-
Analysis of some greedy algorithms for the single-sink fixed-charge transportation problem
Görtz, Simon, (2009)
-
A branch-and-price algorithm for the capacitated facility location problem
Klose, Andreas, (2007)
-
A Simple but Usually Fast Branch-and-Bound Algorithm for the Capacitated Facility Location Problem
Görtz, Simon, (2012)
- More ...