Pages that link to "Item:Q829168"
From MaRDI portal
The following pages link to Minimum spanning tree with conflicting edge pairs: a branch-and-cut approach (Q829168):
Displaying 7 items.
- A unifying model for locally constrained spanning tree problems (Q2045044) (← links)
- Minimum cost flow problem with conflicts (Q6065835) (← links)
- Maximum weighted induced forests and trees: new formulations and a computational comparative review (Q6071056) (← links)
- The knapsack problem with forfeit sets (Q6109304) (← links)
- Precedence-constrained arborescences (Q6109804) (← 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)
