40 results on '"Ropke, Stefan"'
Search Results
2. Solving unconstrained binary polynomial programs with limited reach: Application to low autocorrelation binary sequences
3. The mobile production vehicle routing problem: Using 3D printing in last mile distribution
4. A column-generation-based matheuristic for periodic and symmetric train timetabling with integrated passenger routing
5. Erratum: "Branch and Price for the Time-Dependent Vehicle Routing Problem with Time Windows".
6. Exact and Heuristic Methods for the Split Delivery Vehicle Routing Problem.
7. Simultaneously exploiting two formulations: An exact benders decomposition approach
8. An adaptive large neighborhood search metaheuristic for the vehicle routing problem with drones
9. Simultaneous Optimization of Container Ship Sailing Speed and Container Routing with Transit Time Restrictions
10. Flexible ship loading problem with transfer vehicle assignment and scheduling
11. A branch-and-price approach to the feeder network design problem
12. A comparison of acceptance criteria for the adaptive large neighbourhood search metaheuristic
13. Improved formulations and an Adaptive Large Neighborhood Search heuristic for the integrated berth allocation and quay crane assignment problem
14. The liquefied natural gas infrastructure and tanker fleet sizing problem
15. The Electric Fleet Size and Mix Vehicle Routing Problem with Time Windows and Recharging Stations
16. Integrated Berth Allocation and Quay Crane Assignment Problem: Set partitioning models and computational results
17. The time constrained multi-commodity network flow problem and its application to liner shipping network design
18. A branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes
19. A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports
20. The Simultaneous Vehicle Scheduling and Passenger Service Problem
21. Branch and Price for the Time-Dependent Vehicle Routing Problem with Time Windows
22. A Branch-and-Cut Algorithm for the Symmetric Two-Echelon Capacitated Vehicle Routing Problem
23. The Waste Collection Vehicle Routing Problem with Time Windows in a City Logistics Context
24. Formulations and Branch-and-Cut Algorithms for the Generalized Vehicle Routing Problem
25. Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows
26. Models for the discrete berth allocation problem: A computational comparison
27. An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows
28. Consistency Cuts for Dantzig-Wolfe Reformulations.
29. The Multiport Berth Allocation Problem with Speed Optimization: Exact Methods and a Cooperative Game Analysis.
30. Scheduling technicians and tasks in a telecommunications company
31. The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm
32. A general heuristic for vehicle routing problems
33. A unified heuristic for a large class of Vehicle Routing Problems with Backhauls
34. Integrated Liner Shipping Network Design and Scheduling.
35. Cover Inequalities for a Vehicle Routing Problem with Time Windows and Shifts.
36. Centralised horizontal cooperation and profit sharing in a shipping pool.
37. A note on a model for quay crane scheduling with non-crossing constraints.
38. Modeling and solving a multimodal transportation problem with flexible-time and scheduled services.
39. Models and branch-and-cut algorithms for pickup and delivery problems with time windows.
40. ROUTE 2009: Recent advances in vehicle routing optimization.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.