Find

Department of Economics and Business Economics

Research publications

Sort by: Date | Author | Title

Sørensen, M. M. (2005). Polyhedral Computations for the Simple Graph Partitioning Problem. Aarhus School of Business, Department of Accounting, Finance and Logistics.

Sørensen, M. M. & Letchford, A. N. (2008). Binary positive semidefinite matrices and associated integer polytopes. Lecture Notes in Computer Science, 125-139. https://doi.org/10.1007/978-3-540-68891-4

Sørensen, M. M. & Letchford, A. N. (2014). A new separation algorithm for the Boolean quadric and cut polytopes. Discrete Optimization, 14, 61-71. https://doi.org/10.1016/j.disopt.2014.07.002

Sørensen, M. M. (2017). Facets for node-capacitated multicut polytopes from path-block cycles with two common nodes. Discrete Optimization, 25, 120-140. https://doi.org/10.1016/j.disopt.2017.03.001

Skaksen, L. & Wøhlk, S. (2009). OR er også for små virksomheder. ORbit, (15), 24-28.

Severini , L., Olsen, M. & D'Angelo, G. (2019). Coverage Centrality Maximization in Undirected Networks. Proceedings of the AAAI Conference on Artificial Intelligence, 33(1), 501-508. https://doi.org/10.1609/aaai.v33i01.3301501

Sajadieh, M. S., Thorstenson, A. & Akbari Jokar, M. R. (2009). Comparing sourcing strategies in two-echelon supply chains. Aarhus School of Business, Aarhus University, Department of Business Studies.

Sajadieh, M. S., Thorstenson, A. & Akbari Jokar, M. R. (2010). An integrated vendor-buyer model with stock-dependent demand. Transportation Review. Part E: Logistics and Transportation Review, 46(6), 963-974. https://doi.org/10.1016/j.tre.2010.01.007

Sajadieh, M. S., Thorstenson, A. & Akbari Jokar, M. R. (2009). Comparing Four Sourcing Scenarios in a Two-echelon Supply Chain. In C. Chi Kin (Ed.), Proceedings Second International Workshop on Successful Strategies in Supply Chain Management (pp. 281-288). The Hong Kong Polytechnic University.

Sajadieh, M. S., Thorstenson, A. & Akbari Jokar, M. R. (2009). An integrated vendor-buyer model with stock-dependent demand. Aarhus School of Business, Aarhus University, Department of Business Studies.

Sajadieh, M. S. & Thorstenson, A. (2014). Comparing sourcing strategies in two-echelon supply chains. Computers & Operations Research, 45(May), 108–115. https://doi.org/10.1016/j.cor.2013.12.006

Sajadieh, M. S. & Larsen, C. (2015). A coordinated manufacturer-retailer model under stochastic demand and production rate. International Journal of Production Economics, 168(October), 64-70. https://doi.org/10.1016/j.ijpe.2015.06.013

Rauff Lind Christensen, T., Klose, A. & Andersen, K. A. (2010). Solving the Single-Sink, Fixed-Charge, Multiple-Choice Transportation Problem by Dynamic Programming. Abstract from 4th Nordic Optimization Symposium, Aarhus, Denmark. http://www.asb.dk/article.aspx?pid=25146

Rapp, B. & Thorstenson, A. (1983). Product Variants and the Turnover Rate. International Journal of Production Research, 21(4).

Pretolani, D., Nielsen, L. R., Andersen, K. A. & Ehrgott, M. (2008). Time-adaptive versus history-adaptive strategies for multicriterion routing in stochastic time-dependent networks. Aarhus School of Business, Aarhus University, CORAL - Centre for Operations Research Applications in Logistics.

Pretolani, D., Nielsen, L. R., Andersen, K. A. & Ehrgott, M. (2009). Time-adaptive and history-adaptive multicriterion routing in stochastic, time-dependent networks. Operations Research Letters, 37(3), 201-205. https://doi.org/10.1016/j.orl.2009.02.001

Pretolani, D., Nielsen, L. R. & Andersen, K. (2006). A note on "Multicriteria adaptive paths in stochastic, time-varying networks". In Working Paper L-2006-11

Pourmoayed, R., Nielsen, L. R. & Kristensen, A. R. (2016). A hierarchical Markov decision process modeling feeding and marketing decisions of growing pigs. European Journal of Operational Research, 250(3), 925-938. https://doi.org/10.1016/j.ejor.2015.09.038

Pourmoayed, R. & Nielsen, L. R. (2016). Culling pigs under price fluctuations. Orbit, (27).

Pourmoayed, R. & Nielsen, L. R. (2019). An approximate dynamic programming approach for sequential pig marketing decisions at herd level. European Journal of Operational Research, 276(3), 1056-1070. https://doi.org/10.1016/j.ejor.2019.01.050

Pontoppidan, I. C. & Nielsen, S. (2004). Economic value added & shareholder value - når økonomistyringen skal kobles til eksterne nøgletal. Samfundslederskab i Skandinavien, (1), 73-82.

Pedersen, C. R., Nielsen, L. R. & Andersen, K. A. (2008). The Bicriterion Multi Modal Assignment Problem: Introduction, Analysis, and Experimental Results. INFORMS Journal on Computing, 20(3), 400-411. https://doi.org/10.1287/ijoc.1070.0253

Pedersen, C. R., Nielsen, L. R. & Andersen, K. A. (2008). An algorithm for ranking assignments using reoptimization. Computers & Operations Research, 35(11), 3714-3726. https://doi.org/10.1016/j.cor.2007.04.008

Pedersen, C. R., Nielsen, L. R. & Andersen, K. A. (2005). On the Bicriterion Multi Modal Assignment Problem. In WP-2005-2

Pedersen, C. R., Nielsen, L. R. & Andersen, K. A. (2005). A note on ranking assignments using reoptimization. In WP-2005-3

Pedersen, C. R., Nielsen, L. R. & Andersen, K. A. (2010). Erratum to "An algorithm for ranking assignments using reoptimization" [Computers & Operations Research 35 (2008) 3714-3726]. Computers & Operations Research, 37(2), 426-427. https://doi.org/10.1016/j.cor.2009.04.009

Olsen, K. A., Sætre, P. & Thorstenson, A. (1997). A Procedure-Oriented Generic Bill of Materials. Computers & Industrial Engineering, 32(1), 29-45.

Olsen, M. (2007). Nash Stability in Additively Separable Hedonic Games is NP-hard. In Computation and Logic in the Real World (4497 of Lecture Notes in Computer Science ed., Vol. 4497/2007, pp. 598 - 605). Springer.

Olsen, M. (2008). Communities in Large Networks: Identification and Ranking. Lecture Notes in Computer Science, 4936, 84-96.

Olsen, M. (2008). The Computational Complexity of Link Building. Lecture Notes in Computer Science, 5092, 119-129.

Olsen, M. (2009). Nash Stability in Additively Separable Hedonic Games and Community Structures. Theory of Computing Systems, 45(4), 917-925. https://doi.org/10.1007/s00224-009-9176-8

Olsen, M. (2009). Link Building. Aarhus Universitetsforlag.

Olsen, M. (2010). Maximizing PageRank with New Backlinks. Lecture Notes in Computer Science, 6078, 37-48. https://doi.org/10.1007/978-3-642-13073-1_5

Olsen, M., Viglas, A. & Zvedeniouk, I. (2010). A Constant-Factor Approximation Algorithm for the Link Building Problem. Lecture Notes in Computer Science, 6509, 87-96.

Olsen, M. (2012). On Defining and Computing Communities. Conferences in Research and Practice in Information Technology, 128, 97-102.

Olsen, M., Bækgaard, L. & Tambo, T. (2012). On non-trivial Nash stable partitions in additive hedonic games with symmetric 0/1-utilities. Information Processing Letters, 112(23), 903-907. https://doi.org/10.1016/j.ipl.2012.08.016

Olsen, M. & Viglas, A. (2014). On the Approximability of the Link Building Problem. Theoretical Computer Science, 518, 96-116. https://doi.org/10.1016/j.tcs.2013.08.003

Olsen, M. (2013). A General View on Computing Communities. Mathematical Social Sciences, 66(3), 331-336. https://doi.org/10.1016/j.mathsocsci.2013.07.002

Olsen, M. & Revsbæk, M. (2013). On Alliance Partitions and Bisection Width for Planar Graphs. Journal of Graph Algorithms and Applications, 17(6), 599-614. https://doi.org/10.7155/jgaa.00307

Olsen, M. & Revsbæk, M. (2013). Alliances and Bisection Width for Planar Graphs. In S. K. Ghosh & T. Tokuyama (Eds.), WALCOM: Algorithms and Computation: 7th International Workshop, WALCOM 2013, Kharagpur, India, February 14-16, 2013. Proceedings (pp. 206-216). Springer VS. Lecture Notes in Computer Science Vol. 7748 https://doi.org/10.1007/978-3-642-36065-7_20

Olsen, M. (2013). On the Complexity of Computing Optimal Private Park-and-Ride Plans. In D. Voss, S. Jensen & R. Møller (Eds.), Computational Logistics: 4th International Conference, ICCL 2013, Copenhagen, Denmark, September 25-27, 2013, Proceedings (pp. 73-82). Springer. Lecture Notes in Computer Science Vol. 8197 https://doi.org/10.1007/978-3-642-41019-2_6

Olsen, M. & Gross, A. (2014). Average Case Analysis of Blocks Relocation Heuristics. In R. G. González-Ramírez , F. Schulte , S. Voß & J. A. Ceroni Diaz (Eds.), Computational Logistics: 5th International Conference, ICCL 2014, Valparaiso, Chile, September 24-26, 2014. Proceedings (pp. 81-92). Springer. Lecture Notes in Computer Science Vol. 8760 https://doi.org/10.1007/978-3-319-11421-7_6

Olsen, M. & Gross, A. (2015). Probabilistic Analysis of Online Stacking Algorithms. In Computational Logistics: 6th International Conference, ICCL 2015 (Vol. 9335, pp. 358-369). Springer VS. Lecture Notes in Computer Science https://doi.org/10.1007/978-3-319-24264-4_25

Olsen, M., Kurz, S. & Molinero, X. (2016). On the Construction of High-Dimensional Simple Games. In ECAI 2016 (Vol. 285). IOS Press. Frontiers in Artificial Intelligence and Applications https://doi.org/10.3233/978-1-61499-672-9-880

Olsen, M. (2017). On Covering Codes and Upper Bounds for the Dimension of Simple Games. In Procedings of the Thirty-First AAAI Conference on Artiificial Intelligence (Vol. 1) http://aaai.org/ocs/index.php/AAAI/AAAI17/paper/view/14511

Olsen, M. & Andersen, L. N. (2018). Towards Asymptotically Optimal One-to-One PDP Algorithms for Capacity 2+ Vehicles. In International Conference on Computational Logistics ICCL 2018: Computational Logistics (pp. 268-278). Springer. Lecture Notes in Computer Science https://link.springer.com/chapter/10.1007/978-3-030-00898-7_17

Olsen, M. (2020). Online Stacking Using RL with Positional and Tactical Features. In I. S. Kotsireas & P. M. Pardalos (Eds.), Learning and Intelligent Optimization - 14th International Conference, LION 14, 2020, Revised Selected Papers: LION 2020 (pp. 184-194). Springer. Lecture Notes in Computer Science Vol. 12096 https://doi.org/10.1007/978-3-030-53552-0_19

Nonås, S. L. & Thorstenson, A. (2008). Solving a combined cutting-stock and lot-sizing problem with a column generating procedure. Computers & Operations Research, 35(10, October), 3371-3392. https://doi.org/10.1016/j.cor.2007.03.005

Nonås, S. L. & Thorstenson, A. (2001). Solving a Combined Cutting-stock and Lot-sizing Problem with a Column-generating Procedure.

Nonås, S. L. & Thorstenson, A. (2000). A Combined Cutting-stock and Lot-sizing Problem. European Journal of Operational Research, 120(2), 327-342. http://www.baser.dk/login?url=http://www.sciencedirect.com/science?_ob=MImg&_imagekey=B6VCT-3Y9HFD0-9-1&_cdi=5963&_user=745831&_pii=S0377221799001605&_orig=search&_coverDate=01%2F16%2F2000&_sk=998799997&view=c&wchp=dGLbVtz-zSkzS&_valck=1&md5=2039e822aca9cdd8ac87f12f7c4df56d&ie=/sdarticle.pdf

Displaying results 101 to 150 out of 531

3

Revised 25.06.2021 -

Birgitte Højklint Nielsen