Research publications

Sort by: Date | Author | Title

Marand, A. J., Li, H. J. & Thorstenson, A. (2021). Competing on price, speed, and reliability: How does bounded rationality matter? Journal of the Operational Research Society, 72(9), 2059-2072. https://doi.org/10.1080/01605682.2020.1759384

Marand, A. J. & Mousavi Gargari, S. S. (2021). Congestion in the system. In M. Hemmati & M. S. Sajadieh (Eds.), Influencing Customer Demand: An Operations Management Approach (pp. 135-155). CRC Press.

Ma, Q., Li, H. & Thorstenson, A. (2021). A big data-driven root cause analysis system: Application of Machine Learning in quality problem solving. Computers and Industrial Engineering, 160, [107580]. https://doi.org/10.1016/j.cie.2021.107580

Lystlund, L. & Wøhlk, S. (2011). The Service-Time Restricted Capacitated Arc Routing Problem. Aarhus School of Business, Aarhus University, CORAL - Centre for Operations Research Applications in Logistics.

Lysgaard, J. (1995). New bounding procedures for the restricted Lagrangean approach to the traveling salesman problem.

Lysgaard, J. & Løber, J. (2008). Scheduling participants of Assessment Centres. Aarhus School of Business, Aarhus University, CORAL - Centre for Operations Research Applications in Logistics.

Lysgaard, J. (2009). The Pyramidal Capacitated Vehicle Routing Problem. Paper presented at 3rd Nordic Optimization Symposium, Stockholm, Sweden.

Lysgaard, J. (2010). The pyramidal capacitated vehicle routing problem. European Journal of Operational Research, 205(1), 59-64. https://doi.org/10.1016/j.ejor.2009.11.029

Lysgaard, J. (1998). Application of Set Partitioning to a Real-World Vehicle Routing Problem.

Lysgaard, J. (2002). Allocating customers to routes with zone costs: A case study.

Lysgaard, J. (2003). CVRPSEP: A package of separation routines for the Capacitated Vehicle Routing Problem.

Lysgaard, J. (2004). Reachability cuts for the vehicle routing problem with time windows.

Lysgaard, J. (1999). Cluster based branching for the asymmetric traveling salesman problem. European Journal of Operational Research, 119(2), 314-325.

Lysgaard, J., Letchford, A. N. & Eglese, R. W. (2004). A new branch-and-cut algorithm for the capacitated vehicle routing problem. Mathematical Programming, 100(2), 423-445. http://springerlink.metapress.com/media/64CRRLUQQL5NKX1JXDF1/Contributions/F/N/V/1/FNV1WMJ2Y08TD0PA.pdf

Lysgaard, J., Letchford, A. N. & Eglese, R. W. (1999). New Procedures in Branch and Cut for the Vehicle Routing Problem. Paper presented at The 15th Triennial Conference of IFORS, August.

Lysgaard, J., Letchford, A. N. & Eglese, R. W. (1999). A Branch and Cut algorithm for the Vehicle Routing Problem. Paper presented at Symposium über Operations Research, September.

Lysgaard, J. (1998). Application of Set Partitioning to a Real-World Vehicle Routing Problem. Paper presented at 10th Annual Nordic Logistics Conference. Proceedings of the 10th Annual Nordic Logistics Conference, Espoo, Finland.

Lysgaard, J. (2002). Optimizing vehicle routes with non-additive costs: A case study. Paper presented at IFORS 2002: The sixteenth triennial conference of the International Federation of Operational Research Societies, Edinburgh, UK.

Lysgaard, J. (2003). Exact solution of the CVRP for a given set of seed customers: a branch-and-bound approach. Paper presented at ISMP, Copenhagen, Denmark.

Lysgaard, J. (1995). A 2-phase shortest path algorithm for networks with node coordinates. European Journal of Operational Research, 87(2), 368-374. http://elin.lub.lu.se/cgi-bin/linker/link/asb/elsevier/03772217_1995_87_2_368-374/0377-2217(94)00152-3

Lysgaard, J. (1992). Dynamic Transportation Networks in Vehicle Routing and Scheduling. Interfaces, 22(3), 45-55.

Lysgaard, J. (2006). Reachability Cuts for the Vehicle Routing Problem with Time Windows. European Journal of Operational Research, 175(1), 210-233. https://doi.org/10.1016/j.ejor.2005.04.022

Lysgaard, J. (2008). The Pyramidal Capacitated Vehicle Routing Problem. Aarhus School of Business, Aarhus University, CORAL - Centre for Operations Research Applications in Logistics.

Lysgaard, J., López Sánchez, A. D. & Hernández-Díaz, A. G. (2020). A matheuristic for the MinMax capacitated open vehicle routing problem. International Transactions in Operational Research, 27(1), 394-417. https://doi.org/10.1111/itor.12581

Lohse, S. R., Farkas, D. K., Lohse, N., Skouby, S. O., Nielsen, F. E., Lash, T. L. & Ehrenstein, V. (2010). Validation of spontaneous abortion diagnoses in the Danish National Registry of Patients. Clinical epidemiology, 2, 247-50. https://doi.org/10.2147/CLEP.S13815

Liu, Y. & Li, H. (2014). A FTA-based method for risk decision-making in emergency response. Computers & Operations Research, 42, 49-57. https://doi.org/10.1016/j.cor.2012.08.015

Li, H., Hendry, L. & Teunter, R. (2009). A strategic capacity allocation model for a complex supply chain: Formulation and solution approach comparison. International Journal of Production Economics, 121(2), 505-518. https://doi.org/10.1016/j.ijpe.2007.02.033

Li, H. & Meissner, J. (2009). Capacitated Dynamic Lot Sizing with Capacity Acquisition. Aarhus School of Business, Aarhus University, Department of Business Studies.

Li, H. & Meissner, J. (2011). Capacitated dynamic lot sizing with capacity acquisition. International Journal of Production Research, 49(16), 4945-4963. https://doi.org/10.1080/00207543.2010.518991

Li, Y., Fan, Z. & Li, H. (2007). Value-adding time, approach to business process reengineering. Paper presented at Proceedings of the 4th Asia Pacific Decision Science Institute Conference' Shanghai, Shanghai, China.

Li, H. & Meissner, J. (2011). Competition under capacitated dynamic lot-sizing with capacity acquisition. International Journal of Production Economics, 131(2), 535–544. https://doi.org/10.1016/j.ijpe.2011.01.022

Li, H. J., You, T. & Luo, X. (2011). Collaborative supply chain planning under dynamic lot sizing costs with capacity decision. Journal of Systems Engineering and Electronics, 22(2), 247-256. https://doi.org/10.3969/j.issn.1004-4132.2011.02.010

Li, H. J. & Meissner, J. (2018). Capacity Optimization and Competition with Cyclical and Lead-Time-Dependent Demands. Annals of Operations Research, 271(2), 737-763. https://doi.org/10.1007/s10479-018-2773-7

Li, H. & Deng, S. (2019). A game-theoretical analysis of joint-rebate strategies in platform-based retailing systems. EURO Journal on Decision Processes, 7(1-2), 117-150. https://doi.org/10.1007/s40070-018-0091-6

Letchford, A. N. & Sørensen, M. M. (2012). Binary Positive Semidefinite Matrices and Associated Integer Polytopes. Mathematical Programming, 131(1-2), 253-271. https://doi.org/10.1007/s10107-010-0352-z

Letchford, A. N., Eglese, R. W. & Lysgaard, J. (1998). Multistar inequalities for the vehicle routing problem.

Letchford, A. N., Eglese, R. W. & Lysgaard, J. (2002). Multistars, partial multistars and the capacitated vehicle routing problem. Mathematical Programming, A 94(1), 21-40. http://link.springer.de/link/service/journals/10107/papers/2094001/20940021.pdf

Letchford, A. N., Lysgaard, J. & Eglese, R. W. (2006). A Branch-and-Cut Algorithm for the Capacitated Open Vehicle Routing Problem. Aarhus School of Business, Department of Business Studies.

Letchford, A. N., Lysgaard, J. & Eglese, R. W. (2007). A branch-and-cut algorithm for the capacitated open vehicle routing problem. Journal of the Operational Research Society, 58(12, dec), 1642-1651. https://doi.org/10.1057/palgrave.jors.2602345

Larsen, C. (1998). Investigating the sensitivity and the impact of information on pricing decisions in an M/M/1 queuing model. International Journal of Production Economics, 56-57, 365-377. http://www.sciencedirect.com/science?_ob=MImg&_imagekey=B6VF8-3WWMCPK-14-1&_cdi=6004&_user=745831&_orig=search&_coverDate=09%2F20%2F1998&_sk=999439999&view=c&wchp=dGLbVtz-zSkzS&_valck=1&md5=b926477e1c8996a164ae0ac11bbc77f3&ie=/sdarticle.pdf

Larsen, C. (1997). Using a variable production rate as a response mechanism in the economic production lot size model. Journal of the Operational Research Society, 48, 97-99.

Larsen, C. (1992). Tilpasning til ny teknologi: nogle normative bidrag. Ledelse og Erhvervsoekonomi, 4, 195-202.

Larsen, C. (1990). Aspects of global non-convex optimization. Aarhus Universitet, Afdeling for Operationsanalyse. Uden navn

Larsen, C. (1990). Modelling aspects and solution procedures for an activity model having economies and diseconomies of scale.

Larsen, C., Seiding, C. H., Teller, C. & Thorstenson, A. (2007). An inventory control project in a major Danish company using compound renewal demand models. Aarhus School of Business, Aarhus University, Department of Business Studies.

Larsen, C. & Kiesmüller, G. P. (2007). Developing a closed-form cost expression for an (R, s, nQ) policy where the demand process is compound generalized Erlang. Operations Research Letters, 35(5), 567-572. https://doi.org/10.1016/j.orl.2006.11.002

Larsen, C., Seiding, C. H., Teller, C. & Thorstenson, A. (2008). An inventory control project in a major Danish company using compound renewal demand models. IMA Journal of Management Mathematics, 19, 145-162. http://www.oxfordjournals.org/our_journals/imaman/editors_choice.html

Larsen, C. (2008). Derivation of confidence intervals of service measures in a base-stock inventory control system with low-frequent demand. Aarhus School of Business, Aarhus University, CORAL - Centre for Operations Research Applications in Logistics.

Larsen, C. (2008). Comments to Özkaya et al. (2006). Aarhus School of Business, Aarhus University, CORAL - Centre for Operations Research Applications in Logistics.

Larsen, C. (2009). The Q(s,S) control policy for the joint replenishment problem extended to the case of correlation among item-demands. International Journal of Production Economics, 118(1), 292-297. https://doi.org/10.1016/j.ijpe.2008.08.025

Displaying results 301 to 350 out of 531

Revised 25.06.2021 -

Birgitte Højklint Nielsen