Multiheuristic approach to discrete optimization problems
DOI10.1007/S10559-006-0070-YzbMATH Open1119.90045OpenAlexW2055477049MaRDI QIDQ2371698FDOQ2371698
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
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
- Publication:4933704
decision makingheuristicsgenetic algorithmdiscrete optimizationdynamic risk functionuncompleted branch-and-bound method
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- Minimal NFA Problems are Hard
- Title not available (Why is that?)
- On the State Minimization of Nondeterministic Finite Automata
- Algorithms for determining relative star height and star height
- The Traveling Salesman Problem: A Survey
- Title not available (Why is that?)
- Heuristics in programming of nondeterministic games
- A choice of strategy in nondeterministic antagonistic games
- Edge-minimization of non-deterministic finite automata
Cited In (10)
- Chapter 9: An MPEC based heuristic
- Combining Multiple Heuristics
- Title not available (Why is that?)
- Pseudogeometric version of the traveling salesman problem, its application in quantum physics models and some heuristic algorithms for its solution
- A decision-theoretic framework for comparing heuristics
- 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
- Title not available (Why is that?)
- 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)
