The knapsack problem with forfeits

DOI10.1007/978-3-030-53262-8_22MaRDI QIDQ2225068zbMATH OpenOpenAlexFDO

Authors Raffaele Cerulli, Ciriaco D'Ambrosio, Gaetano Vitale, Andrea Raiconi

Publication date 4 February 2021

Full work available at URL https://doi.org/10.1007/978-3-030-53262-8_22

zbMATH Keywords

carousel greedyconflictsforfeitsknapsack problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• The knapsack problem with forfeit sets
• scientific article; zbMATH DE number 1302173
• scientific article; zbMATH DE number 4005976
• The unbounded knapsack problem
• Knapsack problems with setups
• scientific article; zbMATH DE number 3847214
• The knapsack problem with a minimum filling constraint

Cited in

(7)

• An optimization algorithm for a penalized knapsack problem
• The knapsack problem with forfeit sets
• Adaptive feasible and infeasible evolutionary search for the knapsack problem with forfeits
• Identifying knapsack problems with conflicts that are difficult to solve optimally using general-purpose integer programming software
• Fixed set search matheuristic applied to the knapsack problem with forfeits
• Hybridizing carousel greedy and kernel search: a new approach for the maximum flow problem with conflict constraints
• Bi-objective knapsack problem with conflicts

This page was built for publication: The knapsack problem with forfeits

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