The following pages link to (Q4260373):
Displaying 22 items.
- The maximum flow problem with disjunctive constraints (Q358660) (← links)
- Approximability of the subset sum reconfiguration problem (Q489711) (← links)
- Paths, trees and matchings under disjunctive constraints (Q643009) (← links)
- Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem (Q653316) (← links)
- Approximation algorithms for time constrained scheduling (Q676776) (← links)
- Scheduling with conflicts: Online and offline algorithms (Q842559) (← links)
- Probabilistic analysis for scheduling with conflicts (Q924143) (← links)
- Partitioning a weighted partial order (Q927191) (← links)
- Treelike comparability graphs (Q1026130) (← links)
- The mutual exclusion scheduling problem for permutation and comparability graphs. (Q1401918) (← links)
- Heuristics and lower bounds for the bin packing problem with conflicts (Q1765544) (← links)
- Solution approaches for storage loading problems with stacking constraints (Q2027013) (← links)
- A unifying model for locally constrained spanning tree problems (Q2045044) (← links)
- Scheduling identical jobs on uniform machines with a conflict graph (Q2273690) (← links)
- Fair allocation of indivisible items with conflict graphs (Q2701390) (← links)
- Approximability of the Subset Sum Reconfiguration Problem (Q3010386) (← links)
- Fair Packing of Independent Sets (Q5041187) (← links)
- An approximation scheme for bin packing with conflicts (Q5054839) (← links)
- Structural parameterizations of budgeted graph coloring (Q5918737) (← links)
- Structural parameterizations of budgeted graph coloring (Q5925707) (← links)
- Fair allocation algorithms for indivisible items under structured conflict constraints (Q6056608) (← links)
- Scheduling on uniform machines with a conflict graph: complexity and resolution (Q6187242) (← links)
