Welcome

This is a remnant of my old academic page. I studied mathematics at the University of Zagreb (Croatia) and did my PhD at the Graz University of Technology (Austria). I was then a postdoc at the Simon Fraser University (Canada) for a few years. My research interests are in combinatorial optimization, theoretical computer science and discrete mathematics.

Contact:

You can contact me via email at first name then dot then last name on gmail.

Papers:

  1. The Steiner cycle and path cover problem on interval graphs
    A. Ćustić, S. Lendl
    Journal of Combinatorial Optimization, 2021, [doi], [arXiv - video game version]

  2. Combinatorial optimization problems with interaction costs: Complexity and solvable cases
    S. Lendl, A. Ćustić, A. Punnen
    Discrete Optimization, 33, 101-117, 2019, [doi], [arXiv]

  3. Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms
    V. Sokol, A. Ćustić, A. Punnen, B. Bhattacharya
    INFORMS Journal on Computing, 32, 2020, [doi], [arXiv]

  4. A characterization of linearizable instances of the quadratic minimum spanning tree problem
    A. Ćustić, A. Punnen
    Journal of Combinatorial Optimization 35, 436-453, 2018, [doi], [arXiv]

  5. The quadratic minimum spanning tree problem and its variations
    A. Ćustić, R. Zhang, A. Punnen
    Discrete Optimization 27, 73-87, 2018, [doi], [arXiv]

  6. Average value of solutions of the bipartite quadratic assignment problem and linkages to domination analysis
    A. Ćustić, A. Punnen
    Operations Research Letters 45, 232-237, 2017, [doi], [arXiv]

  7. The Bilinear assignment problem: Complexity and polynomially solvable special cases
    A. Ćustić, V. Sokol, A. Punnen, B. Bhattacharya
    Mathematical Programming 166, 185-205, 2017, [doi], [arXiv]

  8. Analysis of 2-opt heuristic for the winner determination problem under the Chamberlin-Courant system
    A. Ćustić, E. Iranmanesh, R. Krishnamurti
    CALDAM 2017, LNCS 10156, 107-117, 2017, [doi]

  9. Geometric k-center problems with centers constrained to two lines
    B. Bhattacharya, A. Ćustić, S. Das, Y. Higashikawa, T. Kameda, N. Katoh
    JCDCG^2 2015, LNCS 9943, 24-36, 2016, [doi], [arXiv]

  10. The constant objective value property for multidimensional assignment problems
    A. Ćustić, B. Klinz
    Discrete Optimization 19, 23-35, 2016, [doi]

  11. Approximation algorithms for generalized MST and TSP in grid clusters
    B. Bhattacharya, A. Ćustić, A. Rafiey, A. Rafiey, V. Sokol
    COCOA 2015, LNCS 9486, 110-125, 2015, [doi], [arXiv]

  12. Geometric versions of the 3-dimensional assignment problem under general norms
    A. Ćustić, B. Klinz, G.J. Woeginger
    Discrete Optimization 18, 38-55, 2015, [doi], [arXiv]

  13. Tiling groups with difference sets
    A. Ćustić, V. Krčadinac, Y. Zhou
    The Electronic Journal of Combinatorics 22, #P2.56, 2015, [pdf]

  14. On conjectures and problems of Ruzsa concerning difference graphs of S-units
    A. Ćustić, L. Hajdu, D. Kreso, R. Tijdeman
    Acta Mathematica Hungarica 146, issue 2, 391-404, 2015, [doi], [arXiv]

  15. Planar 3-dimensional assignment problems with Monge-like arrays
    A. Ćustić, B. Klinz, G.J. Woeginger
    [preprint]

Theses:

  • A. Ćustić, Efficiently solvable special cases of multidimensional assignment problems, PhD thesis, 2014, [pdf]

  • A. Ćustić, Popločavanje grupa diferencijskim skupovima (Tilings of groups with difference sets), Dipl. Ing. thesis, 2010, [pdf in Croatian]

Miscellaneous links: