default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnte Custic
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j11]Wei Yang
, Yang Wang, Ante Custic, Abraham P. Punnen:
Experimental analysis of algorithms for the independent quadratic assignment problem. Comput. Oper. Res. 168: 106704 (2024)- 2022
- [j10]Ante Custic, Stefan Lendl:
The Steiner cycle and path cover problem on interval graphs. J. Comb. Optim. 43(1): 226-234 (2022) - 2020
- [j9]Vladyslav Sokol, Ante Custic, Abraham P. Punnen, Binay Bhattacharya:
Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms. INFORMS J. Comput. 32(3): 730-746 (2020)
2010 – 2019
- 2019
- [j8]Stefan Lendl, Ante Custic, Abraham P. Punnen:
Combinatorial optimization with interaction costs: Complexity and solvable cases. Discret. Optim. 33: 101-117 (2019) - 2018
- [j7]Ante Custic, Ruonan Zhang, Abraham P. Punnen:
The quadratic minimum spanning tree problem and its variations. Discret. Optim. 27: 73-87 (2018) - [j6]Ante Custic, Abraham P. Punnen:
A characterization of linearizable instances of the quadratic minimum spanning tree problem. J. Comb. Optim. 35(2): 436-453 (2018) - [i8]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 abs/1802.08577 (2018) - 2017
- [j5]Ante Custic, Vladyslav Sokol, Abraham P. Punnen, Binay Bhattacharya:
The bilinear assignment problem: complexity and polynomially solvable special cases. Math. Program. 166(1-2): 185-205 (2017) - [j4]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): 232-237 (2017) - [c3]Ante Custic, Ehsan Iranmanesh, Ramesh Krishnamurti:
Analysis of 2-Opt Heuristic for the Winner Determination Problem Under the Chamberlin-Courant System. CALDAM 2017: 107-117 - [i7]Vladyslav Sokol, Ante Custic, Abraham P. Punnen, Binay Bhattacharya:
Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms. CoRR abs/1707.07057 (2017) - 2016
- [j3]Ante Custic, Bettina Klinz:
The constant objective value property for multidimensional assignment problems. Discret. Optim. 19: 23-35 (2016) - [i6]Ante Custic, Ruonan Zhang, Abraham P. Punnen:
The Quadratic Minimum Spanning Tree Problem and its Variations. CoRR abs/1603.04451 (2016) - 2015
- [j2]Ante Custic, Vedran Krcadinac, Yue Zhou:
Tiling Groups with Difference Sets. Electron. J. Comb. 22(2): 2 (2015) - [j1]Ante Custic, Bettina Klinz, Gerhard J. Woeginger:
Geometric versions of the three-dimensional assignment problem under general norms. Discret. Optim. 18: 38-55 (2015) - [c2]Binay K. Bhattacharya, Ante Custic, Akbar Rafiey, Arash Rafiey, Vladyslav Sokol:
Approximation Algorithms for Generalized MST and TSP in Grid Clusters. COCOA 2015: 110-125 - [c1]Binay Bhattacharya, Ante Custic, Sandip Das, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh:
Geometric p-Center Problems with Centers Constrained to Two Lines. JCDCGG 2015: 24-36 - [i5]Binay K. Bhattacharya, Ante Custic, Akbar Rafiey, Arash Rafiey, Vladyslav Sokol:
Approximation Algorithms for Generalized MST and TSP in Grid Clusters. CoRR abs/1507.04438 (2015) - [i4]Ante Custic, Abraham P. Punnen:
A characterization of linearizable instances of the quadratic minimum spanning tree problem. CoRR abs/1510.02197 (2015) - [i3]Binay K. Bhattacharya, Ante Custic, Sandip Das, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh:
Geometric k-Center Problems with Centers Constrained to Two Lines. CoRR abs/1512.07533 (2015) - 2014
- [i2]Ante Custic, Bettina Klinz, Gerhard J. Woeginger:
Planar 3-dimensional assignment problems with Monge-like cost arrays. CoRR abs/1405.5210 (2014) - [i1]Ante Custic, Bettina Klinz, Gerhard J. Woeginger:
Geometric versions of the 3-dimensional assignment problem under general norms. CoRR abs/1409.0845 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
