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

DOI10.1016/J.EJOR.2007.07.003MaRDI QIDQ928018zbMATH OpenOpenAlexFDO

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

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

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

Recommendations

• Exact Algorithms For The Setup Knapsack Problem
• Knapsack problems with setups
• Exact approaches for the knapsack problem with setups
• An exact algorithm for the Knapsack problem with setup
• An exact approach for the 0-1 knapsack problem with setups

Cites work

• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 949665 (Why is no real title available?)
• scientific article; zbMATH DE number 2107164 (Why is no real title available?)
• scientific article; zbMATH DE number 895009 (Why is no real title available?)
• A Bibliographical Survey On Some Well-Known Non-Standard Knapsack Problems
• A Cross Decomposition Algorithm for Capacitated Facility Location
• A Modified Benders' Partitioning Algorithm for Mixed Integer Programming
• Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
• An Algorithm for Large Zero-One Knapsack Problems
• Approximate and exact algorithms for the fixed-charge knapsack problem
• Cross decomposition for mixed integer programming
• Discrete-variable extremum problems
• Exact Algorithms For The Setup Knapsack Problem
• Multicommodity Distribution System Design by Benders Decomposition
• On the convergence of cross decomposition
• Partitioning procedures for solving mixed-variables programming problems
• Pivot and Complement–A Heuristic for 0-1 Programming
• Solving makespan minimization problems with Lagrangean decomposition

Cited in

(11)

• The impact of distribution system characteristics on computational tractability
• Exact Algorithms For The Setup Knapsack Problem
• A cross entropy algorithm for the Knapsack problem with setups
• A New Knapsack Solution Approach by Integer Equivalent Aggregation and Consistency Determination
• A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem
• Exact approaches for the knapsack problem with setups
• An exact approach for the 0-1 knapsack problem with setups
• Knapsack problems with setups
• HEURISTIC AND EXACT SOLUTION METHOD FOR CONVEX NONLINEAR KNAPSACK PROBLEM
• Generalized quadratic multiple knapsack problem and two solution approaches
• Knapsack problems -- an overview of recent advances. I: Single knapsack problems

Describes a project that uses

Uses Software

• CPLEX

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

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