A Lagrangian lower bound for the container transshipment problem at a railway hub for a fast branch-and bound algorithm
Year of publication: |
2013
|
---|---|
Authors: | Barketau, M. ; Kopfer, Herbert ; Pesch, Erwin |
Published in: |
Journal of the Operational Research Society : OR. - Basingstoke, Hampshire : Palgrave, ISSN 0030-3623, ZDB-ID 716033-1. - Vol. 64.2013, 11, p. 1614-1621
|
Subject: | lower bounds | linear programming | branch-and-bound algorithm | Lagrangian relaxation | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Scheduling-Verfahren | Scheduling problem |
-
An exact algorithm for the block relocation problem with a stowage plan
Tanaka, Shunji, (2019)
-
Job shop scheduling with the option of jobs outsourcing
Safarzadeh, Hamid, (2019)
-
Robust balancing of straight assembly lines with inerval task times
Gurevsky, E., (2013)
- More ...
-
Bernhardt, A., (2016)
-
Fracht- und Laderaumbörsen im Internet: Von der Pinnwand zum Auktionshaus
Kopfer, Herbert, (2000)
-
Automated Timetable Generation for Rounds of a Table-Tennis League
Schönberger, Jörn, (2000)
- More ...