✦ LIBER ✦

Worst-case analysis of an approximation scheme for the subset-sum problem

✍ Scribed by Matteo Fischetti

Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 150 KB
Volume: 5
Category: Article
ISSN: 0167-6377
DOI: 10.1016/0167-6377(86)90065-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Worst-case analysis of greedy algorithms

Worst-case analysis of greedy algorithms for the unbounded knapsack, subset-sum and partition problems

✍ Tsung-Chyan Lai 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 360 KB

A note on worst-case analysis of approxi

A note on worst-case analysis of approximation algorithms for a scheduling problem

✍ Eugeniusz Nowicki; Czesław Smutnicki 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 370 KB

A worst-case analysis of two approximate

A worst-case analysis of two approximate algorithms for the asymmetric travelling salesman problem

✍ Giovanni Righini; Marco Trubian 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 251 KB

Worst-case analysis of heuristics for th

Worst-case analysis of heuristics for the local microcode optimization problem

✍ Axel Böttcher; Gisbert Lawitzky; Hans-Ulrich Simon 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 383 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

An economic lot-sizing problem with peri

An economic lot-sizing problem with perishable inventory and economies of scale costs: Approximation solutions and worst case analysis

✍ Leon Yang Chu; Vernon Ning Hsu; Zuo-Jun Max Shen 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 190 KB

## Abstract The costs of many economic activities such as production, purchasing, distribution, and inventory exhibit economies of scale under which the average unit cost decreases as the total volume of the activity increases. In this paper, we consider an economic lot‐sizing problem with general