Hybrid approaches for the two-scenario max-min knapsack problem
From MaRDI portal
Publication:2914199
DOI10.1111/j.1475-3995.2011.00836.xzbMath1251.90320OpenAlexW2025706613MaRDI QIDQ2914199
Raïd Mansi, Christophe Wilbaut, Arnaud Fréville, Saïd Hanafi
Publication date: 25 September 2012
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/j.1475-3995.2011.00836.x
Mixed integer programming (90C11) Minimax problems in mathematical programming (90C47) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (2)
Knapsack problems -- an overview of recent advances. I: Single knapsack problems ⋮ Solving the multiscenario max-MIN knapsack problem exactly with column generation and branch-and-bound
Uses Software
Cites Work
- Unnamed Item
- Improved convergent heuristics for the 0-1 multidimensional knapsack problem
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects
- Hybrid algorithms for the multiple-choice multi-dimensional knapsack problem
- A multi-level search strategy for the 0-1 multidimensional knapsack problem
- A cooperative local search-based algorithm for the multiple-scenario max-min knapsack problem
- Robustness in operational research and decision aiding: a multi-faceted issue
- Dynamic programming algorithms for the zero-one knapsack problem
- Zero-one programming with many variables and few constraints
- A note on the max-min 0-1 knapsack problem
- An exact search for the solution of the surrogate dual of the 0-1 bidimensional knapsack problem
- The 0-1 bidimensional knapsack problem: Toward an efficient high-level primitive tool
- A minimal algorithm for the multiple-choice knapsack problem
- An expanding-core algorithm for the exact \(0-1\) knapsack problem
- Local branching
- The multidimensional 0-1 knapsack problem: an overview.
- Reduced costs propagation in an efficient implicit enumeration for the 01 multidimensional knapsack problem
- Heuristic and exact algorithms for the max-min optimization of the multi-scenario knapsack problem
- A survey of effective heuristics and their application to a variety of knapsack problems
- A virtual pegging approach to the max–min optimization of the bi-criteria knapsack problem
- An Algorithm for Large Zero-One Knapsack Problems
- Calculating surrogate constraints
- Surrogate Constraint Duality in Mathematical Programming
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- Parametric Solution for Linear Bicriteria Knapsack Models
- On the Max-Min 0-1 Knapsack Problem with Robust Optimization Applications
- The Theory and Computation of Knapsack Functions
- The Traveling-Salesman Problem and Minimum Spanning Trees
This page was built for publication: Hybrid approaches for the two-scenario max-min knapsack problem
