✦ LIBER ✦

The inverse -knapsack problem: Theory, algorithms and computational experiments

✍ Scribed by Roland, Julien; Figueira, José Rui; De Smet, Yves

Book ID: 121183748
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 426 KB
Volume: 10
Category: Article
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2013.03.001

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computational results with a branch-and-

Computational results with a branch-and-bound algorithm for the general knapsack problem

✍ R. L. Bulfin; R. G. Parker; C. M. Shetty 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 416 KB 👁 1 views

Heuristic and Exact Algorithms for the P

Heuristic and Exact Algorithms for the Precedence-Constrained Knapsack Problem

✍ N. Samphaiboon; Y. Yamada 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 150 KB

[Algorithms and Combinatorics] Combinato

[Algorithms and Combinatorics] Combinatorial Optimization Volume 21 || The Knapsack Problem

✍ Korte, Bernhard; Vygen, Jens 📂 Article 📅 2011 🏛 Springer Berlin Heidelberg ⚖ 174 KB

The Multidimensional 0-1 Knapsack Proble

The Multidimensional 0-1 Knapsack Problem—Bounds and Computational Aspects

✍ Arnaud Fréville; SaÏd Hanafi 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 281 KB

The inverse swift effect: experiments an

The inverse swift effect: experiments and theory

✍ J.J. Jonas; S. Shrivastava; L.S. Tóth 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 423 KB

AbstractÐExperiments are described in which previously twisted wires are loaded in ``free end'' extension. The prior shears are applied at either low or elevated homologous temperatures. When prior twisting takes place at room temperature, extensions beyond 1±2% produce continued twisting. Conversel

Computational experience with a core-bas

Computational experience with a core-based reduction procedure for the 2-knapsack problem

✍ F. Della Croce; A. Grosso 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 117 KB