Stefan Ropke - Citegraph

Author Info

Name	Affiliation	Papers
STEFAN ROPKE	Canada Research Chair in Distribution Management, HEC Montréal 3000, chemin de la Cóte-Sainte-Catherine, Montréal, Canada H3T 2A7	28
Collaborators	Citations	PageRank
46	1347	55.90
Referers	Referees	References
2150	567	439

Search Limit

1001000

Publications (28 rows)

Collaborators (46 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
The Multiport Berth Allocation Problem with Speed Optimization: Exact Methods and a Cooperative Game Analysis.	0	0.34	2022
Simultaneously exploiting two formulations: An exact benders decomposition approach.	0	0.34	2020
Integrated Liner Shipping Network Design and Scheduling	0	0.34	2020
Cover Inequalities for a Vehicle Routing Problem with Time Windows and Shifts	0	0.34	2019
Centralised horizontal cooperation and profit sharing in a shipping pool	0	0.34	2019
Simultaneous Optimization of Container Ship Sailing Speed and Container Routing with Transit Time Restrictions	2	0.39	2018
A comparison of acceptance criteria for the adaptive large neighbourhood search metaheuristic.	3	0.38	2018
A branch-and-price approach to the feeder network design problem.	0	0.34	2018
Full-shipload tramp ship routing and scheduling with variable speeds	4	0.42	2016
An adaptive large neighborhood search heuristic for the Electric Vehicle Scheduling Problem.	4	0.56	2016
The Electric Fleet Size and Mix Vehicle Routing Problem with Time Windows and Recharging Stations.	39	1.69	2016
A branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes.	13	0.57	2014
A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports.	8	0.56	2014
Branch and Price for the Time-Dependent Vehicle Routing Problem with Time Windows	15	0.68	2013
The Simultaneous Vehicle Scheduling and Passenger Service Problem	4	0.49	2013
A Branch-and-Cut Algorithm for the Symmetric Two-Echelon Capacitated Vehicle Routing Problem	28	0.86	2013
Modeling and solving a multimodal transportation problem with flexible-time and scheduled services	15	0.75	2011
ROUTE 2009: Recent advances in vehicle routing optimization	0	0.34	2011
The pickup and delivery problem with cross-docking opportunity	16	0.69	2011
Formulations and Branch-and-Cut Algorithms for the Generalized Vehicle Routing Problem	21	1.26	2011
Scheduling technicians and tasks in a telecommunications company	35	1.26	2010
The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm	30	1.29	2010
Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows	99	3.18	2009
Horizontal cooperation among freight carriers: request allocation and profit sharing	69	2.78	2008
A general heuristic for vehicle routing problems	388	13.17	2007
Models and branch-and-cut algorithms for pickup and delivery problems with time windows	50	2.36	2007
A unified heuristic for a large class of Vehicle Routing Problems with Backhauls	124	5.34	2006
An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows	380	14.88	2006