**Published Papers**

J. Ahmt, J. S. Sigtenbjerggaard, R. M. Lusby, J. Larsen, D. Ryan: “A new approach to the Container Positioning Problem”. Flexible Services and Manufacturing Journal, 2015.

M. Allan, A. Downward, A. Raith: “A Planning Tool for New Zealand Defence Force Development Work”, 2014 Joint NZSA+ORSNZ Conference Proceedings, number 36 (2014)

M. Bender, C. Thielen, S. Westphal: “Packing Items Into Several Bins Facilitates Approximating the Separable Assignment Problem”, Information Processing Letters 115, pp. 570-575 (2015)

M. Bender, C. Thielen, S. Westphal: “A Constant Factor Approximation for the Generalized Assignment Problem with Minimum Quantities and Unit Size Items”. In: Proceedings of the 38th International Symposium on Mathematical Foundations of Computer Science (MFCS 2013), LNCS vol. 8087, pp. 135-145, Springer (2013).

P. Bouman, M. Schmidt, L. Kroon, A. Schöbel: “Passenger Route Choice in Case of Disruptions”. In Proceedings of the IEEE-ITSC 2013 (2013)

S. Kristiansen, T. R. Stidsen: “Elective Course Student Sectioning at Danish High Schools”, Annals of Operations Research, pp. 1-19, (2014).

B. D. Brouer, G. Desaulniers: “A matheuristic for the liner shipping network design problem”, Electronic Proceedings of LOGMS 2012, (2012).

B. D. Brouer, J. Dirksen, D. Pisinger, C. E. M. Plum, B. Vaaben: “The Vessel Schedule Recovery Problem (VSRP) – A MIP model for handling disruptions in liner shipping”, European Journal of Operational Research, vol. 224, (2013).

J. Brimberg, H. Juel, M.-C. Körner, A. Schöbel: “On Models for Continuous Facility Location with Partial Coverage”. Journal of the Operational Research Society,

Volume 66, Issue 1, pp. 33–43 (2015)

J. Brimberg, R. Schieweck, A. Schöbel: “Locating a median line with partial coverage distance”. In: Journal of Global Optimization, Springer, Volume 62, Issue 2, pp. 371–389 (2015)

C. Buchheim, R. Hübner, A. Schöbel: “Ellipsoid bounds for convex quadratic integer programming”, SIAM journal on optimization, Volume 25, Issue 2, pp. 741–769 (2015)

K. Buhrkal, S. Zuglian, S. Røpke, J. Larsen, R. M. Lusby: “Models for the discrete berth allocation problem: A computational comparison”, Transportation Research. Part E: Logistics and Transportation Review, Volume 47, Issue 4, pp. 461-473 (2011).

S. Bull, A. Mason, A. Raith: “Scheduling Families of Jobs on Multiple Identical Machines to Minimize Total Tardiness”, ORSNZ 46th Annual Conference Proceedings, pp. 57-66 (2012)

G. Cabrera, M. Chica, M. Ehrgott, A. Mason: “Mathematical Programming and Metaheuristic Approaches Applied to Biological-Based Fluence Map Optimization in Radiotherapy”, ORSNZ 46th Annual Conference Proceedings, pp. 47-56 (2012)

G. Cabrera, M. Ehrgott, A. Mason, A. Philpott: “Multi-objective optimisation of positively homogeneous functions and an application in radiation therapy”. Operations Research Letters, Volume 42, pp 268–272, (2014)

E. Carrizosa, J. Harbering, A. Schöbel: “The stop location problem with realistic traveling time”. *Proceedings of ATMOS13*, Volume 33, pp. 80-93 (2013)

A. Chassein, M. Goerigk: “A Bicriteria Approach to Robust Optimization”. Computers & Operations Research. Volume 66, February 2016, Pages 181–189.

L. Chen, A. Raith, T.F. Henning: “Multi-objective optimisation in decision making of road maintenance”, 2014 Joint NZSA+ORSNZ Conference Proceedings, number 125 (2014)

L. Chen, A. Raith, T.F. Henning, A. Shamseldin: “Multi-objective optimisation in decision making of infrastructure asset management”, 2013 Joint NZSA+ORSNZ Conference Proceedings, number 100 (2013)

L. Chen, T. Henning, A. Raith, A. Shamseldin: “Multi-Objective Optimization for Maintenance Decision Making in Infrastructure Asset Management”. Journal of Management in Engineering, 31(6), 1-9 (2015)

B. Chen, O. Perederieieva, A. Raith: “Shortest Path Algorithms in Traffic Assignment”, 2013 Joint NZSA+ORSNZ Conference Proceedings, number 112 (2013)

J. Chow, N. Giacaman, O. Sinnen: “Pipeline pattern in an object-oriented, task-parallel environment”. Concurrency, 27:1273–1291, 2015.

S. Cicerone, G. Di Stefano, M. Schachtebeck, A. Schöbel: “Multi-Stage Recovery Robustness for Optimization Problems”: A new Concept for Planning under Disturbances, Information Sciences 190, pp. 107-126, 2012

M. Crowder, A. Mason: “Districting for the New Zealand Census MIP-Heuristic Approaches”, ORSNZ 46th Annual Conference Proceedings, pp. 88-96 (2012)

A Dohn, A. Mason: “Branch-and-Price for Staff Rostering: An Efficient Implementation Using Generic Programming and Nested Column Generation.” European Journal of Operational Research, vol. 230.1 (2013): 157–169.

A. H. Dohn, M. S. Rasmussen, J. Larsen: “The vehicle routing problem with time windows and temporal dependencies”, Networks Volume 58, Issue 4, pp. 273-289 (2011)

T. Dollevoet, D. Huisman, M. Schmidt, A. Schöbel: “Delay Management with Re-Routing of Passengers”, Transportation Science **46**(1): 74-89. (2012)

T. Dollevoet, D. Huisman, L. Kroon, M. Schmidt, A. Schöbel: “Delay Management including capacities of stations”. Transportation Science, Volume 49, Issue 2, pp. 185–203 (2015)

T. Dollevoet, M. Schmidt, A. Schöbel: “Delay Management including Capacities of Stations”. In Caprara, A., Kontogiannis S., editors, 11th Workshop on Algorithmic Approaches for Transportation, Modelling, Optimization, and Systems (ATMOS), volume 20 of OASIcs, pages 88-99. (2011)

J. Du, M. Ehrgott, A. Raith: “Optimal Delivery of Arc Modulated Radiation Therapy in Cancer Treatment”, ORSNZ 46th Annual Conference Proceedings, pp. 108-117 (2012)

M. Ehrgott, M. Hassanasab, A. Raith: “Data Envelopment Analysis without Linear Programming”, ORSNZ 46th Annual Conference Proceedings, pp. 119-128 (2012)

M. Ehrgott, J. Wang, A. Rait, C. Van Houtte: “Bi-objective Cyclist Route Choice Model”, Transportation Research Part A: Policy and Practice, 46, 652-663 (2012)

M. Ehrgott: “Single-serach based heuristics for multiobjective optimization”. In Cochran, J.J., editor, Wiley Encyclpedia of Operations Research and Management Science, available online, John Wiley & Sons, New York (2011)

M. Ehrgott, L. Shao, A. Schöbel: “An Approximation Algorithm for Convex Multi-objective Programming Problems”, Journal of Global Optimization 50, 397-416, (2011)

M. Ehrgott, A. Loehne, L. Shao: “A dual variant of Benson’s outer approximation algorithm for multiple objective linear programming”, Journal of Global Optimization, published online before print (2011)

M. Ehrgott, J. Ide, A. Schöbel: “Minmax Robustness for Multi-objective Optimization Problems”, European Journal of Operational Research, Volume 239, pp. 17–31 (2014)

D. Elvikis, H. W. Hamacher, V. T’kindt: “Scheduling two agents on uniform parallel machines with makespan and cost functions” Journal of Scheduling, 14 , 471-481 (2011)

A. Eusebio, J. R. Figueira, M. Ehrgott: “On finding representative non-dominated points for bi-objective integer network flow problems”, Computers & Operations Research Volume 48, pp. 1–10, (2014)

L. Eyraud-Dubois, L. Marchal, O. Sinnen, F. Vivien: “Parallel scheduling of task trees with limited memory”. ACM Transactions on Parallel Computing, 2(2):13, 2015.

H. Flier, M. Mihalak, P. Widmayer, A. Zych, Y. Kobayashi, A. Schöbel: “Selecting vertex disjoint paths in plane graphs”, Networks, Volume 66, Issue 2, pp. 136–144 (2015)

J. Frasch, S. O. Krumke, S. Westphal: “MIP formulations for Flowshop Scheduling with Limited Buffers”, Proceedings of the 1st Internationional ICST Conference on Theory and Practice of Algorithms in Computer Science, volume 6595 of Lecture Notes in Computer Science, pages 127-138. Springer, (2011).

S. Freytag, J. Manitz, M. Schlather, T. Kneib, C. I. Amos, A. Risch, J. Chang-Claude, J. Heinrich, H. Bickeböller: “A Network-Based Kernel Machine Test for the Identification of Risk Pathways in Genome-Wide Association Studies”. Human Heredity, 76(2), pp. 64-75 (2013)

M. Gamst: “Exact and heuristic solution approaches for the Integrated Job Scheduling and Constrained Network Routing Problem”, Discrete Applied Mathematics, Available online 6 August 2011, 10.1016/j.dam.2011.07.011 .

M. Gamst, N. Kjeldsen: “The Boat and Barge problem”. In 10th Cologne-Twente Workshop on graphs and combinatorial optimization 2011, pages 158-161

M. Gamst, B. Petersen: “Comparing branch-and-price algorithms for the Multi-Commodity k-splittable Maximum Flow Problem”, European Journal of Operational Research, Volume 217, Issue 2, 2012, Pages 278-286, 10.1016/j.ejor.2011.10.001 .

M. Gamst: “A local search heuristic for the Multi-Commodity k-splittable Maximum Flow Problem”, Optimization Letters, pages: 19, 2013

M. Gamst, D. Pisinger: “Integrated Job Scheduling and Network Routing”, Networks, vol: 61, issue: 3, pages: 248-262, 2013

S. Gelareh, R. Neamatian Monemi, P. Mahey, N. Maculan, D. Pisinger: “Single string planning problem arising in liner shipping industries: A heuristic approach”, Computers & Operations Research vol: 40, issue: 10, pages: 2357-2373, 2013

J. Geldermann, A. Schöbel: “On the similarities of various MCDA methods”, 2011, Multi-criteria decision analysis 18:3-4 pp: 219-230, 2011

N. Giacaman, O. Sinnen: “Research-infused teaching of parallel programming concepts for undergraduate software engineering students”. In Proc. of 4th NSF/TCPP Workshop on Parallel and Distributed Computing Education (EduPar-14), in conjunction with IPDPS2014, Phoenix, USA, 2014.

M. Goerigk, H. W. Hamacher: “Optimisation Models to Enhance Resilience in Evacuation Planning”. Civil Engineering and Environmental Systems. Volume 32, Issue 1-2, 2015.

M. Goerigk, K. Deghdak, V. T’Kindt: “A Two-Stage Robustness Approach to Evacuation Planning with Buses”. Transportation Research Part B. Volume 78, August 2015, Pages 66–82.

A. Chassein, M. Goerigk: “A New Bound for the Midpoint Solution in Minmax Regret Optimization with an Application to the Robust Shortest Path Problem”. European Journal of Operational Research. Volume 244, Issue 3, 1 August 2015, Pages 739–747.

A. Chassein, M. Goerigk: “Alternative Formulations for the Ordered Weighted Averaging Objective”. Information Processing Letters. Volume 115, Issues 6–8, June–August 2015, Pages 604–608.

M. Goerigk: “Exact and Heuristic Approaches to the Robust Periodic Event Scheduling Problem”. Public Transport. March 2015, Volume 7, Issue 1, pp 101-119.

M. Goerigk, M. Gupta, J. Ide, A. Schöbel, S. Sen: “The Robust Knapsack Problem with Queries”. Computers & Operations Research. Volume 55, March 2015, Pages 12–22.

M. Goerigk, K. Deghdak, P. Heßler: “A Comprehensive Evacuation Planning Model and Genetic Solution Algorithm”. Transportation Research Part E. Volume 71, November 2014, Pages 82–97.

M. Goerigk, A. Schöbel: “Recovery-to-Optimality: A New Two-Stage Approach to Robustness with an Application to Aperiodic Timetabling”. Computers & Operations Research. Volume 52, Part A, December 2014, Pages 1–15.

M. Goerigk: “A Note on Upper Bounds to the Robust Knapsack Problem with Discrete Scenarios”. Annals of Operations Research. December 2014, Volume 223, Issue 1, pp 461-469.

F. Bruns, M. Goerigk, S. Knust, A. Schöbel: “Robust load planning of trains in intermodal transportation”. OR Spectrum. Volume 36, Issue 3, July 2014, Pages 631-668.

M. Goerigk, B. Grün: “A Robust Bus Evacuation Model with Delayed Scenario Information”. OR Spectrum. October 2014, Volume 36, Issue 4, pp 923-948.

I. Ndiaye, E. Neron, A. Linot, N. Nonmarche, M. Goerigk: “A new model for macroscopic pedestrian evacuation planning with safety and duration criteria”. In Proceedings of PED14, Transportation Research Procedia Volume 2, 2014, Pages 486–494 (2014).

M. Goerigk, B. Grün, P. Heßler: “Combining bus evacuation with location decisions: a branch-and-price approach”. In Proceedings of PED14, Transportation Research Procedia Volume 2, 2014, Pages 783–791 (2014).

M. Goerigk, R. Hoshino, K. Kawarabayashi, S. Westphal: “Solving the Traveling Tournament Problem by Packing Three-Vertex Paths”. In Proceedings of AAAI-14, pp 2271-2277 (2014).

M. Goerigk, S. Heße, M. Müller-Hannemann, M. Schmidt, A. Schöbel: “Recoverable Robust Timetable Information”. In 13th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems. 33: Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik. 1-14, 2013

M. Goerigk, M. Knoth, M. Müller-Hannemann, M. Schmidt, A. Schöbel: “The Price of Robustness in Timetable Information”. In Caprara, A., Kontogiannis S., editors, 11th Workshop on Algorithmic Approaches for Transportation, Modelling, Optimization, and Systems (ATMOS), volume 20 of OASIcs, pages 76-87. (2011)

M. Goerigk, M. Knoth, M. Müller-Hannemann, M. Schmidt, A. Schöbel: “The Price of Strict and Light Robustness in Timetable Information”. Transportation Science.

Volume 48 Issue 2, May 2014, pp. 225-242.

M. Goerigk, A. Schöbel: “A scenario-based approach for robust linear optimization”. In Alberto Marchetti-Spaccamela and Michael Segal, editors, TAPAS, volume 6595 of Lecture Notes in Computer Science, pages 139-150. Springer, (2011).

M. Goerigk, A. Schöbel: “Engineering the modulo network simplex heuristic for the periodic timetabling problem”. In P. M. Pardalos and S. Rebennack, editors, Proc. of the 10th International Symposium on Experimental Algorithms (SEA 11), volume 6630 of LNCS, pages 181-192. Springer, (2011).

M. Goerigk, A. Schöbel: “Improving the Modulo Simplex Algorithm for Large-Scale Periodic Timetabling”. Computers and Operations Research. Volume 40, Issue 5, May 2013, Pages 1363–1370.

M. Goerigk, B. Grün, Ph. Heßler: “Branch and Bound Algorithms for the Bus Evacuation Problem”. Computers and Operations Research. Volume 40, Issue 12, December 2013, Pages 3010–3020.

M. Goerigk, M. Schachtebeck, A. Schöbel: “Evaluating Line Concepts using Travel Times and Robustness: Simulations with the Lintim toolbox.” Public Transport. October 2013, Volume 5, Issue 3, pp 267-284.

M. Goerigk, Y. Sabharwal, A. Schöbel, S. Sen: “Approximation Algorithms for the Weight-Reducible Knapsack Problem”. In Proceedings of TAMC 2014, LNCS Volume 8402, 2014, pp 203-215.

M. Goerigk, S. Westphal: “A Combined Local Search and Integer Programming Approach to the Traveling Tournament Problem”. Annals of Operations Research, pp. 1–12 (2012)

H.W. Hamacher, B. Grün: “Von Straßenkarten bis zur Evakuierung von Städten!”, Zukunftsperspektiven des Operations Research, M Lübbecke, A. Welter, and B. Wernes (edts.), Springer 2014, pp 203-226.

H.W. Hamacher, S. Heller, B. Rupp: “Flow location (FlowLoc) problems : dynamic network flows and location models for evacuation planning”, Annals of Operations Research (2013), 207, 161-180

H. W. Hamacher, K. Jörnsten: “Optimal Relinquishment Accornding to the Norwegian Petroleum Law: A Combinatorial Optimization Approach”, in *Energy, Natural Resource, and Environmental Economics*, (Björndal, E. Björndal, M, Pardalos, P. and Rönnkvist, M (edts.), 443-458, Springer, (2011)

I. Hamling, M. O’Sullivan, C. Thielen, C. Walker: “Improving Resource Efficiency in Internet Cafés by Virtualization and Optimal User Allocation”, Proceedings of the 8th IEEE/ACM International Conference on Utility and Cloud Computing (UCC 2015)

Y. Han, T. Takaoka: “An O(n^3 loglogn/log^2 n) Time Algorithm for All Pairs Shortest Paths”. In Algorithm Theory – SWAT 2012, LNCS, volume 7357, pages 131-141 (2012)

J. Harbering, A. Ranade, M. Schmidt: “Single Track Train Scheduling”. In Proceedings of the fifth Multidisciplinary International Scheduling Conference: Theory and Applications MISTA, (2015)

J. Harding, T. Takaoka, M. Thaher, D.i Umar: “Application of the Maximum Convex Sum Algorithm in Determining Environmental Variables That Affect Nigerian Highland Stream Benthic Communities”. ICCS 2013: 909-918

K. Hauge, J. Larsen, R. M. Lusby, E. Krapper: “A Hybrid Column Generation approach for an Industrial Waste Collection Routing Problem”. Computers & Industrial Engineering, Vol. 71, No. 1, p. 10-20 (2014).

P. Heßler, H.W. Hamacher: “Sink Location to Find Optimal Shelters in Evacuation Planning”, European Journal of Computational Optimization (accepted)

R. Hübner, A. Schöbel: “When is rounding allowed in integer nonlinear optimization?” European Journal of Operational Research, Volume 237, pp. 404-410 (2014)

J. Ide, M. Tiedemann, S. Westphal, F. Haiduk: “An Application of Deterministic and Robust Optimization in the Wood Cutting Industry”. 4OR, (2013)

J. Ide, M. Tiedemann: “An Application of Minmax Robust Efficiency in the Wood Processing Industry”. In Proceedings of the First International Conference on Resource Efficiency in Interorganizational Networks 2013.

J. Ide, M. Tiedemann: “Resource Efficiency in Veneer Production: Optimization of a Complex Cutting Problem”. In Proceedings of the First International Conference on Resource Efficiency in Interorganizational Networks 2013.

P.M. Jacobsen, D. Pisinger: “Train shunting at a workshop area”. Flexible Services and Manufacturing Journal, Volume 23, Number 2, June 2011 , pp. 156-180(25)

M. K. Jepsen, S. Spoorendonk, S. Røpke: “A branch-and-cut algorithm for the symmetric two-echelon capacitated vehicle routing problem”, Transportation Science, vol: 47, issue: 1, pages: 23-37, 2013

M.K. Jepsen, B. Løfstedt, C.E.M. Plum, D. Pisinger, M.M. Sigurd: “A path based model for the liner shipping network design problem”, in Proceedings of the IAENG, ICOR 2011, (2011).

K. Klamroth, E. Köbis, A. Schöbel, C. Tammer: “A unified approach for different concepts of robustness and stochastic programming via nonlinear scalarizing functionals”, Optimization, Volume 62, Issue 5, pp. 649–671 (2013).

M. Körner, H. Martini, A. Schöbel: “Minisum Hypersphere in Normed Spaces,” Discrete und Applied Mathematics 16(15), pp. 2221-2233, (2012)

M. Körner, J. A. Mesa, F. Perea, A. Schöbel, D. Scholz: “A Maximum Trip Covering Location Problem with an Alternative Mode of Transportation on Tree Networks and Segments”, TOP, Volume 22, Issue 1, pp. 227-258 (2014)

S. Kristiansen, M. Sørensen, T. Stidsen: “Elective course planning”, European Journal of Operational Research”, Volume 215, Issue 3, pp. 713-720 (2011)

S. Kristiansen, M. Sørensen, M. B. Herold, T. R. Stidsen: “The consultation timetabling problem at Danish high schools”, Journal of Heuristics vol: 19, pages: 465-495, 2013

S. O. Krumke, N. Leithäuser, M. Merkert: “Approximating Infeasible 2VPI-Systems”, Proceedings of the 38th Workshop on Graphtheoretic Concepts in Computer Science, Vol. 7555 of Lecture Notes in Computer Science, pp. 225-336, 2012

S. O. Krumke, A. Quilliot, A. Wagler, J.-Th. Wegener: “Models and Algorithms for Carsharing Systems and Related Problems”, Proceedings of LATIN VII, 2013

S. O. Krumke, C. Thielen: “The Generalized Assignment Problem with Minimum Quantities”, European Journal of Operational Research 228:1 (2013), pp. 46–55, DOI: 10.1016/j.ejor.2013.01.027.

S. O. Krumke, C. Thielen, C. Zeck: “Extensions to Online Delay Management on a Single Train Line: New Bounds for Delay Minimization and Profit Maximization”, Mathematical Methods of Operations Research, vol. 74(1), pages 53-75. (2011)

S. O. Krumke, C. Thielen, S. Westphal: “Interval Scheduling on Related Machines: Complexity and Online Algorithms”, Computers and Operations Research, vol. 38(12), pages 1836-1844. (2011)

S. O. Krumke, J. Rambau: “Stability with Uniform Bounds for On-Line Dial-a-Ride Problems under Reasonable Load”, Lecture Notes in Control and Information Sciences, vol. 417, pages 387–412. (2012).

S. O. Krumke, C. Zeck: “Generalized Max Flow in Series-Parallel-Graphs”, Discrete Optimization 10(2), pp. 155-162, 2013

K. Kuhn: “Pavement Network Maintenance Optimization Considering Multidimensional Condition Data”, Journal of Infrastructure Systems 18(4), pages 270–277 (2011)

K.-L. Lin, J. Simpson, G. Sasso, A. Raith, M. Ehrgott: “Quality assessment for VMAT prostate radiotherapy planning based on data envelopment analysis”, Physics in Medicine and Biology, pp. 5753-5769 (2013)

K.-L. Lin, J. Simpson, G. Sasso, A. Raith, M. Ehrgott: “An Application of Data Envelopment Analysis to External Radiotherapy Treatment Planning”, ORSNZ 46th Annual Conference Proceedings, pp. 185-193 (2012)

Z. Liu, M. Ehrgott, A. Raith: “Linear Optimization over the Nondominated Set of a Multiobjective Linear Programming Problem”, ORSNZ 46th Annual Conference Proceedings, pp. 194-203 (2012)

T. M. Lange, R. M. Lusby, J. Larsen: “Solving the selective multi-category parallel-servicing problem”. Journal of Scheduling, Vol. 18, No. 2, p. 165-184, 2015.

B. Løfstedt, D. Pisinger, S. Spoorendonk: “Liner Shipping Cargo Allocation with Repositioning of Empty Containers” INFOR 49(2), (2011)

R. M. Lusby, L. F. Muller, B. Petersen: “A solution approach based on Benders decomposition for the preventive maintenance scheduling problem of a stochastic large-scale energy system”, Journal of Scheduling vol: 16, issue: 6, pages: 605-628, 2013

R. M. Lusby, J. Larsen: “Improved exact method for the double TSP with multiple stacks”, Networks Volume 58, Issue 4, pp. 290-300 (2011).

R. M. Lusby, J. Larsen, M. Ehrgott, D. Ryan: “Railway track allocation: Models and methods” OR Spectrum 33, pages 843-883 (2011)

R. M. Lusby, A. H. Dohn, T. M. Range, J. Larsen: “A column generation-based heuristic for rostering with work patterns”. Journal of the Operational Research Society (2011).

R. M. Lusby, J. Larsen, D. Ryan, M. Ehrgott: “Routing trains through railway junctions: A new set-packing approach”, Transportation Science Volume 45, Issue 2, pp. 228-245 (2011)

R. M. Lusby, J. Larsen, D. Ryan, M. Ehrgott: “A Set Packing Inspired Method for Real-Time Junction Train Routing”. Computers \& Operations Research 40(3), pages 713–724 (2013)

J. Manitz, T. Kneib: “Model-based source estimation during foodborne disease outbreaks”. Proceedings of 28th International Workshop on Statistical Modelling. (2013)

J. Manitz, J. Harbering, M. Schmidt, T. Kneib, A. Schöbel: “Network-based Source Detection: ‘From Infectious Disease Spreading to Train Delay Propagation'”. Proceedings of the 29th International Workshop on Statistical Modelling, Volume 1. pp. 201-205 (2014)

J. Manitz, T. Kneib, M. Schlather, D. Helbing, D. Brockmann: “Network-based Source Detection of Food-borne Disease Outbreaks – A case study 2011 EHEC/HUS Outbreak in Germany”, PLOS Currents Outbreaks, Edition 1. pp. 1-31 (2014)

A. Mason: “SolverStudio: A New Tool for Better Optimisation and Simulation Modelling in Excel”. INFORMS Transactions on Education 14(1):45-52. http://dx.doi.org/10.1287/ited.2013.0112 (2013)

A. Mason: “SolverStudio for Excel”, ORSNZ 46th Annual Conference Proceedings, pp. 223-227 (2012)

A. J. Mason: “Simulation and real-time optimised relocation for improving ambulance operations”, Handbook of Healthcare Operations Management, pp. 289–317 (2013)

A. J. Mason: “OpenSolver – An Open Source Add-in to Solve Linear and Integer programmes in excel”, Operations Research Proceedings 2011, pp. 401–406 (2012)

M. Milke: “Causal Loops for Analysis of the Social Dimension to Complex Systems”, Civil Engineering and Environmental Systems, volume 30, 243-248, 2013.

S. Moradi, M. Ehrgott, A. Raith: “The Linear Bi-Objective Multi-Commodity Minimum Cost Flow Problem”, ORSNZ 46th Annual Conference Proceedings, pp. 238-247 (2012)

S. Moradi, A. Raith, M. Ehrgott: “Dantzig-Wolfe Decomposition for the Bi-Objective Multi-Commodity Minimum Cost Flow Problem”, 2013 Joint NZSA+ORSNZ Conference Proceedings, number 109 (2013)

S. Moradi, A. Raith, M. Ehrgott: “Estimating value of time from observed flows on transportation networks”, 2014 Joint NZSA+ORSNZ Conference Proceedings, number 40 (2014)

S. Moradi, A. Raith, M. Ehrgott: “A Bi-Objective Decomposition Method for Solving the Bi-Objective Multi-Commodity Minimum Cost Flow Problem”, European Journal of Operational Research 244(2), pages 369-378, 2015

L.F. Muller, A. Attamturk, D. Pisinger: “Separation and extension of cover inequalities for second-order conic knapsack constraints with generalized upper bounds”, INFORMS Journal on Computing (2011), vol. 25, no. 3, pp. 420-431.

L.F. Muller, S. Spoorendonk, D. Pisinger, “A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times”, European Journal of Operational Research 218(3), pages 614–623 (2012).

M. Orr, O. Sinnen: “A duplicate-free state-space model for optimal task scheduling”. In Proc. of 21st Int. European Conference on Parallel and Distributed Computing (Euro-Par 2015), Lecture Notes in Computer Science, Vienna, Austria, 2015. Springer.

O. Perederieieva, M. Ehrgott, J. Y. T. Wang, A. Raith: “A Computational Study of Traffic Assignment Algorithms”. ATRF 36th Annual Conference Proceedings, (2013)

O. Perederieieva: “Solving Bi-objective Traffic Assignment Based on Time Surplus Maximisation”, ORSNZ 46th Annual Conference Proceedings, pp. 268-277 (2012)

O. Perederieieva, M. Ehrgott, A. Raith, J. Y. T. Wang: “A Framework for and Empirical Study of Algorithms for Traffic Assignment”, Computers \& Operations Research 54, pages 90-107, 2015

O. Perederieieva, M. Ehrgott, A. Raith, J. Y.T. Wang: “Numerical stability of path-based algorithms for traffic assignment”, Optimization Methods and Software, 10.1080/10556788.2015.1047018 (2015)

O. Perederieieva, A. Raith, M. Schmidt: “Non-additive Shortest Path Sub-problems in the Context of Traffic Assignment”, 2014 Joint NZSA+ORSNZ Conference Proceedings, number 55 (2014)

A. Phillips, M. Ehrgott, D. Ryan: “Efficient Timetable Modifications in University Course Timetabling”, ORSNZ 46th Annual Conference Proceedings, pp. 278-286 (2012)

A. Phillips, M. Ehrgott, D. Ryan: “Solving the Classroom Assignment Problem Using Integer Programming”, ORSNZ 47th Annual Conference Proceedings, ID. 119 (2013)

A. E. Phillips, C. G. Walker, M. Ehrgott, D. M. Ryan: “Integer programming for minimal perturbation problems in university course timetabling”. In E. Ozcan, E. K. Burke, and B. McCollum (eds). Practice and Theory of Automated Timetabling X, Lecture Notes in Computer Science, 366-379 (2014)

A. E. Phillips, C. G. Walker, M. Ehrgott, D. M. Ryan: “Integer programming methods for large-scale practical classroom assignment problems”. Computers & Operations Research, 53(0):42-53 (2015)

R.A.R. Prabodanie, J.F. Raffensperger, E.G. Read, M.W. Milke: “LP models for pricing diffuse nitrate discharge permits”. Annals of Operations Research, Volume 220, pp. 87-109, DOI: 10.1007/s10479-011-0941-0 (2014).

A. Przybylski, X. Gandibleux, M. Ehrgott: “The Two-Phase Method for Multiobjective Combinatorial Optimization Problems” In Mahjoub, R., editor, progress in Combinatorial Optimization, pages 559-596, ISTE Wiley, London (2011)

T. M. Range, R. M. Lusby, J. Larsen: “A column generation approach for solving the patient admission scheduling problem”, European Journal of Operational Research, vol. 235, p. 252-264, (2013).

A. Raith, M. Ehrgott: “On Vector Equilibria, Vector Optimization and Vector Variational Inequalities”, Journal of Multi-Criteria Decision Analysis, vol. 18, pages 39-54. (2011)

A. Raith, S. Moradi, M. Ehrgott, M. Stiglmayr: “Exploring Bi-objective Column Generation”, ORSNZ 46th Annual Conference Proceedings, pp. 288-296 (2012)

A. Raith, U. Nataraj, M. Ehrgott, G. Miller, K. Pauw: “Prioritising cycle infrastructure projects”, In Proceedings of Australasian Transport Research Forum 2011, paper no 158, pages 1-15. (2011).

A. Raith, U. Nataraj, M. Ehrgott, G. Miller, K. Pauw: “Prioritising Cycling and Walking Infrastructure”, In Proceedings of 2 walk and cycle – creating smarter connections 2012, paper no Q4, pages 1-13. (2012).

A. Raith, M. Stiglmayr: “Multi-Objective Combinatorial Optimization”, EURO Working Group on Multicriteria Decision Making Newsletter, Number 27, pp. 9-12 (2013).

A. Raith, J. Y. T. Wang, M. Ehrgott, S. Mitchell: “Solving multi-objective traffic assignment”, DOI 10.1007/s10479-012-1284-1, available online, Annals of Operations Research, 222 (1), 483-516 (2014).

L. B. Reinhardt, D. Pisinger: “A Branch and Cut algorithm for the container shipping network design problem”, Flexible Services and Manufacturing Journal doi: 10.1007/s10696-011-9105-4 (2011)

L. B. Reinhard, T. Clausen, D. Pisinger: “Synchronized dial-a-ride transportation of disabled passengers at airports”, European Journal of Operational Research 225 (1), pp. 106-117, (2013).

L. B. Reinhardt, D. Pisinger: “A branch and cut algorithm for the container shipping network design problem”, Flexible Services and Manufacturing Journal 24 (3), pp. 349-374, (2012).

L. B. Reinhardt, S. Spoorendonk, D. Pisinger: “Solving vehicle routing with full container load and time windows”, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 7555 LNCS , pp. 120-128, (2012).

L. B. Reinhardt, D. Pisinger: “Multi-objective and multi-constrained non-additive shortest path problems”, Computers and Operations Research Volume 38 Issue 3 (2011)

L. B. Reinhardt, D. Pisinger: “Multi-Objective Non-Additive Shortest Path”, Computers and Operations Research, 38:605–616 (2011)

K. Ruddell, A. Raith: “An Aggregational Approach to the Traffic Assignment Problem”, ORSNZ 46th Annual Conference Proceedings, pp. 326-335 (2012)

K. Ruddell, A. Raith: “Graph partitioning and its Application to the Traffic Assignment Problem”, 2013 Joint NZSA+ORSNZ Conference Proceedings, number 107 (2013)

K. Ruddell, A. Raith: “Initializing the Traffic Assignment Problem by Zone Aggregation and Disaggregation”, Transportation Research Record (TRR): Journal of the Transportation Research Board, 2466, 52-57 (2014)

M. Schmidt: “Simultaneous Optimization of Delay Management Decisions and Passenger Routes”. Public Transport 5(1): 125-147, (2013).

M. Schmidt: “Integrating Routing Decisions in Network Problems”. Volume 89 of Optimization and Its Applications, Springer. (2014).

M. Schmidt, A. Schöbel: “Location of speed-up subnetworks”, Annals of Operations Research, Volume 223, Issue 1, pp. 379–401 (2014)

M. Schmidt, A. Schöbel: “Timetabling with Passenger Routing”, OR Spectrum. Volume 37, pp 75–97. (2015).

M. Schmidt, A. Schöbel: “The complexity of integrating routing decisions in public transportation models”, Networks, Volume 65, Issue 3, pp. 228–243 (2015)

A. Schöbel: “Line planning in public transportation: models and methods”, OR Spectrum 34:3, pp. 491-510, (2012)

A. Schöbel: “Generalized light robustness and the trade-off between robustness and nominal quality”, Mathematical Methods of Operations Research, Volume 80, Issue 2, pp. 161–191 (2014)

A. Schöbel: “Location of Dimensional Facilities in a Continuous Space”, In: Location Science, Springer, Chapter 7, pp. 63–103 (2015)

A. Schöbel, D. Scholz: “A solution algorithm for non-convex mixed integer optimization problems with only few continuous variables”, European Journal of Operational Research, Volume 232, Issue 2, pp. 266-275, (2014).

A. Sedeno-Noda, A. Raith: “A Dijkstra-like method computing all extreme upported nondominated solutions of the biobjective shortest path problem”, Computers & Operations Research, 57, 83-94, (2015)

L. Shao, M. Ehrgott: “An Objective Space Cut and Bound Algorithm for Convex Multiplicative Programs”, Journal of Global Optimization, Volume 58, Issue 4, pp. 711–728 (2014)

L. Shao, M. Ehrgott: “An approximation algorithm for convex multiplicative programming problems” In 2011 IEEE Symposium on Computational Intelligence in Multiple Criteria Decision Making, pages 175-181 (2011)

T. Shinn, T. Takaoka, “Efficient Graph Algorithms for Network Analysis”, ResEff, volume 1, pages 236-247 (2013)

T. Shinn, T. Takaoka: “Some extensions of the bottleneck paths problem”. Algorithms and Computation, pp. 176–187 (2014)

T. Shinn, T. Takaoka: “Combining All Pairs Shortest Paths and All Pairs BR. Hübner, A. Schöbel: “When is rounding allowed in integer nonlinear optimization?” European Journal of Operational Research, Volume 237, pp. 404-410 (2014)ottleneck Paths Problems”. LATIN 2014: Theoretical Informatics, pp. 226–237 (2014)

T. Shinn, T. Takaoka: “Combining the Shortest Paths and the Bottleneck Paths Problems”. Proceedings of the Thirty-Seventh Australasian Computer Science Conference-Volume 147, pp. 13–18 (2014)

M. Siebert, M. Goerigk: “An Experimental Comparison of Periodic Timetabling Models”. Computers and Operations Research, Volume 40, Issue 10, October 2013, Pages 2251–2259.

O. Sinnen: “Reducing the solution space of optimal task scheduling”. Computers & Operations Research, 43:201–214, 2014.

M. Sørensen, F. H. W. Dahms: “A Two-Stage Decomposition of High School Timetabling applied to cases in Denmark”, Computers & Operations Research vol: 43, pages: 36–49, 2014

T. Takaoka: “Efficient Algorithms for the All Pairs Shortest Path Problem with Limited Edge Costs”. In Computing: The Australasian Theory Symposium (CATS 2012), CRPIT, volume 128, pages 21-26 (2012)

T. Takaoka: “Efficient Parallel Algorithms for the Maximum Subarray Problem”. Proceedings of the Twelfth Australasian Symposium on Parallel and Distributed Computing-Volume 152, pp. 45–50 (2014)

T. Takaoka: “A simplified algorithm for the all pairs shortest path problem with O(n 2logn) expected time”. Journal of Combinatorial Optimization, Volume 25, Issue 2, pp. 326–337 (2013)

B. Tam, M. Ehrgott, D. Ryan, G. Zakeri: “A comparison of stochastic programming and bi-objective optimisation appoaches to robust airline crew scheduling”, OR Spectrum 33, pages 49-75 (2011)

B. Tam, D. Ryan, M. Ehrgott: “Multi-objective approaches to the unite crewing problem in airline crew scheduling”, Journal of Multi-Criteria Decision Analysis, Volume 21, Issue 5-6, pp. 257-277 (2014)

M. Thaher, T. Takaoka: “Improved algorithms for the K overlapping maximum convex sum problem”. In ICCS 2012, Procedia CS 9, pages 754-763 (2012)

C. Thielen, M. Tiedemann, S. Westphal: “The Online Knapsack Problem with Incremental Capacity”. Mathematical Methods of Operations Research (2015)

C. Thielen, S. Westphal: “Complexity and approximability of the maximum flow problem with minimum quantities”. Networks, Volume 62, Issue 2, pages 125–131 (2013)

C. Thielen, S. Westphal: “Approximation Algorithms for TTP(2)”. Mathematical Methods of Operations Research, Volume 76, Issue 1, pp 1-20 (2012)

M. Tiedemann, J. Ide, A. Schöbel: “Competitive Analysis for Multi-Objective Online Algorithms”, In Proceedings of the 9th International Workshop on Algorithms and Computation WALCOM 2015. LNCS 8973, Springer, pages 210-221 (2015)

D. Tsai, A. Raith, A. Philpott: “Capacity Expansion Optimisation in Transportation Networks”, 2013 Joint NZSA+ORSNZ Conference Proceedings, number 101 (2013)

L. Turner: “Variants of the Shortest Path Problem”, Algorithmic Operations Research, 6(2): 91-104 (2011)

L. Turner, M. Ehrgott, H.W. Hamacher: “On the generality of the greedy algorithm for solving matroid problems”, Discrete Applied Mathematics, Vol. 195 , 114-128 (2015)

L. Turner, D. Poetranto Groß, H.W. Hamacher, S.O. Krumke: “Static and dynamic source locations in undirected networks”, Invited Paper, TOP , Vol. 23,619-646 (2015)

L. Turner, D. Poetranto Groß, H.W. Hamacher, S.O. Krumke: “Rejoinder on: Static and dynamic source locations in undirected networks”, TOP , Vol. 23, 665-668 (2015)

L. Turner, A. P. Punnen, Y. P. Aneja, H. W. Hamacher: “On generalized balanced optimization problems”, Math Meth Oper Res 73:19–27 (2011).

H. Uhlemair, I. Karschin, J. Geldermann: “Optimizing the production and distribution system of bioenergy villages”. International Journal of Production Economics, Volume 147, pp, 62–72 (2014)

B. Vaaben, J. Larsen: “Mitigation of airspace congestion impact on airline networks” Journal of Air Transport Management, vol 47, pp. 54-65. (2015)

S. Venugopalan, O. Sinnen: “Integer linear programming for the multiprocessor scheduling problem with communication delays”. IEEE Transactions on Parallel and Distributed Systems, 16:142–151, (2015).

Vikas, N. Giacaman, O. Sinnen: “Multiprocessing with GUI-awareness using OpenMP-like directives in java”. Parallel Computing, 40:69–89, (2014).

C. Vilhelmsen, R. M. Lusby, J. Larsen: “Routing and Scheduling in Tramp Shipping – Integrating Bunker Optimization”, EURO Journal of Transportation and Logistics, vol. 3, no. 2, 2014, p. 143-175.

J. Y. T. Wang, M. Ehrgott: “Modelling route choice behaviour in a tolled road network with a time surplus maximisation bi-objective user equilibrium model”, Transportation Research Part B: Methodological, Volume 57, pp. 342–360 (2013)

M. Wen, E. Krapper, J. Larsen, T. R. Stidsen: “A multilevel variable neighborhood search heuristic for a practical vehicle routing and driver scheduling problem”, Networks Volume 58, Issue 4, pp. 311-322 (2011)

T. L. Werth, H. Sperber, S. O. Krumke: “Computation of equilibria and the price of anarchy in bottleneck congestion games”, Central European Journal of Operations Research, (2013)

S. Westphal, K. Noparlik: “A 5.875-Approximation for the Traveling Tournament Problem”, Annals of Operations Research, Volume 218, Issue 1, pp. 347–360 (2014)

S. Westphal, C. Thielen: “Complexity of the traveling tournament problem”, Theoret. Comput. Sci. 412, 345-351 (2011)

S. Westphal, S. O. Krumke, A. Taudes: “Online scheduling of weighted equal-length jobs with hard deadlines on parallel machines”, Comput. Oper. Res. 38, 1103-1108 (2011)

S. Wiedenmann: “Supply Planning for Processors of Agricultural Raw Materials”. Dissertation. Cuvillier Verlag, Göttingen (2013

**Accepted Papers**

G. Cabrera, M. Ehrgott, A. Mason, A. Raith: “A Matheuristic approach to solve the multi-objective beam angle optimisation problem in intensity modulated radiation therapy”, accepted in ITOR (2015)

E. Carrizosa, J. Harbering, A. Schöbel: “The Stop Location Problem with Realistic Traveling Time”. To appear.

A. Chassein, M. Goerigk: “On the recoverable robust traveling salesman problem”. Optimization Letters. To appear.

M. Goerigk, A. Schöbel: “Algorithm Engineering in Robust Optimization”. LNCS State-of-the-Art Surveys, Springer. To appear.

K. Kuhn, A. Raith, M. Schmidt, A. Schöbel: “Bicriteria robust optimization”, European Journal of Operational Research (2016).

R. M. Lusby, J. T. Haahr: “A Matheuristic Approach for Solving the Railroad Hump Yard Block-to-Track Assignment”. Networks. To appear.

A. Mason, “Using Excel to teach Column Generation using OpenSolver, SolverStudio and AMPL”, to appear in INFORMS Transactions on Education (2015)

O. Perederieieva, M. Ehrgott, A. Raith, J. Y. T. Wang: “Numerical stability of path-based algorithms for traffic assignment”, Optimization Methods and Software (2015)

A. E. Phillips, C. G. Walker, M. Ehrgott, D. M. Ryan: “Integer Programming for Minimal Perturbation Problems in University Course Timetabling”, accepted in Annals of Operations Research (2016)

U. Pyakurel, M. Goerigk, T. N. Dhamala, H. W. Hamacher: “Transit Dependent Evacuation Planning for Kathmandu Valley: A Case Study”. IJORN (in print).

U. Pyakurel, H.W. Hamacher, T.N. Dhamala: “Generalized Maximum Dynamic Contraflows on Lossy Networks”, IJORN 3 (2014), 27-44

P. Thorlacius, J. Larsen, M. Laumanns: “An Integrated Rolling Stock Planning Model for the Copenhagen Suburban Passenger Railway”, accepted in Journal of Rail Transport Planning & Management (2015)

**Submitted Papers**

P. Gattermann, J. Harbering, A. Schöbel: “Generation of Line Pools” (2015)

M. Goerigk, A. Schöbel: “A note on the connection between strict and adjustable robustness” (2012)

J. Harbering: “Delay Resistant Line Planning” (2015)

J. Harbering, A. Ranade, M. Schmidt, O.Sinnen: “Single Track Train Scheduling” (2015)

S. O. Krumke, C. Thielen, S. Westphal: “Strong Implementation of Social Choice Functions in Dominant Strategies”, (2015).

J. Manitz, J. Harbering, M. Schmidt, T. Kneib, A. Schöbel: “Network-based Source Detection for PropagationProcesses on Complex Networks with an Application to Train Delays on Railway Systems”, (2015).

S. Moradi, A. Raith, M. Ehrgott: “Decomposition Subproblem Forumlations for Bi-objective Multi-commodity Network Flow Problems” (2015)

R. C. Storey, J. E. Cater, S. E. Norris: “Large Eddy Simulation of Turbine Loading and Performance in a Wind Farm” (2015)

T. Treskatis, M. A. Moyers-Gonzaleza, C. J. Pricea: “An Accelerated Dual Gradient Method and Applications in Viscoplasticity”, arXiv preprint arXiv:1509.05084, (2014)

O. Hinder, A Mason: “A Novel Integer Programming Formulation for Scheduling with Family Setup Times on a Single Machine to Minimize Maximum Lateness”, submitted to European Journal of Operational Research (2015)

**Work in Progress**

I. Hamling, C. Thielen, S. O. Krumke, M. O’Sullivan, C. Walker: “An online allocation algorithm for user allocation in a cloud based internet cafe” (2015)

L. Chen, A. Raith, P. F. T. Henning, Y. A. Shamseldin: “Multi-Objective Meta-Heuristics for Decision Making in Pavement Management” (2015)

L. Chen, P. F. T. Henning, A. Raith, Y. A. Shamseldin: “Measuring the Performance of Multi-Objective Optimisation Algorithms in Decision Making in Infrastructure Asset Management” (2015)

G. Cabrera, M. Ehrgott, A. Mason, A. Raith: “Multi-objective optimisation over a set of convex sub-problems”, in preparation (2015)

G. Cabrera, M. Ehrgott, A. Mason, A. Raith: “Multi-objective local search algorithms to solve the multi-objective beam angle optimisation problem in intensity modulated radiation therapy”, in preparation (2015)

O. Perederieieva, A. Raith, M. Schmidt. “Non-additive Shortest Path in the Context of Traffic Assignment”, Planned to be submitted to EJOR (2015)