A list of publications by the Combinatorial Optimization Group since 1997 sorted by year.
2025
- , Recognition of Unit Segment and Polyline Graphs is ∃R-Complete, In Graph-Theoretic Concepts in Computer Science - 50th International Workshop, WG 2024, Revised Selected Papers (Daniel Krá\v I, Martin Milani\v c, eds.), Springer Science and Business Media Deutschland GmbH, (2025), 266–281.
2024
- , A linear time algorithm for linearizing quadratic and higher-order shortest path problems, Mathematical Programming, North-Holland Publ Co, 2024, (2024).
- , On the complexity of robust multi-stage problems with discrete recourse, Discrete Applied Mathematics, Elsevier B.V., 343, (2024), 355–370.
- , On the Exact Matching Problem in Dense Graphs, In 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024 (Olaf Beyersdorff, Kante, Mamadou Moustapha, Orna Kupferman, Daniel Lokshtanov, eds.), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024).
- , Special Cases of the Minimum Spanning Tree Problem under Explorable Edge and Vertex Uncertainty, Networks, Wiley-Liss Inc., 83(3), (2024), 587–604.
- , Enhancing time series aggregation for power system optimization models: Incorporating network and ramping constraints, Electric Power Systems Research, Elsevier B.V., 230, (2024).
- , The bipartite travelling salesman problem: A pyramidally solvable case, Operations Research Letters, Elsevier B.V., 55, (2024).
- , Improving accuracy of energy system models for an efficient energy transition: basis-oriented aggregation and machine learning, In 45TH IAEE INTERNATIONAL CONFERENCE 25 -28 JUNE, 2024 ISTANBUL BOĞAZİÇİ UNIVERSITY, (2024), 481–484.
2023
- , 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.
- , Integrating multiple sources of ordinal information in portfolio optimization, Technical report, , (2023).
- , A linear time algorithm for linearizing quadratic and higher-order shortest path problems, Technical report, , (2023).
- , Non-Preemptive Tree Packing, Algorithmica, Springer New York, 85(3), (2023), 783–804.
- , Recognising permuted Demidenko matrices, Operations Research Letters, Elsevier B.V., 51(5), (2023), 494–500.
- , An Approximation Algorithm for the Exact Matching Problem in Bipartite Graphs, In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023 (Nicole Megow, Adam Smith, eds.), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023).
- , Exact Matching: Correct Parity and FPT Parameterized by Independence Number, In 34th International Symposium on Algorithms and Computation, ISAAC 2023 (Satoru Iwata, Satoru Iwata, Naonori Kakimura, eds.), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023).
- , Assistance and interdiction problems on interval graphs, Discrete Applied Mathematics, Elsevier B.V., 340, (2023), 153–170.
- , Gerhard J. Woeginger 1964-2022, Internationale Mathematische Nachrichten, Österreichische Mathematische Gesellschaft, ÖMG, 77(254), (2023).
2022
- , The Steiner Cycle and Path Cover Problem on Interval Graphs, Journal of Combinatorial Optimization, Springer Netherlands, 43(1), (2022), 226–234.
- , Non-Preemptive Tree Packing, Algorithmica, Springer New York, (2022).
- , Two-Stage robust optimization problems with two-stage uncertainty, European Journal of Operational Research, Elsevier B.V., 302(1), (2022), 62–78.
- , Recoverable robust representatives selection problems with discrete budgeted uncertainty, European Journal of Operational Research, Elsevier B.V., 303(2), (2022), 567–580.
2021
- , Non-preemptive Tree Packing, In Combinatorial Algorithms. IWOCA 2021. Lecture Notes in Computer Science (P. Flocchini, L. Moura, eds.), Springer, 12757, (2021).
- , 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.
- , Robust Combinatorial Optimization with Locally Budgeted Uncertainty, Open Journal of Mathematical Optimization, Centre Mersenne for Open Scientific Publishing, 2, (2021).
- , Mean-variance portfolio optimization based on ordinal information, Journal of Banking and Finance, Elsevier B.V., 122, (2021).
- , Continuous facility location on graphs, Mathematical Programming, Springer Verlag, (2021).
- , Matroid Bases with Cardinality Constraints on the Intersection, Mathematical Programming, Springer Verlag, (2021).
- , 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.
- , A Machine Learning Based Branch and Price Algorithm for a Sampled Vehicle Routing Problem, OR-Spectrum, Springer Verlag, 43(3), (2021), 693–732.
- , A linear time algorithm for the robust recoverable selection problem, Discrete Applied Mathematics, Elsevier B.V., 303, (2021), 94–107.
- , Travelling salesman paths on Demidenko matrices, Discrete Applied Mathematics, Elsevier B.V., (2021).
2020
- , 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.
- , Relationship of k-Bend and Monotonic ℓ-Bend Edge Intersection Graphs of Paths on a Grid, Technical report, , (2020), 1–30.
- , Travelling salesman paths on Demidenko matrices, Technical report, , (2020).
2019
- , Combinatorial Optimization with Interaction Costs: Complexity and Solvable Cases, Discrete Optimization, Elsevier B.V., 33, (2019), 101–117.
- , 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.
- , Mean-Variance Portfolio Optimization Based on Ordinal Information, Technical report, , (2019), 1–34.
- , Monotonic Representations of Outerplanar Graphs as Edge Intersection Graphs of Paths on a Grid, Technical report, , (2019).
2018
- , On sequences covering all rainbow k-progressions, Journal of Combinatorics, International Press, Inc., 9(4), (2018).
- , 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.
2017
- , The multi-stripe travelling salesman problem, Annals of Operations Research, Springer Netherlands, 259(1-2), (2017), 21–34.
2016
- , Linearizable special cases of the QAP, Journal of Combinatorial Optimization, Springer Netherlands, 31(3), (2016), 1269–1279.
- , The constant objective value property for multidimensional assignment problems, Discrete Optimization, Elsevier B.V., (2016), 23–35.
- , Optimization Approach to Handle Global CO2 Fleet Emission Standards, (2016).
2015
- , 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.
- , Geometric versions of the 3-dimensional assignment problem under general norms, Discrete Optimization, Elsevier B.V., 18, (2015), 38–55.
- , Heuristics for the data arrangement problem on regular trees, Journal of Combinatorial Optimization, Springer Netherlands, 30(3), (2015), 768–802.
- , Well-solvable cases of the QAP with block-structured matrices, Discrete Applied Mathematics, Elsevier B.V., 186, (2015), 56–65.
2014
- , Four-point conditions for the TSP: The complete complexity classification, Discrete Optimization, Elsevier B.V., 14, (2014), 147–159.
2013
- , PragmatiX: An Interactive Tool for Visualizing the Creation Process Behind Collaboratively Engineered Ontologies, International Journal on Semantic Web and Information Systems, IGI Global, 9(1), (2013), 45–78.
- , Uniqueness in quadratic and hyperbolic 0–1 programming problems, Operations Research Letters, Elsevier B.V., 41(6), (2013), 633–635.
2012
- , 2-balanced Flows and the Inverse 1-median Problem in the Chebyshev Space, Discrete Optimization, Elsevier B.V., 9(3), (2012), 137–148.
- , The x-and-y-axes travelling salesman problem, European Journal of Operational Research, Elsevier B.V., 223, (2012), 333–345.
2011
- , The Wiener maximum quadratic assignment problem, Discrete Optimization, Elsevier B.V., 8, (2011), 411–416.
- , The Northwest corner rule revisited, Discrete Applied Mathematics, Elsevier B.V., 159(12), (2011), 1284–1289.
- , Maximizing a Sum Related to Image Segmentation Evaluation, Journal of Mathematical Modelling and Algorithms, Springer Netherlands, 10, (2011), 193–203.
- , Inverse p-median problems with variable edge lengths, Mathematical Methods of Operations Research, Physica-Verlag, 73(2), (2011), 263–280.
2010
- , CLEVER or SMART: Strategies for the Online Target Date Assignement Problem, Discrete Applied Mathematics, Elsevier B.V., 158 (1), (2010), 71–79.
- , 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.
- , The 1-median Problem in R^d with the Chebyshev-norm and its inverse problem, In Electronic Notes in Discrete Mathematics, ., (2010), 1137–1144.
- , 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.
- , Median problems with positive and negative weights on cycles and cacti, Journal of Combinatorial Optimization, Springer Netherlands, 20, (2010), 27–46.
- , The inverse Fermat-Weber problem, European Journal of Operational Research, Elsevier B.V., 206, (2010), 11–17.
- , A Fast Parametric Assignment Algorithm with Applications in Max-Algebra, Networks, Wiley-Liss Inc., 55(2), (2010), 61–77.
- , The Steiner Forest Problem Revisited, Journal of Discrete Algorithms, Elsevier B.V., 8, (2010), 154–163.
2009
- , Polygons with inscribed circles and prescribed side lengths, Applied Mathematics Letters, Elsevier Ltd., 22(5), (2009), 704–706.
- , Inverse 1-center location problems with edge length augmentation on trees, ., (2009).
- , Inverse 1-center location problems with edge length augmentation on trees, Computing, Springer, 86, (2009), 331–343.
- , Up- and downgrading the 1-center in a network, European Journal of Operational Research, Elsevier B.V., 198, (2009), 370–377.
- , Inverse 1-center location problems with edge length augmentation on trees, ., (2009).
- , The complexity of computing the Muirhead–Dalton distance, Mathematical Social Sciences, Elsevier B.V., 57(2), (2009), 282–284.
- , The computational complexity of bilevel assignment problems, 4OR, Springer, 7, (2009), 379–394.
- , 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.
- , Location Problems with Variable Input Data, PhD thesis, , (2009).
- , 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.
- , The Inverse Fermat-Weber Problem, (2009).
- , Optimal algorithms for inverse center location problems with edge length augmentation on trees, (2009).
2008
- , A Parity Domination Problem in Graphs with Bounded Treewidth and Distance-hereditary Graphs, Computing, Springer, 82, (2008), 171–187.
- , Simultaneous Geometric Graph Embeddings, Lecture Notes in Computer Science, Springer Science and Business Media Deutschland GmbH, 4875, (2008), 280–290.
- , The Inverse 1-Maxian Problem with edge length modification, Journal of Combinatorial Optimization, Springer Netherlands, 16, (2008), 50–67.
- , Combinatorial properties of a domination problem with parity constraints, Discrete Mathematics, Elsevier B.V., 308, (2008), 6355–6367.
- , Inverse 1-median problems, In Oberwolfach Reports, ., 51/2008, (2008), 2908–2909.
- , How hard is it to find extreme Nash equilibria in network congestion games? (extended abstract), Lecture Notes in Computer Science, Springer Science and Business Media Deutschland GmbH, 5385, (2008), 82–93.
- , Reverse 2-median problem on trees, Discrete Applied Mathematics, Elsevier B.V., 156(11), (2008), 1963–1976.
- , Up- and downgrading the 1-median in a network, TU Graz, Institut für Optimierung und Diskrete Mathematik (Math B), (2008).
- , Clever or Smart: Strategies for the Online Target Date Assignment Problem, (2008).
- , How hard is it to find extreme Nash equilibria in network congestion games?, (2008).
2007
- , Median problems on wheels and cactus graphs, Computing, Springer, 80(4), (2007), 377–393.
- , 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.
- , Combinatorial properties of a general domination problem with parity constraints, (2007).
- , The p-maxian problem on a tree, Operations Research Letters, Elsevier B.V., 35, (2007), 331–335.
- , Monge properties, discrete convexity and applications, European Journal of Operational Research, Elsevier B.V., 176, (2007), 1–14.
- , Mixed Integer Linear Programs for Batch Processes, (2007).
- , Discrete optimization:an Austrian view, Annals of Operations Research, Springer Netherlands, 149, (2007), 43–48.
- , Semi-infinite optimization for solving linear fractional programming with fuzzy coefficients, (2007).
- , Semi-Infinite Programming for solving Linear Fractional Programming with Fuzzy Parameters in Constraints, (2007).
2006
- , ILP Models for a Nurse Scheduling Problem, In Operations Research Proceedings 2006, Springer, (2006), 319–324.
- , Deterministic Online Optical Call Admission Revisited, In Approximation and Online Algorithms, Springer, 3879, (2006), 190–202.
- , 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.
- , Simultaneous Graph Embeddings with Fixed Edges, Lecture Notes in Computer Science, Springer Science and Business Media Deutschland GmbH, 4271, (2006), 325–335.
- , 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.
- , 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.
- , Modelling and optimizing batch processes in the chemical industry, Chapter in , Springer, (2006), 279–290.
- , Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem, Journal of Combinatorial Optimization, Springer Netherlands, 12, (2006), 187–215.
- , The web proxy location problem in general tree of rings networks, Journal of Combinatorial Optimization, Springer Netherlands, 12, (2006), 327–336.
- , A linear time algorithm for the reverse 1-median problem on a cycle, Networks, Wiley-Liss Inc., 48(1), (2006), 16–23.
- , Exact algorithms for the Hamiltonian cycle problem in planar graphs, Operations Research Letters, Elsevier B.V., 34(3), (2006), 269–274.
- , An ant colony algorithm for the pos/neg weighted p-median problem, Central European Journal of Operations Research, Springer, 14, (2006), 229–246.
2005
- , Review, extensions and computational comparison of MILP formulations for scheduling of batch processes, Computers & Chemical Engineering, Elsevier B.V., 29, (2005), 1752–1769.
- , Reverse Median Problems on Graphs, In Oberwolfach Report No. 50/2005, ., (2005), 2854–2856.
- , (Generalized) Convexity and Discrete Optimization, Chapter in (Andrew Eberhard, Nicolas Hadjisavvas, Luc, Dinh The, eds.), Springer, (2005), 23–37.
- , The reel and sheet cutting problem in paper industry, Central European Journal of Operations Research, Springer, 13, (2005), 147–167.
- , Deterministic Online Optical Call Admission Revisited, In Oberwolfach reports, Mathematisches Forschungsinstitut Oberwolfach, (2005), 2918–2920.
- , Faster algorithms for computing power indices in weighted voting games, Mathematical Social Sciences, Elsevier B.V., 49, (2005), 111–116.
2004
- , Mixed-integer linear programs for batch processes, In Discrete optimization methods in production and logistics (DOM'2004), ., (2004), 108–113.
- , Inverse p-median problems, Discrete Optimization, Elsevier B.V., no. 1, (2004), 23–39.
- , Minimum cost dynamic flow problems: The series-parallel case, Networks, Wiley-Liss Inc., 43, (2004), 153–162.
- , Variants of the Assignment Problem and of the Transportation Problem, PhD thesis, , (2004).
- , Weight reduction problems with certain bottleneck objectives, European Journal of Operational Research, Elsevier B.V., 153, (2004), 191–199.
- , On the Euclidean TSPwith a permuted Van der Veen matrix, Information Processing Letters, Elsevier B.V., 91, (2004), 259–262.
2003
- , Finding all essential terms of characteristic maxpolynomial, Discrete Applied Mathematics, Elsevier B.V., 130, (2003), 367–380.
- , Center Problems with pos/neg weights on trees, European Journal of Operational Research, Elsevier B.V., 145, (2003), 483–495.
- , 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.
- , Which cost matrices are immune against the transportation paradox?, Discrete Applied Mathematics, Elsevier B.V., 130, (2003), 495–501.
- , Constrained Steiner trees in Halin graphs, RAIRO / Operations research, EDP Sciences, 37, (2003), 179–194.
- , Max-algebra and the linear assignment problem, Mathematical Programming, Springer Verlag, 98, (2003), 415–429.
2002
- Combinatorial and global optimization, (P. Pardalos, A. Migdalas, Burkard, Rainer Ernst, eds.), World Scientific, 14, (2002).
- , Gentechnologie - Fluch oder Segen?, Shaker-Verlag GmbH, (2002).
- , The travelling salesman problem, Chapter in , Oxford University Press, (2002), 616–624.
- , A note on the robust 1-center problem on trees, Annals of Operations Research, Springer Netherlands, 110, (2002), 68–82.
- , Makespan minimization of chemical batch processes using non-uniform time-grids, Computers & Chemical Engineering, Elsevier B.V., 26, (2002), 1321–1332.
- , Entropie und Chaos in Stadt und Verkehr, Shaker-Verlag GmbH, (2002).
- , Selected topics in assignment problems, Discrete Applied Mathematics, Elsevier B.V., 123, (2002), 257–302.
- , Maximal spannende Baumprobleme mit einer Hierarchie von zwei Entscheidungsträgern, PhD thesis, , (2002).
2001
- , Robust problems with pos/neg weights on a tree, Networks, Wiley-Liss Inc., 38, (2001), 102–113.
- , Capacity expansion and weight reduction problems, In Proceedings of the 6th International Symposium on Operational Research, Slovenian Society Informatika, (2001), 119–124.
- , Bottleneck capacity expansion problems with general budget constraints, RAIRO / Operations research, EDP Sciences, 35, (2001), 1–20.
- , The obnoxious center problem on a tree, SIAM Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics Publications, 14, (2001), 498–509.
- , 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.
- , NP-hard location problems: efficiently solvable special cases and lower bounds, PhD thesis, , (2001).
- , Transportation problems, Chapter in , Physica-Verlag, (2001), 249–261.
- 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).
2000
- , Zuordnungsprobleme: Ein Streifzug durch die kombinatorische Optimierung, Chapter in , Passagen Verlag, (2000), 193–207.
- , Computational mathematics driven by industrial problems, Springer, 1739, (2000).
- Zur Kunst des Formalen Denkens, (Burkard, Rainer Ernst, W. Maass, Peter Weibel, eds.), Passagen Verlag, (2000).
- Mathematics of industrial systems IV, (Burkard, Rainer Ernst, T. Ibararki, W.R. Pulleyblank, E. Santibanez-Gonzalez, eds.), Baltzer, 96, (2000).
- , 2-Medians in networks with pos/neg weights, Discrete Applied Mathematics, Elsevier B.V., 105, (2000), 51–71.
- , Optimal location of facilities for a two stage production process, ECMI newsletter, 28, (2000), 14–16.
1999
- , The Steiner tree problem in Kalmanson matrices and in circulant matrices, Journal of Combinatorial Optimization, Springer Netherlands, 3, (1999), 51–58.
- , Volume maximization and orthoconvex approximation of orthogons, Computing, Springer, 63, (1999), 317–330.
- , The traveling salesman problem on permuted Monge matrices, Journal of Combinatorial Optimization, Springer Netherlands, 2, (1999), 333–350.
- Integer programming and combinatorial optimization, (Burkard, Rainer Ernst, G. Cornuejols, G.J. Woeginger, eds.), Springer, 1610, (1999).
- , OR Utopia, European Journal of Operational Research, Elsevier B.V., 119, (1999), 224–234.
- , 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.
- , A note on the bottleneck graph partition problem, Networks, Wiley-Liss Inc., 33(3), (1999), 189–191.
- , Well-solvable Cases of Hard Combinatorial Optimization Problems - the Role of Special Cost Matrices and Related Input Restrictions, PhD thesis, , (1999).
- , QAPLIB- A quadratic assignment problem libraray, European Journal of Operational Research, Elsevier B.V., 55, (1999), 115–119.
- , A transportation problem with a permuted demand vector, Mathematical Methods of Operations Research, Physica-Verlag, 50, (1999), 1–8.
- , 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.
- , Linear assignment problems and extensions, Chapter in , Kluwer Academic Publishers, (1999), 75–149.
- , A dual framework for lower bounds of the quadratic assignment problem based on linearization, Computing, Springer, 63, (1999), 351–403.
- , Minimum cost strong network orientation problems: Classification, algorithms and complexity, Networks, Wiley-Liss Inc., 33(1), (1999), 57–70.
1998
- Mathematics of industrial systems III, (Burkard, Rainer Ernst, T. Ibararki, W.R. Pulleyblank, eds.), Baltzer, 76, (1998).
- , The computational complexity of multi-level programming problems revisited, Chapter in , Kluwer Academic Publishers, 20, (1998), 165–179.
- , The quadratic assignment problem, Chapter in , Kluwer Academic Publishers, 2, (1998), 241–337.
- , Well-solvable special cases of the TSP, SIAM Review, Society for Industrial and Applied Mathematics Publications, 40, (1998), 496–546.
- , A linear compound algorithm for uniform machines, Computing, Springer, 61, (1998), 1–9.
- , A note on multifit scheduling for uniform machines, Computing, Springer, 61, (1998), 277–283.
- , A linear Algorithm for the pos/neg-weighted 1-median problem on a cactus, Computing, Springer, 60, (1998), 193–215.
- , The Travelling Salesman and the PQ-Tree, Mathematics of operations research, INFORMS Inst.for Operations Res.and the Management Sciences, 23, (1998), 613–623.
- , The k-minimum spanning tree problem in graded matrices, Computers & Mathematics with Applications, Elsevier Ltd., 36, (1998), 61–67.
- , Quadratic Assignment Problems: Theory and Applications, Kluwer Academic Publishers, (1998).
- , A unified approach to simple special cases of extremal permutations, Optimization, Taylor and Francis Ltd., 44, (1998), 123–138.
- , 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.
- , On the traveling salesman problem with a relaxed Monge matrix, Information Processing Letters, Elsevier B.V., 67, (1998), 231–237.
- , The quadratic assignment problem with a monotone anti-Monge matrix and a symmetric toeplitz matrix: Easy and hard cases, Mathematical Programming, Springer Verlag, 82, (1998), 128–158.
- , One, two, three, many, or: complexity aspects of dynamic network flows with dedicated arcs, Operations Research Letters, Elsevier B.V., 22, (1998), 119–127.
- , Rounding strategies of mixed integer programs arising from chemical production planning, Yugoslav Journal of Operations Research, Faculty of Organizational Sciences, University of Belgrade, 8, (1998), 9–23.
- , A process scheduling problem arising from chemical production planning, Optimization Methods & Software, Taylor and Francis Ltd., (1998), 175–196.
1997
- , Hamiltonian cycles in circulant digraphs with two stripes, Discrete Mathematics, Elsevier B.V., 176, (1997), 233–254.
- , On-line waste management in a galvanization plant, Yugoslav Journal of Operations Research, Faculty of Organizational Sciences, University of Belgrade, 7, (1997), 1–13.
- , Waste water minimization in metal industry, In Proceedings of the 4th International Symposium on Operational Research, Slovenian Society Informatika, (1997), 77–82.
- Algorithms- ESA '97, (Burkard, Rainer Ernst, G.J. Wöginger, eds.), Springer, 1284, (1997).
- , Bounded space on-line variable-sized bin packing, Acta Cybernetica, University of Szeged, Institute of Informatics, 13, (1997), 63–76.
- , Efficiently solvable special cases of hard combinatorial optimization problems, Mathematical Programming, Springer Verlag, 79, (1997), 55–69.
- , A communication assignment problem on trees: Heuristics and asymptotic behaviour, Chapter in (Pardalos, Panos M., ed.), Springer, 450, (1997), 127–155.
- Mathematics of Industrial systems II, (Burkard, Rainer Ernst, T. Ibararki, M. Queyranne, eds.), Baltzer, 69, (1997).
- , Waste treatment in a metal-processing plant, In Operations Research Proceedings, Springer, (1997), 392–397.
- , QAPLIB- A quadratic assignment problem library. Update, Journal of global optimization, Springer Netherlands, 10, (1997), 391–403.
- , The computational complexity of Steiner tree problems in graded matrices, Applied Mathematics Letters, Elsevier Ltd., 10(4), (1997), 35–39.
- , Quadratic and three-dimensional assignments: An annotated bibliography, Chapter in , J. Wiley, (1997), 373–391.
- , A general approach for identifying special cases of the traveling salesman problem with a fixed optimal tur, OR transactions, 1, (1997), 41–53.