A list of publications by the Combinatorial Optimization Group since 1997 sorted by year.

2024

  • Mathwieser, Corinna Marlene and Eranda Cela, Special Cases of the Minimum Spanning Tree Problem under Explorable Edge and Vertex Uncertainty, Networks, Wiley-Liss Inc., 2024, (2024). [doi]
  • Marc Goerigk, Stefan Lendl and Lasse Wulf, On the complexity of robust multi-stage problems with discrete recourse, Discrete Applied Mathematics, Elsevier B.V., 343, (2024), 355–370. [doi]

2023

  • Bettina Klinz and Eranda Çela, Gerhard J. Woeginger 1964-2022, Internationale Mathematische Nachrichten, Österreichische Mathematische Gesellschaft, ÖMG, 77(254), (2023).
  • Hoang, Hung P., Stefan Lendl and Lasse Wulf, Assistance and interdiction problems on interval graphs, Discrete Applied Mathematics, Elsevier B.V., 340, (2023), 153–170. [doi]
  • Çela , Eranda  , Vladmir Deineko and Wöginger, Gerhard Johannes, Recognising permuted Demidenko matrices, Operations Research Letters, Elsevier B.V., 51(5), (2023), 494–500. [doi]
  • Eranda Çela, Bettina Klinz, Stefan Lendl, Woeginger, Gerhard J. and Lasse Wulf, A linear time algorithm for linearizing quadratic and higher-order shortest path problems, Technical report, , (2023).
  • Stefan Lendl, Gerhard Woeginger and Lasse Wulf, Non-Preemptive Tree Packing, Algorithmica, Springer New York, 85(3), (2023), 783–804. [doi]
  • Eranda Çela, Stephan Hafner, Ulrich Pferschy and Roland Mestel, Integrating multiple sources of ordinal information in portfolio optimization, Technical report, , (2023).
  • Çela , Eranda  , Bettina Klinz, Stefan Lendl, Woeginger, Gerhard J. and Lasse Wulf, A linear time algorithm for linearizing quadratic and higher-order shortest path problems, In Integer Programming and Combinatorial Optimization - 24th International Conference, IPCO 2023, Proceedings (Del Pia, Alberto, Volker Kaibel, eds.), Springer, (2023), 466–479. [doi]

2022

  • Marc Goerigk, Stefan Lendl and Lasse Wulf, Recoverable robust representatives selection problems with discrete budgeted uncertainty, European Journal of Operational Research, Elsevier B.V., 303(2), (2022), 567–580. [doi]
  • Marc Goerigk, Stefan Lendl and Lasse Wulf, Two-Stage robust optimization problems with two-stage uncertainty, European Journal of Operational Research, Elsevier B.V., 302(1), (2022), 62–78. [doi]
  • Stefan Lendl, Gerhard Woeginger and Lasse Wulf, Non-Preemptive Tree Packing, Algorithmica, Springer New York, (2022). [doi]
  • Ante Custic and Stefan Lendl, The Steiner Cycle and Path Cover Problem on Interval Graphs, Journal of Combinatorial Optimization, Springer Science+Business Media B.V, 43(1), (2022), 226–234. [doi]

2021

  • Eranda Dragoti-Cela, Woeginger, Gerhard J. and Vladimir Deineko, Travelling salesman paths on Demidenko matrices, Discrete Applied Mathematics, Elsevier B.V., (2021). [doi]
  • Thomas Lachmann, Stefan Lendl and Woeginger, Gerhard J., A linear time algorithm for the robust recoverable selection problem, Discrete Applied Mathematics, Elsevier B.V., 303, (2021), 94–107. [doi]
  • Nikolaus Furian, Michael O'Sullivan, Cameron Walker and Eranda Cela, A Machine Learning Based Branch and Price Algorithm for a Sampled Vehicle Routing Problem, OR-Spectrum, Springer Verlag, 43(3), (2021), 693–732. [doi]
  • Eranda Dragoti-Cela, Bettina Klinz, Stefan Lendl, Orlin, James B., Gerhard Woeginger and Lasse Wulf, Linearizable Special Cases of the Quadratic Shortest Path Problem, In Graph-Theoretic Concepts in Computer Science (Kowalik, Łukasz, Pilipczuk, Michał, Rz\c a\.zewski, Pawel, eds.), Springer, (2021), 245–256. [doi]
  • Stefan Lendl, Britta Peis and Veerle Timmermans, Matroid Bases with Cardinality Constraints on the Intersection, Mathematical Programming, Springer, (2021). [doi]
  • Hartmann, Tim A., Stefan Lendl and Woeginger, Gerhard J., Continuous facility location on graphs, Mathematical Programming, Springer, (2021). [doi]
  • Eranda Cela, Stephan Hafner, Roland Mestel and Ulrich Pferschy, Mean-variance portfolio optimization based on ordinal information, Journal of Banking and Finance, Elsevier B.V., 122, (2021). [doi]
  • Marc Goerigk and Stefan Lendl, Robust Combinatorial Optimization with Locally Budgeted Uncertainty, Open Journal of Mathematical Optimization, Centre Mersenne for Open Scientific Publishing, 2, (2021). [doi]
  • Dennis Fischer, Hartmann, Tim A., Stefan Lendl and Woeginger, Gerhard J., An Investigation of the Recoverable Robust Assignment Problem, In 16th International Symposium on Parameterized and Exact Computation (IPEC 2021) (Golovach, Petr A., Meirav Zehavi, eds.), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 214, (2021), 19:1—-19:14. [doi]
  • Stefan Lendl, Gerhard Woeginger and Lasse Wulf, Non-preemptive Tree Packing, In Combinatorial Algorithms. IWOCA 2021. Lecture Notes in Computer Science (P. Flocchini, L. Moura, eds.), Springer, 12757, (2021).

2020

  • Eranda Dragoti-Cela, Vladimir Deineko and Gerhard Woeginger, Travelling salesman paths on Demidenko matrices, Technical report, , (2020).
  • Eranda Dragoti-Cela and Elisabeth Gaar, Relationship of k-Bend and Monotonic ℓ-Bend Edge Intersection Graphs of Paths on a Grid, Technical report, , (2020), 1–30.
  • Hartmann, Tim A., Stefan Lendl and Woeginger, Gerhard J., Continuous facility location on graphs, In Integer Programming and Combinatorial Optimization - 21st International Conference, IPCO 2020, Proceedings (Daniel Bienstock, Giacomo Zambelli, eds.), Springer, (2020), 171–181. [url] [doi]

2019

  • Eranda Cela and Elisabeth Gaar, Monotonic Representations of Outerplanar Graphs as Edge Intersection Graphs of Paths on a Grid, Technical report, , (2019).
  • Eranda Dragoti-Cela, Ulrich Pferschy, Roland Mestel and Stephan Hafner, Mean-Variance Portfolio Optimization Based on Ordinal Information, Technical report, , (2019), 1–34.
  • Alexander Grigoriev, Hartmann, Tim A., Stefan Lendl and Woeginger, Gerhard J., Dispersing obnoxious facilities on a graph, In 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019), 33:1–33:11. [url] [doi]
  • Stefan Lendl, Ante Custic and Abraham Punnen, Combinatorial Optimization with Interaction Costs: Complexity and Solvable Cases, Discrete optimization, Elsevier B.V., 33, (2019), 101–117. [doi]

2018

  • Eranda Dragoti-Cela, Vladimir Deineko and Gerhard Woeginger, New special cases of the Quadratic Assignment Problem with diagonally structured coefficient matrices, European Journal of Operational Research, Elsevier B.V., 267(3), (2018), 818–834. [doi]
  • Leonardo Alese, Stefan Lendl and Paul Tabatabai, On sequences covering all rainbow k-progressions, Journal of Combinatorics, International Press of Boston, Inc., 9(4), (2018). [doi]

2017

  • Eranda Cela, Vladimir Deineko and Woeginger, Gerhard Johannes, The multi-stripe travelling salesman problem, Annals of Operations Research, Springer Netherlands, 259(1-2), (2017), 21–34. [doi]

2016

  • Michael Martin, Arno Eichberger and Eranda Dragoti-Cela, Optimization Approach to Handle Global CO2 Fleet Emission Standards, (2016). [doi]
  • Ante Custic and Bettina Klinz, The constant objective value property for multidimensional assignment problems, Discrete optimization, Elsevier B.V., (2016), 23–35. [doi]
  • Eranda Dragoti-Cela, Vladimir Deineko and Woeginger, Gerhard J., Linearizable special cases of the QAP, Journal of Combinatorial Optimization, Springer Science+Business Media B.V, 31(3), (2016), 1269–1279. [doi]

2015

  • Eranda Dragoti-Cela, Vladimir Deineko and Woeginger, Gerhard J., Well-solvable cases of the QAP with block-structured matrices, Discrete Applied Mathematics, Elsevier B.V., 186, (2015), 56–65. [doi]
  • Eranda Dragoti-Cela and Rostislav Stanek, Heuristics for the data arrangement problem on regular trees, Journal of Combinatorial Optimization, Springer Science+Business Media B.V, 30(3), (2015), 768–802. [doi]
  • Ante Custic, Bettina Klinz and Wöginger, Gerhard Johannes, Geometric versions of the 3-dimensional assignment problem under general norms, Discrete optimization, Elsevier B.V., 18, (2015), 38–55. [doi]
  • Eranda Dragoti-Cela, Vladimir Deineko and Woeginger, Gerhard J., A new tractable case of the QAP with a Robinson matrix,, In Proceedings of the 9th International Conference on Combinatorial Optimization and Applications (COCOA'2015), Springer, 9486, (2015), 709–720.

2014

  • Vladimir Deineko, Bettina Klinz, Alexander Tiskin and Wöginger, Gerhard Johannes, Four-point conditions for the TSP: The complete complexity classification, Discrete optimization, Elsevier B.V., 14, (2014), 147–159. [doi]

2013

  • Vladimir Deineko, Bettina Klinz and Wöginger, Gerhard Johannes, Uniqueness in quadratic and hyperbolic 0–1 programming problems, Operations Research Letters, Elsevier B.V., 41(6), (2013), 633–635. [doi]
  • Simon Walk, Jan Pöschko, Markus Strohmaier, Keith Andrews, Tania Tudorache, Natalya Noy, Csongor Nyulas and Mark Musen, PragmatiX: An Interactive Tool for Visualizing the Creation Process Behind Collaboratively Engineered Ontologies, International journal on semantic web and information systems, IGI Publishing, 9(1), (2013), 45–78. [doi]

2012

  • Eranda Dragoti-Cela, Vladimir. Deineko and Woeginger, Gerhard Johannes, The x-and-y-axes travelling salesman problem, European Journal of Operational Research, Elsevier B.V., 223, (2012), 333–345. [doi]
  • Johannes Hatzl, 2-balanced Flows and the Inverse 1-median Problem in the Chebyshev Space, Discrete optimization, Elsevier B.V., 9(3), (2012), 137–148. [doi]
  • Eranda Dragoti-Cela, Vladimir. Deineko and Woeginger, Gerhard Johannes, Another well-solvable case of the QAP: Maximizing the job completion time variance,, Operations Research Letters, Elsevier B.V., 40, (2012), 356–359. [doi]
  • Elisabeth Gassner, An inverse approach to convex ordered median problems in trees, Journal of Combinatorial Optimization, Springer Science+Business Media B.V, 23, (2012), 262–273.

2011

  • Rainer Burkard, Baroughi Bonap, Fahimeh and Elisabeth Gassner, Inverse p-median problems with variable edge lengths, Mathematical Methods of Operations Research, Physica-Verlag, 73(2), (2011), 263–280. [doi]
  • Johannes Hatzl, Toufik Mansour and Mark Shattuck, Maximizing a Sum Related to Image Segmentation Evaluation, Journal of Mathematical Modelling and Algorithms, Springer Netherlands, 10, (2011), 193–203. [doi]
  • Bettina Klinz and Wöginger, Gerhard Johannes, The Northwest corner rule revisited, Discrete Applied Mathematics, Elsevier B.V., 159(12), (2011), 1284–1289. [doi]
  • Eranda Dragoti-Cela, Schmuck, Nina Sabine, Shmuel Wimer and Wöginger, Gerhard Johannes, The Wiener maximum quadratic assignment problem, Discrete optimization, Elsevier B.V., 8, (2011), 411–416. [doi]

2010

  • Elisabeth Gassner, The Steiner Forest Problem Revisited, Journal of Discrete Algorithms, Elsevier B.V., 8, (2010), 154–163. [doi]
  • Elisabeth Gassner and Bettina Klinz, A Fast Parametric Assignment Algorithm with Applications in Max-Algebra, Networks, Wiley-Liss Inc., 55(2), (2010), 61–77. [doi]
  • Rainer Burkard, Mohammadreza Galavii and Elisabeth Gassner, The inverse Fermat-Weber problem, European Journal of Operational Research, Elsevier B.V., 206, (2010), 11–17. [doi]
  • Rainer Burkard and Johannes Hatzl, Median problems with positive and negative weights on cycles and cacti, Journal of Combinatorial Optimization, Springer Science+Business Media B.V, 20, (2010), 27–46. [doi]
  • Johannes Hatzl, The Inverse 1-median Problem in R^d with the Chebyshev-Norm, In 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, ., (2010), 87–90.
  • Johannes Hatzl, The 1-median Problem in R^d with the Chebyshev-norm and its inverse problem, In Electronic Notes in Discrete Mathematics, ., (2010), 1137–1144.
  • Johannes Hatzl and Andreas Karrenbauer, A Combinatorial Algorithm for the 1-Median Problem in R^d with the Chebyshev-Norm, Operations Research Letters, Elsevier B.V., 38, (2010), 383–385.
  • Elisabeth Gassner, Johannes Hatzl, Krumke, Sven O. and Sleman Saliba, CLEVER or SMART: Strategies for the Online Target Date Assignement Problem, Discrete Applied Mathematics, Elsevier B.V., 158 (1), (2010), 71–79. [doi]

2009

  • Behrooz Alizadeh, Rainer Burkard and Ulrich Pferschy, Optimal algorithms for inverse center location problems with edge length augmentation on trees, (2009).
  • Elisabeth Gassner and Günter Rote, The Inverse Fermat-Weber Problem, (2009).
  • Elisabeth Gassner, Johannes Hatzl, Krumke, Sven O., Heike Sperber and Woeginger, Gerhard J., How hard is it to find extreme Nash equilibria in network congestion games?, Theoretical Computer Science, Elsevier B.V., 410 (47-4), (2009), 4989–4999.
  • Elisabeth Gassner, Location Problems with Variable Input Data, PhD thesis, , (2009).
  • Elisabeth Gassner, A game-theoretic approach for downgrading the 1-median in the plane with Manhattan metric, Annals of Operations Research, Springer Netherlands, 172(1), (2009), 393–404. [doi]
  • Elisabeth Gassner and Bettina Klinz, The computational complexity of bilevel assignment problems, 4OR, Springer Verlag, 7, (2009), 379–394. [doi]
  • Vladimir Deineko, Bettina Klinz and Wöginger, Gerhard Johannes, The complexity of computing the Muirhead–Dalton distance, Mathematical Social Sciences, Elsevier B.V., 57(2), (2009), 282–284. [doi]
  • Behrooz Alizadeh, Burkard, Rainer Ernest and Ulrich Pferschy, Inverse 1-center location problems with edge length augmentation on trees, ., (2009).
  • Elisabeth Gassner, Up- and downgrading the 1-center in a network, European Journal of Operational Research, Elsevier B.V., 198, (2009), 370–377.
  • Behrooz Alizadeh, Rainer Burkard and Ulrich Pferschy, Inverse 1-center location problems with edge length augmentation on trees, Computing, Springer Wien, 86, (2009), 331–343. [doi]
  • Behrooz Alizadeh, Rainer Burkard and Ulrich Pferschy, Inverse 1-center location problems with edge length augmentation on trees, ., (2009).
  • Vladimir Deineko, Bettina Klinz and Wöginger, Gerhard Johannes, Polygons with inscribed circles and prescribed side lengths, Applied Mathematics Letters, Elsevier Limited, 22(5), (2009), 704–706. [doi]

2008

  • Elisabeth Gassner and Johannes Hatzl, How hard is it to find extreme Nash equilibria in network congestion games?, (2008).
  • Elisabeth Gassner and Johannes Hatzl, Clever or Smart: Strategies for the Online Target Date Assignment Problem, (2008).
  • Elisabeth Gassner, Up- and downgrading the 1-median in a network, TU Graz, Institut für Optimierung und Diskrete Mathematik (Math B), (2008).
  • Rainer Burkard, Elisabeth Gassner and Johannes Hatzl, Reverse 2-median problem on trees, Discrete Applied Mathematics, Elsevier B.V., 156(11), (2008), 1963–1976. [doi]
  • Elisabeth Gassner, Johannes Hatzl, Sven Krumke, Heike Sperber and Wöginger, Gerhard Johannes, How hard is it to find extreme Nash equilibria in network congestion games? (extended abstract), Lecture Notes in Computer Science, Springer Verlag, 5385, (2008), 82–93.
  • Rainer Burkard, Galavii, Mohammadreza, [No Value] and Elisabeth Gassner, Inverse 1-median problems, In Oberwolfach Reports, ., 51/2008, (2008), 2908–2909.
  • Johannes Hatzl and Stephan Wagner, Combinatorial properties of a domination problem with parity constraints, Discrete Mathematics, Elsevier B.V., 308, (2008), 6355–6367. [doi]
  • Elisabeth Gassner, The Inverse 1-Maxian Problem with edge length modification, Journal of Combinatorial Optimization, Springer Science+Business Media B.V, 16, (2008), 50–67.
  • Alejandro Estrella-Balderrama, Elisabeth Gassner, Michael Jünger, Merijam Percan, Marcus Schaefer and Michael Schulz, Simultaneous Geometric Graph Embeddings, Lecture Notes in Computer Science, Springer Verlag, 4875, (2008), 280–290. [doi]
  • Elisabeth Gassner and Johannes Hatzl, A Parity Domination Problem in Graphs with Bounded Treewidth and Distance-hereditary Graphs, Computing, Springer Wien, 82, (2008), 171–187. [doi]

2007

  • Burkard, Rainer Ernst, Behrooz Alizadeh and Baroughi Bonab, Fahimeh, Semi-Infinite Programming for solving Linear Fractional Programming with Fuzzy Parameters in Constraints, (2007).
  • Burkard, Rainer Ernst, Behrooz Alizadeh and Baroughi Bonab, Fahimeh, Semi-infinite optimization for solving linear fractional programming with fuzzy coefficients, (2007).
  • Burkard, Rainer Ernst, Discrete optimization:an Austrian view, Annals of Operations Research, Springer Netherlands, 149, (2007), 43–48.
  • Johannes Hatzl, Mixed Integer Linear Programs for Batch Processes, (2007).
  • Burkard, Rainer Ernst, Monge properties, discrete convexity and applications, European Journal of Operational Research, Elsevier B.V., 176, (2007), 1–14.
  • Burkard, Rainer Ernst, Jafar Fathali and Kakhki, Hossein Taghizadeh, The p-maxian problem on a tree, Operations Research Letters, Elsevier B.V., 35, (2007), 331–335. [doi]
  • Johannes Hatzl and Stephan Wagner, Combinatorial properties of a general domination problem with parity constraints, (2007).
  • Burkard, Rainer Ernst and Jafar Fathali, A polynomial method for the pos/neg weighted 3-median problem on a tree, Mathematical Methods of Operations Research, Physica-Verlag, 65, (2007), 229–238. [doi]
  • Johannes Hatzl, Median problems on wheels and cactus graphs, Computing, Springer Wien, 80(4), (2007), 377–393.

2006

  • J Fathali, Taghizadeh Kakhki, H and Burkard, Rainer Ernst, An ant colony algorithm for the pos/neg weighted p-median problem, Central European Journal of Operations Research, Springer, 14, (2006), 229–246.
  • Vladimir Deineko, Bettina Klinz and Wöginger, Gerhard Johannes, Exact algorithms for the Hamiltonian cycle problem in planar graphs, Operations Research Letters, Elsevier B.V., 34(3), (2006), 269–274. [doi]
  • Burkard, Rainer Ernst, Elisabeth Gassner and Johannes Hatzl, A linear time algorithm for the reverse 1-median problem on a cycle, Networks, Wiley-Liss Inc., 48(1), (2006), 16–23.
  • Guangting Chen, Gu Zhang and Burkard, Rainer Ernst, The web proxy location problem in general tree of rings networks, Journal of Combinatorial Optimization, Springer Science+Business Media B.V, 12, (2006), 327–336. [doi]
  • Eranda Dragoti-Cela, Bettina Klinz and Christophe Meyer, Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem, Journal of Combinatorial Optimization, Springer Science+Business Media B.V, 12, (2006), 187–215. [doi]
  • Burkard, Rainer Ernst and Johannes Hatzl, Modelling and optimizing batch processes in the chemical industry, Chapter in , Springer, (2006), 279–290.
  • Hansjörg Albrecher, Burkard, Rainer Ernst and Eranda Dragoti-Cela, An asymptotical study of combinatorial optimization problems by means of statistical mechanics, Journal of Computational and Applied Mathematics, Elsevier B.V., 186(1), (2006), 148–162.
  • Vladimir Deineko, Bettina Klinz and Wöginger, Gerhard Johannes, Four point conditions and exponential neighborhoods for symmetric TSP, In Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm, Association of Computing Machinery, (2006), 544–553. [doi]
  • Elisabeth Gassner, Michael Jünger, Merijam Percan, Michael Schulz and Marcus Schaefer, Simultaneous Graph Embeddings with Fixed Edges, Lecture Notes in Computer Science, Springer Verlag, 4271, (2006), 325–335. [doi]
  • Burkard, Rainer Ernst and Johannes Hatzl, A complex time based construction heuristic for batch scheduling problems in the chemical industry, European Journal of Operational Research, Elsevier B.V., 174(2), (2006), 1162–1183.
  • Elisabeth Gassner and Sven Krumke, Deterministic Online Optical Call Admission Revisited, In Approximation and Online Algorithms, Springer, 3879, (2006), 190–202. [doi]
  • Bettina Klinz, Ulrich Pferschy and Joachim Schauer, ILP Models for a Nurse Scheduling Problem, In Operations Research Proceedings 2006, Springer, (2006), 319–324.

2005

  • Bettina Klinz and Wöginger, Gerhard Johannes, Faster algorithms for computing power indices in weighted voting games, Mathematical Social Sciences, Elsevier B.V., 49, (2005), 111–116. [doi]
  • Elisabeth Gassner, Deterministic Online Optical Call Admission Revisited, In Oberwolfach reports, Mathematisches Forschungsinstitut Oberwolfach, (2005), 2918–2920.
  • Christian Zelle and Burkard, Rainer Ernst, The reel and sheet cutting problem in paper industry, Central European Journal of Operations Research, Springer, 13, (2005), 147–167.
  • Burkard, Rainer Ernst, (Generalized) Convexity and Discrete Optimization, Chapter in (Andrew Eberhard, Nicolas Hadjisavvas, Luc, Dinh The, eds.), Springer, (2005), 23–37.
  • Johannes Hatzl, Reverse Median Problems on Graphs, In Oberwolfach Report No. 50/2005, ., (2005), 2854–2856.
  • Burkard, Rainer Ernst and Johannes Hatzl, Review, extensions and computational comparison of MILP formulations for scheduling of batch processes, Computers & Chemical Engineering, Elsevier B.V., 29, (2005), 1752–1769.

2004

  • Burkard, Rainer Ernst and Vladimir Deineko, On the Euclidean TSPwith a permuted Van der Veen matrix, Information Processing Letters, Elsevier B.V., 91, (2004), 259–262.
  • Burkard, Rainer Ernst, Y. Lin and Z. Zhang, Weight reduction problems with certain bottleneck objectives, European Journal of Operational Research, Elsevier B.V., 153, (2004), 191–199.
  • Elisabeth Gassner, Variants of the Assignment Problem and of the Transportation Problem, PhD thesis, , (2004).
  • Bettina Klinz and Wöginger, Gerhard Johannes, Minimum cost dynamic flow problems: The series-parallel case, Networks, Wiley-Liss Inc., 43, (2004), 153–162.
  • Burkard, Rainer Ernst, Carmen Pleschiutschnig and Jianzhong Zhang, Inverse p-median problems, Discrete optimization, Elsevier B.V., no. 1, (2004), 23–39.
  • Burkard, Rainer Ernst and Johannes Hatzl, Mixed-integer linear programs for batch processes, In Discrete optimization methods in production and logistics (DOM'2004), ., (2004), 108–113.

2003

  • Burkard, Rainer Ernst and P. Butkovic, Max-algebra and the linear assignment problem, Mathematical Programming, Springer, 98, (2003), 415–429.
  • Guangting Chen and Burkard, Rainer Ernst, Constrained Steiner trees in Halin graphs, RAIRO / Operations research, EDP Sciences, 37, (2003), 179–194.
  • Vladimir Deineko, Bettina Klinz and Wöginger, Gerhard Johannes, Which cost matrices are immune against the transportation paradox?, Discrete Applied Mathematics, Elsevier B.V., 130, (2003), 495–501. [doi]
  • Matthias Ehrgott and Dagmar Tenfelde-Podehl, Computation of ideal and Nadir values and implications for their use in MCDM methods, European Journal of Operational Research, Elsevier B.V., 151, (2003), 119–139.
  • Burkard, Rainer Ernst and Helidon Dollani, Center Problems with pos/neg weights on trees, European Journal of Operational Research, Elsevier B.V., 145, (2003), 483–495.
  • Burkard, Rainer Ernst and Peter Butkovic, Finding all essential terms of characteristic maxpolynomial, Discrete Applied Mathematics, Elsevier B.V., 130, (2003), 367–380.

2002

  • Elisabeth Gassner, Maximal spannende Baumprobleme mit einer Hierarchie von zwei Entscheidungsträgern, PhD thesis, , (2002).
  • Burkard, Rainer Ernst, Selected topics in assignment problems, Discrete Applied Mathematics, Elsevier B.V., 123, (2002), 257–302.
  • Dagmar Tenfelde-Podehl and H.W. Hamacher, Entropie und Chaos in Stadt und Verkehr, Shaker-Verlag GmbH, (2002).
  • Burkard, Rainer Ernst, T. Fortuna and C.A.J. Hurkens, Makespan minimization of chemical batch processes using non-uniform time-grids, Computers & Chemical Engineering, Elsevier B.V., 26, (2002), 1321–1332.
  • Burkard, Rainer Ernst and H. Dollani, A note on the robust 1-center problem on trees, Annals of Operations Research, Springer Netherlands, 110, (2002), 68–82.
  • Burkard, Rainer Ernst, The travelling salesman problem, Chapter in , Oxford University Press, (2002), 616–624.
  • Dagmar Tenfelde-Podehl and H.W. Hamacher, Gentechnologie - Fluch oder Segen?, Shaker-Verlag GmbH, (2002).
  • Combinatorial and global optimization, (P. Pardalos, A. Migdalas, Burkard, Rainer Ernst, eds.), World Scientific, 14, (2002).

2001

  • Mathematics of industrial systems V, (Burkard, Rainer Ernst, T. Ibaraki, W.R. Pulleyblank, H. Blank, G. Mirta, S. Noble, eds.), Kluwer Academic Publishers, 107, (2001).
  • Burkard, Rainer Ernst, Transportation problems, Chapter in , Physica-Verlag, (2001), 249–261.
  • Eranda Dragoti-Cela, NP-hard location problems: efficiently solvable special cases and lower bounds, PhD thesis, , (2001).
  • Burkard, Rainer Ernst, Helidon Dollani and Thach, Phan Thien, Linear approximations in a dynamic programming approach for the uncapacitated single-source minimum concave network flow problem in acyclic networks, Journal of global optimization, Springer Netherlands, 19, (2001), 121–139.
  • Burkard, Rainer Ernst, H. Dollani, Yixun Lin and Günther Rothe, The obnoxious center problem on a tree, SIAM Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics Publications, 14, (2001), 498–509.
  • Burkard, Rainer Ernst, Bettina Klinz and Jianzhong Zhang, Bottleneck capacity expansion problems with general budget constraints, RAIRO / Operations research, EDP Sciences, 35, (2001), 1–20.
  • Burkard, Rainer Ernst, Bettina Klinz, Yixun Lin and Jason Zhang, Capacity expansion and weight reduction problems, In Proceedings of the 6th International Symposium on Operational Research, Slovenian Society Informatika, (2001), 119–124.
  • Burkard, Rainer Ernst and Helidon Dollani, Robust problems with pos/neg weights on a tree, Networks, Wiley-Liss Inc., 38, (2001), 102–113.

2000

  • Burkard, Rainer Ernst and Eranda Dragoti-Cela, Optimal location of facilities for a two stage production process, ECMI newsletter, 28, (2000), 14–16.
  • Burkard, Rainer Ernst, Eranda Dragoti-Cela and Helidon Dollani, 2-Medians in networks with pos/neg weights, Discrete Applied Mathematics, Elsevier B.V., 105, (2000), 51–71.
  • Mathematics of industrial systems IV, (Burkard, Rainer Ernst, T. Ibararki, W.R. Pulleyblank, E. Santibanez-Gonzalez, eds.), Baltzer, 96, (2000).
  • Zur Kunst des Formalen Denkens, (Burkard, Rainer Ernst, W. Maass, Peter Weibel, eds.), Passagen Verlag, (2000).
  • Burkard, Rainer Ernst, P. Deuflhard, A. Jameson, J.-L. Lions and G. Strang, Computational mathematics driven by industrial problems, Springer, 1739, (2000).
  • Burkard, Rainer Ernst, Zuordnungsprobleme: Ein Streifzug durch die kombinatorische Optimierung, Chapter in , Passagen Verlag, (2000), 193–207.

1999

  • Burkard, Rainer Ernst, Karin Feldbacher, Bettina Klinz and Wöginger, Gerhard Johannes, Minimum cost strong network orientation problems: Classification, algorithms and complexity, Networks, Wiley-Liss Inc., 33(1), (1999), 57–70. [doi]
  • Eranda Dragoti-Cela, Karisch, Stefan E., Jens Clausen and Torn Espersen, A dual framework for lower bounds of the quadratic assignment problem based on linearization, Computing, Springer Wien, 63, (1999), 351–403.
  • Burkard, Rainer Ernst and Eranda Çela, Linear assignment problems and extensions, Chapter in , Kluwer Academic Publishers, (1999), 75–149.
  • Mihali Hujter, Bettina Klinz and Wöginger, Gerhard Johannes, A note on the complexity of the transportation problem with a permutable demand vector, Mathematical Methods of Operations Research, Physica-Verlag, 50, (1999), 9–16.
  • Stefan Meusel and Burkard, Rainer Ernst, A transportation problem with a permuted demand vector, Mathematical Methods of Operations Research, Physica-Verlag, 50, (1999), 1–8.
  • Burkard, Rainer Ernst, S. Karisch and Franz Rendl, QAPLIB- A quadratic assignment problem libraray, European Journal of Operational Research, Elsevier B.V., 55, (1999), 115–119.
  • Bettina Klinz, Well-solvable Cases of Hard Combinatorial Optimization Problems - the Role of Special Cost Matrices and Related Input Restrictions, PhD thesis, , (1999).
  • Bettina Klinz and Wöginger, Gerhard Johannes, A note on the bottleneck graph partition problem, Networks, Wiley-Liss Inc., 33(3), (1999), 189–191.
  • Burkard, Rainer Ernst and Tiziana Fortuna, Batch processing in the chemical industry: a model based on nonuniform time discretization., In Proceedings of the 5th International Symposium on Operational Research, Slovenian Society Informatika, (1999), 1–6.
  • Burkard, Rainer Ernst, OR Utopia, European Journal of Operational Research, Elsevier B.V., 119, (1999), 224–234.
  • Integer programming and combinatorial optimization, (Burkard, Rainer Ernst, G. Cornuejols, G.J. Woeginger, eds.), Springer, 1610, (1999).
  • Burkard, Rainer Ernst, Vladimir Deineko and Wöginger, Gerhard Johannes, The traveling salesman problem on permuted Monge matrices, Journal of Combinatorial Optimization, Springer Science+Business Media B.V, 2, (1999), 333–350.
  • Burkard, Rainer Ernst and M.M. Miatselski, Volume maximization and orthoconvex approximation of orthogons, Computing, Springer Wien, 63, (1999), 317–330.
  • Bettina Klinz and Wöginger, Gerhard Johannes, The Steiner tree problem in Kalmanson matrices and in circulant matrices, Journal of Combinatorial Optimization, Springer Science+Business Media B.V, 3, (1999), 51–58.

1998

  • Burkard, Rainer Ernst, Bettina Klinz, Rüdiger Rudolf and Marc Wennink, A process scheduling problem arising from chemical production planning, Optimization methods & software, Taylor and Francis Ltd., (1998), 175–196.
  • Burkard, Rainer Ernst, Michael Kocher and Rüdiger Rudolf, Rounding strategies of mixed integer programs arising from chemical production planning, Yugoslav Journal of Operations Research, University of Belgrade, 8, (1998), 9–23.
  • Bettina Klinz and Wöginger, Gerhard Johannes, One, two, three, many, or: complexity aspects of dynamic network flows with dedicated arcs, Operations Research Letters, Elsevier B.V., 22, (1998), 119–127. [doi]
  • Burkard, Rainer Ernst, Eranda Dragoti-Cela, Günther Rothe and Wöginger, Gerhard Johannes, The quadratic assignment problem with a monotone anti-Monge matrix and a symmetric toeplitz matrix: Easy and hard cases, Mathematical Programming, Springer, 82, (1998), 128–158.
  • Burkard, Rainer Ernst and Vladimir Deineko, On the traveling salesman problem with a relaxed Monge matrix, Information Processing Letters, Elsevier B.V., 67, (1998), 231–237.
  • Z. Tan and Burkard, Rainer Ernst, The simple block iterative algorithm of an extended entropy model and its convergence, Acta mathematicae applicatae Sinica / English series, Springer Verlag, 14, (1998), 96–105.
  • Burkard, Rainer Ernst, Eranda Dragoti-Cela, V.M. Demidenko, N.N. Metelski and Wöginger, Gerhard Johannes, A unified approach to simple special cases of extremal permutations, Optimization, Taylor and Francis Ltd., 44, (1998), 123–138.
  • Eranda Dragoti-Cela, Quadratic Assignment Problems: Theory and Applications, Kluwer Academic Publishers, (1998).
  • Tibor Dudas, Bettina Klinz and Wöginger, Gerhard Johannes, The k-minimum spanning tree problem in graded matrices, Computers & Mathematics with Applications, Elsevier B.V., 36, (1998), 61–67.
  • Burkard, Rainer Ernst, Vladimir Deineko and Wöginger, Gerhard Johannes, The Travelling Salesman and the PQ-Tree, Mathematics of operations research, INFORMS Inst.for Operations Res.and the Management Sciences, 23, (1998), 613–623.
  • Burkard, Rainer Ernst and Jakob Krarup, A linear Algorithm for the pos/neg-weighted 1-median problem on a cactus, Computing, Springer Wien, 60, (1998), 193–215.
  • Burkard, Rainer Ernst and Yong He, A note on multifit scheduling for uniform machines, Computing, Springer Wien, 61, (1998), 277–283.
  • Burkard, Rainer Ernst, Yong He and Hans Kellerer, A linear compound algorithm for uniform machines, Computing, Springer Wien, 61, (1998), 1–9.
  • Burkard, Rainer Ernst, Vladimir Deineko, van Dal, R., van der Veen, J. and Wöginger, Gerhard Johannes, Well-solvable special cases of the TSP, SIAM Review, Society for Industrial and Applied Mathematics Publications, 40, (1998), 496–546.
  • Burkard, Rainer Ernst, Eranda Çela, P.M. Pardalos and L.S. Pitsoulis, The quadratic assignment problem, Chapter in , Kluwer Academic Publishers, 2, (1998), 241–337.
  • Tibor Dudas, Bettina Klinz and Wöginger, Gerhard Johannes, The computational complexity of multi-level programming problems revisited, Chapter in , Kluwer Academic Publishers, 20, (1998), 165–179.
  • Mathematics of industrial systems III, (Burkard, Rainer Ernst, T. Ibararki, W.R. Pulleyblank, eds.), Baltzer, 76, (1998).

1997

  • Burkard, Rainer Ernst, V.M. Demidenko and Rüdiger Rudolf, A general approach for identifying special cases of the traveling salesman problem with a fixed optimal tur, OR transactions, 1, (1997), 41–53.
  • Burkard, Rainer Ernst and Eranda Çela, Quadratic and three-dimensional assignments: An annotated bibliography, Chapter in , J. Wiley, (1997), 373–391.
  • Bettina Klinz, Wöginger, Gerhard Johannes and Tibor Dudas, The computational complexity of Steiner tree problems in graded matrices, Applied Mathematics Letters, Elsevier Limited, 10(4), (1997), 35–39. [doi]
  • Burkard, Rainer Ernst, S. Karisch and Franz Rendl, QAPLIB- A quadratic assignment problem library. Update, Journal of global optimization, Springer Netherlands, 10, (1997), 391–403.
  • Burkard, Rainer Ernst, Ulrich Pferschy and Rüdiger Rudolf, Waste treatment in a metal-processing plant, In Operations Research Proceedings, Springer, (1997), 392–397.
  • Mathematics of Industrial systems II, (Burkard, Rainer Ernst, T. Ibararki, M. Queyranne, eds.), Baltzer, 69, (1997).
  • Burkard, Rainer Ernst, Eranda Çela and Tibor Dudas, A communication assignment problem on trees: Heuristics and asymptotic behaviour, Chapter in (Pardalos, Panos M., ed.), Springer, 450, (1997), 127–155.
  • Burkard, Rainer Ernst, Efficiently solvable special cases of hard combinatorial optimization problems, Mathematical Programming, Springer, 79, (1997), 55–69.
  • Burkard, Rainer Ernst and G. Zhang, Bounded space on-line variable-sized bin packing, Acta Cybernetica, University of Szeged, 13, (1997), 63–76.
  • Algorithms- ESA '97, (Burkard, Rainer Ernst, G.J. Wöginger, eds.), Springer, 1284, (1997).
  • Burkard, Rainer Ernst, Waste water minimization in metal industry, In Proceedings of the 4th International Symposium on Operational Research, Slovenian Society Informatika, (1997), 77–82.
  • Burkard, Rainer Ernst, Ulrich Pferschy and Rüdiger Rudolf, On-line waste management in a galvanization plant, Yugoslav Journal of Operations Research, University of Belgrade, 7, (1997), 1–13.
  • Yang, Qi Fan., Burkard, Rainer Ernst, Eranda Dragoti-Cela and Wöginger, Gerhard Johannes, Hamiltonian cycles in circulant digraphs with two stripes, Discrete Mathematics, Elsevier B.V., 176, (1997), 233–254.