Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Keyword: knapsack problem
Found
169 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Bounded knapsack sharing
1994,
Brown J. Randall
A bounded knapsack sharing problem is a maximim or minimax mathematical programming...
A complementary greedy heuristic for the knapsack problem
1992,
White D.J.
This paper considers the structural properties of an alternative O( n’ 2) time...
A nonlinear Knapsack problem
1995,
Hochbaum Dorit S.
The nonlinear Knapsack problem is to maximize a separable concave objective function,...
Valid inequalities and facets for a hypergraph model of the nonlinear knapsack and the FMS part selection problems
1995,
Mazzola Joseph B.
This paper defines the dense subhypergraph problem (DSP), which provides a modelling...
Nwe results for aggregating integer-valued equations
1995,
Glover Fred
A variety of results have been given for aggregating integer-valued (diophantine)...
Partial cover and complete cover inequalities
1994,
Jrnsten Kurt
In this paper the authors use an extension of the well-known cover inequalities to...
Fuzzy multiple choice knapsack problem
1994,
Gen Mitsuo
This article is intended to present a multiple choice knapsack problem with fuzzy...
Matroidal relaxations for 0-1 knapsack problems
1993,
Barcia Paulo
The family of the feasible solutions for a Knapsack with positive coefficients, , is...
Solving sequential knapsack problems
1993,
Hartmann Mark
The authors give an O( n log n) algorithm for solving sequential knapsack problems,...
0-1 Multidimensional knapsack problem: Bounds on the sum of variables at optimum
1993,
Plateau G.
Glover has been the first author to introduce an extra constraint, related to the sum...
A lexicographic search for strongly correlated 0-1 knapsack problems
1993,
Pandit S.N.N.
An efficient lexicographic search approach to the 0-1 single constraint knapsack...
Polyhedral results for the precedence-constrained knapsack problem
1993,
Boyd Andrew E.
A problem characteristic common to a number of important integer programming problems...
Hard 0-1 multiknapsack test problems for size reduction methods
1990,
Frville A.
Our reduction algorithm applied to classical 0-1 multiknapsack test problems of the...
On the continuous quadratic knapsack problem
1992,
Robinson A.G.
The authors introduce a new algorithm for the continuous bounded quadratic knapsack...
Adjacency of the 0-1 knapsack problem
1992,
Geist Daniel
In this paper the authors show that adjacency on the 0-1 knapsack polytope can be...
On a discrete nonlinear and nonseparable knapsack problem
1990,
Klastorin T.D.
In this paper, a discrete knapsack problem with a convex but nonseparable objective...
A probabilistic analysis of the multiknapsack value function
1990,
Vercellis C.
The optimal solution value of the multiknapsack problem as a function of the knapsack...
The linear multiple choice knapsack problem
1989,
Karwan Mark H.
The multiple choice knapsack problem is defined as a knapsack problem with additional...
On a cardinality constrained linear programming knapsack problem
1989,
Dudzinski Krysztof
The paper presents an O( n 2 ) method for solving the cardinality constrained linear...
On the supermodular knapsack problem
1989,
Simeone B.
In this paper the authors introduce binary knapsack problems where the objective...
An O(n3) worst case bounded special LP knapsack (0-1) with two constraints
1988,
Maculan Nelson
In this paper it is shown that a linear knapsack 0-1 problem amended with a nontrivial...
The knapsack problem with generalized upper bounds
1989,
Elmaghraby Salah E.
A particular production planning problem gives rise to a knapsack problem with...
A hard knapsack problem
1988,
Hung Ming S.
In this article the authors develop a class of general knapsack problems which are...
Probabilistic analysis of the multidimensional knapsack problem
1989,
Dyer M.E.
The authors analyse the multi-constraint zero-one knapsack problem, under the...
First Page
5
6
7
8
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers