The knapsack problem with forfeit sets

DOI10.1016/j.cor.2022.106093OpenAlexW4309825491MaRDI QIDQ6109304

Federica Laureana, Andrea Raiconi, Ciriaco D'Ambrosio, Gaetano Vitale

Publication date: 4 July 2023

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2022.106093

zbMATH Keywords

knapsack problemmemetic algorithmhybrid metaheuristicconflictsCarousel Greedyforfeit sets

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Unnamed Item
• Unnamed Item
• The minimum spanning tree problem with conflict constraints and its variations
• Paths, trees and matchings under disjunctive constraints
• Minimum spanning tree with conflicting edge pairs: a branch-and-cut approach
• A modified descent method-based heuristic for binary quadratic knapsack problems with conflict graphs
• An exact algorithm for the fixed-charge multiple knapsack problem
• New exact approaches and approximation results for the penalized knapsack problem
• Carousel greedy: a generalized greedy algorithm with applications in optimization
• Heuristics and lower bounds for the bin packing problem with conflicts
• Optimization algorithms for the disjunctively constrained knapsack problem
• Approximation of knapsack problems with conflict and forcing graphs
• A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts
• Knapsack problems -- an overview of recent advances. I: Single knapsack problems
• Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
• The knapsack problem with forfeits
• A branch and cut algorithm for minimum spanning trees under conflict constraints
• An optimization algorithm for a penalized knapsack problem
• Approximate and exact algorithms for the fixed-charge knapsack problem
• An algorithm for the disjunctively constrained knapsack problem
• Cover by disjoint cliques cuts for the knapsack problem with conflicting items
• Algorithms for the Bin Packing Problem with Conflicts
• The Maximum Flow Problem with Conflict and Forcing Conditions
• The Knapsack Problem with Conflict Graphs
• On Bin Packing with Conflicts
• Determining a Minimum Spanning Tree with Disjunctive Constraints
• A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph
• Introduction to evolutionary computing
• OMEGA one multi ethnic genetic approach

This page was built for publication: The knapsack problem with forfeit sets