A reactive local search-based algorithm for the disjunctively constrained knapsack problem

DOI10.1057/PALGRAVE.JORS.2602046MaRDI QIDQ3418859zbMATH OpenOpenAlexFDO

Authors Mhand Hifi, M. Michrafy

Publication date 26 January 2007

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1057/palgrave.jors.2602046

zbMATH Keywords

combinatorial optimizationheuristicsknapsacksreactive local search

Mathematics Subject Classification ID

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

Recommendations

• An algorithm for the disjunctively constrained knapsack problem
• 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
• A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem

Cited in

(18)

• A local search-based method for sphere packing problems
• A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts
• Knapsack problems -- an overview of recent advances. I: Single knapsack problems
• A multi-objective model for environmental investment decision making
• A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem
• An algorithm for the disjunctively constrained knapsack problem
• A threshold search based memetic algorithm for the disjunctively constrained knapsack problem
• A fast large neighborhood search for disjunctively constrained knapsack 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 fast algorithm for knapsack problem with conflict graph
• An adaptive neighborhood search for k-clustering minimum bi-clique completion problems
• Responsive strategic oscillation for solving the disjunctively constrained knapsack problem
• Knapsack: connectedness, path, and shortest-path
• Identifying knapsack problems with conflicts that are difficult to solve optimally using general-purpose integer programming software
• Knapsack with vertex cover, set cover, and hitting set
• A modified descent method-based heuristic for binary quadratic knapsack problems with conflict graphs
• Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem

Describes a project that uses

Uses Software

• CPLEX

This page was built for publication: A reactive local search-based algorithm for the disjunctively constrained knapsack problem

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