Pages that link to "Item:Q3184613"

The following pages link to The Knapsack Problem with Conflict Graphs (Q3184613):

Displaying 47 items.

• The maximum flow problem with disjunctive constraints (Q358660) (← links)
• On the maximum acyclic subgraph problem under disjunctive constraints (Q477599) (← links)
• Approximability of the subset sum reconfiguration problem (Q489711) (← links)
• Paths, trees and matchings under disjunctive constraints (Q643009) (← links)
• Counting and enumerating independent sets with applications to combinatorial optimization problems (Q784784) (← links)
• Minimum spanning tree with conflicting edge pairs: a branch-and-cut approach (Q829168) (← links)
• A modified descent method-based heuristic for binary quadratic knapsack problems with conflict graphs (Q829173) (← links)
• Branch-and-cut for linear programs with overlapping SOS1 constraints (Q1646682) (← links)
• Exact algorithms for the bin packing problem with fragile objects (Q1662100) (← links)
• A unified matheuristic for solving multi-constrained traveling salesman problems with profits (Q1707083) (← links)
• A branch-and-bound algorithm for the minimum cost bipartite perfect matching problem with conflict pair constraints (Q1742190) (← links)
• Optimization algorithms for the disjunctively constrained knapsack problem (Q1797814) (← links)
• Approximation of knapsack problems with conflict and forcing graphs (Q2012887) (← links)
• Exact solution algorithms for the maximum flow problem with additional conflict constraints (Q2023909) (← links)
• A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts (Q2029024) (← links)
• On the exact separation of cover inequalities of maximum-depth (Q2115307) (← links)
• Interdicting facilities in tree networks (Q2121611) (← links)
• A new class of hard problem instances for the 0-1 knapsack problem (Q2140267) (← links)
• Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)
• Set covering problem with conflict constraints (Q2147026) (← links)
• Parameterized complexity of conflict-free matchings and paths (Q2182094) (← links)
• Scheduling jobs with normally distributed processing times on parallel machines (Q2242242) (← links)
• A branch and cut algorithm for minimum spanning trees under conflict constraints (Q2257077) (← links)
• Assignment problem with conflicts (Q2273673) (← links)
• Solutions for the knapsack problem with conflict and forcing graphs of bounded clique-width (Q2311126) (← links)
• Quadratic bottleneck knapsack problems (Q2359152) (← links)
• An exact algorithm for parallel machine scheduling with conflicts (Q2400043) (← links)
• A threshold search based memetic algorithm for the disjunctively constrained knapsack problem (Q2669554) (← links)
• A stand-alone branch-and-price algorithm for identical parallel machine scheduling with conflicts (Q2669559) (← links)
• Fair allocation of indivisible items with conflict graphs (Q2701390) (← links)
• Dual Inequalities for Stabilized Column Generation Revisited (Q2806874) (← links)
• Approximability of the Subset Sum Reconfiguration Problem (Q3010386) (← links)
• Approximation of the Quadratic Knapsack Problem (Q3186661) (← links)
• A Fast Large Neighborhood Search for Disjunctively Constrained Knapsack Problems (Q3195349) (← links)
• A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph (Q4599315) (← links)
• Probabilistic Tabu search with multiple neighborhoods for the Disjunctively Constrained Knapsack Problem (Q4603929) (← links)
• Trees in Graphs with Conflict Edges or Forbidden Transitions (Q4922140) (← links)
• A Fast Algorithm for Knapsack Problem with Conflict Graph (Q5024916) (← links)
• Fair Packing of Independent Sets (Q5041187) (← links)
• (Q5092396) (← links)
• Fair allocation algorithms for indivisible items under structured conflict constraints (Q6056608) (← links)
• Minimum cost flow problem with conflicts (Q6065835) (← links)
• A Lagrangian approach for the minimum spanning tree problem with conflicting edge pairs (Q6087142) (← links)
• The knapsack problem with forfeit sets (Q6109304) (← links)
• Responsive strategic oscillation for solving the disjunctively constrained knapsack problem (Q6112824) (← links)
• Approximation algorithms for drone delivery scheduling with a fixed number of drones (Q6122609) (← links)
• Features for the 0-1 knapsack problem based on inclusionwise maximal solutions (Q6168585) (← links)