A branch and bound algorithm for bi-level discrete network design problem
Year of publication: |
2013
|
---|---|
Authors: | Farvaresh, Hamid ; Sepehri, Mohammad Mehdi |
Published in: |
Networks and spatial economics : a journal of infrastructure modeling and computation. - Norwell, Mass. : Kluwer Academic Publ., ISSN 1566-113X, ZDB-ID 2079789-8. - Vol. 13.2013, 1, p. 67-106
|
Subject: | Mathematische Optimierung | Mathematical programming | Branch-and-Bound | Branch and Bound | USA | United States | Theorie | Theory |
-
Leitner, Markus, (2018)
-
A branch-and-bound algortihm for the cell formation problem
Utkina, Irina E., (2018)
-
Exact algorithms for the solution of the grey pattern quadratic assignment problem
Drezner, Zvi, (2015)
- More ...
-
A single-level mixed integer linear formulation for a bi-level discrete network design problem
Farvaresh, Hamid, (2011)
-
A single-level mixed integer linear formulation for a bi-level discrete network design problem
Farvaresh, Hamid, (2011)
-
A single-level mixed integer linear formulation for a bi-level discrete network design problem
Farvaresh, Hamid, (2011)
- More ...