Exact and heuristic solution approaches for the mixed integer setup knapsack problem

DOI10.1016/j.ejor.2007.07.003zbMath1162.90018OpenAlexW2008507270MaRDI QIDQ928018

Kurt M. Bretthauer, Nezih Altay, Powell E. jun. Robinson

Publication date: 11 June 2008

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://works.bepress.com/cgi/viewcontent.cgi?article=1015&context=nezih_altay

zbMATH Keywords

integer programmingknapsackBenders decompositioncross decomposition

Mathematics Subject Classification ID

Mixed integer programming (90C11) Multi-objective and goal programming (90C29) Combinatorial optimization (90C27)

Related Items (6)

Knapsack problems -- an overview of recent advances. I: Single knapsack problems ⋮ Generalized quadratic multiple knapsack problem and two solution approaches ⋮ An exact approach for the 0-1 knapsack problem with setups ⋮ A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem ⋮ Exact approaches for the knapsack problem with setups ⋮ The impact of distribution system characteristics on computational tractability

Uses Software

• CPLEX

Cites Work

• On the convergence of cross decomposition
• Partitioning procedures for solving mixed-variables programming problems
• Solving makespan minimization problems with Lagrangean decomposition
• Approximate and exact algorithms for the fixed-charge knapsack problem
• A Cross Decomposition Algorithm for Capacitated Facility Location
• Pivot and Complement–A Heuristic for 0-1 Programming
• An Algorithm for Large Zero-One Knapsack Problems
• Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
• Multicommodity Distribution System Design by Benders Decomposition
• A Modified Benders' Partitioning Algorithm for Mixed Integer Programming
• Exact Algorithms For The Setup Knapsack Problem
• Cross decomposition for mixed integer programming
• Discrete-Variable Extremum Problems
• A Bibliographical Survey On Some Well-Known Non-Standard Knapsack Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Exact and heuristic solution approaches for the mixed integer setup knapsack problem