Branch-Relax-and-Check : a tractable decomposition method for order acceptance and identical parallel machine scheduling
Year of publication: |
2020
|
---|---|
Authors: | Naderi, Bahman ; Roshanaei, Vahid |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 286.2020, 3 (1.11.), p. 811-827
|
Subject: | Benders decomposition | Combinatorial optimization | Mixed-integer programming | Order acceptance identical parallel machine scheduling | Temporary cuts | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Dekompositionsverfahren | Decomposition method | Ganzzahlige Optimierung | Integer programming | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming | Branch-and-Bound | Branch and Bound |
-
Exact solution algorithms for the maximum flow problem with additional conflict constraints
Şuvak, Zeynep, (2020)
-
An algorithmic framework for the exact solution of tree-star problems
Leitner, Markus, (2017)
-
Exact and heuristic algorithms for the maximum weighted submatrix coverage problem
Sinnl, Markus, (2022)
- More ...
-
Naderi, Bahman, (2021)
-
Zohali, Hassan, (2019)
-
Roshanaei, Vahid, (2021)
- More ...