✦ LIBER ✦

Using stratified sampling to solve the knapsack problem

✍ Scribed by N. Yu. Kuznetsov

Publisher: Springer US
Year: 1998
Tongue: English
Weight: 772 KB
Volume: 34
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf02911263

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Solving the 0–1 proportional knapsack pr

Solving the 0–1 proportional knapsack problem by sampling

✍ M. Penn; D. Hasson; M. Avriel 📂 Article 📅 1994 🏛 Springer 🌐 English ⚖ 380 KB

Development of core to solve the multidi

Development of core to solve the multidimensional multiple-choice knapsack problem

✍ Taha Ghasemi; Mohammadreza Razzazi 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 426 KB

The multidimensional multiple-choice knapsack problem (MMKP) is an extension of the 0-1 knapsack problem. The core concept has been used to design efficient algorithms for the knapsack problem but the core has not been developed for the MMKP so far. In this paper, we develop an approximate core for

A method of solving the knapsack problem

✍ G.P. Veliev; K.Sh. Mamedov 📂 Article 📅 1981 🏛 Elsevier Science ⚖ 432 KB

Solving the generalized knapsack problem

Solving the generalized knapsack problem with variable coefficients

✍ Kaj Holmberg; Kurt Jörnsten 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 1012 KB

In this article we present methods based on Lagrangian duality and decomposition techniques for the generalized knapsack problem with variable coefficients. The Lagrangian dual is solved with subgradient optimization or interval bisection. We also describe a heuristic that yields primal feasible sol

Reformulation and sampling to solve a st

Reformulation and sampling to solve a stochastic network interdiction problem

✍ Udom Janjarassuk; Jeff Linderoth 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 179 KB

## Abstract The network interdiction problem involves interrupting an adversary's ability to maximize flow through a capacitated network by destroying portions of the network. A budget constraint limits the amount of the network that can be destroyed. In this article, we study a stochastic version

Using DNA to solve the Bounded Post Corr

Using DNA to solve the Bounded Post Correspondence Problem

✍ Lila Kari; Greg Gloor; Sheng Yu 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 121 KB

Theoretical research in DNA computing includes designing practical experiments for solving various computational problems by means of DNA manipulation. This paper proposes a DNA algorithm for an NP-complete problem, The Bounded Post Correspondence Problem. The proposed experiment can be used to test