Solving the multiscenario max-MIN knapsack problem exactly with column generation and branch-and-bound

DOI10.1155/2015/439609zbMath1394.90492OpenAlexW2040319092WikidataQ59118599 ScholiaQ59118599MaRDI QIDQ1665694

Telmo Pinto, Cláudio Alves, Raïd Mansi, José M. Valério de Carvalho

Publication date: 27 August 2018

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2015/439609

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (2)

Knapsack problems -- an overview of recent advances. I: Single knapsack problems ⋮ Optimization of energy distribution in solar panel array configurations by graphs and Minkowski's paths

Cites Work

• Unnamed Item
• Unnamed Item
• Approximation of min-max and min-max regret versions of some combinatorial optimization problems
• A cooperative local search-based algorithm for the multiple-scenario max-min knapsack problem
• A note on the max-min 0-1 knapsack problem
• An incomplete \(m\)-exchange algorithm for solving the large-scale multi-scenario knapsack problem
• Approximating the min-max (regret) selecting items problem
• Heuristic and exact algorithms for the max-min optimization of the multi-scenario knapsack problem
• Hybrid approaches for the two-scenario max-min knapsack problem
• A virtual pegging approach to the max–min optimization of the bi-criteria knapsack problem
• On the Max-Min 0-1 Knapsack Problem with Robust Optimization Applications
• Budgeting with bounded multiple-choice constraints.

This page was built for publication: Solving the multiscenario max-MIN knapsack problem exactly with column generation and branch-and-bound