✦ LIBER ✦

Subadditive lifting methods for partitioning and knapsack problems

✍ Scribed by Ellis L Johnson

Publisher: Elsevier Science
Year: 1980
Tongue: English
Weight: 925 KB
Volume: 1
Category: Article
ISSN: 0196-6774
DOI: 10.1016/0196-6774(80)90006-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Partitioning methods for reaction–diffus

Partitioning methods for reaction–diffusion problems

✍ Wolfram Heineken; Gerald Warnecke 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 499 KB

A hybrid method for solving nonlinear kn

A hybrid method for solving nonlinear knapsack problems

✍ Frank Körner 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 210 KB

Average Saving Effects in Enumerative Me

Average Saving Effects in Enumerative Methods for Solving Knapsack Problems

✍ Karl Heinz Borgwardt; Jürgen Brzank 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 404 KB

Lagrangean methods for the 0–1 Quadratic

Lagrangean methods for the 0–1 Quadratic Knapsack Problem

✍ Philippe Michelon; Louis Veilleux 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 742 KB

State space partitioning methods for sto

State space partitioning methods for stochastic shortest path problems

✍ Alexopoulos, Christos 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 150 KB 👁 2 views

This paper describes methods for computing measures related to shortest paths in networks with discrete random arc lengths. These measures include the probability that there exists a path with length not exceeding a specified value and the probability that a given path is shortest. The proposed meth

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