Pages that link to "Item:Q2741469"
From MaRDI portal
The following pages link to Generating lower bounds for the prize collecting Steiner problem in graphs (Q2741469):
Displaying 8 items.
- Prize collecting Steiner trees with node degree dependent costs (Q709134) (← links)
- A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs (Q1025987) (← links)
- Strong lower bounds for the prize collecting Steiner problem in graphs (Q1827870) (← links)
- Tight compact models and comparative analysis for the prize collecting Steiner tree problem (Q1941390) (← links)
- A hybrid Lagrangian genetic algorithm for the prize collecting Steiner tree problem (Q2496025) (← links)
- Strength of three MIP formulations for the prize collecting Steiner tree problem with a quota constraint (Q2883603) (← links)
- Prize-collecting steiner network problems (Q2933630) (← links)
- (Q5365098) (← links)