๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An algorithm for 0-1 multiple-knapsack problems

โœ Scribed by Ming S. Hung; John C. Fisk

Publisher
John Wiley and Sons
Year
1978
Tongue
English
Weight
528 KB
Volume
25
Category
Article
ISSN
0894-069X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Fast and Scalable Parallel Algorithms fo
Fast and Scalable Parallel Algorithms for Knapsack-like Problems
โœ Afonso Ferreira; John Michael Robson ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 403 KB

We present two new algorithms for searching in sorted X ุ‰ Y ุ‰ R ุ‰ S, one based on heaps and the other on sampling. Each of the algorithms runs in time O(n 2 log n) (n being the size of the sorted arrays X, Y, R, and S). Hence in each case, by constructing arrays of size n โ€ซุโ€ฌ O(2 s/4 ), we obtain a

An approximation algorithm for quadratic
An approximation algorithm for quadratic cost 0โ€“1 mixed integer programming problems
โœ Kumiko Mukai; Keiji Tatsumi; Masao Fukushima ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 586 KB

In this paper, we focus on the quadratic cost 01 mixed integer programming problem. First, we formulate the problem as a two-level programming problem that consists of a lower-level continuous quadratic programming problem with 01 variables fixed and an upper-level nonlinear 01 programming problem.