Now showing items 1-10 of 73
The constrained compartmentalized knapsack problem: mathematical models and solution methods
(ELSEVIER SCIENCE BV, 2011)
The constrained compartmentalized knapsack problem can be seen as an extension of the constrained knapsack problem. However, the items are grouped into different classes so that the overall knapsack has to be divided into ...
The Double Knapsack Negotiation Problem: Modeling Cooperative Agents and Experimenting Negotiation Strategies
This paper presents a novel approach to the well-known Knapsack problem, extending it as a bilateral negotiating problem with default information where each of the two agents has a knapsack and there is a set of items ...
Approximation schemes for knapsack problems with shelf divisions
(Elsevier Science BvAmsterdamHolanda, 2006)
A NOTE ON A TWO DIMENSIONAL KNAPSACK PROBLEM WITH UNLOADING CONSTRAINTS
(Edp Sciences S ALes Ulis Cedex AFrança, 2013)
The precedence constrained knapsack problem: Separating maximally violated inequalities
We consider the problem of separating maximally violated inequalities for the precedence constrained knapsack problem. Though we consider maximally violated constraints in a very general way, special emphasis is placed on ...
Sequence independent lifting for mixed knapsack problems with GUB constraints
In this paper, we consider the semi-continuous knapsack problem with generalized upper bound constraints on binary variables. We prove that generalized flow cover inequalities are valid in this setting and, under mild ...
A knapsack problem as a tool to solve the production planning problem in small foundries
(PERGAMON-ELSEVIER SCIENCE LTDOxford, 2012)
According to recent research carried out in the foundry sector, one of the most important concerns of the industries is to improve their production planning. A foundry production plan involves two dependent stages: (1) ...
Algorithms for 3D guillotine cutting problems: Unbounded knapsack, cutting stock and strip packing
(Pergamon-Elsevier Science LtdOxford, 2012)
Approximating geometric knapsack via l-packings
We study the two-dimensional geometricknapsack problem (2DK) in which we are given a setofnaxis-aligned rectangular items, each one with anassociated profit, and an axis-aligned square knapsack. ...