Solving a selective dial-a-ride problem with logic-based Benders decomposition
Year of publication: |
August 2018
|
---|---|
Authors: | Riedler, Martin ; Raidl, Günther |
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. 96.2018, p. 30-54
|
Subject: | Transportation | Dial-a-Ride problem | Logic-based Benders decomposition | Combinatorial Benders cuts | Branch-and-check | Dekompositionsverfahren | Decomposition method | Mathematische Optimierung | Mathematical programming | Scheduling-Verfahren | Scheduling problem |
-
Nutmeg : a MIP and CP hybrid solver using branch-and-check
Lam, Edward, (2020)
-
Combinatorial Benders cuts for assembly line balancing problems with setups
Akpinar, Sener, (2017)
-
Pérez Martínez, Karim, (2019)
- More ...
-
Exact approaches for network design problems with relays
Leitner, Markus, (2019)
-
Exact approaches for the directed network design problem with relays
Leitner, Markus, (2020)
-
Prüfer Numbers: A Poor Presentation of Spanning Trees for Evolutionary Search
Gottlieb, Jens, (2000)
- More ...