Cyclic best first search: Using contours to guide branch‐and‐bound algorithms (Q4632957)
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: Cyclic best first search: Using contours to guide branch‐and‐bound algorithms |
scientific article; zbMATH DE number 7049671
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Cyclic best first search: Using contours to guide branch‐and‐bound algorithms |
scientific article; zbMATH DE number 7049671 |
Statements
Cyclic best first search: Using contours to guide branch‐and‐bound algorithms (English)
0 references
2 May 2019
0 references
branch and bound
0 references
search strategies
0 references
optimization
0 references
integer programming
0 references
