A Lagrangian lower bound for the container transshipment problem at a railway hub for a fast branch-and bound algorithm
M. Barketau, H. Kopfer and E. Pesch
| 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 | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Branch-and-Bound | Branch and Bound | Transportproblem | Transportation problem | Algorithmus | Algorithm | Scheduling-Verfahren | Scheduling problem |
| Extent: | graph. Darst. |
|---|---|
| Type of publication: | Article |
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://ebvufind01.dmz1.zbw.eu/10010207892