Stefan Irnich

Oper. Res. Lett., 2022

New neighborhoods and an iterated local search algorithm for the generalized traveling salesman problem.

[BibT_eX]

[DOI]

Jeanette Schmidt

EURO J. Comput. Optim., 2022

2021

Branch-Price-and-Cut for the Soft-Clustered Capacitated Arc-Routing Problem.

[BibT_eX]

[DOI]

Timo Hintsch

Lone Kiilerich

Transp. Sci., 2021

The last-mile vehicle routing problem with delivery options.

[BibT_eX]

[DOI]

Katharina Olkis

OR Spectr., 2021

A Branch-and-Price Framework for Decomposing Graphs into Relaxed Cliques.

[BibT_eX]

[DOI]

Fabio Furini

Roberto Wolfler Calvo

INFORMS J. Comput., 2021

Hybridizing large neighborhood search and exact methods for generalized vehicle routing problems with time windows.

[BibT_eX]

[DOI]

EURO J. Transp. Logist., 2021

A branch-and-cut algorithm for the soft-clustered vehicle-routing problem.

[BibT_eX]

[DOI]

Katrin Heßler

Discret. Appl. Math., 2021

A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2021

2020

Strategic Planning for Integrated Mobility-on-Demand and Urban Public Bus Networks.

[BibT_eX]

[DOI]

Konrad Steiner

Transp. Sci., 2020

Variable Fixing for Two-Arc Sequences in Branch-Price-and-Cut Algorithms on Path-Based Models.

[BibT_eX]

[DOI]

Guy Desaulniers

Transp. Sci., 2020

Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network.

[BibT_eX]

[DOI]

J. Sched., 2020

Routing electric vehicles with a single recharge per route.

[BibT_eX]

[DOI]

Networks, 2020

Exact solution of the soft-clustered vehicle-routing problem.

[BibT_eX]

[DOI]

Timo Hintsch

Eur. J. Oper. Res., 2020

2019

Branch-and-Cut-and-Price for the Vehicle Routing Problem with Time Windows and Convex Node Costs.

[BibT_eX]

[DOI]

Qie He

Yongjia Song

Transp. Sci., 2019

Branch-and-Cut for the Split Delivery Vehicle Routing Problem with Time Windows.

[BibT_eX]

[DOI]

Transp. Sci., 2019

The Split Delivery Vehicle Routing Problem with Time Windows and Customer Inconvenience Constraints.

[BibT_eX]

[DOI]

Transp. Sci., 2019

Optimal booking control in revenue management with two substitutable resources.

[BibT_eX]

[DOI]

David Sayah

Math. Methods Oper. Res., 2019

Nested branch-and-price-and-cut for vehicle routing problems with multiple resource interdependencies.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2019

Stabilized branch-price-and-cut for the commodity-constrained split delivery vehicle routing problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2019

2018

Branch-and-Price-and-Cut for the Active-Passive Vehicle-Routing Problem.

[BibT_eX]

[DOI]

Transp. Sci., 2018

Schedule-Based Integrated Intercity Bus Line Planning via Branch-and-Cut.

[BibT_eX]

[DOI]

Konrad Steiner

Transp. Sci., 2018

Branch-and-Price-and-Cut for the Truck-and-Trailer Routing Problem with Time Windows.

[BibT_eX]

[DOI]

Transp. Sci., 2018

Large multiple neighborhood search for the clustered vehicle-routing problem.

[BibT_eX]

[DOI]

Timo Hintsch

Eur. J. Oper. Res., 2018

Stabilized branch-and-price algorithms for vector packing problems.

[BibT_eX]

[DOI]

Katrin Heßler

Eur. J. Oper. Res., 2018

Bidirectional labeling in column-generation algorithms for pickup-and-delivery problems.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2018

Maximum weight relaxed cliques and Russian Doll Search revisited.

[BibT_eX]

[DOI]

Isabel Podlinski

Discret. Appl. Math., 2018

Combined column-and-row-generation for the optimal communication spanning tree problem.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2018

2017

Dynamic Programming for the Minimum Tour Duration Problem.

[BibT_eX]

[DOI]

Transp. Sci., 2017

An Exact Method for Vehicle Routing and Truck Driver Scheduling Problems.

[BibT_eX]

[DOI]

Asvin Goel

Transp. Sci., 2017

Stabilized column generation for the temporal knapsack problem using dual-optimal inequalities.

[BibT_eX]

[DOI]

OR Spectr., 2017

Asymmetry matters: Dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2017

A new compact formulation for the discrete p-dispersion problem.

[BibT_eX]

[DOI]

David Sayah

Eur. J. Oper. Res., 2017

2016

Exact Algorithms for Electric Vehicle-Routing Problems with Time Windows.

[BibT_eX]

[DOI]

Oper. Res., 2016

Dual Inequalities for Stabilized Column Generation Revisited.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2016

Branch-and-price-and-cut for a service network design and hub location problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2016

Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2016

2015

Effective Handling of Dynamic Time Windows and Its Application to Solving the Dial-a-Ride Problem.

[BibT_eX]

[DOI]

Transp. Sci., 2015

In-Depth Analysis of Pricing Problem Relaxations for the Capacitated Arc-Routing Problem.

[BibT_eX]

[DOI]

Claudia Bode

Transp. Sci., 2015

Two-phase branch-and-cut for the mixed capacitated general routing problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2015

2014

Solving elementary shortest-path problems as mixed-integer programs.

[BibT_eX]

[DOI]

OR Spectr., 2014

Formulations for an inventory routing problem.

[BibT_eX]

[DOI]

Int. Trans. Oper. Res., 2014

The shortest-path problem with resource constraints with (k, 2)-loop elimination and its application to the capacitated arc-routing problem.

[BibT_eX]

[DOI]

Claudia Bode

Eur. J. Oper. Res., 2014

The Family of Vehicle Routing Problems.

[BibT_eX]

[DOI]

Paolo Toth

Daniele Vigo

Proceedings of the Vehicle Routing, 2014

Four Variants of the Vehicle Routing Problem.

[BibT_eX]

[DOI]

Michael Schneider

Daniele Vigo

Proceedings of the Vehicle Routing, 2014

2012

Cut-First Branch-and-Price-Second for the Capacitated Arc-Routing Problem.

[BibT_eX]

[DOI]

Claudia Bode

Oper. Res., 2012

2011

A note on symmetry reduction for circular traveling tournament problems.

[BibT_eX]

[DOI]

Elisabeth Gussmagg-Pfliegl

Eur. J. Oper. Res., 2011

Heuristics for a Real-World Mail Delivery Problem.

[BibT_eX]

[DOI]

Proceedings of the Applications of Evolutionary Computation, 2011

2010

Path-Reduced Costs for Eliminating Arcs in Routing and Scheduling.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2010

A new branch-and-price algorithm for the traveling tournament problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2010

2009

New Models and Methods for Arc Routing.

[BibT_eX]

[DOI]

Proceedings of the Models and Algorithms for Optimization in Logistics, 21.06., 2009

2008

Resource extension functions: properties, inversion, and generalization to segments.

[BibT_eX]

[DOI]

OR Spectr., 2008

A Unified Modeling and Solution Framework for Vehicle Routing and Local Search-Based Metaheuristics.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2008

Solution of real-world postman problems.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2008

Undirected postman problems with zigzagging option: A cutting-plane approach.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2008

2006

The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k 3.

[BibT_eX]

[DOI]

Daniel Villeneuve

INFORMS J. Comput., 2006

Sequential search and its application to vehicle-routing problems.

[BibT_eX]

[DOI]

Birger Funke

Comput. Oper. Res., 2006

2005

Local Search for Vehicle Routing and Scheduling Problems: Review and Conceptual Integration.

[BibT_eX]

[DOI]

Birger Funke

J. Heuristics, 2005

A Note on Single Alternating Cycle Neighborhoods for the TSP.

[BibT_eX]

[DOI]

Birger Funke

J. Heuristics, 2005

2002

Finding all k-cliques in k-partite graphs, an application in textile engineering.

[BibT_eX]

[DOI]

Hans-Jürgen Zimmermann

Markus Schneider

Burkhard Wulfhorst

Comput. Oper. Res., 2002

2000

A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles.

[BibT_eX]

[DOI]