The following pages link to Stefan Irnich (Q229417):
Displaying 50 items.
- The shortest-path problem with resource constraints with \((k, 2)\)-loop elimination and its application to the capacitated arc-routing problem (Q296774) (← links)
- Two-phase branch-and-cut for the mixed capacitated general routing problem (Q319006) (← links)
- Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks (Q322560) (← links)
- A note on symmetry reduction for circular traveling tournament problems (Q531484) (← links)
- Nested branch-and-price-and-cut for vehicle routing problems with multiple resource interdependencies (Q666967) (← links)
- Stabilized branch-and-price algorithms for vector packing problems (Q724108) (← links)
- Undirected postman problems with zigzagging option: a cutting-plane approach (Q925846) (← links)
- A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles (Q1582189) (← links)
- Combined column-and-row-generation for the optimal communication spanning tree problem (Q1652585) (← links)
- Maximum weight relaxed cliques and Russian doll search revisited (Q1686057) (← links)
- Branch-and-price-and-cut for a service network design and hub location problem (Q1752143) (← links)
- A new compact formulation for the discrete \(p\)-dispersion problem (Q1752169) (← links)
- Asymmetry matters: dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster (Q1753599) (← links)
- Bidirectional labeling in column-generation algorithms for pickup-and-delivery problems (Q1754114) (← links)
- Large multiple neighborhood search for the clustered vehicle-routing problem (Q1754733) (← links)
- A matheuristic for a 2-echelon vehicle routing problem with capacitated satellites and reverse flows (Q2083929) (← links)
- Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network (Q2197321) (← links)
- A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand (Q2208355) (← links)
- A branch-and-cut algorithm for the soft-clustered vehicle-routing problem (Q2208364) (← links)
- Exact solution of the soft-clustered vehicle-routing problem (Q2272311) (← links)
- Stabilized column generation for the temporal knapsack problem using dual-optimal inequalities (Q2362175) (← links)
- Optimal booking control in revenue management with two substitutable resources (Q2417956) (← links)
- Stabilized branch-price-and-cut for the commodity-constrained split delivery vehicle routing problem (Q2424767) (← links)
- Solving elementary shortest-path problems as mixed-integer programs (Q2454365) (← links)
- Resource extension functions: properties, inversion, and generalization to segments (Q2480803) (← links)
- Solution of real-world postman problems (Q2482818) (← links)
- Sequential search and its application to vehicle-routing problems (Q2489298) (← links)
- A note on single alternating cycle neighborhoods for the TSP (Q2573008) (← links)
- Fast local search algorithms for the handicapped persons transportation problem (Q2573013) (← links)
- A new branch-and-price algorithm for the traveling tournament problem (Q2655609) (← links)
- A note on the linearity of Ratliff and Rosenthal's algorithm for optimal picker routing (Q2670493) (← links)
- Dual Inequalities for Stabilized Column Generation Revisited (Q2806874) (← links)
- Cut-First Branch-and-Price Second for the Capacitated Arc-Routing Problem (Q2806992) (← links)
- The Shortest-Path Problem with Resource Constraints and <i>k</i>-Cycle Elimination for <i>k</i> ≥ 3 (Q2892297) (← links)
- Path-Reduced Costs for Eliminating Arcs in Routing and Scheduling (Q2899063) (← links)
- A Unified Modeling and Solution Framework for Vehicle Routing and Local Search-Based Metaheuristics (Q2901011) (← links)
- Exact Algorithms for Electric Vehicle-Routing Problems with Time Windows (Q2957464) (← links)
- Vehicle Routing Problems with Inter-Tour Resource Constraints (Q3564369) (← links)
- Cut-First Branch-and-Price-Second for the Capacitated Arc-Routing Problem (Q4904581) (← links)
- A Branch-and-Price Framework for Decomposing Graphs into Relaxed Cliques (Q5085477) (← links)
- (Q5271456) (← links)
- Shortest Path Problems with Resource Constraints (Q5493627) (← links)
- Finding all \(k\)-cliques in \(k\)-partite graphs, an application in textile engineering (Q5955469) (← links)
- Routing electric vehicles with a single recharge per route (Q6092658) (← links)
- New neighborhoods and an iterated local search algorithm for the generalized traveling salesman problem (Q6114932) (← links)
- Partial Dominance in Branch-Price-and-Cut for the Basic Multicompartment Vehicle-Routing Problem (Q6121576) (← links)
- Inter-depot moves and dynamic-radius search for multi-depot vehicle routing problems (Q6153465) (← links)
- Solving the skiving stock problem by a combination of stabilized column generation and the reflect arc-flow model (Q6157429) (← links)
- Resource-Window Reduction by Reduced Costs in Path-Based Formulations for Routing and Scheduling Problems (Q6202345) (← links)
- The single picker routing problem with scattered storage: modeling and evaluation of routing and storage policies (Q6617071) (← links)
