Strategies of node selection in search procedures for solving combinatorial optimization problems: A survey and a general formalization (Q1592632)
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 1556328
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Strategies of node selection in search procedures for solving combinatorial optimization problems: A survey and a general formalization |
scientific article; zbMATH DE number 1556328 |
Statements
Strategies of node selection in search procedures for solving combinatorial optimization problems: A survey and a general formalization (English)
0 references
25 January 2001
0 references
Currently, most combinatorial optimization problems have to be solved, if the optimum solution is sought, using general techniques to explore the space of feasible solutions and, more specifically, through exploratory enumerative procedures in trees and search graphs. The objective of this work is to propose a survey and a general formalization of the selection strategy of the next node to explore, a feasure that is common to all these optimization procedures.
0 references
combinatorial optimization
0 references
branch-and-bound algorithm
0 references
artificial intelligence
0 references
selection strategy
0 references
0.7668735980987549
0 references
0.7331196665763855
0 references
0.7320923209190369
0 references
0.7306740283966064
0 references
