Lars Magnus Hvattum

Orcid: 0000-0003-0490-9978

According to our database1, Lars Magnus Hvattum authored at least 67 papers between 2004 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
New benchmark instances for the inventory routing problem.
Eur. J. Oper. Res., March, 2024

2023
Maritime inventory routing: recent trends and future directions.
Int. Trans. Oper. Res., November, 2023

The board packing problem.
Eur. J. Oper. Res., August, 2023

The effect of different mathematical formulations on a matheuristic algorithm for the production routing problem.
Comput. Oper. Res., July, 2023

A matheuristic for the multi-product maritime inventory routing problem.
Comput. Oper. Res., June, 2023

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., March, 2023

2022
Optimal location and operation of waste-to-energy plants when future waste composition is uncertain.
Oper. Res., 2022

Guillotine cutting is asymptotically optimal for packing consecutive squares.
Optim. Lett., 2022

Long-term effects of short planning horizons for inventory routing problems.
Int. Trans. Oper. Res., 2022

Variable neighbourhood search for binary integer programming problems.
Int. J. Metaheuristics, 2022

Weighted iterated local branching for mathematical programming problems with binary variables.
J. Heuristics, 2022

Exponential extrapolation memory for tabu search.
EURO J. Comput. Optim., 2022

Adjusting the order crossover operator for capacitated vehicle routing problems.
Comput. Oper. Res., 2022

A matheuristic for the robust integrated airline fleet assignment, aircraft routing, and crew pairing problem.
Comput. Oper. Res., 2022

2021
A dual-level stochastic fleet size and mix problem for offshore wind farm maintenance operations.
INFOR Inf. Syst. Oper. Res., 2021

Comparing bottom-up and top-down ratings for individual soccer players.
Int. J. Comput. Sci. Sport, 2021

Weighted proximity search.
J. Heuristics, 2021

Delayed improvement local search.
J. Heuristics, 2021

Extended high dimensional indexing approach for reachability queries on very large graphs.
Expert Syst. Appl., 2021

Meta-analysis of metaheuristics: Quantifying the effect of adaptiveness in adaptive large neighborhood search.
Eur. J. Oper. Res., 2021

Hybrid Machine Learning Forecasts for the UEFA EURO 2020.
CoRR, 2021

Multi-objective optimization for a strategic ATM network redesign problem.
Ann. Oper. Res., 2021

2020
An application of the multi-depot heterogeneous fixed fleet open vehicle routing problem.
Int. J. Adv. Oper. Manag., 2020

Load-dependent speed optimization in maritime inventory routing.
Comput. Oper. Res., 2020

Multi-objective sustainable location-districting for the collection of municipal solid waste: Two case studies.
Comput. Ind. Eng., 2020

The Multistage Stochastic Vehicle Routing Problem with Dynamic Occasional Drivers.
Proceedings of the Computational Logistics - 11th International Conference, 2020

2019
Analyzing passing networks in association football based on the difficulty, risk, and potential of passes.
Int. J. Comput. Sci. Sport, 2019

A comprehensive review of plus-minus ratings for evaluating individual players in team sports.
Int. J. Comput. Sci. Sport, 2019

Comparing techniques for modelling uncertainty in a maritime inventory routing problem.
Eur. J. Oper. Res., 2019

2018
Robust Optimization for a Maritime Inventory Routing Problem.
Transp. Sci., 2018

A comparison of acceptance criteria for the adaptive large neighbourhood search metaheuristic.
J. Heuristics, 2018

Profit Maximization in Inventory Routing Problems.
Proceedings of the 2018 IEEE International Conference on Industrial Engineering and Engineering Management, 2018

2017
Evaluating the importance of randomization in adaptive large neighborhood search.
Int. Trans. Oper. Res., 2017

Ordinal versus nominal regression models and the problem of correctly predicting draws in soccer.
Int. J. Comput. Sci. Sport, 2017

Heuristics for the robust vehicle routing problem with time windows.
Expert Syst. Appl., 2017

Adaptive large neighborhood search heuristics for multi-tier service deployment problems in clouds.
Eur. J. Oper. Res., 2017

Improved solutions to dynamic and stochastic maritime pick-up and delivery problems using local search.
Ann. Oper. Res., 2017

Preface: logistics, optimization and transportation - in memory of the late Arne Løkketangen.
Ann. Oper. Res., 2017

2016
Simple heuristics for the multi-period fleet size and mix vehicle routing problem.
INFOR Inf. Syst. Oper. Res., 2016

On the Value of Aspiration Criteria in Tabu Search.
Int. J. Appl. Metaheuristic Comput., 2016

An iterative two-phase hybrid matheuristic for a multi-product short sea inventory-routing problem.
Eur. J. Oper. Res., 2016

RescUSim and IPython: An environment for offshore emergency preparedness planning.
Proceedings of the 29th Norsk Informatikkonferanse, 2016

A MIP Based Local Search Heuristic for a Stochastic Maritime Inventory Routing Problem.
Proceedings of the Computational Logistics - 7th International Conference, 2016

2015
Scheduling fighter squadron training missions using column generation.
Optim. Lett., 2015

An effective heuristic for solving a combined cargo and inventory routing problem in tramp shipping.
Comput. Oper. Res., 2015

A maritime inventory routing problem with stochastic sailing and port times.
Comput. Oper. Res., 2015

Evaluating the efficiency of the association football transfer market using regression based player ratings.
Proceedings of the 28th Norsk Informatikkonferanse, 2015

2014
Benchmark Suite for Industrial and Tramp Ship Routing and Scheduling Problems.
INFOR Inf. Syst. Oper. Res., 2014

A survey on maritime fleet size and mix problems.
Eur. J. Oper. Res., 2014

2013
Designing effective improvement methods for scatter search: an experimental study on global optimization.
Soft Comput., 2013

Analysis of an exact algorithm for the vessel speed optimization problem.
Networks, 2013

Heuristics for dynamic and stochastic routing in industrial shipping.
Comput. Oper. Res., 2013

The robust vehicle routing problem with time windows.
Comput. Oper. Res., 2013

Routing and scheduling in project shipping.
Ann. Oper. Res., 2013

2012
Comparisons of Commercial MIP Solvers and an Adaptive Memory (Tabu Search) Procedure for a Class of 0-1 Integer Programming Problems.
Algorithmic Oper. Res., 2012

Layered Formulation for the Robust Vehicle Routing Problem with Time Windows.
Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

2011
Optimization of stowage plans for RoRo ships.
Comput. Oper. Res., 2011

2010
Alternating control tree search for knapsack/covering problems.
J. Heuristics, 2010

2009
Scenario Tree-Based Heuristics for Stochastic Inventory-Routing Problems.
INFORMS J. Comput., 2009

Using scenario trees and progressive hedging for stochastic inventory routing problems.
J. Heuristics, 2009

Finding local optima of high-dimensional functions using direct search methods.
Eur. J. Oper. Res., 2009

Tank allocation problems in maritime bulk shipping.
Comput. Oper. Res., 2009

2007
A branch-and-regret heuristic for stochastic and dynamic vehicle routing problems.
Networks, 2007

Experiments Using Scatter Search for the Multidemand Multidimensional Knapsack Problem.
Proceedings of the Metaheuristics, 2007

2006
Solving a Dynamic and Stochastic Vehicle Routing Problem with a Sample Scenario Hedging Heuristic.
Transp. Sci., 2006

Adaptive memory search for multidemand multidimensional knapsack problems.
Comput. Oper. Res., 2006

2004
Adaptive memory search for Boolean optimization problems.
Discret. Appl. Math., 2004


  Loading...