Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems (Q6090149)
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: Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems |
scientific article; zbMATH DE number 7764638
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems |
scientific article; zbMATH DE number 7764638 |
Statements
Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems (English)
0 references
14 November 2023
0 references
routing
0 references
dial-a-ride problem
0 references
branch-and-cut
0 references
fixed paths
0 references
valid inequalities
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
