Two local search approaches for solving real-life car sequencing problems (Q932212)
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: Two local search approaches for solving real-life car sequencing problems |
scientific article; zbMATH DE number 5299397
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two local search approaches for solving real-life car sequencing problems |
scientific article; zbMATH DE number 5299397 |
Statements
Two local search approaches for solving real-life car sequencing problems (English)
0 references
10 July 2008
0 references
combinatorial optimization
0 references
real-life car sequencing/scheduling
0 references
integer linear programming
0 references
local/neighborhood search
0 references
invariants
0 references
0 references
0 references
0.89055866
0 references
0.88731647
0 references
0.8871134
0 references
0.8868911
0 references
0.8852954
0 references
0.8846076
0 references
0.8824575
0 references
