default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLars Magnus Hvattum
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j59]Jørgen Skålnes
, Mohamed Ben Ahmed, Lars Magnus Hvattum, Magnus Stålhane:
New benchmark instances for the inventory routing problem. Eur. J. Oper. Res. 313(3): 992-1014 (2024)- [c7]Jirí Sgall, János Balogh, József Békési, György Dósa, Lars Magnus Hvattum, Zsolt Tuza:
No Tiling of the 70 × 70 Square with Consecutive Squares. FUN 2024: 28:1-28:16 - 2023
- [j58]Homayoun Shaabani, Arild Hoff, Lars Magnus Hvattum, Gilbert Laporte:
A matheuristic for the multi-product maritime inventory routing problem. Comput. Oper. Res. 154: 106214 (2023) - [j57]Mohamed Ben Ahmed, Lars Magnus Hvattum, Agostinho Agra:
The effect of different mathematical formulations on a matheuristic algorithm for the production routing problem. Comput. Oper. Res. 155: 106232 (2023) - [j56]Gyula Abraham, György Dósa, Lars Magnus Hvattum, Tomas Olaj, Zsolt Tuza:
The board packing problem. Eur. J. Oper. Res. 308(3): 1056-1073 (2023) - [j55]Kjetil Fagerholt, Lars Magnus Hvattum, Dimitri J. Papageorgiou, Sebastián Urrutia:
Maritime inventory routing: recent trends and future directions. Int. Trans. Oper. Res. 30(6): 3013-3056 (2023) - [j54]Sahar Moazzeni, Sobhan Mostafayi Darmian, Lars Magnus Hvattum:
Multiple criteria decision making and robust optimization to design a development plan for small and medium-sized enterprises in the east of Iran. Oper. Res. 23(1): 13 (2023) - 2022
- [j53]Mohamed Ben Ahmed, Maryia Hryhoryeva, Lars Magnus Hvattum, Mohamed Haouari:
A matheuristic for the robust integrated airline fleet assignment, aircraft routing, and crew pairing problem. Comput. Oper. Res. 137: 105551 (2022) - [j52]Lars Magnus Hvattum:
Adjusting the order crossover operator for capacitated vehicle routing problems. Comput. Oper. Res. 148: 105986 (2022) - [j51]Håkon Bentsen, Arild Hoff, Lars Magnus Hvattum:
Exponential extrapolation memory for tabu search. EURO J. Comput. Optim. 10: 100028 (2022) - [j50]Filipe Rodrigues, Agostinho Agra, Lars Magnus Hvattum, Cristina Requejo:
Weighted iterated local branching for mathematical programming problems with binary variables. J. Heuristics 28(3): 329-350 (2022) - [j49]Håkon Bentsen, Lars Magnus Hvattum:
Variable neighbourhood search for binary integer programming problems. Int. J. Metaheuristics 8(1): 1-26 (2022) - [j48]Mohamed Ben Ahmed, Onyemaechi Linda Okoronkwo, Edwin Chimezie Okoronkwo, Lars Magnus Hvattum:
Long-term effects of short planning horizons for inventory routing problems. Int. Trans. Oper. Res. 29(5): 2995-3030 (2022) - [j47]János Balogh, György Dósa, Lars Magnus Hvattum, Tomas Olaj, Zsolt Tuza:
Guillotine cutting is asymptotically optimal for packing consecutive squares. Optim. Lett. 16(9): 2775-2785 (2022) - [j46]Jaroslav Pluskal, Radovan Somplák, Dusan Hrabec, Vlastimír Nevrlý, Lars Magnus Hvattum:
Optimal location and operation of waste-to-energy plants when future waste composition is uncertain. Oper. Res. 22(5): 5765-5790 (2022) - 2021
- [j45]Are Denstad, Einar Ulsund, Marielle Christiansen, Lars Magnus Hvattum, Gregorio Tirado:
Multi-objective optimization for a strategic ATM network redesign problem. Ann. Oper. Res. 296(1): 7-33 (2021) - [j44]Renata Turkes, Kenneth Sörensen, Lars Magnus Hvattum:
Meta-analysis of metaheuristics: Quantifying the effect of adaptiveness in adaptive large neighborhood search. Eur. J. Oper. Res. 292(2): 423-442 (2021) - [j43]Rodrigo Ferreira da Silva, Sebastián Urrutia, Lars Magnus Hvattum:
Extended high dimensional indexing approach for reachability queries on very large graphs. Expert Syst. Appl. 181: 114962 (2021) - [j42]Filipe Rodrigues, Agostinho Agra, Lars Magnus Hvattum, Cristina Requejo:
Weighted proximity search. J. Heuristics 27(3): 459-496 (2021) - [j41]Heber F. Amaral, Sebastián Urrutia, Lars Magnus Hvattum:
Delayed improvement local search. J. Heuristics 27(5): 923-950 (2021) - [j40]Lars Magnus Hvattum, Garry A. Gelade:
Comparing bottom-up and top-down ratings for individual soccer players. Int. J. Comput. Sci. Sport 20(1): 23-42 (2021) - [j39]Magnus Stålhane, Kamilla Hamre Bolstad, Manu Joshi, Lars Magnus Hvattum:
A dual-level stochastic fleet size and mix problem for offshore wind farm maintenance operations. INFOR Inf. Syst. Oper. Res. 59(2): 257-289 (2021) - [i1]Andreas Groll, Lars Magnus Hvattum, Christophe Ley, Franziska Popp, Gunther Schauberger, Hans Van Eetvelde, Achim Zeileis:
Hybrid Machine Learning Forecasts for the UEFA EURO 2020. CoRR abs/2106.05799 (2021) - 2020
- [j38]Sobhan Mostafayi Darmian, Sahar Moazzeni, Lars Magnus Hvattum:
Multi-objective sustainable location-districting for the collection of municipal solid waste: Two case studies. Comput. Ind. Eng. 150: 106965 (2020) - [j37]Line Eide, Gro Cesilie Håhjem Årdal, Nataliia Evsikova, Lars Magnus Hvattum, Sebastián Urrutia:
Load-dependent speed optimization in maritime inventory routing. Comput. Oper. Res. 123: 105051 (2020) - [j36]Anatol Husakou, Lars Magnus Hvattum, Ketil Danielsen, Arild Hoff:
An application of the multi-depot heterogeneous fixed fleet open vehicle routing problem. Int. J. Adv. Oper. Manag. 12(2): 142-155 (2020) - [c6]Jørgen Skålnes, Lars Dahle, Henrik Andersson, Marielle Christiansen, Lars Magnus Hvattum:
The Multistage Stochastic Vehicle Routing Problem with Dynamic Occasional Drivers. ICCL 2020: 261-276
2010 – 2019
- 2019
- [j35]Filipe Rodrigues, Agostinho Agra, Marielle Christiansen, Lars Magnus Hvattum, Cristina Requejo:
Comparing techniques for modelling uncertainty in a maritime inventory routing problem. Eur. J. Oper. Res. 277(3): 831-845 (2019) - [j34]Lars Magnus Hvattum:
A comprehensive review of plus-minus ratings for evaluating individual players in team sports. Int. J. Comput. Sci. Sport 18(1): 1-23 (2019) - [j33]A. S. Wiig, E. M. Håland, Magnus Stålhane, Lars Magnus Hvattum:
Analyzing passing networks in association football based on the difficulty, risk, and potential of passes. Int. J. Comput. Sci. Sport 18(3): 44-68 (2019) - 2018
- [j32]Alberto Santini, Stefan Ropke, Lars Magnus Hvattum:
A comparison of acceptance criteria for the adaptive large neighbourhood search metaheuristic. J. Heuristics 24(5): 783-815 (2018) - [j31]Agostinho Agra, Marielle Christiansen, Lars Magnus Hvattum, Filipe Rodrigues:
Robust Optimization for a Maritime Inventory Routing Problem. Transp. Sci. 52(3): 509-525 (2018) - [c5]Anna Zaitseva, Lars Magnus Hvattum, Sebastián Urrutia:
Profit Maximization in Inventory Routing Problems. IEEM 2018: 1230-1234 - 2017
- [j30]Geir Hasle, Lars Magnus Hvattum, David L. Woodruff:
Preface: logistics, optimization and transportation - in memory of the late Arne Løkketangen. Ann. Oper. Res. 253(2): 709-711 (2017) - [j29]Gregorio Tirado, Lars Magnus Hvattum:
Improved solutions to dynamic and stochastic maritime pick-up and delivery problems using local search. Ann. Oper. Res. 253(2): 825-843 (2017) - [j28]Anders N. Gullhav, Jean-François Cordeau, Lars Magnus Hvattum, Bjørn Nygreen:
Adaptive large neighborhood search heuristics for multi-tier service deployment problems in clouds. Eur. J. Oper. Res. 259(3): 829-846 (2017) - [j27]Simen Braaten, Ola Gjønnes, Lars Magnus Hvattum, Gregorio Tirado:
Heuristics for the robust vehicle routing problem with time windows. Expert Syst. Appl. 77: 136-147 (2017) - [j26]Lars Magnus Hvattum:
Ordinal versus nominal regression models and the problem of correctly predicting draws in soccer. Int. J. Comput. Sci. Sport 16(1) (2017) - [j25]Ahmad Hemmati, Lars Magnus Hvattum:
Evaluating the importance of randomization in adaptive large neighborhood search. Int. Trans. Oper. Res. 24(5): 929-942 (2017) - 2016
- [j24]Ahmad Hemmati, Lars Magnus Hvattum, Marielle Christiansen, Gilbert Laporte:
An iterative two-phase hybrid matheuristic for a multi-product short sea inventory-routing problem. Eur. J. Oper. Res. 252(3): 775-788 (2016) - [j23]Lars Magnus Hvattum:
On the Value of Aspiration Criteria in Tabu Search. Int. J. Appl. Metaheuristic Comput. 7(4): 39-49 (2016) - [j22]Urooj Pasha, Arild Hoff, Lars Magnus Hvattum:
Simple heuristics for the multi-period fleet size and mix vehicle routing problem. INFOR Inf. Syst. Oper. Res. 54(2): 97-120 (2016) - [c4]Agostinho Agra, Marielle Christiansen, Lars Magnus Hvattum, Filipe Rodrigues:
A MIP Based Local Search Heuristic for a Stochastic Maritime Inventory Routing Problem. ICCL 2016: 18-34 - [c3]Markus Brachner, Lars Magnus Hvattum:
RescUSim and IPython: An environment for offshore emergency preparedness planning. NIK 2016 - 2015
- [j21]Agostinho Agra, Marielle Christiansen, Alexandrino Delgado, Lars Magnus Hvattum:
A maritime inventory routing problem with stochastic sailing and port times. Comput. Oper. Res. 61: 18-30 (2015) - [j20]Ahmad Hemmati, Magnus Stålhane, Lars Magnus Hvattum, Henrik Andersson:
An effective heuristic for solving a combined cargo and inventory routing problem in tramp shipping. Comput. Oper. Res. 64: 274-282 (2015) - [j19]Magnar Vestli, Lars Lundsbakken, Kjetil Fagerholt, Lars Magnus Hvattum:
Scheduling fighter squadron training missions using column generation. Optim. Lett. 9(8): 1659-1674 (2015) - [c2]Olav Drivenes Sæbø, Lars Magnus Hvattum:
Evaluating the efficiency of the association football transfer market using regression based player ratings. NIK 2015 - 2014
- [j18]Giovanni Pantuso, Kjetil Fagerholt, Lars Magnus Hvattum:
A survey on maritime fleet size and mix problems. Eur. J. Oper. Res. 235(2): 341-349 (2014) - [j17]Ahmad Hemmati, Lars Magnus Hvattum, Kjetil Fagerholt, Inge Norstad:
Benchmark Suite for Industrial and Tramp Ship Routing and Scheduling Problems. INFOR Inf. Syst. Oper. Res. 52(1): 28-38 (2014) - 2013
- [j16]Kjetil Fagerholt, Lars Magnus Hvattum, Trond A. V. Johnsen, Jarl Eirik Korsvik:
Routing and scheduling in project shipping. Ann. Oper. Res. 207(1): 67-81 (2013) - [j15]Gregorio Tirado, Lars Magnus Hvattum, Kjetil Fagerholt, Jean-François Cordeau:
Heuristics for dynamic and stochastic routing in industrial shipping. Comput. Oper. Res. 40(1): 253-263 (2013) - [j14]Agostinho Agra, Marielle Christiansen, Rosa M. V. Figueiredo, Lars Magnus Hvattum, Michael Poss, Cristina Requejo:
The robust vehicle routing problem with time windows. Comput. Oper. Res. 40(3): 856-866 (2013) - [j13]Lars Magnus Hvattum, Inge Norstad, Kjetil Fagerholt, Gilbert Laporte:
Analysis of an exact algorithm for the vessel speed optimization problem. Networks 62(2): 132-135 (2013) - [j12]Lars Magnus Hvattum, Abraham Duarte, Fred W. Glover, Rafael Martí:
Designing effective improvement methods for scatter search: an experimental study on global optimization. Soft Comput. 17(1): 49-62 (2013) - 2012
- [j11]Lars Magnus Hvattum, Arne Løkketangen, Fred W. Glover:
Comparisons of Commercial MIP Solvers and an Adaptive Memory (Tabu Search) Procedure for a Class of 0-1 Integer Programming Problems. Algorithmic Oper. Res. 7(1): 13-20 (2012) - [c1]Agostinho Agra, Marielle Christiansen, Rosa M. V. Figueiredo, Lars Magnus Hvattum, Michael Poss, Cristina Requejo:
Layered Formulation for the Robust Vehicle Routing Problem with Time Windows. ISCO 2012: 249-260 - 2011
- [j10]Bernt Olav Øvstebø, Lars Magnus Hvattum, Kjetil Fagerholt:
Optimization of stowage plans for RoRo ships. Comput. Oper. Res. 38(10): 1425-1434 (2011) - 2010
- [j9]Lars Magnus Hvattum, Halvard Arntzen, Arne Løkketangen, Fred W. Glover:
Alternating control tree search for knapsack/covering problems. J. Heuristics 16(3): 239-258 (2010)
2000 – 2009
- 2009
- [j8]Lars Magnus Hvattum, Kjetil Fagerholt, Vinícius Amaral Armentano:
Tank allocation problems in maritime bulk shipping. Comput. Oper. Res. 36(11): 3051-3060 (2009) - [j7]Lars Magnus Hvattum, Fred W. Glover:
Finding local optima of high-dimensional functions using direct search methods. Eur. J. Oper. Res. 195(1): 31-45 (2009) - [j6]Lars Magnus Hvattum, Arne Løkketangen:
Using scenario trees and progressive hedging for stochastic inventory routing problems. J. Heuristics 15(6): 527-557 (2009) - [j5]Lars Magnus Hvattum, Arne Løkketangen, Gilbert Laporte:
Scenario Tree-Based Heuristics for Stochastic Inventory-Routing Problems. INFORMS J. Comput. 21(2): 268-285 (2009) - 2007
- [j4]Lars Magnus Hvattum, Arne Løkketangen, Gilbert Laporte:
A branch-and-regret heuristic for stochastic and dynamic vehicle routing problems. Networks 49(4): 330-340 (2007) - [p1]Lars Magnus Hvattum, Arne Løkketangen:
Experiments Using Scatter Search for the Multidemand Multidimensional Knapsack Problem. Metaheuristics 2007: 3-24 - 2006
- [j3]Halvard Arntzen, Lars Magnus Hvattum, Arne Løkketangen:
Adaptive memory search for multidemand multidimensional knapsack problems. Comput. Oper. Res. 33: 2508-2525 (2006) - [j2]Lars Magnus Hvattum, Arne Løkketangen, Gilbert Laporte:
Solving a Dynamic and Stochastic Vehicle Routing Problem with a Sample Scenario Hedging Heuristic. Transp. Sci. 40(4): 421-438 (2006) - 2004
- [j1]Lars Magnus Hvattum, Arne Løkketangen, Fred W. Glover:
Adaptive memory search for Boolean optimization problems. Discret. Appl. Math. 142(1-3): 99-109 (2004)
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-05-31 17:53 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:
