Optimistic Planning for the Stochastic Knapsack Problem
Optimistic planning for the stochastic knapsack problem
... a knapsack size that converges (in a suit- able way) to infinity, rendering all items ...The stochastic knapsack problem is also a generalization of the the pure exploration combinatorial ...
9
A Heuristic for Solving a Stochastic Knapsack Problem with Discrete Random Capacity
... A heuristic method for a stochastic knapsack problem with discrete random capacity has been developed and compared with a general purpose method. The results indicated that the pr[r] ...
Efficient algorithms with performance guarantees for the stochastic multiple-choice knapsack problem
... existing stochastic knapsack algorithms, that are designed for different settings, are not suitable for effi- ciently handling the multiple-choice constraint, and thus, they will not provide good ...
7
Stochastic Simultaneous Optimistic Optimization
... Our definition of loss is very related to the simple regret in multi-armed bandits ( Bubeck et al. , 2009 ). Many algorithms have been developed for this general opti- mization problem. However, a lot of them ...
10
Resource capacity allocation to stochastic dynamic competitors:knapsack problem for perishable items and index-knapsack heuristic
... to stochastic dynamic problems is often in- tractable due to the curse of ...allocation problem, where several stochas- tically and dynamically evolving competitors demand part of the ...given ...
25
Improved Approximation Results for Stochastic Knapsack Problems
... the knapsack. The stochastic knapsack problem is a natural generalization of the classical knapsack problem, and arises in many applications, including bandwidth allocation, ...
21
Application of Neural Network for the Knapsack Problem
... These derivatives are used to make adjustments to the weights, and one of the simplest such technique is gradient descent. 2.2.5 Stochastic gradient descending Parameter optimization is done by slightly modifying ...
54
A decision support system for the stochastic aggregate planning problem
... but experience with the dataset in this study learns us that when near optimal solutions are more than satisfactory, computation time is just a fraction of the total time that is required to find the best solution. ...
45
The Minmax Multidimensional Knapsack Problem with Application to a Chance Constrained Problem
... new knapsack-related combina- torial problem termed minmax multidimensional knapsack problem (MKP) that is motivated by a military logistics ...logistics problem is to determine an ...
11
Abstract The 0/1 Multiple Knapsack Problem is an
... This suggestion is adopted in this paper to deal with the benchmark problem. For selection phase of genetic algorithms, several methods are used in literature such as roulette wheel, stochastic universal ...
6
A robust approach to the chance-constrained knapsack problem
... analysis, stochastic optimization and robust ...contrast, stochastic and robust optimization aim at providing a solution adapted to the uncertain framework ...
12
The multi-handler knapsack problem under uncertainty
... The increasing competition due to both globalization of production processes and the movement of large quan- tities of freight between continents and countries creates the need for new tools for strategic and tactical ...
14
Lecture 13: The Knapsack Problem
... the problem into smaller problems, and find a relation between the structure of the optimal solution of the original problem and the solutions of the smaller ...
17
Substantiation of a heuristic algorithm in the knapsack problem
... Formed knapsack problem in terms of set functions and is a heuristic ...the knapsack problem. Vector optimization: With the knapsack problem is tied vector optimization of ...
6
A complementary heuristic for the unbounded knapsack problem
... optimal subset of items are called Single Knapsack Problems.. The 0-1.[r] ...
124
Exact solution of the robust knapsack problem
... nominal problem A different approach for a special class of ILPs was presented again by Bertsimas and Sim [3] who considered optimization problems in which all variables are binary and only the coef ficients in the ...
7
Knapsack problem with objective value gaps
... assignment problem is NP-complete in the ordinary sense, and Karzanov [6] developed polynomial time algorithm for the case of assignment costs limited to 0 and ...assignment problem in unary encoding is an ...
12
A Hybrid Algorithm for the Unbounded Knapsack Problem
... 35042 Rennes Cedex, France Abstract This paper presents a new approach for exactly solving the Unbounded Knapsack Prob- lem (UKP) and proposes a new bound that was proved to dominate the previous bounds on a ...
25
The 0 -1 multiple knapsack problem
... used this technique with multipliers by heuristic adjustment methods to obtain the lower bounds in the branch and bound procedure. Guignard and Rusenwein [23] proposed a new algorithm which is Known as a branch and ...
142
Knapsack Problem. March 31, CTU in Prague. Z. Hanzálek (CTU) Knapsack Problem March 31, / 15
... Due to the optimal substructure property of the problem, the optimal solution may be found by the recurrent formula using Bellman’s Principle of Optimality. The problem has overlapping subproblems. State ...
15