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

DOI10.1016/j.cor.2011.09.012zbMath1251.90340OpenAlexW1987669018MaRDI QIDQ1761118

Xiang Song, Jonathan M. Thompson, Yue Wu, Rhyd Lewis

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)

Related Items (1)

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

Uses Software

• Knapsack

Cites Work

• 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
• Robust discrete optimization and its applications
• An expanding-core algorithm for the exact \(0-1\) knapsack problem
• Where are the hard knapsack problems?
• Heuristic and exact algorithms for the max-min optimization of the multi-scenario knapsack problem
• Core problems in bi-criteria \(\{0,1\}\)-knapsack problems
• A New Algorithm for the 0-1 Knapsack Problem
• An Algorithm for Large Zero-One Knapsack Problems
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Surrogate Constraint Duality in Mathematical Programming
• On the Max-Min 0-1 Knapsack Problem with Robust Optimization Applications
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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