Pages that link to "Item:Q1330903"
From MaRDI portal
The following pages link to The Steiner tree problem. II: Properties and classes of facets (Q1330903):
Displayed 10 items.
- Intermediate integer programming representations using value disjunctions (Q951104) (← links)
- Facets of two Steiner arborescence polyhedra (Q1181904) (← links)
- The Steiner tree polytope and related polyhedra (Q1322552) (← links)
- On survivable network polyhedra (Q1772416) (← links)
- Generalized network design problems. (Q1810478) (← links)
- A note on the generalized Steiner tree polytope (Q1962028) (← links)
- Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints (Q5191136) (← links)
- Discrete relaxations of combinatorial programs (Q5946814) (← links)
- Steiner trees and polyhedra (Q5946818) (← links)
- A comparison of Steiner tree relaxations (Q5946825) (← links)