Ante Custic

Publication Activity (10 Years)

Years Active: 2014-2024
Publications (10 Years): 13

Top Topics

Approximation Algorithms

Minimum Spanning Tree

Quadratic Assignment Problem

Top Venues

Discret. Optim.

J. Comb. Optim.

Oper. Res. Lett.

Publications

Wei Yang, Yang Wang, Ante Custic, Abraham P. Punnen
Experimental analysis of algorithms for the independent quadratic assignment problem. Comput. Oper. Res. 168 (2024)
Ante Custic, Stefan Lendl
The Steiner cycle and path cover problem on interval graphs. J. Comb. Optim. 43 (1) (2022)
Vladyslav Sokol, Ante Custic, Abraham P. Punnen, Binay Bhattacharya
Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms. INFORMS J. Comput. 32 (3) (2020)
Stefan Lendl, Ante Custic, Abraham P. Punnen
Combinatorial optimization with interaction costs: Complexity and solvable cases. Discret. Optim. 33 (2019)
Ante Custic, Ruonan Zhang, Abraham P. Punnen
The quadratic minimum spanning tree problem and its variations. Discret. Optim. 27 (2018)
Ante Custic, Abraham P. Punnen
A characterization of linearizable instances of the quadratic minimum spanning tree problem. J. Comb. Optim. 35 (2) (2018)
Ante Custic, Stefan Lendl
On Streaming Algorithms for the Steiner Cycle and Path Cover Problem on Interval Graphs and Falling Platforms in Video Games. CoRR (2018)
Ante Custic, Ehsan Iranmanesh, Ramesh Krishnamurti
Analysis of 2-Opt Heuristic for the Winner Determination Problem Under the Chamberlin-Courant System. CALDAM (2017)
Ante Custic, Abraham P. Punnen
Average value of solutions of the bipartite quadratic assignment problem and linkages to domination analysis. Oper. Res. Lett. 45 (3) (2017)
Vladyslav Sokol, Ante Custic, Abraham P. Punnen, Binay Bhattacharya
Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms. CoRR (2017)
Ante Custic, Vladyslav Sokol, Abraham P. Punnen, Binay Bhattacharya
The bilinear assignment problem: complexity and polynomially solvable special cases. Math. Program. 166 (1-2) (2017)
Ante Custic, Bettina Klinz
The constant objective value property for multidimensional assignment problems. Discret. Optim. 19 (2016)
Ante Custic, Ruonan Zhang, Abraham P. Punnen
The Quadratic Minimum Spanning Tree Problem and its Variations. CoRR (2016)
Ante Custic, Bettina Klinz, Gerhard J. Woeginger
Geometric versions of the three-dimensional assignment problem under general norms. Discret. Optim. 18 (2015)
Binay K. Bhattacharya, Ante Custic, Akbar Rafiey, Arash Rafiey, Vladyslav Sokol
Approximation Algorithms for Generalized MST and TSP in Grid Clusters. CoRR (2015)
Binay K. Bhattacharya, Ante Custic, Akbar Rafiey, Arash Rafiey, Vladyslav Sokol
Approximation Algorithms for Generalized MST and TSP in Grid Clusters. COCOA (2015)
Binay Bhattacharya, Ante Custic, Sandip Das, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh
Geometric p-Center Problems with Centers Constrained to Two Lines. JCDCGG (2015)
Ante Custic, Vedran Krcadinac, Yue Zhou
Tiling Groups with Difference Sets. Electron. J. Comb. 22 (2) (2015)
Ante Custic, Abraham P. Punnen
A characterization of linearizable instances of the quadratic minimum spanning tree problem. CoRR (2015)
Ante Custic, Bettina Klinz, Gerhard J. Woeginger
Geometric versions of the 3-dimensional assignment problem under general norms. CoRR (2014)
Ante Custic, Bettina Klinz, Gerhard J. Woeginger
Planar 3-dimensional assignment problems with Monge-like cost arrays. CoRR (2014)