J. Lysgaard & S.L. Gadegaard (2024): "A Set Partitioning Model for MinMax Vehicle Routing", presented at EURO 2024, June 30 - July 3, Copenhagen, Denmark.
J. Lysgaard & S.L. Gadegaard (2018): "Symmetry-Free Polynomial Formulations of the Capacitated Vehicle Routing Problem", presented at OR60 Anniversary Conference, September 11-13, Lancaster, England.
J. Lysgaard, A.D. López-Sánchez & A.G. Hernández-Díaz (2016): "A Matheuristic for the MinMax Capacitated Open Vehicle Routing Problem", presented at VEROLOG 2016, June 6-8, Nantes, France.
J. Lysgaard (2015): "A new sparse transformation and exact algorithm for the Clustered Traveling Salesman Problem", presented at VEROLOG 2015, June 8-10, Vienna, Austria.
J. Lysgaard & T. Bektaş (2014): "Optimal vehicle routing with lower and upper bounds on route durations", presented at VEROLOG 2014, June 22-25, Oslo, Norway.
J. Lysgaard & J. Bauer (2013): "Offshore Windfarm Infield Cable Layout: Models and Algorithms", presented at VEROLOG 2013, July 7-10, Southampton, England.
J. Lysgaard & S. Wøhlk (2012): "A Branch-and-Cut-and-Price Algorithm for the Minimum Latency Capacitated Vehicle Routing Problem", presented at VEROLOG 2012, June 18-20, Bologna, Italy.
J. Lysgaard (2012): "Dual-Optimal Inequalities for the Capacitated Vehicle Routing Problem", presented at ODYSSEUS 2012, May 21-25, Mykonos, Greece.
J. Lysgaard (2009): "The Pyramidal Capacitated Vehicle Routing Problem", presented at the 3rd Nordic Optimization Symposium, March 13-14, Stockholm, Sweden.
J. Lysgaard & J. Løber (2007): "Scheduling exercises of an assessment centre", presented at the 2nd Nordic Optimization Symposium, October 18-20, Oslo, Norway.
J. Lysgaard, A.N. Letchford & R.W. Eglese (2006): "A Branch-and-Cut Algorithm for the Capacitated Open Vehicle Routing Problem", presented at the 1st Nordic Optimization Symposium (10th Nordic MPS Meeting), April 20-22, Copenhagen, Denmark.
J. Lysgaard (2005): "Reachability Cuts for the Vehicle Routing Problem with Time Windows", presented at IFORS 2005, July 11-15, Hawaii, USA.
J. Lysgaard (2003): "Exact solution of the CVRP for a given set of seed customers: a branch-and-bound approach", presented at ISMP 2003, August 18-22, Copenhagen, Denmark.
J. Lysgaard (2002): "Optimizing vehicle routes with non-additive costs: A case study", presented at IFORS 2002, July 8-12, Edinburgh, Scotland.
J. Lysgaard, A.N. Letchford & R.W. Eglese (2000): "A Branch and Cut algorithm for the Vehicle Routing Problem", presented at CO2000, July 12-14, Greenwich, London, England.
J. Lysgaard, A.N. Letchford & R.W. Eglese (1999): "A Branch and Cut algorithm for the Vehicle Routing Problem", presented at Symposium on Operations Research, September 1-3, Magdeburg, Germany.
J. Lysgaard, A.N. Letchford & R.W. Eglese (1999): "New Procedures in Branch and Cut for the Vehicle Routing Problem", presented at IFORS 1999, August 16-20, Beijing, China.
J. Lysgaard (1998): "Application of Set Partitioning to a Real-World Vehicle Routing Problem", in Proceedings of the 10th Annual Nordic Logistics Conference, June 9-10, Espoo, Finland.
J. Lysgaard (1997): "Cluster based branching for the asymmetric traveling salesman problem", presented at EURO XV / INFORMS XXXIV Joint International Conference, July 14-17, Barcelona, Spain.