Ante Ćustić
Ante Ćustić
Postdoc in Mathematics and Computer Science, Simon Fraser University
Verified email at - Homepage
Cited by
Cited by
A characterization of linearizable instances of the quadratic minimum spanning tree problem
A Ćustić, AP Punnen
Journal of Combinatorial Optimization 35 (2), 436-453, 2018
The bilinear assignment problem: complexity and polynomially solvable special cases
A Ćustić, V Sokol, AP Punnen, B Bhattacharya
Mathematical programming 166 (1), 185-205, 2017
Approximation algorithms for generalized MST and TSP in grid clusters
B Bhattacharya, A Ćustić, A Rafiey, A Rafiey, V Sokol
Combinatorial Optimization and Applications, 110-125, 2015
Geometric versions of the three-dimensional assignment problem under general norms
A Ćustić, B Klinz, GJ Woeginger
Discrete Optimization 18, 38-55, 2015
Combinatorial optimization with interaction costs: Complexity and solvable cases
S Lendl, A Ćustić, AP Punnen
Discrete optimization 33, 101-117, 2019
The quadratic minimum spanning tree problem and its variations
A Ćustić, R Zhang, AP Punnen
Discrete Optimization 27, 73-87, 2018
Average value of solutions of the bipartite quadratic assignment problem and linkages to domination analysis
A Ćustić, AP Punnen
Operations Research Letters 45 (3), 232-237, 2017
Tiling groups with difference sets
A Ćustić, V Krčadinac, Y Zhou
The Electronic Journal of Combinatorics, P2. 56-P2. 56, 2015
The constant objective value property for multidimensional assignment problems
A Ćustić, B Klinz
Discrete optimization 19, 23-35, 2016
On conjectures and problems of Ruzsa concerning difference graphs of S-units
A Ćustić, L Hajdu, D Kreso, R Tijdeman
Acta Mathematica Hungarica 146 (2), 391-404, 2015
Bilinear assignment problem: Large neighborhoods and experimental analysis of algorithms
V Sokol, A Ćustić, AP Punnen, B Bhattacharya
INFORMS Journal on Computing 32 (3), 730-746, 2020
On streaming algorithms for the Steiner cycle and path cover problem on interval graphs and falling platforms in video games
A Ćustić, S Lendl
arXiv preprint arXiv:1802.08577, 2018
Analysis of 2-opt heuristic for the winner determination problem under the chamberlin-courant system
A Ćustić, E Iranmanesh, R Krishnamurti
Conference on Algorithms and Discrete Applied Mathematics, 107-117, 2017
The Steiner cycle and path cover problem on interval graphs
A Ćustić, S Lendl
Journal of Combinatorial Optimization, 1-9, 2021
Geometric p-Center Problems with Centers Constrained to Two Lines
B Bhattacharya, A Ćustić, S Das, Y Higashikawa, T Kameda, N Katoh
Japanese Conference on Discrete and Computational Geometry and Graphs, 24-36, 2015
Planar 3-dimensional assignment problems with Monge-like cost arrays
A Ćustić, B Klinz, GJ Woeginger
arXiv preprint arXiv:1405.5210, 2014
The constant objective value property for combinatorial optimization problems
A Ćustić, B Klinz
arXiv preprint arXiv:1405.6096, 2014
The system can't perform the operation now. Try again later.
Articles 1–17