Keyword: knapsack problem

Found 169 papers in total
An integer-programming-based heuristic for the balanced loading problem
An integer-programming-based heuristic for the balanced loading problem
1998,
This paper presents an efficient heuristic algorithm for the one-dimensional loading...
A note on splitting of variables in integer programming models
A note on splitting of variables in integer programming models
2000,
The splitting of variables in an integer programming model is a tool to obtain a more...
A minimal algorithm for the 0–1 knapsack problem
A minimal algorithm for the 0–1 knapsack problem
1997,
Several types of large-sized 0–1 Knapsack Problems (KP) may be easily solved,...
Upper bounds and algorithms for hard 0–1 knapsack problems
Upper bounds and algorithms for hard 0–1 knapsack problems
1997,
It is well-known that many instances of the 0–1 knapsack problem can be...
On the max–min 0–1 knapsack problem with robust optimization applications
On the max–min 0–1 knapsack problem with robust optimization applications
1996,
Given a set of items, a set of scenarios, and a knapsack of fixed capacity, a...
Lifting valid inequalities for the precedence constrained knapsack problem
Lifting valid inequalities for the precedence constrained knapsack problem
1999,
This paper considers the precedence constrained knapsack problem. More specifically,...
Solving a class of multiplicative programs with 0–1 knapsack constraints
Solving a class of multiplicative programs with 0–1 knapsack constraints
1999,
We develop a branch-and-bound algorithm to solve a nonlinear class of 0–1...
Fixed-charge continuous knapsack problems and pseudogreedy solutions
Fixed-charge continuous knapsack problems and pseudogreedy solutions
1999,
We investigate nonlinear continuous knapsack problems, which can be classified as...
Sensitivity analysis for knapsack problems: Another negative result
Sensitivity analysis for knapsack problems: Another negative result
1999,
We answer a question of Blair on the computational complexity of a problem related to...
O(n log n) procedures for tightening cover inequalities
O(n log n) procedures for tightening cover inequalities
1999,
We present two procedures for tightening cover induced inequalities in 0–1...
The 0–1 knapsack problem with a single continuous variable
The 0–1 knapsack problem with a single continuous variable
1999,
Constraints arising in practice often contain many 0–1 variables and one or a...
A new upper bound for the 0–1 quadratic knapsack problem
A new upper bound for the 0–1 quadratic knapsack problem
1999,
The 0–1 quadratic knapsack problem (QKP) consists in maximizing a positive...
An efficient algorithm for the Lagrangean dual of nonlinear knapsack problems with additional nested constraints
An efficient algorithm for the Lagrangean dual of nonlinear knapsack problems with additional nested constraints
1997,
This paper presents an efficient algorithm for solving the Lagrangean dual of...
Facets of knapsack polytopes with bipartite precedence constraints
Facets of knapsack polytopes with bipartite precedence constraints
1998,
We consider the precedence-constrained knapsack problem, which is a knapsack problem...
On characterizing tighter formulations for 0–1 programs
On characterizing tighter formulations for 0–1 programs
1998,
We present two approaches for 0–1 program model tightening. They are based on...
Some exact algorithms for the knapsack sharing problem
Some exact algorithms for the knapsack sharing problem
1998,
The knapsack sharing problem (KSP) is formulated as an extension to the ordinary...
Cutting planes for mixed-integer knapsack polyhedra
Cutting planes for mixed-integer knapsack polyhedra
1998,
An algorithm for generating cutting planes for mixed-integer knapsack polyhedra is...
A cyclic production problem: An application of max-algebra
A cyclic production problem: An application of max-algebra
1998,
Given are m identical machines, each of which performs the same N operations O i , 1...
Impact of learning and fatigue factors on single machine scheduling with penalties for tardy jobs
Impact of learning and fatigue factors on single machine scheduling with penalties for tardy jobs
1998,
We consider a single machine scheduling problem in which the machine experiences the...
The growth of multi-constraint random knapsacks with large right-hand sides of the constraints
The growth of multi-constraint random knapsacks with large right-hand sides of the constraints
1997,
The asymptotic value of an m -constraint, n -variable, binary random knapsack is...
On dominated terms in the general knapsack problem
On dominated terms in the general knapsack problem
1997,
A necessary and sufficient condition for the identification of dominated terms in a...
A core approach to the 0–1 equality knapsack problem
A core approach to the 0–1 equality knapsack problem
1998,
For the 0–1 knapsack problem with equality constraint a partitioning procedure...
New polynomial bounds for matroidal knapsacks
New polynomial bounds for matroidal knapsacks
1996,
The Matroidal Knapsack Problem (MK) consists in finding the maximum weight basis for a...
On tightening 0–1 programs based on extensions of pure 0–1 knapsack and subset-sum problems
On tightening 0–1 programs based on extensions of pure 0–1 knapsack and subset-sum problems
1998,
We present a framework for automatic tightening of general 0–1 programs. A given...
Papers per page: