Stefan Røpke
Orcid: 0000-0002-6799-9934Affiliations:
- Technical University of Denmark, Department of Management Engineering, Kongens Lyngby, Denmark
According to our database1,
Stefan Røpke
authored at least 41 papers
between 2006 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
2006
2008
2010
2012
2014
2016
2018
2020
2022
2024
0
1
2
3
4
5
6
2
5
1
3
2
3
3
3
2
3
3
2
1
1
2
2
2
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on twitter.com
-
on orcid.org
-
on orbit.dtu.dk
On csauthors.net:
Bibliography
2024
Transp. Sci., 2024
Erratum: "Branch and Price for the Time-Dependent Vehicle Routing Problem with Time Windows".
Transp. Sci., 2024
INFORMS J. Comput., 2024
An adaptive large neighborhood search heuristic for the multi-port continuous berth allocation problem.
Eur. J. Oper. Res., 2024
Solving unconstrained binary polynomial programs with limited reach: Application to low autocorrelation binary sequences.
Comput. Oper. Res., 2024
2023
The mobile production vehicle routing problem: Using 3D printing in last mile distribution.
Eur. J. Oper. Res., 2023
2022
The Multiport Berth Allocation Problem with Speed Optimization: Exact Methods and a Cooperative Game Analysis.
Transp. Sci., 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 problems using decision diagrams.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics 2022 (ISAIM 2022), 2022
Proceedings of the Computational Logistics - 13th International Conference, 2022
2020
Comput. Oper. Res., 2020
2019
Transp. Sci., 2019
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
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
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
Proceedings of the Vehicle Routing, 2014
2013
Transp. Sci., 2013
A Branch-and-Cut Algorithm for the Symmetric Two-Echelon Capacitated Vehicle Routing Problem.
Transp. Sci., 2013
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
Proceedings of the Computational Logistics - Second International Conference, 2011
2010
The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm.
Math. Program., 2010
2009
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
2006
An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows.
Transp. Sci., 2006
Eur. J. Oper. Res., 2006