Ante Custic

According to our database1, Ante Custic authored at least 15 papers between 2014 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms.
INFORMS J. Comput., 2020

2019
Combinatorial optimization with interaction costs: Complexity and solvable cases.
Discret. Optim., 2019

2018
A characterization of linearizable instances of the quadratic minimum spanning tree problem.
J. Comb. Optim., 2018

The quadratic minimum spanning tree problem and its variations.
Discret. Optim., 2018

On Streaming Algorithms for the Steiner Cycle and Path Cover Problem on Interval Graphs and Falling Platforms in Video Games.
CoRR, 2018

2017
Average value of solutions of the bipartite quadratic assignment problem and linkages to domination analysis.
Oper. Res. Lett., 2017

The bilinear assignment problem: complexity and polynomially solvable special cases.
Math. Program., 2017

Analysis of 2-Opt Heuristic for the Winner Determination Problem Under the Chamberlin-Courant System.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2017

2016
The constant objective value property for multidimensional assignment problems.
Discret. Optim., 2016

2015
Geometric versions of the three-dimensional assignment problem under general norms.
Discret. Optim., 2015

Tiling Groups with Difference Sets.
Electron. J. Comb., 2015

Geometric p-Center Problems with Centers Constrained to Two Lines.
Proceedings of the Discrete and Computational Geometry and Graphs - 18th Japan Conference, 2015

Approximation Algorithms for Generalized MST and TSP in Grid Clusters.
Proceedings of the Combinatorial Optimization and Applications, 2015

2014
Geometric versions of the 3-dimensional assignment problem under general norms.
CoRR, 2014

Planar 3-dimensional assignment problems with Monge-like cost arrays.
CoRR, 2014


  Loading...