Bounding, filtering and diversification in CP-based local branching (Q519096)
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: Bounding, filtering and diversification in CP-based local branching |
scientific article; zbMATH DE number 6700349
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bounding, filtering and diversification in CP-based local branching |
scientific article; zbMATH DE number 6700349 |
Statements
Bounding, filtering and diversification in CP-based local branching (English)
0 references
4 April 2017
0 references
constraint programming
0 references
local search
0 references
cost-based filtering
0 references
additive bounding
0 references
diversification
0 references
traveling salesman problem with time windows
0 references
0 references
0 references
0.8631336
0 references
0.83186704
0 references
0.8283245
0 references
0.8275375
0 references
0.82636404
0 references
0.8254821
0 references
0.81930053
0 references
