Graphical method of representing variable sets for solving search problems

MaRDI QIDQ5942471zbMATH OpenFDO

Authors S. V. Ezhkov

Publication date 10 September 2001

Published in Moscow University Computational Mathematics and Cybernetics (Search for Journal in Brave)

zbMATH Keywords

computer graphicstwo and three dimensional search problem

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Searching and sorting (68P10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Review text

The method allowing to use the computer graphics for the solution of search problems are presented. The significant meaning of the selection of a trajectory objects is shown. A class of the necessary trajectories is selected from the evolution of trajectories in the test solution. The examples presented allow to estimate the effectiveness of the method offered.

Recommendations

• Graphical method to solve combinatorial optimization problems
• Graphical approach to combinatorial optimization
• Drawing graphs with mathematical programming and variable neighborhood search
• scientific article; zbMATH DE number 3974727
• AND/OR graph heuristic search methods
• Variable space search for graph coloring

Cited in

(3)

• Graphical method to solve combinatorial optimization problems
• Графоаналитический способ решения задачи минимизации затрат
• Computational Science - ICCS 2004

This page was built for publication: Graphical method of representing variable sets for solving search problems

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