A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph
From MaRDI portal
Recommendations
- A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts
- A fast algorithm for knapsack problem with conflict graph
- The Knapsack Problem with Conflict Graphs
- A branch and bound algorithm for solving the multiple-choice knapsack problem
- Solutions for the knapsack problem with conflict and forcing graphs of bounded clique-width
- A branch-and-bound algorithm for hard multiple knapsack problems
- Approximation of knapsack problems with conflict and forcing graphs
- A branch-and-price algorithm for the bin packing problem with conflicts
- Publication:4204000
- A branch-and-bound algorithm for the quadratic multiple knapsack problem
Cites work
- A branch-and-price algorithm for the bin packing problem with conflicts
- A reactive local search-based algorithm for the disjunctively constrained knapsack problem
- Algorithms for the bin packing problem with conflicts
- An algorithm for the disjunctively constrained knapsack problem
- An exact algorithm for the maximum clique problem
- An exact approach for the vertex coloring problem
- Benchmarking optimization software with performance profiles.
- Heuristics and lower bounds for the bin packing problem with conflicts
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- Local branching
- Maximum-weight stable sets and safe lower bounds for graph coloring
- Reducibility among combinatorial problems
- Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem
- The Knapsack Problem with Conflict Graphs
Cited in
(43)- On the product knapsack problem
- A branch-and-bound algorithm for the minimum cost bipartite perfect matching problem with conflict pair constraints
- Optimization algorithms for the disjunctively constrained knapsack problem
- Approximation of knapsack problems with conflict and forcing graphs
- Exact solution algorithms for the maximum flow problem with additional conflict constraints
- A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts
- On the exact separation of cover inequalities of maximum-depth
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems
- Two-stage three-machine assembly scheduling problem with sum-of-processing-times-based learning effect
- Multiple-choice knapsack constraint in graphical models
- A matheuristic for a customer assignment problem in direct marketing
- Exact algorithms to minimize makespan on single and parallel batch processing machines
- Solutions for the knapsack problem with conflict and forcing graphs of bounded clique-width
- An exact algorithm for parallel machine scheduling with conflicts
- A threshold search based memetic algorithm for the disjunctively constrained knapsack problem
- Cover by disjoint cliques cuts for the knapsack problem with conflicting items
- Optimal selection of touristic packages based on user preferences during sports mega-events
- Dual inequalities for stabilized column generation revisited
- The Knapsack Problem with Conflict Graphs
- A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems
- Probabilistic Tabu search with multiple neighborhoods for the Disjunctively Constrained Knapsack Problem
- A fast algorithm for knapsack problem with conflict graph
- Models and Algorithms for the Bin-Packing Problem with Minimum Color Fragmentation
- Bin Packing Problem with Time Lags
- Hybridizing adaptive large neighborhood search with kernel search: a new solution approach for the nurse routing problem with incompatible services and minimum demand
- Minimum cost flow problem with conflicts
- Pseudo-polynomial algorithms for solving the knapsack problem with dependencies between items
- The knapsack problem with forfeit sets
- Responsive strategic oscillation for solving the disjunctively constrained knapsack problem
- CliSAT: a new exact algorithm for hard maximum clique problems
- Maximum weight perfect matching problem with additional disjunctive conflict constraints
- Knapsack: connectedness, path, and shortest-path
- On conflict-free cuts: algorithms and complexity
- Tight bounds for budgeted maximum weight independent set in bipartite and perfect graphs
- Adaptive feasible and infeasible evolutionary search for the knapsack problem with forfeits
- Identifying knapsack problems with conflicts that are difficult to solve optimally using general-purpose integer programming software
- Fixed set search matheuristic applied to the knapsack problem with forfeits
- Knapsack with vertex cover, set cover, and hitting set
- Algorithms and complexity results for the 0-1 knapsack problem with group fairness
- Bi-objective knapsack problem with conflicts
- Finding conflict-free minimum weight spanning trees using maximal stable sets of the conflict graph
- Conflict-free cuts in planar and 3-degenerate graphs with 1-regular conflicts
- A modified descent method-based heuristic for binary quadratic knapsack problems with conflict graphs
This page was built for publication: A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4599315)
