Branch-and-refine for solving time-expanded MILP formulations (Q2108138)
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 7634085
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Branch-and-refine for solving time-expanded MILP formulations |
scientific article; zbMATH DE number 7634085 |
Statements
Branch-and-refine for solving time-expanded MILP formulations (English)
0 references
19 December 2022
0 references
graph refinement
0 references
branch-and-bound
0 references
shortest path problem with time windows
0 references
traveling salesman problem with time windows
0 references
0 references
0 references
0 references
0 references
0 references
0.7681335806846619
0 references
0.7473348379135132
0 references
0.7256613969802856
0 references
0.720750093460083
0 references
