Mette Gamst

Orcid: 0000-0002-7036-3179

Affiliations:
  • Deptartment of Mathematics & Computer Science, University of Southern Denmark


According to our database1, Mette Gamst authored at least 12 papers between 2010 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Decision support for the technician routing and scheduling problem.
Networks, January, 2024

2020
Finding a Portfolio of Near-Optimal Aggregated Solutions to Capacity Expansion Energy System Models.
Oper. Res. Forum, 2020

Time Aggregation Techniques Applied to a Capacity Expansion Model for Real-Life Sector Coupled Energy Systems.
CoRR, 2020

Simultaneously exploiting two formulations: An exact benders decomposition approach.
Comput. Oper. Res., 2020

2014
A local search heuristic for the Multi-Commodity $k$ -splittable Maximum Flow Problem.
Optim. Lett., 2014

Exact and heuristic solution approaches for the Integrated Job Scheduling and Constrained Network Routing Problem.
Discret. Appl. Math., 2014

2013
Integrated job scheduling and network routing.
Networks, 2013

2012
Comparing branch-and-price algorithms for the Multi-Commodity k-splittable Maximum Flow Problem.
Eur. J. Oper. Res., 2012

2011
A branch-and-price algorithm for the long-term home care scheduling problem.
Proceedings of the Operations Research Proceedings 2011, Selected Papers of the International Conference on Operations Research (OR 2011), August 30, 2011

The Boat and Barge Problem.
Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011

2010
Two- and three-index formulations of the minimum cost multicommodity k-splittable flow problem.
Eur. J. Oper. Res., 2010

Integrating job scheduling and constrained network routing.
Electron. Notes Discret. Math., 2010


  Loading...