Pages that link to "Item:Q4620424"
From MaRDI portal
The following pages link to Combining NP-Hard Reduction Techniques and Strong Heuristics in an Exact Algorithm for the Maximum-Weight Connected Subgraph Problem (Q4620424):
Displaying 9 items.
- Mixed-integer programming techniques for the connected max-\(k\)-cut problem (Q2246187) (← links)
- New formulations and branch-and-cut procedures for the longest induced path problem (Q2669795) (← links)
- Imposing Contiguity Constraints in Political Districting Models (Q5080650) (← links)
- On the Exact Solution of Prize-Collecting Steiner Tree Problems (Q5085996) (← links)
- Optimal connected subgraphs: Integer programming formulations and polyhedra (Q6064164) (← links)
- Maximum weighted induced forests and trees: new formulations and a computational comparative review (Q6071056) (← links)
- Solving Steiner trees: Recent advances, challenges, and perspectives (Q6087073) (← links)
- New formulations for two location problems with interconnected facilities (Q6128897) (← links)
- Vertex covering with capacitated trees (Q6179715) (← links)