A cutting plane algorithm for the site layout planning problem with travel barriers
Year of publication: |
June 2017
|
---|---|
Authors: | Hammad, Ahmed W. A. ; Rey, David ; Akbarnezhad, Ali |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 82.2017, p. 36-51
|
Subject: | Site layout planning | Mixed integer programming | Cutting plane algorithms | Decomposition methods | Global optimisation | d-visibility | Theorie | Theory | Mathematische Optimierung | Mathematical programming |
-
A binarisation heuristic for non-convex quadratic programming with box constraints
Galli, Laura, (2018)
-
Inverse mixed integer optimization : polyhedral insights and trust region methods
Bodur, Merve, (2022)
-
A decomposition approach for multidimensional knapsacks with family-split penalties
Mancini, Simona, (2024)
- More ...
-
Sustainable urban facility location : minimising noise pollution and network congestion
Hammad, Ahmed W. A., (2017)
-
Rey, David, (2005)
-
Feasible Momentum Strategies - Evidence from the Swiss Stock Market
Rey, David, (2005)
- More ...