Pages that link to "Item:Q2496025"
From MaRDI portal
The following pages link to A hybrid Lagrangian genetic algorithm for the prize collecting Steiner tree problem (Q2496025):
Displayed 9 items.
- Decomposition based hybrid metaheuristics (Q319285) (← links)
- A hybridized Lagrangian relaxation and simulated annealing method for the course timetabling problem (Q339653) (← links)
- A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs (Q1025987) (← links)
- Algorithmic expedients for the prize collecting Steiner tree problem (Q1952504) (← links)
- Exact approaches for solving robust prize-collecting Steiner tree problems (Q2355891) (← links)
- The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches (Q2427392) (← links)
- Strength of Three MIP Formulations for the Prize Collecting Steiner Tree Problem with a Quota Constraint (Q2883603) (← links)
- Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization (Q2950518) (← links)
- Stabilizing branch‐and‐price for constrained tree problems (Q5326785) (← links)