✦ LIBER ✦

A graphical method to solve a maximin allocation problem

✍ Scribed by Waldemar Czuchra

Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 158 KB
Volume: 26
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(86)90187-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A graphical method to solve a family of

A graphical method to solve a family of allocation problems

✍ RenéVictor Valqui Vidal 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 198 KB

A graphical bicriteria approach to the r

A graphical bicriteria approach to the resource allocation problem

✍ Waldemar Czuchra 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 318 KB

A method to solve fuzzy reliability opti

A method to solve fuzzy reliability optimization problem

✍ Lev V. Utkin; Sergey V. Gurov; Igor B. Shubinsky 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 413 KB

A linear-time algorithm for solving cont

A linear-time algorithm for solving continuous maximin knapsack problems

✍ Takahito Kuno; Hiroshi Konno; Eitan Zemel 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 221 KB

A graphical method for optimal reliabili

A graphical method for optimal reliability allocation

✍ R.A. Agarwala; K.K. Aggarwal 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 348 KB

A graphical realization of the dynamic p

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

✍ Alexander A. Lazarev; Frank Werner 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 656 KB

## a b s t r a c t In this paper, we consider a graphical realization of dynamic programming. The concept is discussed on the partition and knapsack problems. In contrast to dynamic programming, the new algorithm can also treat problems with non-integer data without necessary transformations of the