Graphical method to solve combinatorial optimization problems
From MaRDI portal
Publication:517329
Recommendations
- Graphical approach to combinatorial optimization
- scientific article; zbMATH DE number 2159270
- Graphical method of representing variable sets for solving search problems
- A graphical realization of the dynamic programming method for solving NP-hard combinatorial problems
- Layered graph approaches for combinatorial optimization problems
- An optimization problem on graphs
- scientific article; zbMATH DE number 5606407
- scientific article; zbMATH DE number 3974727
- A graphical method to solve a maximin allocation problem
- A new technique for optimization problems in graph theory
Cites work
- A graphical realization of the dynamic programming method for solving NP-hard combinatorial problems
- A new effective dynamic program for an investment optimization problem
- A note on a single machine scheduling problem with generalized total tardiness objective function
- scientific article; zbMATH DE number 3126094 (Why is no real title available?)
- The Hijazi inequality on manifolds with boundary
- Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one
Cited in
(7)- Layered graph approaches for combinatorial optimization problems
- Graphical approach to combinatorial optimization
- scientific article; zbMATH DE number 1093947 (Why is no real title available?)
- A graphical approach to solve an investment optimization problem
- Графоаналитический способ решения задачи минимизации затрат
- Graphical method of representing variable sets for solving search problems
- A graphical realization of the dynamic programming method for solving NP-hard combinatorial problems
This page was built for publication: Graphical method to solve combinatorial optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q517329)
