Find

Department of Economics and Business Economics

Research publications

Sort by: Date | Author | Title

Johansen, S. G. & Thorstenson, A. (2010). Value-based Q(s,S) policy for joint replenishments. Paper presented at LCCC Theme Semester 2010 Workshop on Distributed Model Predictive Control and Supply Chains, Lund, Sweden.

Johansen, S. G. (2005). Base-stock policies for the lost sales inventory system with Poisson demand and Erlangian lead times. International Journal of Production Economics, 93-94, 429-437.

Johansen, S. G. (2002). Production-to-order pricing based on renewal-reward optimization.

Johansen, S. G. (2001). Pure and modified base-stock policies for the lost sales inventory system with negligible set-up costs and constant lead times. International Journal of Production Economics, 71, 391-399.

Johansen, S. G. & Larsen, C. (2001). Computation of a near-optimal service policy for a single-server queue with homogeneous jobs. European Journal of Operational Research, 134(3), 648-663. https://doi.org/10.1016/S0377-2217(00)00290-3

Johansen, S. G. & Melchiors, P. (2003). Can-order policy for the periodic-review joint replenishment problem. Journal of the Operational Research Society, 54(3), 283-290.

Johansen, S. G. & Thorstenson, A. (2004). The (r,q) policy for the lost-sales inventory system when more than one order may be outstanding. Department of Business Studies, Aarhus School of Business.

Johansen, S. G. & Thorstenson, A. (2008). Optimal base-stock policy for the inventory system with periodic review, backorders and sequantial lead times. International Journal of Inventory Research, 1(1), 44-52. http://www.inderscience.com/storage/f461078329125111.pdf

Johansen, S. G. & Larsen, C. (2000). Computation of a near-optimal service policy for a single-server queue with homogeneous jobs.

Johansen, S. G. & Thorstenson, A. (2004). The (r,q) policy for the lost-sales inventory system when more than one order may be outstanding. http://www.hha.dk/afl/wp/log/L_2004_03.pdf

Johansen, S. G. & Larsen, C. (2001). Computation of a near-optimal service policy for a single-server queue with homogeneous jobs. European Journal of Operational Research, 134(3), 648-663.

Johansen, S. G. & Thorstenson, A. (2006). Note: Optimal base-stock policy for the inventory system with periodic review, backorders and sequential lead times. (pp. 10). Aarhus School of Business, Department of Business Studies.

Johansen, S. G. & Thorstenson, A. (1996). Optimal (r,Q) Inventory Policies with Lost Sales and Poisson Demands: Discounted and Undiscounted Cases. International Journal of Production Economics, 46-47, 359-371.

Johansen, S. G. & Thorstenson, A. (2006). Value-based Q(s, S) policy for joint replenishments. Paper presented at 14th International Symposium on Inventories, Budapest, Hungary.

Johansen, S. G. & Thorstenson, A. (2008). Pure and restricted base-stock policies for the lost-sales inventory system with periodic review and constant lead times. Paper presented at 15th International Symposium on Inventories, Budapest, Hungary.

Johansen, S. G. (2013). Modified base-stock policies for continuous-review, lost-sales inventory models with Poisson demand and a fixed lead time. International Journal of Production Economics, 143(2), 379-384. https://doi.org/10.1016/j.ijpe.2012.02.021

Johansen, S. G. & Thorstenson, A. (2014). Emergency orders in the periodic-review inventory system with fixed ordering costs and compound Poisson demand. International Journal of Production Economics, 157, 147-157. https://doi.org/10.1016/j.ijpe.2014.07.013

Johansen, S. G. (2019). Emergency orders in the periodic-review inventory system with fixed ordering costs and stochastic lead times for normal orders. International Journal of Production Economics, 209, 205-214. https://doi.org/10.1016/j.ijpe.2018.01.017

Johansen, S. G. (2021). The Markov model for base-stock control of an inventory system with Poisson demand, non-crossing lead times and lost sales. International Journal of Production Economics, 231, [107913]. https://doi.org/10.1016/j.ijpe.2020.107913

Jenny Li, H. & Thorstenson, A. (2014). A multi-phase algorithm for a joint lot-sizing and pricing problem with stochastic demands. International Journal of Production Research, 1-18. https://doi.org/10.1080/00207543.2013.864053

Jaeger, G. & Turkensteen, M. (2018). Extending single tolerances to set tolerances. Discrete Applied Mathematics, 247, 197-215. https://doi.org/10.1016/j.dam.2018.03.053

Islam, N., Wong, H. & Naim, M. (2009). Building a New Readiness Framework for Managing the Emergent Micro and Nanomanufacturing Technologies. Paper presented at 4th Europeaan Conference on Management of Technology (EuroMOT), Glasgow, United Kingdom.

Hvolby, H-H. & Thorstenson, A. (2000). Performance Indicators in Small and Medium-sized Enterprises.

Hvolby, H-H. & Thorstenson, A. (2000). Production Characteristics and Performance Measurements - Results From a Survey of Danish SMEs.

Hvolby, H-H. & Thorstenson, A. (2002). Focused versus diversified logistics performance measurement in small and medium-sized enterprises.

Hvolby, H-H. & Thorstenson, A. (2001). Indicators for performance measurement in small and medium-sized enterprises. Proceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture, 215(B8), 1143-1146.

Hvolby, H-H. & Thorstenson, A. (2000). Performance Measurement in Small and Medium-sized Enterprises. In Proceedings ed.by T.B. Fox and D. Steeple (pp. s. 324-332)

Hvolby, H-H. & Thorstenson, A. (2001). Production Characteristics and Performance Measurements - Results from A Survey of Danish SMEs. In Logistics Changes in the New Century (pp. 340-358). Aarhus School of Business, Department of Management Science and Logistics.

Hill, R. M. & Johansen, S. G. (2006). Optimal and near-optimal policies for lost sales inventory models with at most one replenishment order outstanding. European Journal of Operational Research, 169(1), 111-132.

Görtz, S. & Klose, A. (2009). Analysis of some greedy algorithms for the single-sink fixed-charge transportation problem. Journal of Heuristics, 15(4), 331-349. https://doi.org/10.1007/s10732-007-9065-8

Görtz, S. & Klose, A. (2009). A subgradient-based branch-and-bound algorithm for the capacitated facility location problem. Department of Mathematical Sciences, Aarhus University. http://www.imf.au.dk/publs?id=702

Görtz, S. & Klose, A. (2012). A simple but usually fast branch-and-bound algorithm for the capacitated facility location problem. INFORMS Journal on Computing, 24(4), 597-610. https://doi.org/10.1287/ijoc.1110.0468

Grubbström, R. W. & Thorstenson, A. (1986). Evaluation of Capital Costs in a Multi-Level Inventory System By Means of the Annuity Stream Principle. European Journal of Operational Research, 24(1), 136-145.

Goldengorin, B., Sierksma, G. & Turkensteen, M. (2004). Tolerance Based Algorithms for the ATSP Graph-Theoretic Concepts in Computer Science. In J. Hromkovic, M. Nagl & B. Westfechtel (Eds.), Lecture Notes in Computer Science 3353 (pp. 222-234)

Goertz, S. & Klose, A. (2007). The single-sink fixed-charge transportation problem: Applications and solution methods. In Management logistischer Netzwerke: Entscheidungsunterstützung, Informationssysteme und OR-Tools (pp. 383-406). Physica-Verlag.

Germs, R., Goldengorin, B. & Turkensteen, M. (2012). Lower tolerance-based Branch and Bound algorithms for the ATSP. Computers & Operations Research, 39(2), 291–298. https://doi.org/10.1016/j.cor.2011.04.003

Gadegaard, S. L. (2016). Discrete Location Problems – Theory, Algorithms, and Extensions to Multiple Objectives. Institut for Økonomi, Aarhus Universitet. ECON PhD Dissertations No. 2016-11

Gadegaard, S. L. (2016). Integrating cut-and-solve and semi-Lagrangean based dual ascent for the single-source capacitated facility location problem. Department of Economics and Business Economics, School of Business and Social Sciences, Aarhus University. http://www.optimization-online.org/DB_HTML/2016/04/5415.html

Gadegaard, S. L., Ehrgott, M. & Nielsen, L. R. (2016). Bi-objective branch-and-cut algorithms: Applications to the single source capacitated facility location problem. Aarhus Universitet. http://www.optimization-online.org/DB_HTML/2016/04/5402.html

Gadegaard, S. L., Klose, A. & Nielsen, L. R. (2018). A bi-objective approach to discrete cost-bottleneck location problems. Annals of Operations Research, 267(1-2), 179-201. https://doi.org/10.1007/s10479-016-2360-8

Gadegaard, S. L., Klose, A. & Nielsen, L. R. (2018). An improved cut-and-solve algorithm for the single-source capacitated facility location problem. EURO Journal on Computational Optimization, 6(1), 1-27. https://doi.org/10.1007/s13675-017-0084-4

Gadegaard, S. L., Klose, A. & Nielsen, L. R. (2017, Mar 7). A solver for the single source capacitated facility location problem. GitHub. https://github.com/SuneGadegaard/SSCFLPsolver

Gadegaard, S. L., Nielsen, L. R. & Ehrgott, M. (2019). Bi-objective branch-and-cut algorithms based on LP relaxation and bound sets. INFORMS Journal on Computing, 31(4), 790-804. https://doi.org/10.1287/ijoc.2018.0846

Gadegaard, S. L. & Lysgaard, J. (2021). A symmetry-free polynomial formulation of the capacitated vehicle routing problem. Discrete Applied Mathematics, 296, 179-192. https://doi.org/10.1016/j.dam.2020.02.012

Gadegaard, S. L. & Desmorais Salomonsen, H. (2020). Kan man regne sig frem til bedre normeringer i børnehaver? Videnskab.dk [online]. https://videnskab.dk/kultur-samfund/kan-man-regne-sig-frem-til-bedre-minimumsnormeringer-i-boernehaver

Gadegaard, S. L., Relund, L., Forget, N. J., Klamroth, K. & Przybylski, A. (2020). Branch-and-bound and objective branching with three objectives. optimization-online.org.

Fukasawa, R., Lysgaard, J., Aragão, M. P. D., Reis, M., Uchoa, E. & Werneck, R. F. (2004). Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem. In Proceedings, Lecture Notes in Computer Science, vol. 3064 / G. Nemhauser & D. Bienstock (eds) Springer.

Fukasawa, R., Longo, H., Lysgaard, J., Poggi de Aragão, M., Reis, M., Uchoa, E. & Werneck, R. F. (2006). Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem. Mathematical Programming, 106(3), 491-511. http://elin.lub.lu.se/elin?func=jorToc&issn=00255610&lang=dk

Freixas, J., Molinero, X., Olsen, M. & Serna, M. (2010). Completeness on Simple Games. Paper presented at GTM 2010 - The Fourth International Conference on Game Theory And Management, Sankt Petersborg, Russian Federation. http://www.gsom.pu.ru/en/gtm2010/

Freixas, J., Molinero, X., Olsen, M. & Serna, M. (2011). On the Complexity of Problems on Simple Games. R A I R O - Operations Research, 45, 295-314. https://doi.org/10.1051/ro/2011115

Displaying results 401 to 450 out of 531

9

Revised 25.06.2021 -

Birgitte Højklint Nielsen