Problems of discrete optimization: Challenges and main approaches to solve them

Authors:
I. V. Sergienko;V. P. Shylo
Affiliations:
V. M. Glushkov Institute of Cybernetics, National Academy of Sciences of Ukraine, Kiev, Ukraine;V. M. Glushkov Institute of Cybernetics, National Academy of Sciences of Ukraine, Kiev, Ukraine
Venue:
Cybernetics and Systems Analysis
Year:
2006

Citing 0
Cited 6

Global equilibrium search applied to the unconstrained binary quadratic optimization problem

Optimization Methods & Software
LP-oriented upper bounds for the weighted stability number of a graph

Cybernetics and Systems Analysis
Solving the maxcut problem by the global equilibrium search

Cybernetics and Systems Analysis
Parallel suboptimal heuristic search for finding a w-admissible solution. performance analysis

ICANCM'11/ICDCC'11 Proceedings of the 2011 international conference on applied, numerical and computational mathematics, and Proceedings of the 2011 international conference on Computers, digital communications and computing
Solving weighted MAX-SAT via global equilibrium search

Operations Research Letters
A Review of Niching Genetic Algorithms for Multimodal Function Optimization

Cybernetics and Systems Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper briefly reviews the current state of the art in the field of discrete optimization problems. Emphasis is on the generalization of the experience gained at the V. M. Glushkov Institute of Cybernetics of the National Academy of Sciences of Ukraine in research and development of solution methods and software for various classes of complicated discrete programming problems.