𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The minmax multidimensional knapsack problem with application to a chance-constrained problem

✍ Scribed by Moshe Kress; Michal Penn; Maria Polukarov


Publisher
John Wiley and Sons
Year
2007
Tongue
English
Weight
136 KB
Volume
54
Category
Article
ISSN
0894-069X

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


A new rank correlation coefficient with
✍ Edward J. Emond; David W. Mason πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 165 KB

## Abstract The consensus ranking problem has received much attention in the statistical literature. Given __m__ rankings of __n__ objects the objective is to determine a consensus ranking. The input rankings may contain ties, be incomplete, and may be weighted. Two solution concepts are discussed,

The pilot method: A strategy for heurist
✍ Duin, Cees; VoοΏ½, Stefan πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 140 KB πŸ‘ 2 views

As a metaheuristic to obtain solutions of enhanced quality, we formulate the so-called pilot method. It is a tempered greedy method that is to avoid the greedy trap by looking ahead for each possible choice (memorizing the best result). Repeatedly, a so-called master solution is modified, each time

A probabilistic local majority polling g
✍ Toshio Nakata; Hiroshi Imahayashi; Masafumi Yamashita πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 123 KB πŸ‘ 1 views

In this paper, we investigate a probabilistic local majority polling game on weighted directed graphs, keeping an application to the distributed agreement problem in mind. We formulate the game as a Markov chain, where an absorbing state corresponds to a system configuration that an agreement is ach