✦ LIBER ✦

Some problems in the analysis of stochastic dominance

✍ Scribed by William E. Stein; Roger C. Pfaffenberger

Publisher: Elsevier Science
Year: 1987
Weight: 294 KB
Volume: 8
Category: Article
ISSN: 0270-0255
DOI: 10.1016/0270-0255(87)90575-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Dominance stochastic models in data enve

Dominance stochastic models in data envelopment analysis

✍ Zhimin Huang; Susan X. Li 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 990 KB

Relaxations of linear programming proble

Relaxations of linear programming problems with first order stochastic dominance constraints

✍ Nilay Noyan; Gábor Rudolf; Andrzej Ruszczyński 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 177 KB

The solution of some stochastic two-stag

The solution of some stochastic two-stage problems

✍ D.D. Frolkin 📂 Article 📅 1984 🏛 Elsevier Science ⚖ 505 KB

A stochastic dominance analysis of ranke

A stochastic dominance analysis of ranked voting systems with scoring

✍ William E. Stein; Philip J. Mizzi; Roger C. Pfaffenberger 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 517 KB

Domination analysis of combinatorial opt

Domination analysis of combinatorial optimization problems

✍ Gregory Gutin; Alek Vainshtein; Anders Yeo 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 141 KB

We use the notion of domination ratio introduced by Glover and Punnen in 1997 to present a new classiÿcation of combinatorial optimization (CO) problems: DOM-easy and DOM-hard problems. It follows from results already proved in the 1970s that min TSP (both symmetric and asymmetric versions) is DOM-e

Analysis of the stochastic “unilateral c

Analysis of the stochastic “unilateral contact” problem

✍ P.D. Panagiotopoulos 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 689 KB