Pages that link to "Item:Q2012887"
From MaRDI portal
The following pages link to Approximation of knapsack problems with conflict and forcing graphs (Q2012887):
Displayed 19 items.
- Counting and enumerating independent sets with applications to combinatorial optimization problems (Q784784) (← links)
- The knapsack problem with special neighbor constraints (Q2123119) (← links)
- Matching-based capture strategies for 3D heterogeneous multiplayer reach-avoid differential games (Q2125490) (← links)
- Approximations for restrictions of the budgeted and generalized maximum coverage problems (Q2132403) (← links)
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)
- Parameterized complexity of conflict-free matchings and paths (Q2182094) (← links)
- Solutions for the knapsack problem with conflict and forcing graphs of bounded clique-width (Q2311126) (← links)
- A threshold search based memetic algorithm for the disjunctively constrained knapsack problem (Q2669554) (← links)
- Fair allocation of indivisible items with conflict graphs (Q2701390) (← links)
- Exploring the Kernelization Borders for Hitting Cycles (Q5009476) (← links)
- Fair Packing of Independent Sets (Q5041187) (← links)
- (Q5092396) (← links)
- Parameterized complexity of conflict-free set cover (Q5918356) (← links)
- Conflict free version of covering problems on graphs: classical and parameterized (Q5918906) (← links)
- Combining decomposition approaches for the maximum weight stable set problem (Q6040632) (← links)
- Fair allocation algorithms for indivisible items under structured conflict constraints (Q6056608) (← links)
- Pseudo-polynomial algorithms for solving the knapsack problem with dependencies between items (Q6106591) (← links)
- The knapsack problem with forfeit sets (Q6109304) (← links)
- Responsive strategic oscillation for solving the disjunctively constrained knapsack problem (Q6112824) (← links)