Strong cuts from compatibility relations for the dial-a-ride problem (Q2065792): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 20:08, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Strong cuts from compatibility relations for the dial-a-ride problem |
scientific article |
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
