✦ LIBER ✦

Average-Case Analysis of the Double Description Method and the Beneath-Beyond Algorithm

✍ Scribed by Karl Heinz Borgwardt

Publisher: Springer
Year: 2007
Tongue: English
Weight: 260 KB
Volume: 37
Category: Article
ISSN: 0179-5376
DOI: 10.1007/s00454-006-1257-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Average-case analysis of the Modified Ha

Average-case analysis of the Modified Harmonic algorithm

✍ Prakash Ramanan; Kazuhiro Tsuga 📂 Article 📅 1989 🏛 Springer 🌐 English ⚖ 751 KB

Average-Case Analysis of the Merging Alg

Average-Case Analysis of the Merging Algorithm of Hwang and Lin

✍ W. Fernandez de la Vega; A. M. Frieze; M. Santha 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 77 KB

Interior-Point Methods: Worst Case and A

Interior-Point Methods: Worst Case and Average Case Analysis of a Phase-I Algorithm and a Termination Procedure

✍ Petra Huhn; Karl Heinz Borgwardt 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 644 KB

An average case analysis of a greedy alg

An average case analysis of a greedy algorithm for the on-line Steiner tree problem

✍ Ying Teh Tsai; Chuan Yi Tang; Yunn Yen Chen 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 719 KB

Average and worst-case analysis of heuri

Average and worst-case analysis of heuristics for the maximum tardiness problem

✍ Nicholas G. Hall; WanSoo T. Rhee 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 530 KB

Average-case analysis of the bin-packing

Average-case analysis of the bin-packing problem with general cost structures

✍ Julien Bramel; WanSoo T. Rhee; David Simchi-Levi 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 100 KB

We consider a version of the famous bin-packing problem where the cost of a bin is a concave function of the number of items in the bin. We analyze the problem from an average-case point of view and develop techniques to determine the asymptotic optimal solution value for a variety of functions. We