The Steiner cycle and path cover problem on interval graphs von Ćustić, Ante, Lendl, Stefan

Volltext

Experimental analysis of algorithms for the independent quadratic assignment problem von Yang, Wei, Wang, Yang, Ćustić, Ante, Punnen, Abraham P.

Volltext

A characterization of linearizable instances of the quadratic minimum spanning tree problem von Ćustić, Ante, Punnen, Abraham P.

Volltext

Combinatorial optimization with interaction costs: Complexity and solvable cases von Lendl, Stefan, Ćustić, Ante, Punnen, Abraham P.

Volltext

The bilinear assignment problem: complexity and polynomially solvable special cases von Ćustić, Ante, Sokol, Vladyslav, Punnen, Abraham P., Bhattacharya, Binay

Volltext

Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms von Sokol, Vladyslav, Ćustić, Ante, Punnen, Abraham P., Bhattacharya, Binay

Volltext

The quadratic minimum spanning tree problem and its variations von Ćustić, Ante, Zhang, Ruonan, Punnen, Abraham P.

Volltext

Average value of solutions of the bipartite quadratic assignment problem and linkages to domination analysis von Ćustić, Ante, Punnen, Abraham P.

Volltext

The constant objective value property for multidimensional assignment problems von Ćustić, Ante, Klinz, Bettina

Volltext

Geometric versions of the three-dimensional assignment problem under general norms von Ćustić, Ante, Klinz, Bettina, Woeginger, Gerhard J.

Volltext

Tiling Groups with Difference Sets von Ćustić, Ante, Krčadinac, Vedran, Zhou, Yue

Volltext

Approximation Algorithms for Generalized MST and TSP in Grid Clusters von Bhattacharya, Binay, Ćustić, Ante, Rafiey, Akbar, Rafiey, Arash, Sokol, Vladyslav

Volltext

Analysis of 2-Opt Heuristic for the Winner Determination Problem Under the Chamberlin-Courant System von Ćustić, Ante, Iranmanesh, Ehsan, Krishnamurti, Ramesh

Volltext

Geometric p-Center Problems with Centers Constrained to Two Lines von Bhattacharya, Binay, Ćustić, Ante, Das, Sandip, Higashikawa, Yuya, Kameda, Tsunehiko, Katoh, Naoki

Volltext

On Streaming Algorithms for the Steiner Cycle and Path Cover Problem on Interval Graphs and Falling Platforms in Video Games von Ćustić, Ante, Lendl, Stefan

Volltext bestellen

The constant objective value property for combinatorial optimization problems von Ćustić, Ante, Klinz, Bettina

Volltext bestellen

Average value of solutions of the bipartite quadratic assignment problem and linkages to domination analysis von Ćustić, Ante, Punnen, Abraham P

Volltext bestellen

On Streaming Algorithms for the Steiner Cycle and Path Cover Problem on Interval Graphs and Falling Platforms in Video Games von Ćustić, Ante, Lendl, Stefan

Volltext

Combinatorial Optimization Problems with Interaction Costs: Complexity and Solvable Cases von Lendl, Stefan, Ćustić, Ante, Punnen, Abraham P

Volltext bestellen

A characterization of linearizable instances of the quadratic minimum spanning tree problem von Ćustić, Ante, Punnen, Abraham P

Volltext bestellen