A hybrid metaheuristic for the Knapsack Problem with Forfeits
- 27 October 2021
- journal article
- research article
- Published by Springer Nature in Soft Computing
- Vol. 26 (2) , 749-762
Abstract
No abstract availableKeywords
This publication has 30 references indexed in Scilit:
- A branch and cut algorithm for minimum spanning trees under conflict constraintsOptimization Letters, 2014
- Bin Packing with Conflicts: A Generic Branch-and-Price AlgorithmINFORMS Journal on Computing, 2013
- Trees in Graphs with Conflict Edges or Forbidden Transitions2013
- The minimum spanning tree problem with conflict constraints and its variationsDiscrete Optimization, 2011
- The Maximum Flow Problem with Conflict and Forcing Conditions2011
- Algorithms for the Bin Packing Problem with ConflictsINFORMS Journal on Computing, 2010
- The Knapsack Problem with Conflict GraphsJournal of Graph Algorithms and Applications, 2009
- On Bin Packing with ConflictsSIAM Journal on Optimization, 2008
- An optimization algorithm for a penalized knapsack problemOperations Research Letters, 2006
- Heuristics and lower bounds for the bin packing problem with conflictsComputers & Operations Research, 2004