Multiheuristic approach to discrete optimization problems

DOI10.1007/S10559-006-0070-YMaRDI QIDQ2371698zbMATH OpenOpenAlexFDO

Authors Boris Melnikov

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

decision makingheuristicsgenetic 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)

Recommendations

• Intractability and analysis of heuristics for discrete optimization. II
• scientific article; zbMATH DE number 1054758
• Discrete optimization algorithms and problems of decision making in a fuzzy environment
• Problems of discrete optimization: challenges and main approaches to solve them
• scientific article; zbMATH DE number 1386739

Cites work

• scientific article; zbMATH DE number 1082106 (Why is no real title available?)
• scientific article; zbMATH DE number 1538176 (Why is no real title available?)
• A choice of strategy in nondeterministic antagonistic games
• Algorithms for determining relative star height and star height
• Edge-minimization of non-deterministic finite automata
• 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

Cited in

(10)

• Chapter 9: An MPEC based heuristic
• Combining Multiple Heuristics
• scientific article; zbMATH DE number 4072722 (Why is no real title available?)
• A decision-theoretic framework for comparing heuristics
• Pseudogeometric version of the traveling salesman problem, its application in quantum physics models and some heuristic algorithms for its solution
• Formalization and use of knowledge in discrete optimization systems
• Intractability and analysis of heuristics for discrete optimization. II
• The problem of intractability and analysis of heuristics in discrete optimization. I
• scientific article; zbMATH DE number 3993304 (Why is no real title available?)
• Problems of discrete optimization: challenges and main approaches to solve them

This page was built for publication: Multiheuristic approach to discrete optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2371698)