✦ LIBER ✦

A randomized algorithm for the min-max selecting items problem with uncertain weights

✍ Scribed by Adam Kasperski; Paweł Zieliński

Publisher: Springer US
Year: 2009
Tongue: English
Weight: 311 KB
Volume: 172
Category: Article
ISSN: 0254-5330
DOI: 10.1007/s10479-009-0564-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A fast algorithm for the minimax flow pr

A fast algorithm for the minimax flow problem with 01 weights

✍ C.-C. Han 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 398 KB

A randomized algorithm for the on-line w

A randomized algorithm for the on-line weighted bipartite matching problem

✍ Béla Csaba; András Pluhár 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 283 KB

A metaheuristic for the min–max windy ru

A metaheuristic for the min–max windy rural postman problem with K vehicles

✍ Enrique Benavent; Ángel Corberán; José M. Sanchis 📂 Article 📅 2009 🏛 Springer-Verlag 🌐 English ⚖ 386 KB

A PTAS for the chance-constrained knapsa

A PTAS for the chance-constrained knapsack problem with random item sizes

✍ Vineet Goyal; R. Ravi 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 441 KB

A simulated annealing algorithm with the

A simulated annealing algorithm with the random compound move for the sequential partitioning problem of directed acyclic graphs

✍ Taichi Kaji; Azuma Ohuchi 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 240 KB

In this paper, we present an approach for ®nding a minimum cost partition of the nodes of a directed acyclic graph into subsets of a given size, subject to the constraint that the precedence relationships among the elements are satis®ed, based on the concept of simulated annealing. Simulated anneali

Genetic algorithm with adaptive and dyna

Genetic algorithm with adaptive and dynamic penalty functions for the selection of cleaner production measures: a constrained optimization problem

✍ Elmer P. Dadios; Jamshaid Ashraf 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 506 KB