✦ LIBER ✦

Probabilistic asymptotic properties of some combinatorial optimization problems

✍ Scribed by Rainer E. Burkard; Ulrich Fincke

Publisher: Elsevier Science
Year: 1985
Tongue: English
Weight: 351 KB
Volume: 12
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(85)90037-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Easy distributions for combinatorial opt

Easy distributions for combinatorial optimization problems with probabilistic constraints

✍ Bernard Fortz; Michael Poss 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 232 KB

We show how we can linearize individual probabilistic linear constraints with binary variables when all coefficients are independently distributed according to either N (µ i , λµ i ), for some λ > 0 and µ i > 0, or Γ (k i , θ ) for some θ > 0 and k i > 0. The constraint can also be linearized when t

Combinatorial optimization problems in t

Combinatorial optimization problems in the analysis and design of probabilistic networks

✍ D. Bauer; F. Boesch; C. Suffel; R. Tindell 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 668 KB

This paper presents some results regarding the design of reliable networks. The problem under consideration involves networks which are undirected graphs having equal and independent edge failure probabilities. The index of reliability is the probability that the network fails (becomes disconnected)

Probabilistic and worst case analyses of

Probabilistic and worst case analyses of classical problems of combinatorial optimization in Euclidean Space

✍ J.Michael Steele 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 61 KB

Asymptotic solutions of some probabilist

Asymptotic solutions of some probabilistic optimal control problems: PMM vol. 41, n≗ 1, 1977, pp. 13–23

✍ A.S. Bratus' 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 712 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

Probabilistic analysis of an asymptotica

Probabilistic analysis of an asymptotically optimal solution for the completion time variance problem

✍ C.T. Ng; X. Cai; T.C.E. Cheng 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 135 KB 👁 2 views

Scheduling a set of n jobs on a single machine so as to minimize the completion time variance is a well-known NP-hard problem. In this paper, we propose a sequence, which can be constructed in O(n log n) time, as a solution for the problem. Our primary concern is to establish the asymptotical optima