On some matching problems arising in vehicle scheduling models (Q3790928)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4055355
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On some matching problems arising in vehicle scheduling models |
scientific article; zbMATH DE number 4055355 |
Statements
On some matching problems arising in vehicle scheduling models (English)
0 references
1987
0 references
bipartite matching
0 references
Vehicle Scheduling
0 references
capacitated matching
0 references
multicommodity matching
0 references
polynomial time algorithm
0 references
NP-hard
0 references
heuristic
0 references
Lagrangean relaxation
0 references
0.8421230912208557
0 references
0.799354076385498
0 references
0.7916244268417358
0 references
