Multiheuristic approach to discrete optimization problems

DOI10.1007/s10559-006-0070-yzbMath1119.90045OpenAlexW2055477049MaRDI QIDQ2371698

B. F. Mel'nikov

Publication date: 5 July 2007

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-006-0070-y

zbMATH Keywords

heuristicsdecision makinggenetic algorithmdiscrete optimizationdynamic risk functionuncompleted branch-and-bound method

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cites Work

• Algorithms for determining relative star height and star height
• Heuristics in programming of nondeterministic games
• Minimal NFA Problems are Hard
• On the State Minimization of Nondeterministic Finite Automata
• The Traveling Salesman Problem: A Survey
• A choice of strategy in nondeterministic antagonistic games
• Unnamed Item
• Unnamed Item
• Unnamed Item