Routing of barge container ships by mixed-integer programming heuristics.
Vladislav MarasJasmina LazicTatjana DavidovicNenad MladenovicPublished in: Appl. Soft Comput. (2013)
Keyphrases
- mixed integer programming
- column generation
- lot sizing
- mixed integer
- dantzig wolfe decomposition
- production planning
- routing problem
- routing protocol
- network design problem
- lagrangian relaxation
- mathematical model
- ad hoc networks
- routing algorithm
- resource allocation
- search algorithm
- shortest path
- branch and bound algorithm
- feasible solution
- dynamical systems
- heuristic search
- worst case
- lower bound