


default search action
Stefan Røpke
Person information
- affiliation: Technical University of Denmark, Department of Management Engineering, Kongens Lyngby, Denmark
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2025
 [j36]Mikkel Lassen Johansen [j36]Mikkel Lassen Johansen , Klaus Kähler Holst , Klaus Kähler Holst , Stefan Ropke , Stefan Ropke : :
 Designing the Liner Shipping Network of Tomorrow Powered by Alternative Fuels. Transp. Sci. 59(2): 391-412 (2025)
- 2024
 [j35]Jens Vinther Clausen [j35]Jens Vinther Clausen , Yves Crama , Yves Crama , Richard Lusby , Richard Lusby , Elisabeth Rodríguez-Heck , Elisabeth Rodríguez-Heck , Stefan Ropke , Stefan Ropke : :
 Solving unconstrained binary polynomial programs with limited reach: Application to low autocorrelation binary sequences. Comput. Oper. Res. 165: 106586 (2024)
 [j34]Bernardo Martin-Iradi [j34]Bernardo Martin-Iradi , Dario Pacino , Dario Pacino , Stefan Ropke , Stefan Ropke : :
 An adaptive large neighborhood search heuristic for the multi-port continuous berth allocation problem. Eur. J. Oper. Res. 316(1): 152-167 (2024)
 [j33]Daniel Kowalczyk [j33]Daniel Kowalczyk , Roel Leus , Roel Leus , Christopher Hojny , Christopher Hojny , Stefan Røpke , Stefan Røpke : :
 A Flow-Based Formulation for Parallel Machine Scheduling Using Decision Diagrams. INFORMS J. Comput. 36(6): 1696-1714 (2024)
 [j32]Mette Gamst [j32]Mette Gamst , Richard Martin Lusby , Richard Martin Lusby , Stefan Ropke , Stefan Ropke : :
 Exact and Heuristic Methods for the Split Delivery Vehicle Routing Problem. Transp. Sci. 58(4): 741-760 (2024)
 [j31]Said Dabia [j31]Said Dabia , Stefan Ropke, Tom Van Woensel , Stefan Ropke, Tom Van Woensel : :
 Erratum: "Branch and Price for the Time-Dependent Vehicle Routing Problem with Time Windows". Transp. Sci. 58(5): 919-924 (2024)
- 2023
 [j30]Yu Wang [j30]Yu Wang , Stefan Ropke , Stefan Ropke , Min Wen , Min Wen , Simon Bergh: , Simon Bergh:
 The mobile production vehicle routing problem: Using 3D printing in last mile distribution. Eur. J. Oper. Res. 305(3): 1407-1423 (2023)
- 2022
 [j29]Bernardo Martin-Iradi [j29]Bernardo Martin-Iradi , Stefan Ropke , Stefan Ropke : :
 A column-generation-based matheuristic for periodic and symmetric train timetabling with integrated passenger routing. Eur. J. Oper. Res. 297(2): 511-531 (2022)
 [j28]Jens Vinther Clausen [j28]Jens Vinther Clausen , Richard Lusby , Richard Lusby , Stefan Ropke , Stefan Ropke : :
 Consistency Cuts for Dantzig-Wolfe Reformulations. Oper. Res. 70(5): 2883-2905 (2022)
 [j27]Bernardo Martin-Iradi [j27]Bernardo Martin-Iradi , Dario Pacino , Dario Pacino , Stefan Ropke , Stefan Ropke : :
 The Multiport Berth Allocation Problem with Speed Optimization: Exact Methods and a Cooperative Game Analysis. Transp. Sci. 56(4): 972-999 (2022)
- 2020
 [j26]Richard Martin Lusby [j26]Richard Martin Lusby , Mette Gamst , Mette Gamst , Stefan Ropke , Stefan Ropke , Simon Spoorendonk , Simon Spoorendonk : :
 Simultaneously exploiting two formulations: An exact benders decomposition approach. Comput. Oper. Res. 123: 105041 (2020)
 [j25]David Franz Koza [j25]David Franz Koza , Guy Desaulniers , Guy Desaulniers , Stefan Ropke , Stefan Ropke : :
 Integrated Liner Shipping Network Design and Scheduling. Transp. Sci. 54(2): 512-533 (2020)
- 2019
 [j24]Min Wen, Rune Larsen [j24]Min Wen, Rune Larsen , Stefan Ropke , Stefan Ropke , Hanne L. Petersen, Oli B. G. Madsen: , Hanne L. Petersen, Oli B. G. Madsen:
 Centralised horizontal cooperation and profit sharing in a shipping pool. J. Oper. Res. Soc. 70(5): 737-750 (2019)
 [j23]Said Dabia [j23]Said Dabia , Stefan Ropke , Stefan Ropke , Tom Van Woensel , Tom Van Woensel : :
 Cover Inequalities for a Vehicle Routing Problem with Time Windows and Shifts. Transp. Sci. 53(5): 1354-1371 (2019)
- 2018
 [j22]Alberto Santini [j22]Alberto Santini , Christian E. M. Plum , Christian E. M. Plum , Stefan Ropke , Stefan Ropke : :
 A branch-and-price approach to the feeder network design problem. Eur. J. Oper. Res. 264(2): 607-622 (2018)
 [j21]Alberto Santini [j21]Alberto Santini , Stefan Ropke , Stefan Ropke , Lars Magnus Hvattum: , Lars Magnus Hvattum:
 A comparison of acceptance criteria for the adaptive large neighbourhood search metaheuristic. J. Heuristics 24(5): 783-815 (2018)
 [j20]Christian Vad Karsten [j20]Christian Vad Karsten , Stefan Ropke , Stefan Ropke , David Pisinger , David Pisinger : :
 Simultaneous Optimization of Container Ship Sailing Speed and Container Routing with Transit Time Restrictions. Transp. Sci. 52(4): 769-787 (2018)
- 2016
 [j19]Min Wen, Stefan Ropke [j19]Min Wen, Stefan Ropke , Hanne L. Petersen, Rune Larsen , Hanne L. Petersen, Rune Larsen , Oli B. G. Madsen: , Oli B. G. Madsen:
 Full-shipload tramp ship routing and scheduling with variable speeds. Comput. Oper. Res. 70: 1-8 (2016)
 [j18]Min Wen, E. Linde, Stefan Ropke [j18]Min Wen, E. Linde, Stefan Ropke , Pitu Mirchandani, Allan Larsen , Pitu Mirchandani, Allan Larsen : :
 An adaptive large neighborhood search heuristic for the Electric Vehicle Scheduling Problem. Comput. Oper. Res. 76: 73-83 (2016)
 [j17]Gerhard Hiermann [j17]Gerhard Hiermann , Jakob Puchinger , Jakob Puchinger , Stefan Ropke , Stefan Ropke , Richard F. Hartl , Richard F. Hartl : :
 The Electric Fleet Size and Mix Vehicle Routing Problem with Time Windows and Recharging Stations. Eur. J. Oper. Res. 252(3): 995-1018 (2016)
- 2014
 [j16]Tomás Robenek, Nitish Umang, Michel Bierlaire [j16]Tomás Robenek, Nitish Umang, Michel Bierlaire , Stefan Ropke , Stefan Ropke : :
 A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports. Eur. J. Oper. Res. 235(2): 399-411 (2014)
 [j15]Renaud Masson, Stefan Ropke [j15]Renaud Masson, Stefan Ropke , Fabien Lehuédé , Fabien Lehuédé , Olivier Péton , Olivier Péton : :
 A branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes. Eur. J. Oper. Res. 236(3): 849-862 (2014)
- 2013
 [j14]Mads Jepsen, Simon Spoorendonk [j14]Mads Jepsen, Simon Spoorendonk , Stefan Ropke , Stefan Ropke : :
 A Branch-and-Cut Algorithm for the Symmetric Two-Echelon Capacitated Vehicle Routing Problem. Transp. Sci. 47(1): 23-37 (2013)
 [j13]Said Dabia [j13]Said Dabia , Stefan Ropke , Stefan Ropke , Tom Van Woensel , Tom Van Woensel , Ton G. de Kok , Ton G. de Kok : :
 Branch and Price for the Time-Dependent Vehicle Routing Problem with Time Windows. Transp. Sci. 47(3): 380-396 (2013)
 [j12]Hanne L. Petersen, Allan Larsen [j12]Hanne L. Petersen, Allan Larsen , Oli B. G. Madsen, Bjørn Petersen, Stefan Ropke , Oli B. G. Madsen, Bjørn Petersen, Stefan Ropke : :
 The Simultaneous Vehicle Scheduling and Passenger Service Problem. Transp. Sci. 47(4): 603-616 (2013)
- 2011
 [j11]Luigi Moccia [j11]Luigi Moccia , Jean-François Cordeau, Gilbert Laporte, Stefan Ropke , Jean-François Cordeau, Gilbert Laporte, Stefan Ropke , Maria Pia Valentini: , Maria Pia Valentini:
 Modeling and solving a multimodal transportation problem with flexible-time and scheduled services. Networks 57(1): 53-68 (2011)
 [j10]Oli B. G. Madsen, Stefan Ropke [j10]Oli B. G. Madsen, Stefan Ropke : :
 ROUTE 2009: Recent advances in vehicle routing optimization. Networks 58(4): 239-240 (2011)
 [j9]Tolga Bektas [j9]Tolga Bektas , Günes Erdogan , Günes Erdogan , Stefan Ropke , Stefan Ropke : :
 Formulations and Branch-and-Cut Algorithms for the Generalized Vehicle Routing Problem. Transp. Sci. 45(3): 299-316 (2011)
- 2010
 [j8]Irina Dumitrescu, Stefan Ropke [j8]Irina Dumitrescu, Stefan Ropke , Jean-François Cordeau, Gilbert Laporte: , Jean-François Cordeau, Gilbert Laporte:
 The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm. Math. Program. 121(2): 269-305 (2010)
 [j7]Jean-François Cordeau, Gilbert Laporte, Federico Pasin, Stefan Ropke [j7]Jean-François Cordeau, Gilbert Laporte, Federico Pasin, Stefan Ropke : :
 Scheduling technicians and tasks in a telecommunications company. J. Sched. 13(4): 393-409 (2010)
- 2009
 [j6]Stefan Ropke [j6]Stefan Ropke , Jean-François Cordeau: , Jean-François Cordeau:
 Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows. Transp. Sci. 43(3): 267-286 (2009)
- 2008
 [j5]Marta Anna Krajewska, Herbert Kopfer, Gilbert Laporte, Stefan Ropke [j5]Marta Anna Krajewska, Herbert Kopfer, Gilbert Laporte, Stefan Ropke , Georges Zaccour , Georges Zaccour : :
 Horizontal cooperation among freight carriers: request allocation and profit sharing. J. Oper. Res. Soc. 59(11): 1483-1491 (2008)
- 2007
 [j4]David Pisinger [j4]David Pisinger , Stefan Ropke , Stefan Ropke : :
 A general heuristic for vehicle routing problems. Comput. Oper. Res. 34(8): 2403-2435 (2007)
 [j3]Stefan Ropke [j3]Stefan Ropke , Jean-François Cordeau, Gilbert Laporte: , Jean-François Cordeau, Gilbert Laporte:
 Models and branch-and-cut algorithms for pickup and delivery problems with time windows. Networks 49(4): 258-272 (2007)
- 2006
 [j2]Stefan Ropke [j2]Stefan Ropke , David Pisinger , David Pisinger : :
 A unified heuristic for a large class of Vehicle Routing Problems with Backhauls. Eur. J. Oper. Res. 171(3): 750-775 (2006)
 [j1]Stefan Ropke [j1]Stefan Ropke , David Pisinger , David Pisinger : :
 An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows. Transp. Sci. 40(4): 455-472 (2006)
Conference and Workshop Papers
- 2022
 [c3]Bernardo Martin-Iradi [c3]Bernardo Martin-Iradi , Dario Pacino , Dario Pacino , Stefan Ropke , Stefan Ropke : :
 The Multi-port Continuous Berth Allocation Problem with Speed Optimization. ICCL 2022: 31-43
 [c2]Daniel Kowalczyk, Roel Leus, Christopher Hojny, Stefan Røpke: [c2]Daniel Kowalczyk, Roel Leus, Christopher Hojny, Stefan Røpke:
 A flow-based formulation for parallel machine scheduling problems using decision diagrams. ISAIM 2022
- 2011
 [c1]Hanne L. Petersen, Stefan Ropke [c1]Hanne L. Petersen, Stefan Ropke : :
 The Pickup and Delivery Problem with Cross-Docking Opportunity. ICCL 2011: 101-113
Parts in Books or Collections
- 2014
 [p2]Gilbert Laporte, Stefan Ropke [p2]Gilbert Laporte, Stefan Ropke , Thibaut Vidal: , Thibaut Vidal:
 Heuristics for the Vehicle Routing Problem. Vehicle Routing 2014: 87-116
 [p1]Guy Desaulniers, Oli B. G. Madsen, Stefan Ropke [p1]Guy Desaulniers, Oli B. G. Madsen, Stefan Ropke : :
 The Vehicle Routing Problem with Time Windows. Vehicle Routing 2014: 119-159
Informal and Other Publications
- 2023
 [i3]Bernardo Martin-Iradi, Dario Pacino, Stefan Ropke: [i3]Bernardo Martin-Iradi, Dario Pacino, Stefan Ropke:
 An adaptive large neighborhood search heuristic for the multi-port continuous berth allocation problem. CoRR abs/2302.02356 (2023)
- 2022
 [i2]Daniel Kowalczyk, Roel Leus, Christopher Hojny, Stefan Røpke: [i2]Daniel Kowalczyk, Roel Leus, Christopher Hojny, Stefan Røpke:
 A flow-based formulation for parallel machine scheduling using decision diagrams. CoRR abs/2210.02434 (2022)
- 2019
 [i1]Bernardo Martin-Iradi, Stefan Ropke: [i1]Bernardo Martin-Iradi, Stefan Ropke:
 A column-generation-based matheuristic for periodic train timetabling with integrated passenger routing. CoRR abs/1912.06941 (2019)
Coauthor Index

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from  to the list of external document links (if available).
 to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the  of the Internet Archive (if available).
 of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from  ,
,  , and
, and  to record detail pages.
 to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from  and
 and  to record detail pages.
 to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from  .
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-10-16 00:14 CEST by the dblp team
 all metadata released as open data under CC0 1.0 license
 all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint


 Google
Google Google Scholar
Google Scholar Semantic Scholar
Semantic Scholar Internet Archive Scholar
Internet Archive Scholar CiteSeerX
CiteSeerX ORCID
ORCID







