LOWER BOUNDS OF THE CRITERIUM IN THE PROBLEM OF ASSIGNEMENT OF TRAINS ON THE TIME SLOTS
In this paper we consider the container transshipment problem at a railway hub. New lowerbounds are developed. One lower bound is based on the linear relaxation of the integer linear formulation, and the other lower bound is based on the Lagrangian relaxation technique.
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | Russian |
| Published: |
The United Institute of Informatics Problems of the National Academy of Sciences of Belarus
2016-09-01
|
| Series: | Informatika |
| Online Access: | https://inf.grid.by/jour/article/view/65 |