Pages that link to "Item:Q2340278"
From MaRDI portal
The following pages link to The two-level diameter constrained spanning tree problem (Q2340278):
Displaying 14 items.
- Load-dependent and precedence-based models for pickup and delivery problems (Q342036) (← links)
- Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem (Q342101) (← links)
- Element perturbation problems of optimum spanning trees with two-parameter objectives (Q674298) (← links)
- The 2-hop spanning tree problem (Q1306467) (← links)
- Layered graph approaches for combinatorial optimization problems (Q1628112) (← links)
- Branch-and-cut methods for the network design problem with vulnerability constraints (Q1652559) (← links)
- Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem (Q1683126) (← links)
- A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints (Q1694297) (← links)
- A polyhedral study of the diameter constrained minimum spanning tree problem (Q2197445) (← links)
- A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees (Q3157034) (← links)
- Optimal Network Design with End-to-End Service Requirements (Q4604906) (← links)
- Network Design with Service Requirements: Scaling-up the Size of Solvable Problems (Q5058001) (← links)
- Distance Transformation for Network Design Problems (Q5231681) (← links)
- Layered graph models for the electric vehicle routing problem with nonlinear charging functions (Q6663970) (← links)
