Combining local branching and descent method for solving the multiple‐choice knapsack problem with setups

DOI10.1111/itor.13326OpenAlexW4378907098MaRDI QIDQ6060689

Unnamed Author, Mhand Hifi

Publication date: 29 November 2023

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/itor.13326

zbMATH Keywords

optimizationlearningcomputational methodsbranching

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• A dynamic programming algorithm for the knapsack problem with setup
• Knapsack problems with setups
• Local branching
• Exact algorithms for unconstrained three-dimensional cutting problems: A comparative study
• An exact approach for the 0-1 knapsack problem with setups
• Exact approaches for the knapsack problem with setups
• Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls
• A two-stage packing problem procedure
• A local branching heuristic for mixed-integer programs with 2-level variables, with an application to a telecommunication network design problem
• Variable Neighborhood Search
• Sensitivity analysis of the setup knapsack problem to perturbation of arbitrary profits or weights
• Improved dynamic programming and approximation results for the knapsack problem with setups
• Hiding information and signatures in trapdoor knapsacks
• An introduction to the two‐dimensional rectangular cutting and packing problem
• LP relaxation and dynamic programming enhancing VNS for the multiple knapsack problem with setup
• A decomposition approach for multidimensional knapsacks with family‐split penalties

This page was built for publication: Combining local branching and descent method for solving the multiple‐choice knapsack problem with setups