Strong cuts from compatibility relations for the dial-a-ride problem (Q2065792)
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: Strong cuts from compatibility relations for the dial-a-ride problem |
scientific article; zbMATH DE number 7456396
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Strong cuts from compatibility relations for the dial-a-ride problem |
scientific article; zbMATH DE number 7456396 |
Statements
Strong cuts from compatibility relations for the dial-a-ride problem (English)
0 references
13 January 2022
0 references
pickup and delivery problem
0 references
cutting planes
0 references
exact separation
0 references
edge-polytope
0 references
0 references
0 references
0.8074257373809814
0 references
0.7838577628135681
0 references
0.7619956731796265
0 references
0.7612119317054749
0 references
0.7424194812774658
0 references
