A branch-and-cut algorithm for the single commodity uncapacitated fixed charge network flow problem.
Year of publication: |
2000-10
|
---|---|
Authors: | ORTEGA, Francisco ; WOLSEY, Laurence |
Institutions: | Center for Operations Research and Econometrics (CORE), École des Sciences Économiques de Louvain |
Subject: | Network Design | Fixed Charge | Branch and Cut | Dicut Inequalities | Branching | Heuristics | Minimum cost flow |
-
Yıldız, Bariş, (2021)
-
Fixed charge multicommodity network design using p-partition facets
Agarwal, Y. K., (2017)
-
The recoverable robust two-level network design problem
Álvarez-Miranda, Eduardo, (2015)
- More ...
-
A branch-and-cut algorithm for the single commodity uncapacitated fixed charge network flow problem
Ortega, Francisco, (2000)
-
Lot-sizing with fixed charges on stocks: the convex hull
VAN VYVE, Mathieu, (2003)
-
ORTEGA, Francisco,
- More ...