Stefan Røpke

Orcid: 0000-0002-6799-9934

Affiliations:
  • Technical University of Denmark, Department of Management Engineering, Kongens Lyngby, Denmark


According to our database1, Stefan Røpke authored at least 38 papers between 2006 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
The mobile production vehicle routing problem: Using 3D printing in last mile distribution.
Eur. J. Oper. Res., 2023

An adaptive large neighborhood search heuristic for the multi-port continuous berth allocation problem.
CoRR, 2023

2022
The Multiport Berth Allocation Problem with Speed Optimization: Exact Methods and a Cooperative Game Analysis.
Transp. Sci., 2022

Consistency Cuts for Dantzig-Wolfe Reformulations.
Oper. Res., 2022

A column-generation-based matheuristic for periodic and symmetric train timetabling with integrated passenger routing.
Eur. J. Oper. Res., 2022

A flow-based formulation for parallel machine scheduling using decision diagrams.
CoRR, 2022

A flow-based formulation for parallel machine scheduling problems using decision diagrams.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics 2022 (ISAIM 2022), 2022

The Multi-port Continuous Berth Allocation Problem with Speed Optimization.
Proceedings of the Computational Logistics - 13th International Conference, 2022

2020
Integrated Liner Shipping Network Design and Scheduling.
Transp. Sci., 2020

Simultaneously exploiting two formulations: An exact benders decomposition approach.
Comput. Oper. Res., 2020

2019
Cover Inequalities for a Vehicle Routing Problem with Time Windows and Shifts.
Transp. Sci., 2019

Centralised horizontal cooperation and profit sharing in a shipping pool.
J. Oper. Res. Soc., 2019

A column-generation-based matheuristic for periodic train timetabling with integrated passenger routing.
CoRR, 2019

2018
Simultaneous Optimization of Container Ship Sailing Speed and Container Routing with Transit Time Restrictions.
Transp. Sci., 2018

A comparison of acceptance criteria for the adaptive large neighbourhood search metaheuristic.
J. Heuristics, 2018

A branch-and-price approach to the feeder network design problem.
Eur. J. Oper. Res., 2018

2016
The Electric Fleet Size and Mix Vehicle Routing Problem with Time Windows and Recharging Stations.
Eur. J. Oper. Res., 2016

Full-shipload tramp ship routing and scheduling with variable speeds.
Comput. Oper. Res., 2016

An adaptive large neighborhood search heuristic for the Electric Vehicle Scheduling Problem.
Comput. Oper. Res., 2016

2014
A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports.
Eur. J. Oper. Res., 2014

A branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes.
Eur. J. Oper. Res., 2014

Heuristics for the Vehicle Routing Problem.
Proceedings of the Vehicle Routing, 2014

The Vehicle Routing Problem with Time Windows.
Proceedings of the Vehicle Routing, 2014

2013
The Simultaneous Vehicle Scheduling and Passenger Service Problem.
Transp. Sci., 2013

A Branch-and-Cut Algorithm for the Symmetric Two-Echelon Capacitated Vehicle Routing Problem.
Transp. Sci., 2013

Branch and Price for the Time-Dependent Vehicle Routing Problem with Time Windows.
Transp. Sci., 2013

2011
Formulations and Branch-and-Cut Algorithms for the Generalized Vehicle Routing Problem.
Transp. Sci., 2011

Modeling and solving a multimodal transportation problem with flexible-time and scheduled services.
Networks, 2011

ROUTE 2009: Recent advances in vehicle routing optimization.
Networks, 2011

The Pickup and Delivery Problem with Cross-Docking Opportunity.
Proceedings of the Computational Logistics - Second International Conference, 2011

2010
Scheduling technicians and tasks in a telecommunications company.
J. Sched., 2010

The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm.
Math. Program., 2010

2009
Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows.
Transp. Sci., 2009

2008
Horizontal cooperation among freight carriers: request allocation and profit sharing.
J. Oper. Res. Soc., 2008

2007
Models and branch-and-cut algorithms for pickup and delivery problems with time windows.
Networks, 2007

A general heuristic for vehicle routing problems.
Comput. Oper. Res., 2007

2006
An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows.
Transp. Sci., 2006

A unified heuristic for a large class of Vehicle Routing Problems with Backhauls.
Eur. J. Oper. Res., 2006


  Loading...