Column generation strategies and decomposition approaches for the two-stage stochastic multiple knapsack problem
From MaRDI portal
Publication:1652300
DOI10.1016/j.cor.2017.02.009zbMath1458.90564OpenAlexW2588825640MaRDI QIDQ1652300
J. M. van den Akker, Hoogeveen, J. A., Denise D. Tönissen
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: http://dspace.library.uu.nl/handle/1874/371431
column generationbranch-and-pricetwo-stage stochastic programmingrecoverable robustnessmultiple knapsack problem
Related Items (3)
Decomposition approaches for recoverable robust optimization problems ⋮ Using 3D-printing in disaster response: the two-stage stochastic 3D-printing knapsack problem ⋮ Optimal selection of touristic packages based on user preferences during sports mega-events
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An adaptive stochastic knapsack problem
- Decomposition approaches for recoverable robust optimization problems
- A branch-and-bound algorithm for hard multiple knapsack problems
- Knapsack problem with probability constraints
- On two-stage stochastic knapsack problems
- Recoverable robust knapsacks: the discrete scenario case
- Upper bounds for the 0-1 stochastic knapsack problem and a B\&B algorithm
- The complexity of the 0/1 multi-knapsack problem
- An exact algorithm for large multiple knapsack problems
- Solution of the zero-one multiple knapsack problem
- A bound and bound algorithm for the zero-one multiple knapsack problem
- Where are the hard knapsack problems?
- Approximability of the two-stage stochastic knapsack problem with discretely distributed weights
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- Recoverable Robustness for Railway Rolling Stock Planning
- Recoverable Robust Knapsacks: Γ-Scenarios
- Recoverable Robustness by Column Generation
- Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity
- The Dynamic and Stochastic Knapsack Problem with Random Sized Items
- The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications
- Recoverable Robustness in Shunting and Timetabling
- An algorithm for maximizing target achievement in the stochastic knapsack problem with normal returns
- Allocating Bandwidth for Bursty Connections
This page was built for publication: Column generation strategies and decomposition approaches for the two-stage stochastic multiple knapsack problem
