Graphical method to solve combinatorial optimization problems (Q517329)

From MaRDI portal

Revision as of 13:31, 13 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Graphical method to solve combinatorial optimization problems	scientific article

Statements

scholarly article

0 references

Graphical method to solve combinatorial optimization problems (English)

0 references

Evgeny R. Gafarov

0 references

Automation and Remote Control

0 references

publication date

23 March 2017

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

The Hijazi inequality on manifolds with boundary

0 references

A graphical realization of the dynamic programming method for solving NP-hard combinatorial problems

0 references

Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one

0 references

A note on a single machine scheduling problem with generalized total tardiness objective function

0 references

A new effective dynamic program for an investment optimization problem

0 references

Identifiers

zbMATH Open document ID

0 references

10.1134/S000511791612002X

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:517329

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q517329&oldid=36311723"