A Fast Large Neighborhood Search for Disjunctively Constrained Knapsack Problems

DOI10.1007/978-3-319-09174-7_34zbMath1452.90268OpenAlexW423157844MaRDI QIDQ3195349

Lei Wu, Mhand Hifi, Sagvan Saleh

Publication date: 16 October 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-09174-7_34

zbMATH Keywords

heuristicknapsackneighborhoodre-optimisation

Mathematics Subject Classification ID

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

Related Items (1)

Approximation of knapsack problems with conflict and forcing graphs

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem
• An algorithm for the disjunctively constrained knapsack problem
• Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem
• Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
• The Knapsack Problem with Conflict Graphs
• A reactive local search-based algorithm for the disjunctively constrained knapsack problem

This page was built for publication: A Fast Large Neighborhood Search for Disjunctively Constrained Knapsack Problems