New approaches for solving the block‐to‐train assignment problem (Q5433192)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: New approaches for solving the block‐to‐train assignment problem |
scientific article; zbMATH DE number 5224055
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New approaches for solving the block‐to‐train assignment problem |
scientific article; zbMATH DE number 5224055 |
Statements
New approaches for solving the block‐to‐train assignment problem (English)
0 references
8 January 2008
0 references
railroad scheduling
0 references
transportation
0 references
combinatorial optimization
0 references
heuristics
0 references
Lagrangian relaxation
0 references
shortest path
0 references
mixed integer programming
0 references
assignment problems
0 references
0.8592877388000488
0 references
0.8079404234886169
0 references
0.8050538301467896
0 references
0.7998734712600708
0 references
0.7994871735572815
0 references
