Integrating job scheduling and constrained network routing. - Mette Gamst (Electron. Notes Discret. Math., 2010)

Two- and three-index formulations of the minimum cost multicommodity k-splittable flow problem. - Mette Gamst; Peter Neergaard Jensen; David Pisinger; Christian Plum (Eur. J. Oper. Res., 2010)

The Boat and Barge Problem. - Mette Gamst; Niels Hvidberg Kjeldsen (CTW, 2011)

A branch-and-price algorithm for the long-term home care scheduling problem. - Mette Gamst; T. Sejr Jensen (OR, 2011)

Comparing branch-and-price algorithms for the Multi-Commodity k-splittable Maximum Flow Problem. - Mette Gamst; B. Petersen (Eur. J. Oper. Res., 2012)

Integrated job scheduling and network routing. - Mette Gamst; David Pisinger (Networks, 2013)

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

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

Simultaneously exploiting two formulations: An exact benders decomposition approach. - Richard Martin Lusby; Mette Gamst; Stefan Ropke; Simon Spoorendonk (Comput. Oper. Res., 2020)

Time Aggregation Techniques Applied to a Capacity Expansion Model for Real-Life Sector Coupled Energy Systems. - Mette Gamst; Stefanie Buchholz; David Pisinger (CoRR, 2020)

Finding a Portfolio of Near-Optimal Aggregated Solutions to Capacity Expansion Energy System Models. - Stefanie Buchholz; Mette Gamst; David Pisinger (Oper. Res. Forum, 2020)

Exact and Heuristic Methods for the Split Delivery Vehicle Routing Problem. - Mette Gamst; Richard Martin Lusby; Stefan Ropke (Transp. Sci., 2024)

Decision support for the technician routing and scheduling problem. - Mette Gamst; David Pisinger (Networks, 2024)