An algorithm for the disjunctively constrained knapsack problem

DOI10.1504/IJOR.2012.044026zbMath1362.90370MaRDI QIDQ2627241

Mhand Hifi, Nabil Otmani

Publication date: 31 May 2017

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

zbMATH Keywords

heuristicsknapsack problemoptimisationscatter searchdisjunctive constraints

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (10)

Knapsack problems -- an overview of recent advances. I: Single knapsack problems ⋮ A Fast Large Neighborhood Search for Disjunctively Constrained Knapsack Problems ⋮ An exact algorithm for parallel machine scheduling with conflicts ⋮ A threshold search based memetic algorithm for the disjunctively constrained knapsack problem ⋮ The knapsack problem with forfeit sets ⋮ Responsive strategic oscillation for solving the disjunctively constrained knapsack problem ⋮ A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph ⋮ Approximation of knapsack problems with conflict and forcing graphs ⋮ A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts ⋮ A Fast Algorithm for Knapsack Problem with Conflict Graph

Uses Software

• CPLEX

This page was built for publication: An algorithm for the disjunctively constrained knapsack problem