Dual relaxations of the time-indexed ILP formulation for min-sum scheduling problems
Year of publication: |
February 2017
|
---|---|
Authors: | Pan, Yunpeng ; Liang, Zhe |
Published in: |
Applied optimization and data mining : dedicated to Dr. Panos Pardalos on the occasion of his 60th birthday. - New York, NY, USA : Springer. - 2017, p. 197-213
|
Subject: | Lineare Optimierung | Linear programming | Scheduling-Verfahren | Scheduling problem | Dekompositionsverfahren | Decomposition method |
-
Decomposition methods for hard optimization problems
Furini, Fabio, (2020)
-
Preface: decompostion methods for hard optimization problems
Furini, Fabio, (2020)
-
A Comparison of Two Exact Methods for Passenger Railway Rolling Stock (Re)Scheduling
Haahr, J orgen, (2015)
- More ...
-
Branch-and-bound algorithms for solving hard instances of the one-machine sequencing problem
Pan, Yunpeng, (2006)
-
Pan, Yunpeng, (2003)
-
Branch-and-bound algorithms for solving hard instances of the one-machine sequencing problem
Pan, Yunpeng, (2006)
- More ...