default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJadranka Skorin-Kapov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j17]Darko Skorin-Kapov, Jadranka Skorin-Kapov:
Network Connectivity Game. J. Comput. Inf. Technol. 28(2): 73-87 (2020)
2010 – 2019
- 2012
- [j16]Darko Skorin-Kapov, Jadranka Skorin-Kapov:
A note on Steiner tree games. Networks 59(2): 215-225 (2012) - 2011
- [j15]Jacek Blazewicz
, Valter Boljuncic, Silvano Martello, Jadranka Skorin-Kapov:
Combinatorial optimization issues in scheduling. J. Sched. 14(3): 221-223 (2011)
2000 – 2009
- 2006
- [p1]Darko Skorin-Kapov, Jadranka Skorin-Kapov, Valter Boljuncic:
Location Problems in Telecommunications. Handbook of Optimization in Telecommunications 2006: 517-544 - 2005
- [j14]Darko Skorin-Kapov, Jadranka Skorin-Kapov:
Threshold based discounting networks: The cost allocation provided by the nucleolus. Eur. J. Oper. Res. 166(1): 154-159 (2005) - 2003
- [j13]Hrvoje Podnar, Jadranka Skorin-Kapov:
Genetic algorithm for network cost minimization using threshold based discounting. Adv. Decis. Sci. 7(4): 207-228 (2003) - 2002
- [j12]Hrvoje Podnar, Jadranka Skorin-Kapov, Darko Skorin-Kapov:
Network cost minimization using threshold-based discounting. Eur. J. Oper. Res. 137(2): 371-386 (2002) - 2001
- [c3]Hrvoje Podnar, Jadranka Skorin-Kapov:
A Genetic Algorithm for Optimizing Throughout in Non-broadcast WDM Optical Networks. HIS 2001: 323-338
1990 – 1999
- 1998
- [j11]Jadranka Skorin-Kapov, Jean-François P. Labourdette:
Rearrangeable multihop lightwave networks: congestion minimization on regular topologies. Telecommun. Syst. 9(1): 113-132 (1998) - [c2]Jadranka Skorin-Kapov, Jean-François P. Labourdette:
On minimum congestion routing in broadcast optical networks with regular and arbitrary topologies. Multichannel Optical Networks: Theory and Practice 1998: 143-155 - 1997
- [j10]Frieda Granot, Jadranka Skorin-Kapov, Amir Tamir:
Using Quadratic Programming to Solve High Multiplicity Scheduling Problems on Parallel Machines. Algorithmica 17(2): 100-110 (1997) - 1995
- [j9]Jadranka Skorin-Kapov, Jean-François P. Labourdette:
On minimum congestion routing in rearrangeable multihop lightwave networks. J. Heuristics 1(1): 129-145 (1995) - 1994
- [j8]Jadranka Skorin-Kapov:
Extensions of a tabu search adaptation to the quadratic assignment problem. Comput. Oper. Res. 21(8): 855-865 (1994) - [j7]Jaishankar Chakrapani, Jadranka Skorin-Kapov:
A Constructive Method for Improving Lower Bounds for a Class of Quadratic Assignment Problems. Oper. Res. 42(5): 837-845 (1994) - 1993
- [j6]Jaishankar Chakrapani, Jadranka Skorin-Kapov:
Massively parallel tabu search for the quadratic assignment problem. Ann. Oper. Res. 41(4): 327-341 (1993) - [j5]Frieda Granot, Jadranka Skorin-Kapov:
On Polynomial Solvability of the High Multiplicity Total Weighted Tardiness Problem. Discret. Appl. Math. 41(2): 139-146 (1993) - [c1]Jaishankar Chakrapani, Jadranka Skorin-Kapov:
A Constructive Method to Improve Lower Bounds for the Quadratic Assignment Problem. Quadratic Assignment and Related Problems 1993: 161-171 - 1992
- [j4]Jaishankar Chakrapani, Jadranka Skorin-Kapov:
A connectionist approach to the quadratic assignment problem. Comput. Oper. Res. 19(3-4): 287-295 (1992) - 1990
- [j3]Jadranka Skorin-Kapov:
Tabu Search Applied to the Quadratic Assignment Problem. INFORMS J. Comput. 2(1): 33-45 (1990) - [j2]Frieda Granot, Jadranka Skorin-Kapov:
Towards a Strongly Polynomial Algorithm for Strictly Convex Quadratic Programs: An Extension of Tardos' Algorithm. Math. Program. 46: 225-236 (1990) - [j1]Frieda Granot, Jadranka Skorin-Kapov:
Some Proximity and Sensitivity Results in Quadratic Integer Programming. Math. Program. 47: 259-268 (1990)
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-04-24 22:52 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:
