Graphical approach to combinatorial optimization

DOI10.1134/S0005117907040029zbMATH Open1142.90476MaRDI QIDQ2371616FDOQ2371616

Authors: Alexander A. Lazarev 

Publication date: 5 July 2007

Published in: Automation and Remote Control (Search for Journal in Brave)

Recommendations

• A graphical realization of the dynamic programming method for solving NP-hard combinatorial problems
• Graphical method to solve combinatorial optimization problems
• Publication:3028751
• Optimization of dynamic programming methods when solving extremal combinatorial problems
• scientific article

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (15)

• Layered graph approaches for combinatorial optimization problems
• Algorithmization for searching optimal states of the myocard gemodynamic system on a graph
• Optimal resolution sequence of problems modelled by directed graphs
• Title not available (Why is that?)
• On the best choice of a branching variable in the subset sum problem
• Graph‐Related Optimization and Decision Support Systems
• Title not available (Why is that?)
• Complexity of solving the subset sum problem with the branch-and-bound method with domination and cardinality filtering
• Title not available (Why is that?)
• An efficient algorithm of dead-end controls for solving combinatorial optimization problems
• A graphical realization of the dynamic programming method for solving NP-hard combinatorial problems
• Graphical method to solve combinatorial optimization problems
• Graphical method of representing variable sets for solving search problems
• Графоаналитический способ решения задачи минимизации затрат
• Title not available (Why is that?)

This page was built for publication: Graphical approach to combinatorial optimization

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