A reactive local search-based algorithm for the disjunctively constrained knapsack problem
From MaRDI portal
Publication:3418859
DOI10.1057/palgrave.jors.2602046zbMath1151.90587OpenAlexW2037140854MaRDI QIDQ3418859
Publication date: 26 January 2007
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/palgrave.jors.2602046
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (13)
A modified descent method-based heuristic for binary quadratic knapsack problems with conflict graphs ⋮ A local search-based method for sphere packing problems ⋮ Knapsack problems -- an overview of recent advances. I: Single knapsack problems ⋮ A multi-objective model for environmental investment decision making ⋮ A Fast Large Neighborhood Search for Disjunctively Constrained Knapsack Problems ⋮ Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem ⋮ A threshold search based memetic algorithm for the disjunctively constrained knapsack problem ⋮ Responsive strategic oscillation for solving the disjunctively constrained knapsack problem ⋮ An Adaptive Neighborhood Search for k-Clustering Minimum Bi-clique Completion Problems ⋮ A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph ⋮ Probabilistic Tabu search with multiple neighborhoods for the Disjunctively Constrained Knapsack Problem ⋮ A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts ⋮ A Fast Algorithm for Knapsack Problem with Conflict Graph
Uses Software
This page was built for publication: A reactive local search-based algorithm for the disjunctively constrained knapsack problem
