The following pages link to (Q4519136):
Displaying 8 items.
- A tabu search approach for solving a difficult forest harvesting machine location problem (Q863994) (← links)
- Minimax regret spanning arborescences under uncertain costs (Q881514) (← links)
- A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs (Q1025987) (← links)
- A robust and scalable algorithm for the Steiner problem in graphs (Q1646683) (← links)
- The rainbow Steiner tree problem (Q2669791) (← links)
- Multicast routing under quality of service constraints for vehicular ad hoc networks: mathematical formulation and a relax‐and‐fix heuristic (Q6066592) (← links)
- Solving Steiner trees: Recent advances, challenges, and perspectives (Q6087073) (← links)
- Optimizing the Design of a Wind Farm Collection Network (Q6102753) (← links)
