A threshold search based memetic algorithm for the disjunctively constrained knapsack problem
From MaRDI portal
Publication:2669554
DOI10.1016/J.COR.2021.105447OpenAlexW3185953120MaRDI QIDQ2669554FDOQ2669554
Publication date: 9 March 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2101.04753
Recommendations
- A reactive local search-based algorithm for the disjunctively constrained knapsack problem
- 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
- Probabilistic Tabu search with multiple neighborhoods for the Disjunctively Constrained Knapsack Problem
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Benchmarking optimization software with performance profiles.
- Title not available (Why is that?)
- A threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem.
- A ``reduce and solve approach for the multiple-choice multidimensional knapsack problem
- Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
- Iterated responsive threshold search for the quadratic multiple knapsack problem
- Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem
- Upper bounds for the SPOT 5 daily photograph scheduling problem
- Earth observation satellite management
- Bin packing problem with conflicts and item fragmentation
- A ``logic-constrained knapsack formulation and a tabu algorithm for the daily photograph scheduling of an earth observation satellite
- An approximation scheme for bin packing with conflicts
- The Knapsack Problem with Conflict Graphs
- Relaxations and heuristics for the multiple non-linear separable knapsack problem
- Hashing vectors for tabu search
- A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts
- Approximation of knapsack problems with conflict and forcing graphs
- Solutions for the knapsack problem with conflict and forcing graphs of bounded clique-width
- A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem
- A reactive local search-based algorithm for the disjunctively constrained knapsack problem
- A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph
- A new upper bound for the multiple knapsack problem
- Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem
- An iterated ``hyperplane exploration approach for the quadratic knapsack problem
- Exact approaches for the knapsack problem with setups
- Title not available (Why is that?)
- Optimization algorithms for the disjunctively constrained knapsack problem
- An algorithm for the disjunctively constrained knapsack problem
- Probabilistic Tabu search with multiple neighborhoods for the Disjunctively Constrained Knapsack Problem
Cited In (2)
Uses Software
This page was built for publication: A threshold search based memetic 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 Q2669554)
