Pages that link to "Item:Q980008"
From MaRDI portal
The following pages link to A graphical realization of the dynamic programming method for solving NP-hard combinatorial problems (Q980008):
Displayed 8 items.
- A graphical approach to solve an investment optimization problem (Q483269) (← links)
- A new effective dynamic program for an investment optimization problem (Q505320) (← links)
- Graphical method to solve combinatorial optimization problems (Q517329) (← links)
- Algorithms for some maximization scheduling problems on a single machine (Q612210) (← links)
- A note on a single machine scheduling problem with generalized total tardiness objective function (Q763495) (← links)
- On the best choice of a branching variable in the subset sum problem (Q1744347) (← links)
- Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one (Q1761818) (← links)
- Complexity of solving the subset sum problem with the branch-and-bound method with domination and cardinality filtering (Q2399471) (← links)