Probabilistic Tabu search with multiple neighborhoods for the Disjunctively Constrained Knapsack Problem

DOI10.1051/ro/2016049zbMath1387.90227OpenAlexW2481783932MaRDI QIDQ4603929

Hanêne Ben-Abdallah, Saïd Hanafi, Raouia Taktak, Mariem Ben Salem

Publication date: 23 February 2018

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/ro/2016049

zbMATH Keywords

knapsack problemweighted independent setprobabilistic tabu searchconflict graph

Mathematics Subject Classification ID

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

Related Items (4)

Knapsack problems -- an overview of recent advances. I: Single knapsack problems ⋮ A threshold search based memetic algorithm for the disjunctively constrained knapsack problem ⋮ Pseudo-polynomial algorithms for solving the knapsack problem with dependencies between items ⋮ Responsive strategic oscillation for solving the disjunctively constrained knapsack problem

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The multidimensional 0-1 knapsack problem -- bounds and computational aspects
• Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem
• Two-dimensional packing with conflicts
• A multi-level search strategy for the 0-1 multidimensional knapsack problem
• New lower bounds for bin packing problems with conflicts
• The multidimensional 0-1 knapsack problem: an overview.
• An efficient tabu search approach for the 0-1 multidimensional knapsack problem
• The min-conflict packing problem
• Heuristics and lower bounds for the bin packing problem with conflicts
• Future paths for integer programming and links to artificial intelligence
• Diversification strategies in tabu search algorithms for the maximum clique problem
• An approximation scheme for bin packing with conflicts
• A tabu search procedure for multicommodity location/allocation with balancing requirements
• Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem
• The Knapsack Problem with Conflict Graphs
• On Bin Packing with Conflicts
• A reactive local search-based algorithm for the disjunctively constrained knapsack problem
• Tabu Search—Part I
• A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph
• Tabu Thresholding: Improved Search by Nonmonotonic Trajectories
• Discrete-Variable Extremum Problems
• On the convergence of tabu search

This page was built for publication: Probabilistic Tabu search with multiple neighborhoods for the Disjunctively Constrained Knapsack Problem