default search action
Jens Lysgaard
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j21]Farnaz Farzadnia
, Tolga Bektas
The cumulative school bus routing problem: Polynomial-size formulations. Networks 82(4): 571-591 (2023) - 2021
- [j20]Sune Lauth Gadegaard
A symmetry-free polynomial formulation of the capacitated vehicle routing problem. Discret. Appl. Math. 296: 179-192 (2021) - [j19]Farnaz Farzadnia
Solving the service-oriented single-route school bus routing problem: Exact and heuristic solutions. EURO J. Transp. Logist. 10: 100054 (2021) - 2020
- [j18]Jens Lysgaard, Ana Dolores López-Sánchez, Alfredo García Hernández-Díaz:
A matheuristic for the MinMax capacitated open vehicle routing problem. Int. Trans. Oper. Res. 27(1): 394-417 (2020)
2010 – 2019
- 2016
- [j17]Lukas Bach, Jens Lysgaard, Sanne Wøhlk
A branch-and-cut-and-price algorithm for the mixed capacitated general routing problem. Networks 68(3): 161-184 (2016) - 2015
- [j16]Joanna Bauer, Jens Lysgaard:
The offshore wind farm array cable layout problem: a planar open vehicle routing problem. J. Oper. Res. Soc. 66(3): 360-368 (2015) - [j15]Tolga Bektas
Optimal vehicle routing with lower and upper bounds on route durations. Networks 65(2): 166-179 (2015) - 2014
- [j14]Jens Lysgaard, Sanne Wøhlk
A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem. Eur. J. Oper. Res. 236(3): 800-810 (2014) - [j13]Péter Bodnár, Jens Lysgaard:
A dynamic programming algorithm for the space allocation and aisle positioning problem. J. Oper. Res. Soc. 65(9): 1315-1324 (2014) - 2011
- [j12]Qianxin Mu, Zhuo Fu
Disruption management of the vehicle routing problem with vehicle breakdown. J. Oper. Res. Soc. 62(4): 742-749 (2011) - 2010
- [j11]Geir Brønmo, Bjørn Nygreen, Jens Lysgaard:
Column generation approaches to ship scheduling with flexible cargo sizes. Eur. J. Oper. Res. 200(1): 139-150 (2010) - [j10]Jens Lysgaard:
The pyramidal capacitated vehicle routing problem. Eur. J. Oper. Res. 205(1): 59-64 (2010)
2000 – 2009
- 2009
- [j9]Christian H. Christiansen, Jens Lysgaard, Sanne Wøhlk
A Branch-and-Price Algorithm for the Capacitated Arc Routing Problem with Stochastic Demands. Oper. Res. Lett. 37(6): 392-398 (2009) - 2008
- [j8]Eduardo Uchoa
Robust branch-cut-and-price for the Capacitated Minimum Spanning Tree problem over a large extended formulation. Math. Program. 112(2): 443-472 (2008) - 2007
- [j7]Adam N. Letchford
A branch-and-cut algorithm for the capacitated open vehicle routing problem. J. Oper. Res. Soc. 58(12): 1642-1651 (2007) - [j6]Christian H. Christiansen, Jens Lysgaard:
A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands. Oper. Res. Lett. 35(6): 773-781 (2007) - 2006
- [j5]Jens Lysgaard:
Reachability cuts for the vehicle routing problem with time windows. Eur. J. Oper. Res. 175(1): 210-223 (2006) - [j4]Ricardo Fukasawa
Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem. Math. Program. 106(3): 491-511 (2006) - 2004
- [j3]Jens Lysgaard, Adam N. Letchford
A new branch-and-cut algorithm for the capacitated vehicle routing problem. Math. Program. 100(2): 423-445 (2004) - [c1]Ricardo Fukasawa
Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem. IPCO 2004: 1-15 - 2002
- [j2]Adam N. Letchford
Multistars, partial multistars and the capacitated vehicle routing problem. Math. Program. 94(1): 21-40 (2002)
1990 – 1999
- 1999
- [j1]Jens Lysgaard:
Cluster based branching for the asymmetric traveling salesman problem. Eur. J. Oper. Res. 119(2): 314-325 (1999)
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).
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).
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
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
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 2024-10-07 21:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: