Random pseudo-polynomial algorithms for some combinatorial programming problems

Article Abstract:

Various applications of random pseudo-polynomial (rpp) algorithms in solving weighted combinatorial programming problems (WCP) are analyzed. WCPs are defined by input data consisting of a ground set, a nonempty family of feasible sets, a weighting function and an objective function. RPP algorithms are effective in solving exact, multi- weighted exact, exact versions of minimum cost flow, uncapacitated transportation, minimum cost perfect matching, exact cost integral flow, minimum cost circulation, optimization and image problems, as well as other problems requiring solutions to parity bases in matroids.

Computer networks, Integer programming

---

Revisiting dynamic programming for finding optimal subtrees in trees

Article Abstract:

An existing combinatorial optimization method used for finding subtrees in edge weighed trees is examined.

Management dynamics, Spain, Management, Company business management, Mathematical optimization, Optimization theory, Trees (Graph theory)

---

Unbounded knapsack problem: Dynamic programming revisited

Article Abstract:

An efficient dynamic programming algorithm, EDUK, for the unbounded knapsack problem is presented.

Similar abstracts:

• Abstracts: A genetic algorithm for multi-mode resource constrained project scheduling problem
• Abstracts: An application of genetic algorithms for flow shop problems. A primal partitioning approach for single and non-simultaneous multicommodity flow problems

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.