Graphical method to solve combinatorial optimization problems

DOI10.1134/S000511791612002XzbMath1358.49024OpenAlexW2567388886MaRDI QIDQ517329

Evgeny R. Gafarov

Publication date: 23 March 2017

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

Full work available at URL: https://doi.org/10.1134/s000511791612002x

Mathematics Subject Classification ID

Dynamic programming in optimal control and differential games (49L20) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• A new effective dynamic program for an investment optimization problem
• A note on a single machine scheduling problem with generalized total tardiness objective function
• A graphical realization of the dynamic programming method for solving NP-hard combinatorial problems
• Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one
• The Hijazi inequality on manifolds with boundary

This page was built for publication: Graphical method to solve combinatorial optimization problems