Pages that link to "Item:Q643009"
From MaRDI portal
The following pages link to Paths, trees and matchings under disjunctive constraints (Q643009):
Displayed 14 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)
- 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)
- Approximation of knapsack problems with conflict and forcing graphs (Q2012887) (← 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)
- Trees in Graphs with Conflict Edges or Forbidden Transitions (Q4922140) (← links)