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
An O(n2logn) algorithm for the linear knapsack problem with SUB and extended GUB constraints
1997,
Won Joong-Yeon
We present an extension of the well-known generalized upper bound (GUB) constraint and...
An AI approach with tabu search to solve multi-level knapsack problems using cycle detection, short-term and long-term memory
1997,
Ko Ilsang
An AI approach with tabu search is designed to solve multi-level knapsack problems....
The reactive Tabu search
1994,
Battiti Roberto
We propose an algorithm for combinatorial optimization where an explicit check for the...
Optimal access control for broadband services: Stochastic knapsack with advance information
1996,
Cox Louis Anthony
Suppose that call reservation requests of K different types arrive randomly at a...
A special class parametric of knapsack problems: Analytic aids and heuristics
1995,
White D.J.
This paper deals with a knapsack problem of very special form with a variable...
Generating cuts from surrogate constraint analysis for zero–one and multiple choice programming
1997,
Glover Fred
This paper presents a new surrogate constraint analysis that gives rise to a family of...
Multiple period repair kit problem with a job completion criterion – a case-study
1995,
Gelders L.F.
The repair kit problem is concerned with finding an optimal kit of parts and tools to...
An exact algorithm for general, orthogonal, two-dimensional knapsack problems
1995,
Christofides Nicos
We present a new exact tree-search procedure for solving two-dimensional knapsack...
On the 0/1 knapsack polytope
1997,
Weismantel Robert
This paper deals with the 0/1 knapsack polytope. In particular, we introduce the...
The canonical order and greedy algorithms
1995,
Kovalev M.M.
Using the isotone property with respect to the canonical order, we describe a class of...
A nonlinear Knapsack problem
1995,
Hochbaum Dorit S.
The nonlinear Knapsack problem is to maximize a separable concave objective function,...
An approximation algorithm for solving unconstrained two-dimensional knapsack problems
1995,
Zissimopoulos Vassilis
An efficient heuristic for solving two-dimensional knapsack problems is proposed. The...
Bounds for nested knapsack problems
1995,
Johnston Robert E.
In this paper, a specific nested knapsack problem is considered and expressed as an...
On the Dietrich-Escudero approach for solving the 0-1 knapsack problem with a 0-1 objective function
1994,
Escudero L.F.
In this brief note the authors demonstrate that the Dietrich-Escudero procedure for...
A computational note on the Martello-Toth knapsack algorithm
1994,
Vasko Francis J.
Martello and Toth are well known for their work on the 0-1 kanpsack problem....
The growth of multi-constraint random knapsacks with various right-hand sides of the constraints
1994,
Szkatua Krzysztof
The asymptotic value of the m- constraint, n- variable, 0-1 random kanpsack problem...
A new knapsack solution approach by integer equivalent aggregation and consistency determination
1997,
Glover Fred
The authors present a new and highly efficient algorithm for the integer knapsack...
A note on dominance in unbounded knapsack problems
1995,
Johnston Robert E.
The phenomenon of dominance has been used in practice since the early 1960’s to...
A projection method for the integer quadratic knapsack problem
1996,
Shetty Bala
This paper presents a new branch and bound algorithm for solving a class of integer...
Solving the generalized knapsack problem with variable coefficients
1996,
Jrnsten Kurt
In this article the authors present methods based on Lagrangian duality and...
An exact search for the solution of the surrogate dual of te 0-1 bidimensional knapsack problem
1993,
Frville Arnaud
The surrogate dual of the 0-1 bidimensional knapsack problem is exactly solved by an...
Lifted cover facets of the 0-1 knapsack polytope with GUB constraints
1994,
Nemhauser George L.
Facet-defining inequalities lifted from minimal covers are used as strong cutting...
A hybrid dynamic-programming branch-and-bound algorithm for the multiple-choice knapsack-problem
1995,
Dyer M.E.
Dynamic programming and branch-and-bound methodologies are combined to produce a...
Probabilistic properties of the dual structure of the multidimensional knapsack problem and fast statistically efficient algorithms
1994,
Averbakh Igor
Properties of several dual characteristics of the multidimensional knapsack problem...
First Page
4
5
6
7
8
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers