A set partitioning reformulation of a school bus scheduling problem (Q657252)
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: A set partitioning reformulation of a school bus scheduling problem |
scientific article; zbMATH DE number 5997877
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A set partitioning reformulation of a school bus scheduling problem |
scientific article; zbMATH DE number 5997877 |
Statements
A set partitioning reformulation of a school bus scheduling problem (English)
0 references
16 January 2012
0 references
integer linear programming
0 references
single-depot vehicle scheduling with time windows
0 references
IP2
0 references
set partitioning
0 references
cutting planes
0 references
0 references
0 references
0 references
0.8636212348937988
0 references
0.853363573551178
0 references
0.8021443486213684
0 references
0.8017429113388062
0 references
