Cable tree wiring -- benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints (Q2074672)
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 7471953
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Cable tree wiring -- benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints |
scientific article; zbMATH DE number 7471953 |
Statements
Cable tree wiring -- benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints (English)
0 references
10 February 2022
0 references
TSP with precedence constraints
0 references
tour-dependent edge costs
0 references
soft coupled task scheduling
0 references
constraint optimization
0 references
benchmarking CP-SAT
0 references
MIP
0 references
OMT solvers
0 references
0 references
0 references
0 references
0 references
0.6732118129730225
0 references
0.6594172716140747
0 references
0.6590830087661743
0 references
0.6589772701263428
0 references
