The following pages link to Mario Ruthmair (Q342035):
Displaying 13 items.
- Load-dependent and precedence-based models for pickup and delivery problems (Q342036) (← links)
- Layered graph approaches for combinatorial optimization problems (Q1628112) (← links)
- Least cost influence propagation in (social) networks (Q1650779) (← links)
- Bi-objective orienteering for personal activity scheduling (Q1652268) (← links)
- Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem (Q1683126) (← links)
- Large-scale influence maximization via maximal covering location (Q2028806) (← links)
- Corrigendum to: ``Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem'' (Q2184081) (← links)
- A Layered Graph Model and an Adaptive Layers Framework to Solve Delay-Constrained Minimum Tree Problems (Q3009777) (← links)
- Stabilized Branch-and-Price for the Rooted Delay-Constrained Steiner Tree Problem (Q3091493) (← links)
- On Solving the Rooted Delay- and Delay-Variation-Constrained Steiner Tree Problem (Q3167627) (← links)
- Combining and projecting flow models for the (precedence constrained) asymmetric traveling salesman problem (Q4584873) (← links)
- Exact Approaches for Network Design Problems with Relays (Q5137444) (← links)
- Stabilizing branch‐and‐price for constrained tree problems (Q5326785) (← links)