Pages that link to "Item:Q6068530"
From MaRDI portal
The following pages link to Stronger path‐based extended formulation for the Steiner tree problem (Q6068530):
Displaying 5 items.
- Optimal Steiner trees under node and edge privacy conflicts (Q2156311) (← links)
- Stronger MIP formulations for the Steiner forest problem (Q2227541) (← links)
- Chvátal-Gomory cuts for the Steiner tree problem (Q2659072) (← links)
- Optimal connected subgraphs: Integer programming formulations and polyhedra (Q6064164) (← links)
- Solving Steiner trees: Recent advances, challenges, and perspectives (Q6087073) (← links)