Planar 3-dimensional assignment problems with Monge-like cost arrays. - Ante Custic; Bettina Klinz; Gerhard J. Woeginger (CoRR, 2014)

Geometric versions of the 3-dimensional assignment problem under general norms. - Ante Custic; Bettina Klinz; Gerhard J. Woeginger (CoRR, 2014)

Approximation Algorithms for Generalized MST and TSP in Grid Clusters. - Binay K. Bhattacharya; Ante Custic; Akbar Rafiey; Arash Rafiey; Vladyslav Sokol (COCOA, 2015)

Geometric p-Center Problems with Centers Constrained to Two Lines. - Binay Bhattacharya; Ante Custic; Sandip Das 001; Yuya Higashikawa; Tsunehiko Kameda; Naoki Katoh (JCDCGG, 2015)

Tiling Groups with Difference Sets. - Ante Custic; Vedran Krcadinac; Yue Zhou (Electron. J. Comb., 2015)

Geometric k-Center Problems with Centers Constrained to Two Lines. - Binay K. Bhattacharya; Ante Custic; Sandip Das 001; Yuya Higashikawa; Tsunehiko Kameda; Naoki Katoh (CoRR, 2015)

Geometric versions of the three-dimensional assignment problem under general norms. - Ante Custic; Bettina Klinz; Gerhard J. Woeginger (Discret. Optim., 2015)

The constant objective value property for multidimensional assignment problems. - Ante Custic; Bettina Klinz (Discret. Optim., 2016)

Analysis of 2-Opt Heuristic for the Winner Determination Problem Under the Chamberlin-Courant System. - Ante Custic; Ehsan Iranmanesh; Ramesh Krishnamurti (CALDAM, 2017)

The bilinear assignment problem: complexity and polynomially solvable special cases. - Ante Custic; Vladyslav Sokol; Abraham P. Punnen; Binay Bhattacharya (Math. Program., 2017)

Average value of solutions of the bipartite quadratic assignment problem and linkages to domination analysis. - Ante Custic; Abraham P. Punnen (Oper. Res. Lett., 2017)

On Streaming Algorithms for the Steiner Cycle and Path Cover Problem on Interval Graphs and Falling Platforms in Video Games. - Ante Custic; Stefan Lendl (CoRR, 2018)

The quadratic minimum spanning tree problem and its variations. - Ante Custic; Ruonan Zhang; Abraham P. Punnen (Discret. Optim., 2018)

A characterization of linearizable instances of the quadratic minimum spanning tree problem. - Ante Custic; Abraham P. Punnen (J. Comb. Optim., 2018)

Combinatorial optimization with interaction costs: Complexity and solvable cases. - Stefan Lendl; Ante Custic; Abraham P. Punnen (Discret. Optim., 2019)

Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms. - Vladyslav Sokol; Ante Custic; Abraham P. Punnen; Binay Bhattacharya (INFORMS J. Comput., 2020)

The Steiner cycle and path cover problem on interval graphs. - Ante Custic; Stefan Lendl (J. Comb. Optim., 2022)

Experimental analysis of algorithms for the independent quadratic assignment problem. - Wei Yang 049; Yang Wang 030; Ante Custic; Abraham P. Punnen (Comput. Oper. Res., 2024)

The independent quadratic assignment problem: complexity and polynomially solvable special cases. - Ante Custic; Wei Yang 049; Yang Wang 030; Abraham P. Punnen (J. Comb. Optim., 2025)