The Knapsack Problem with Conflict Graphs
From MaRDI portal
Recommendations
- Solutions for the knapsack problem with conflict and forcing graphs of bounded clique-width
- Approximation of knapsack problems with conflict and forcing graphs
- A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph
- Optimization algorithms for the disjunctively constrained knapsack problem
- A fast algorithm for knapsack problem with conflict graph
Cited in
(66)- Approximability of the Subset Sum Reconfiguration Problem
- A graph theoretic approach to solve special knapsack problems in polynomial time
- Parameterized complexity of conflict-free matchings and paths
- Approximation of knapsack problems with conflict and forcing graphs
- Identifying knapsack problems with conflicts that are difficult to solve optimally using general-purpose integer programming software
- A modified descent method-based heuristic for binary quadratic knapsack problems with conflict graphs
- Minimum spanning tree with conflicting edge pairs: a branch-and-cut approach
- Solutions for the knapsack problem with conflict and forcing graphs of bounded clique-width
- Exact solution algorithms for the maximum flow problem with additional conflict constraints
- Solving the set covering problem with conflicts on sets: a new parallel GRASP
- A new class of hard problem instances for the 0-1 knapsack problem
- A Lagrangian approach for the minimum spanning tree problem with conflicting edge pairs
- Hybridizing carousel greedy and kernel search: a new approach for the maximum flow problem with conflict constraints
- A fast and effective breakpoints heuristic algorithm for the quadratic knapsack problem
- On the exact separation of cover inequalities of maximum-depth
- Counting and enumerating independent sets with applications to combinatorial optimization problems
- A fast large neighborhood search for disjunctively constrained knapsack problems
- Trees in graphs with conflict edges or forbidden transitions
- Dual inequalities for stabilized column generation revisited
- A branch-and-bound algorithm for the minimum cost bipartite perfect matching problem with conflict pair constraints
- Fair Packing of Independent Sets
- An exact algorithm for parallel machine scheduling with conflicts
- Scheduling jobs with normally distributed processing times on parallel machines
- The maximum flow problem with disjunctive constraints
- A fast algorithm for knapsack problem with conflict graph
- Features for the 0-1 knapsack problem based on inclusionwise maximal solutions
- On conflict-free cuts: algorithms and complexity
- The knapsack problem with special neighbor constraints on directed co-graphs
- Relaxations and cutting planes for linear programs with complementarity constraints
- On conflict-free spanning tree: mapping tractable and hard instances through the lenses of graph classes
- Quadratic bottleneck knapsack problems
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems
- Set covering problem with conflict constraints
- Minimum cost flow problem with conflicts
- Interdicting facilities in tree networks
- Fair allocation algorithms for indivisible items under structured conflict constraints
- The knapsack problem with neighbour constraints
- On the maximum acyclic subgraph problem under disjunctive constraints
- A threshold search based memetic algorithm for the disjunctively constrained knapsack problem
- A stand-alone branch-and-price algorithm for identical parallel machine scheduling with conflicts
- Optimization algorithms for the disjunctively constrained knapsack problem
- The knapsack problem with special neighbor constraints
- A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts
- Assignment problem with conflicts
- Approximability of the subset sum reconfiguration problem
- Approximation of the quadratic knapsack problem
- Parameterized complexity of conflict-free matchings and paths
- Tight bounds for budgeted maximum weight independent set in bipartite and perfect graphs
- Approximating Bin Packing with Conflict Graphs via Maximization Techniques
- Knapsack with vertex cover, set cover, and hitting set
- On the polynomial kernelizations of finding a shortest path with positive disjunctive constraints
- Paths, trees and matchings under disjunctive constraints
- On conflict-free spanning tree: algorithms and complexity
- A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph
- Exact algorithms for the bin packing problem with fragile objects
- The knapsack problem with forfeit sets
- Fair allocation of indivisible items with conflict graphs
- Matheuristic fixed set search applied to the multidimensional knapsack problem and the knapsack problem with forfeit sets
- A branch and cut algorithm for minimum spanning trees under conflict constraints
- Responsive strategic oscillation for solving the disjunctively constrained knapsack problem
- Probabilistic Tabu search with multiple neighborhoods for the Disjunctively Constrained Knapsack Problem
- Branch-and-cut for linear programs with overlapping SOS1 constraints
- A unified matheuristic for solving multi-constrained traveling salesman problems with profits
- Approximation algorithms for drone delivery scheduling with a fixed number of drones
- Coordinating monetary contributions in participatory budgeting
- Knapsack: connectedness, path, and shortest-path
This page was built for publication: The Knapsack Problem with Conflict Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3184613)
