Ante Custic

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