Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem
From MaRDI portal
Publication:875412
Recommendations
- An algorithm for the disjunctively constrained knapsack problem
- A reactive local search-based algorithm for the disjunctively constrained knapsack problem
- A fast large neighborhood search for disjunctively constrained knapsack problems
- A threshold search based memetic algorithm for the disjunctively constrained knapsack problem
- Optimization algorithms for the disjunctively constrained knapsack problem
Cites work
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 3470175 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- A reactive local search-based algorithm for the disjunctively constrained knapsack problem
- An Algorithm for Large Zero-One Knapsack Problems
- An algorithm for the solution of the 0-1 knapsack problem
- Discrete-variable extremum problems
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- Multistage Cutting Stock Problems of Two and More Dimensions
- The Theory and Computation of Knapsack Functions
- Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem
Cited in
(26)- Branch-and-price and beam search algorithms for the variable cost and size bin packing problem with optional items
- A threshold search based memetic algorithm for the disjunctively constrained knapsack problem
- Probabilistic Tabu search with multiple neighborhoods for the Disjunctively Constrained Knapsack Problem
- A modified descent method-based heuristic for binary quadratic knapsack problems with conflict graphs
- Knapsack: connectedness, path, and shortest-path
- A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph
- A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts
- Knapsack constraint reformulation: A new approach that significantly reduces the number of sub-problems in the branch and bound algorithm
- Relaxations and cutting planes for linear programs with complementarity constraints
- A reactive local search-based algorithm for the disjunctively constrained knapsack problem
- Dual inequalities for stabilized column generation revisited
- Min-Sup-Min Robust Combinatorial Optimization with Few Recourse Solutions
- A fast algorithm for knapsack problem with conflict graph
- Exact solution algorithms for the maximum flow problem with additional conflict constraints
- Responsive strategic oscillation for solving the disjunctively constrained knapsack problem
- A fast large neighborhood search for disjunctively constrained knapsack problems
- Branch-and-cut for linear programs with overlapping SOS1 constraints
- Optimization algorithms for the disjunctively constrained knapsack problem
- Exact and approximate algorithms for discounted \(\{0\text{-}1\}\) knapsack problem
- Procedures for the bin packing problem with precedence constraints
- Cost based filtering for the constrained knapsack problem
- An algorithm for the disjunctively constrained knapsack problem
- Solving the set covering problem with conflicts on sets: a new parallel GRASP
- Column basis reduction and decomposable knapsack problems
- Dynamic programming based algorithms for the discounted \(\{0-1\}\) knapsack problem
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems
This page was built for publication: Reduction strategies and exact algorithms 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 Q875412)
