61 results on '"Mario Ruthmair"'
Search Results
2. Arc Routing with Electric Vehicles: Dynamic Charging and Speed-Dependent Energy Consumption.
3. Analysis of Schedules for Rural First and Last Mile Microtransit Services.
4. Large-scale influence maximization via maximal covering location.
5. Exact Methods for the Traveling Salesman Problem with Drone.
6. Strategies for Iteratively Refining Layered Graph Models.
7. Corrigendum to 'Extended Formulations and Branch-and-Cut Algorithms for the Black-and-White Traveling Salesman Problem' [European Journal of Operational Research, 262(3) 2017, 908-928].
8. Layered graph approaches for combinatorial optimization problems.
9. Exact Approaches for Network Design Problems with Relays.
10. Least cost influence propagation in (social) networks.
11. Combining and projecting flow models for the (precedence constrained) asymmetric traveling salesman problem.
12. Extended formulations and branch-and-cut algorithms for the Black-and-White Traveling Salesman Problem.
13. Bi-objective orienteering for personal activity scheduling.
14. A Variable Neighborhood Search Approach for the Interdependent Lock Scheduling Problem.
15. Load-dependent and precedence-based models for pickup and delivery problems.
16. On Solving the Rooted Delay- and Delay-Variation-Constrained Steiner Tree Problem.
17. Applying (Hybrid) Metaheuristics to Fuel Consumption Optimization of Hybrid Electric Vehicles.
18. A Layered Graph Model and an Adaptive Layers Framework to Solve Delay-Constrained Minimum Tree Problems.
19. A Multilevel Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem.
20. A Memetic Algorithm and a Solution Archive for the Rooted Delay-Constrained Minimum Spanning Tree Problem.
21. Stabilized Branch-and-Price for the Rooted Delay-Constrained Steiner Tree Problem.
22. Variable Neighborhood Search and Ant Colony Optimization for the Rooted Delay-Constrained Minimum Spanning Tree Problem.
23. A Kruskal-Based Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem.
24. Solving a Video-Server Load Re-Balancing Problem by Mixed Integer Programming and Hybrid Variable Neighborhood Search.
25. Spanning trees with variable degree bounds.
26. Large-scale influence maximization via maximal covering location
27. Stabilizing branch-and-price for constrained tree problems.
28. Multi-Depot Routing with Split Deliveries: Models and a Branch-and-Cut Algorithm
29. Benders decomposition for competitive influence maximization in (social) networks
30. Layered graph approaches for combinatorial optimization problems
31. Analysis of Schedules for Rural First and Last Mile Microtransit Services
32. Corrigendum to 'Extended Formulations and Branch-and-Cut Algorithms for the Black-and-White Traveling Salesman Problem' [European Journal of Operational Research, 262(3) 2017, 908–928]
33. Least cost influence propagation in (social) networks
34. Bi-objective orienteering for personal activity scheduling
35. Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem
36. Modeling the first train timetabling problem with minimal missed trains and synchronization time differences in subway networks
37. Strategies for Iteratively Refining Layered Graph Models
38. Sensitivity analysis for energy demand estimation of electric vehicles
39. Load-dependent and precedence-based models for pickup and delivery problems
40. Exact approaches for the directed network design problem with relays
41. Combining and projecting flow models for the (Precedence Constrained) Asymmetric Traveling Salesman Problem
42. Computational Logistics : 7th International Conference, ICCL 2016, Lisbon, Portugal, September 7-9, 2016, Proceedings
43. Optimizing charging station locations for urban taxi providers
44. Overview of optimization problems in electric car-sharing system design and management
45. Computational Logistics
46. Stabilizing branch-and-price for constrained tree problems
47. A Variable Neighborhood Search Approach for the Interdependent Lock Scheduling Problem
48. Spanning trees with variable degree bounds
49. Applying (Hybrid) Metaheuristics to Fuel Consumption Optimization of Hybrid Electric Vehicles
50. A Memetic Algorithm and a Solution Archive for the Rooted Delay-Constrained Minimum Spanning Tree Problem
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.