Solving a truck dispatching scheduling problem using branch-and-cut (Q2781096)
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: Solving a truck dispatching scheduling problem using branch-and-cut |
scientific article; zbMATH DE number 1720754
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving a truck dispatching scheduling problem using branch-and-cut |
scientific article; zbMATH DE number 1720754 |
Statements
1 July 2002
0 references
branch-and-cut IP solver
0 references
0/1 integer programs
0 references
truck dispatching scheduling
0 references
knapsack equality constraints
0 references
Solving a truck dispatching scheduling problem using branch-and-cut (English)
0 references
