Bounding, filtering and diversification in CP-based local branching (Q519096): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C59 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C57 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6700349 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
constraint programming | |||
| Property / zbMATH Keywords: constraint programming / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
local search | |||
| Property / zbMATH Keywords: local search / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
cost-based filtering | |||
| Property / zbMATH Keywords: cost-based filtering / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
additive bounding | |||
| Property / zbMATH Keywords: additive bounding / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
diversification | |||
| Property / zbMATH Keywords: diversification / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
traveling salesman problem with time windows | |||
| Property / zbMATH Keywords: traveling salesman problem with time windows / rank | |||
Normal rank | |||
Revision as of 04:54, 1 July 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bounding, filtering and diversification in CP-based local branching |
scientific article |
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
