Graphical approach to combinatorial optimization
From MaRDI portal
Publication:2371616
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; zbMATH DE number 5520408
Cited in
(16)- Графоаналитический способ решения задачи минимизации затрат
- Graphical method of representing variable sets for solving search problems
- scientific article; zbMATH DE number 1984128 (Why is no real title available?)
- 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
- scientific article; zbMATH DE number 2196291 (Why is no real title available?)
- On the best choice of a branching variable in the subset sum problem
- Graph‐Related Optimization and Decision Support Systems
- scientific article; zbMATH DE number 919785 (Why is no real title available?)
- Complexity of solving the subset sum problem with the branch-and-bound method with domination and cardinality filtering
- \(N\)-gram distribution and unification gain problem and its optimal solution
- scientific article; zbMATH DE number 4016629 (Why is no real title available?)
- 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
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)
