Logistikmanagement
- Beziehungen:
-
- Undirected postman problems with zigzagging option: A cutting-plane approach
- In-depth analysis of pricing problem relaxations for the capacitated arc-routing problem
- Solving elementary shortest-path problems as mixed-integer programs
- Formulations for an inventory routing problem
- A new branch-and-price algorithm for the traveling tournament problem
- New Models and Methods for Arc Routing.
- Branch-and-price-and-cut for a service network design and hub location problem
- Optimierung im Transport 1 Grundlagen
- Optimierung im Transport Wege und Touren
- Bin packing with lexicographic objectives for loading weight- and volume-constrained trucks in a direct-shipping system.
- Solving the skiving stock problem by a combination of stabilized column generation and the Reflect Arc-Flow model
- Partial Dominance in Branch-Price-and-Cut for the Basic Multicompartment Vehicle-Routing Problem
- Local search for vehicle routing and scheduling problems:: Review and conceptual integration
- A note on postman problems with zigzag service
- Variable Fixing for Two-Arc Sequences in Branch-Price-and-Cut Algorithms on Path-Based Models
- A Branch-and-Price Framework for Decomposing Graphs into Relaxed Cliques
- Four variants of the vehicle routing problem
- The capacitated arc routing problem : exact algorithms
- Inter-depot moves and dynamic-radius search for multi-depot vehicle routing problems
- New neighborhoods and an iterated local search algorithm for the generalized traveling salesman problem
- Sequential search and its application to vehicle-routing problems
- Routing electric vehicles with a single recharge per route
- Exact Solution of the Single-Picker Routing Problem with Scattered Storage
- Path-reduced costs for eliminating arcs in routing and scheduling
- A unified modeling and solution framework for vehicle routing and local search-based metaheuristics
- The family of vehicle routing problems
- Resource-Window Reduction by Reduced Costs in Path-Based Formulations for Routing and Scheduling Problems
- Vehicle Routing Problems with Inter-Tour Resource Constraints
- A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles
- Cut-first branch-and-price-second for the capacitated arc-routing problem
- Chapter 1: The Family of Vehicle Routing Problems
- Chapter 9: Four Variants of the Vehicle Routing Problem
- Chapter 9: The Capacitated Arc Routing Problem: Exact Algorithms
- Solution of real-world postman problems
- Resource extension functions: properties, inversion, and generalization to segments
- The shortest-path problem with resource constraints and k-cycle elimination for k ≥ 3
- Exact solution of the soft-clustered vehicle-routing problem
- Branch-cut-and-price for the vehicle routing problem with time windows and convex node costs
- The split delivery vehicle routing problem with time windows and customer inconvenience constraints
- Stabilized branch-price-and-cut for the commodity-constrained split delivery vehicle routing problem
- Optimal booking control in revenue management with two substitutable resources
- Branch-and-cut for the split delivery vehicle routing problem with time windows
- Nested branch-and-price-and-cut for vehicle routing problems with multiple resource interdependencies
- Branch-and-price-and-cut for the truck-and-trailer routing problem with time windows
- Schedule-based integrated intercity bus line planning via branch-and-cut
- Stabilized branch-and-price algorithms for vector packing problems
- Large multiple neighborhood search for the clustered vehicle-routing problem
- Branch-and-price-and-cut for the active-passive vehicle-routing problem
- Combined column-and-row-generation for the optimal communication spanning tree problem
- Bidirectional labeling in column-generation algorithms for pickup-and-delivery problems
- Maximum weight relaxed cliques and Russian Doll Search revisited
- Asymmetry matters : dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster
- An exact method for vehicle routing and truck driver scheduling problems
- Dynamic programming for the minimum tour duration Problem
- Stabilized column generation for the temporal knapsack problem using dual-optimal inequalities
- Exact algorithms for electric vehicle-routing problems with time windows
- A new compact formulation for the discrete p-dispersion problem
- Branch-and-price-and-cut for a service network design and hub location problem
- Dual inequalities for stabilized column generation revisited
- Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks
- Two-phase branch-and-cut for the mixed capacitated general routing problem
- The shortest-path problem with resource constraints with (k,2)-loop elimination and its application to the capacitated arc-routing problem
- Effective handling of dynamic time windows and its application to solving the dial-a-ride problem
- A note on symmetry reduction for circular traveling tournament problems
- A note on single alternating cycle neighborhoods for the TSP
- Finding all k-cliques in k-partite graphs, an application in textile engineering
- Cut-First Branch-and-Price Second for the Capacitated Arc-Routing Problem
- Heuristics for a real-world mail delivery problem
- Shortest Path Problems with Resource Constraints
- A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand
- Strategic Planning for Integrated Mobility-on-Demand and Urban Public Bus Networks
- Branch-Price-and-Cut for the Soft-Clustered Capacitated Arc-Routing Problem
- Asymmetry matters : dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster
- Exact algorithms for the multi-compartment vehicle routing problem with flexible compartment sizes
- A note on the linearity of Ratliff and Rosenthal’s algorithm for optimal picker routing
- Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network
- Contributions to Exact Algorithms for Packing and Routing Problems
- Hybridizing large neighborhood search and exact methods for generalized vehicle routing problems with time windows
- The last-mile vehicle routing problem with delivery options
- Using public transport in a 2-echelon last-mile delivery network
- Bin packing with lexicographic objectives for loading weight- and volume-constrained trucks in a direct-shipping system
- A branch-and-cut algorithm for the soft-clustered vehicle-routing problem
- A matheuristic for a 2-echelon vehicle routing problem with capacitated satellites and reverse flows
- Contributions to column-generation approaches in combinatorial optimization
- Bidirectional labeling for solving vehicle routing and truck driver scheduling problems
- Adapting the ng-path relaxation for bike balancing problems
Besitzt PublikationDie Publikationsliste für die Kategorie "Organisationseinheit" zeigt alle Publikationen, die der einzelnen Organisationseinheit direkt zugeordnet sind. Für eine Liste, die auch alle Publikationen von untergeordneten Organisationseinheiten inkludiert, nutzen Sie die Liste in der Facette "Organisationseinheit".
Teil von