STOCHASTIC KNAPSACK PROBLEM: APPLICATION TO TRANSPORTATION PROBLEMS
ABSTRACT In this paper, we study the stochastic knapsack problem with expectation constraint. We solve the relaxed version of this problem using a stochastic gradient algorithm in order to provide upper bounds for a branch-and-bound framework. Two approaches to estimate the needed gradients are stud...
Main Authors: | Stefanie Kosuch, Marc Letournel, Abdel Lisser |
---|---|
Format: | Article |
Language: | English |
Published: |
Sociedade Brasileira de Pesquisa Operacional
|
Series: | Pesquisa Operacional |
Subjects: | |
Online Access: | http://www.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382017000300597&lng=en&tlng=en |
Similar Items
-
DESIGN AND EXAMINATION OF ALGORITHMS FOR SOLVING THE KNAPSACK PROBLEM
by: S. Kantsedal, et al.
Published: (2015-07-01) -
Improvement of the branch and bound algorithm for solving the knapsack linear integer problem
by: Elias Munapo
Published: (2020-04-01) -
Knapsack constraint reformulation: A new approach that significantly reduces the number of sub-problems in the branch and bound algorithm
by: Elias Munapo, et al.
Published: (2016-12-01) -
A Novel Core-Based Optimization Framework for Binary Integer Programs- the Multidemand Multidimesional Knapsack Problem as a Test Problem
by: Sameh Al-Shihabi
Published: (2021-01-01) -
Multi-objective stochastic transportation problem involving three-parameter extreme value distribution
by: Acharya Mitali Madhumita, et al.
Published: (2019-01-01)