Results 161 to 170 of about 24,926 (205)

An Algorithm for the 0-1 Equality Knapsack Problem

Journal of the Operational Research Society, 1988
The paper deals with the following problem: minimize cx on the set \(\{\) x: \(wx=b\}\). \(x=(x_ 1\),..., \(x_ n)\), \(x_ i=0\) or 1. Here c and w are vectors with rational non-negative coordinates. This is called the equality knapsack problem. A method is developed which computes some candidate solutions and investigates them using branch and bound ...
Ram, Balasubramanian, Sarin, Sanjiv
openaire   +3 more sources

Problem reduction heuristic for the 0–1 multidimensional knapsack problem

Computers & Operations Research, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hill, Raymond R., Cho, Yong Kun, Moore, James T.   +2 more
openaire   +2 more sources

0-1 Knapsack Problems with Random Budgets

SSRN Electronic Journal, 2001
Given a set of elements, each having a profit and cost associated with it, and a budget, the 0-1 knapsack problem finds a subset of the elements with maximum possible combined profit subject to the combined cost not exceeding the budget. In this paper we study a stochastic version of the problem in which the budget is random.
Shubhabratha Das, Diptesh Ghosh
openaire   +1 more source

Lagrangean methods for the 0–1 Quadratic Knapsack Problem

European Journal of Operational Research, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michelon, Philippe, Veilleux, Louis
openaire   +1 more source

Improved results on the 0–1 multidimensional knapsack problem

European Journal of Operational Research, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Vasquez, Michel, Vimont, Yannick
openaire   +1 more source

Solving efficiently the 0–1 multi-objective knapsack problem

Computers & Operations Research, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bazgan, Cristina, Hugot, Hadrien, Vanderpooten, Daniel   +2 more
openaire   +3 more sources

Solving the 0–1 proportional knapsack problem by sampling

Journal of Optimization Theory and Applications, 1994
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Penn, M., Hasson, D., Avriel, M.
openaire   +1 more source

An Improved Heuristic for Multidimensional 0—1 Knapsack Problems

Journal of the Operational Research Society, 1990
For the multidimensional 0-1 knapsack problem a heuristic exists, based on Lagrange multipliers, that also enables the determination of an upper bound to the optimal criterion value. This heuristic is extended in two ways: (1) in each step, not one, but more multiplier values are computed simultaneously, and (2) at the end the upper bound is sharpened ...
A. Volgenant, J. A. Zoon
openaire   +1 more source

A core approach to the 0 –1 equality knapsack problem

Journal of the Operational Research Society, 1998
Summary: For the 0-1 knapsack problem with equality constraint a partitioning procedure is introduced which focuses on the core of the problem. The purpose of the procedure is to reduce the required preliminary sorting for large problem instances. Computational results are presented for an improved heuristic as well as for a complete (exact) algorithm ...
Volgenant, A., Marsman, S.
openaire   +2 more sources

Landscape Properties of the 0-1 Knapsack Problem

Proceedings of the Companion Publication of the 2015 Annual Conference on Genetic and Evolutionary Computation, 2015
This paper studies two landscapes of different instances of the 0-1 knapsack problem. The instances are generated randomly from varied weight distributions. We show that the variation of the weights can be used to guide the selection of the most suitable local search operator for a given instance.
Khulood Alyahya, Jonathan E. Rowe
openaire   +1 more source