Pages that link to "Item:Q643009"
From MaRDI portal
The following pages link to Paths, trees and matchings under disjunctive constraints (Q643009):
Displayed 40 items.
- The maximum flow problem with disjunctive constraints (Q358660) (← links)
- On the maximum acyclic subgraph problem under disjunctive constraints (Q477599) (← links)
- Completion of partial Latin hypercube designs: NP-completeness and inapproximability (Q683750) (← links)
- Minimum spanning tree with conflicting edge pairs: a branch-and-cut approach (Q829168) (← links)
- The transportation problem with conflicts (Q829180) (← links)
- The quadratic minimum spanning tree problem and its variations (Q1662110) (← links)
- A characterization of linearizable instances of the quadratic minimum spanning tree problem (Q1702825) (← links)
- A branch-and-bound algorithm for the minimum cost bipartite perfect matching problem with conflict pair constraints (Q1742190) (← links)
- Budgeted colored matching problems (Q1742233) (← links)
- Fixed cardinality stable sets (Q1983123) (← links)
- Maximum weighted matching with few edge crossings for 2-layered bipartite graph (Q2004074) (← 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 unifying model for locally constrained spanning tree problems (Q2045044) (← links)
- The unsuitable neighbourhood inequalities for the fixed cardinality stable set polytope (Q2056893) (← links)
- Matching-based capture strategies for 3D heterogeneous multiplayer reach-avoid differential games (Q2125490) (← links)
- The generalized dependency constrained spanning tree problem (Q2132411) (← links)
- A matheuristic for a customer assignment problem in direct marketing (Q2171614) (← links)
- Parameterized complexity of conflict-free matchings and paths (Q2182094) (← links)
- A branch and cut algorithm for minimum spanning trees under conflict constraints (Q2257077) (← links)
- Assignment problem with conflicts (Q2273673) (← links)
- The quadratic balanced optimization problem (Q2339810) (← links)
- Optimal base complexes for quadrilateral meshes (Q2357692) (← links)
- Minimum cost noncrossing flow problem on layered networks (Q2414449) (← links)
- The rainbow Steiner tree problem (Q2669791) (← links)
- Fair allocation of indivisible items with conflict graphs (Q2701390) (← links)
- Trees in Graphs with Conflict Edges or Forbidden Transitions (Q4922140) (← 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)
- Fair allocation algorithms for indivisible items under structured conflict constraints (Q6056608) (← links)
- Minimum cost flow problem with conflicts (Q6065835) (← links)
- Two dependency constrained spanning tree problems (Q6067892) (← links)
- A Lagrangian approach for the minimum spanning tree problem with conflicting edge pairs (Q6087142) (← links)
- On conflict-free spanning tree: algorithms and complexity (Q6102267) (← links)
- The knapsack problem with forfeit sets (Q6109304) (← links)
- Polyhedral results and stronger Lagrangean bounds for stable spanning trees (Q6110626) (← links)
- Maximum weight perfect matching problem with additional disjunctive conflict constraints (Q6179693) (← links)