Jadranka Skorin-Kapov

According to our database, Jadranka Skorin-Kapov authored at least 21 papers between 1990 and 2020.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2020

Network Connectivity Game.

Darko Skorin-Kapov, Jadranka Skorin-Kapov

J. Comput. Inf. Technol., 2020

2012

A note on Steiner tree games.

Darko Skorin-Kapov, Jadranka Skorin-Kapov

Networks, 2012

2011

Combinatorial optimization issues in scheduling.

Jacek Blazewicz, Valter Boljuncic, Silvano Martello, Jadranka Skorin-Kapov

J. Sched., 2011

2006

Location Problems in Telecommunications.

Darko Skorin-Kapov, Jadranka Skorin-Kapov, Valter Boljuncic

Proceedings of the Handbook of Optimization in Telecommunications, 2006

2005

Threshold based discounting networks: The cost allocation provided by the nucleolus.

Darko Skorin-Kapov, Jadranka Skorin-Kapov

Eur. J. Oper. Res., 2005

2003

Genetic algorithm for network cost minimization using threshold based discounting.

Hrvoje Podnar, Jadranka Skorin-Kapov

Adv. Decis. Sci., 2003

2002

Network cost minimization using threshold-based discounting.

Hrvoje Podnar, Jadranka Skorin-Kapov, Darko Skorin-Kapov

Eur. J. Oper. Res., 2002

2001

A Genetic Algorithm for Optimizing Throughout in Non-broadcast WDM Optical Networks.

Hrvoje Podnar, Jadranka Skorin-Kapov

Proceedings of the Hybrid Information Systems, 2001

1998

Rearrangeable multihop lightwave networks: congestion minimization on regular topologies.

Jadranka Skorin-Kapov, Jean-François P. Labourdette

Telecommun. Syst., 1998

On minimum congestion routing in broadcast optical networks with regular and arbitrary topologies.

Jadranka Skorin-Kapov, Jean-François P. Labourdette

Proceedings of the Multichannel Optical Networks: Theory and Practice, 1998

1997

Using Quadratic Programming to Solve High Multiplicity Scheduling Problems on Parallel Machines.

Frieda Granot, Jadranka Skorin-Kapov, Amir Tamir

Algorithmica, 1997

1995

On minimum congestion routing in rearrangeable multihop lightwave networks.

Jadranka Skorin-Kapov, Jean-François P. Labourdette

J. Heuristics, 1995

1994

A Constructive Method for Improving Lower Bounds for a Class of Quadratic Assignment Problems.

Jaishankar Chakrapani, Jadranka Skorin-Kapov

Oper. Res., 1994

Extensions of a tabu search adaptation to the quadratic assignment problem.

Jadranka Skorin-Kapov

Comput. Oper. Res., 1994

1993

On Polynomial Solvability of the High Multiplicity Total Weighted Tardiness Problem.

Frieda Granot, Jadranka Skorin-Kapov

Discret. Appl. Math., 1993

Massively parallel tabu search for the quadratic assignment problem.

Jaishankar Chakrapani, Jadranka Skorin-Kapov

Ann. Oper. Res., 1993

A Constructive Method to Improve Lower Bounds for the Quadratic Assignment Problem.

Jaishankar Chakrapani, Jadranka Skorin-Kapov

Proceedings of the Quadratic Assignment and Related Problems, 1993

1992

A connectionist approach to the quadratic assignment problem.

Jaishankar Chakrapani, Jadranka Skorin-Kapov

Comput. Oper. Res., 1992

1990

Some Proximity and Sensitivity Results in Quadratic Integer Programming.

Frieda Granot, Jadranka Skorin-Kapov

Math. Program., 1990

Towards a Strongly Polynomial Algorithm for Strictly Convex Quadratic Programs: An Extension of Tardos' Algorithm.

Frieda Granot, Jadranka Skorin-Kapov

Math. Program., 1990

Tabu Search Applied to the Quadratic Assignment Problem.

Jadranka Skorin-Kapov

INFORMS J. Comput., 1990