Mads Jepsen
Mads Jepsen
Unknown affiliation
Verified email at diku.dk
Title
Cited by
Cited by
Year
Subset-row inequalities applied to the vehicle-routing problem with time windows
M Jepsen, B Petersen, S Spoorendonk, D Pisinger
Operations Research 56 (2), 497-511, 2008
3702008
A branch-and-cut algorithm for the symmetric two-echelon capacitated vehicle routing problem
M Jepsen, S Spoorendonk, S Ropke
Transportation Science 47 (1), 23-37, 2013
1292013
A branch-and-cut algorithm for the capacitated profitable tour problem
MK Jepsen, B Petersen, S Spoorendonk, D Pisinger
Discrete Optimization 14, 78-96, 2014
402014
A Non-robust Branch-and-cut-and-price Algorithm for the Vechicle Routing Problem with Time Windows
MK Jepsen, B Petersen, S Spoorendonk, D Pisinger
Department of Computer Science, University of Copenhagen, 2006
342006
A branch-and-cut algorithm for the elementary shortest path problem with a capacity constraint
MK Jepsen, B Petersen, S Spoorendonk
DIKU, 2008
312008
A path based model for a green liner shipping network design problem
MK Jepsen, B Lofstedt, CEM Plum, D Pisinger, MM Sigurd
World Congress on Engineering 2012. July 4-6, 2012. London, UK. 2189, 1379-1384, 2010
202010
Branch-and-cut and branch-and-cut-and-price algorithms for solving vehicle routing problems
MK Jepsen, D Pisinger
Technical University of Denmark (DTU), 2011
142011
The edge set cost of the vehicle routing problem with time windows
LB Reinhardt, MK Jepsen, D Pisinger
Transportation Science 50 (2), 694-707, 2016
112016
A branch-and-cut-and-price framework for the VRP applied on CVRP and VRPTW
M Jepsen, B Petersen, S Spoorendonk
Master's thesis, DIKU, University of Copenhagen, Copenhagen, Denmark, 2005
52005
Partial path column generation for the vehicle routing problem with time windows
B Petersen, MK Jepsen
International Network Optimization Conference (INOC), 2009,, 2009
42009
A note on the flow extended 0-1 knapsack cover inequalities for the elementary shortest path problem with a capacity constraint
M Jepsen, S Spoorendonk
Technical Report 08-02, DIKU Department of Computer Science, University ofá…, 2008
32008
Partial path column generation for the vehicle routing problem
MK Jepsen, B Petersen
22009
Appendix A The vehicle routing problem with edge set costs
LB Reinhardt, MK Jepsen, D Pisinger
Branch-and-cut and Branch-and-Cut-and-Price Algorithms for Solving Vehicleá…, 2011
12011
A Branch-and-Cut Algorithm for the Elementary Shortest Path Prob-lem with Resource Constraints
M Jepsen, B Petersen, S Spoorendonk
Cut and Column Generation, 129, 2008
12008
Introducing subset row inequalities in a branch-and-cut-and-price algorithm for the vehicle routing problem with time windows
M Jepsen, B Petersen, S Spoorendonk, D Pisinger
Oper Res. v56, 497-511, 0
1
A branch-and-cut algorithm for the capacitated profitable tour problem-DTU Orbit (07/01/2016)
MK Jepsen, B Petersen, S Spoorendonk, D Pisinger
2014
A Path Based Model for a Green Liner Shipping Network Design
BD Brouer, MK Jepsen, CEM Plum, G Desaulniers, D Pisinger, MM Sigurd
DTU Management Engineering, 2012
2012
Appendix BA Path Based Model for a Green Liner Shipping Network Design Problem
MK Jepsen, B L°fstedt, CEM Plum, D Pisinger, MM Sigurd
Branch-and-cut and Branch-and-Cut-and-Price Algorithms for Solving Vehicleá…, 2011
2011
Hierarchical Two-Layer Ring Network Design
S Spoorendonk, T Stidsen, MK Jepsen
10th INFORMS Telecommunications Conference, 2010
2010
A new formulation for the 2-echelon capacitated vehicle routing problem
MK Jepsen, S R°pke, S Spoorendonk
Tristan VII: Seventh Triennial Symposium on Transportation Analysis, 2010
2010
The system can't perform the operation now. Try again later.
Articles 1–20