An incomplete m-exchange algorithm for solving the large-scale multi-scenario knapsack problem

DOI10.1016/J.COR.2011.09.012MaRDI QIDQ1761118zbMATH OpenOpenAlexFDO

Authors X. Song, Rhyd Lewis, J. Thompson, Yue Wu

Publication date 15 November 2012

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2011.09.012

zbMATH Keywords

knapsack problem2-exchangemulti-scenario

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Recommendations

• Heuristic and exact algorithms for the max-min optimization of the multi-scenario knapsack problem
• A cooperative local search-based algorithm for the multiple-scenario max-min knapsack problem
• On the Max-Min 0-1 Knapsack Problem with Robust Optimization Applications
• Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem
• Solving the multiscenario max-MIN knapsack problem exactly with column generation and branch-and-bound

Cites work

• scientific article; zbMATH DE number 4085440 (Why is no real title available?)
• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 862549 (Why is no real title available?)
• A New Algorithm for the 0-1 Knapsack Problem
• A cooperative local search-based algorithm for the multiple-scenario max-min knapsack problem
• A fast algorithm for strongly correlated knapsack problems
• A note on the max-min 0-1 knapsack problem
• An Algorithm for Large Zero-One Knapsack Problems
• An expanding-core algorithm for the exact 0-1 knapsack problem
• Core problems in bi-criteria \(\{0,1\}\)-knapsack problems
• Heuristic and exact algorithms for the max-min optimization of the multi-scenario knapsack problem
• On the Max-Min 0-1 Knapsack Problem with Robust Optimization Applications
• Robust discrete optimization and its applications
• Surrogate Constraint Duality in Mathematical Programming
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Where are the hard knapsack problems?

Cited in

(7)

• A virtual pegging approach to the max–min optimization of the bi-criteria knapsack problem
• Benchmarking problems for robust discrete optimization
• On the Max-Min 0-1 Knapsack Problem with Robust Optimization Applications
• A cooperative local search-based algorithm for the multiple-scenario max-min knapsack problem
• scientific article; zbMATH DE number 5282967 (Why is no real title available?)
• Solving the multiscenario max-MIN knapsack problem exactly with column generation and branch-and-bound
• Heuristic and exact algorithms for the max-min optimization of the multi-scenario knapsack problem

Describes a project that uses

Uses Software

• Knapsack

This page was built for publication: An incomplete \(m\)-exchange algorithm for solving the large-scale multi-scenario knapsack problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1761118)