Mette Gamst

14 papers C 1Journal 12Unranked 1
YearRankTypeTitle / Venue / Authors
2024 J jnl
Decision support for the technician routing and scheduling problem.
Networks
Mette Gamst, David Pisinger
2024 J jnl
Exact and Heuristic Methods for the Split Delivery Vehicle Routing Problem.
Transp. Sci.
Mette Gamst, Richard Martin Lusby, Stefan Ropke
2022 J jnl
Decision support for the Technician Routing and Scheduling Problem.
CoRR
Mette Gamst, David Pisinger
2020 J jnl
Finding a Portfolio of Near-Optimal Aggregated Solutions to Capacity Expansion Energy System Models.
Oper. Res. Forum
Stefanie Buchholz, Mette Gamst, David Pisinger
2020 J jnl
Simultaneously exploiting two formulations: An exact benders decomposition approach.
Comput. Oper. Res.
Richard Martin Lusby, Mette Gamst, Stefan Ropke, Simon Spoorendonk
2020 J jnl
Time Aggregation Techniques Applied to a Capacity Expansion Model for Real-Life Sector Coupled Energy Systems.
CoRR
Mette Gamst, Stefanie Buchholz, David Pisinger
2014 J jnl
A local search heuristic for the Multi-Commodity $k$ -splittable Maximum Flow Problem.
Optim. Lett.
Mette Gamst
2014 J jnl
Exact and heuristic solution approaches for the Integrated Job Scheduling and Constrained Network Routing Problem.
Discret. Appl. Math.
Mette Gamst
2013 J jnl
Integrated job scheduling and network routing.
Networks
Mette Gamst, David Pisinger
2012 J jnl
Comparing branch-and-price algorithms for the Multi-Commodity k-splittable Maximum Flow Problem.
Eur. J. Oper. Res.
Mette Gamst, B. Petersen
2011 — conf
A branch-and-price algorithm for the long-term home care scheduling problem.
OR
Mette Gamst, T. Sejr Jensen
2011 C conf
The Boat and Barge Problem.
CTW
Mette Gamst, Niels Hvidberg Kjeldsen
2010 J jnl
Integrating job scheduling and constrained network routing.
Electron. Notes Discret. Math.
Mette Gamst
2010 J jnl
Two- and three-index formulations of the minimum cost multicommodity k-splittable flow problem.
Eur. J. Oper. Res.
Mette Gamst, Peter Neergaard Jensen, David Pisinger, Christian Plum