Stability of Multiple Knapsack Problems with Interval Capacities
نویسندگان
چکیده
منابع مشابه
Improved Multi-unit Auction Clearing Algorithms with Interval (Multiple-Choice) Knapsack Problems
We study the interval knapsack problem (I-KP), and the interval multiple-choice knapsack problem (I-MCKP), as generalizations of the classic 0/1 knapsack problem (KP) and the multiple-choice knapsack problem (MCKP), respectively. Compared to singleton items in KP and MCKP, each item i in I-KP and I-MCKP is represented by a ([ai, bi], pi) pair, where integer interval [ai, bi] specifies the possi...
متن کاملContinuous knapsack sets with divisible capacities Laurence
We study two continuous knapsack sets Y! and Y" with n integer, one unbounded continuous and m bounded continuous variables in either ! or " form. When the coefficients of the integer variables are integer and divisible, we show in both cases that the convex hull is the intersection of the bound constraints and 2m polyhedra arising from a continuous knapsack set with a single unbounded continuo...
متن کاملExploiting Symmetry in Multiple Knapsack Problems
The multiple knapsack problem (MKP) is a classical combinatorial optimization problem. A recent algorithm for some classes of the MKP is bincompletion, a bin-oriented, branch-and-bound algorithm. We investigate mechanisms for detecting and breaking symmetry in the bin-completion search space. We propose path-symmetry and pathdominance, two new symmetry relations which are more powerful generali...
متن کاملKnapsack problems with setups
RÉSUMÉ : We consider two variants of knapsack problems with setups arising as subproblems in a DantzigWolfe decomposition approach to more complex combinatorial optimization problems. In the multiple-class binary knapsack problem with setups, items are partitioned into classes whose use implies a setup cost and associated capacity consumption. Item weights are assumed to be a multiple of their ...
متن کاملKnapsack Problems with Random Budgets
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. We propose two different formulations of this problem, based on diffe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Advances in Mathematics and Computer Science
سال: 2018
ISSN: 2456-9968
DOI: 10.9734/jamcs/2018/44942