Skorin-Kapov Jadranka

Jadranka Skorin-Kapov

Information about the author Jadranka Skorin-Kapov will soon be added to the site.
Found 13 papers in total
Threshold based discounting networks: The cost allocation provided by the nucleolus
Threshold based discounting networks: The cost allocation provided by the nucleolus
2005
We consider a cost allocation problem in communication networks with threshold based...
Genetic algorithm for network cost minimization using threshold based discounting
Genetic algorithm for network cost minimization using threshold based discounting
2003
We present a genetic algorithm for heuristically solving a cost minimization problem...
Network cost minimization using threshold-based discounting
Network cost minimization using threshold-based discounting
2002
A network design problem in which every pair of nodes can communicate directly is...
On minimum congestion routing in rearrangeable multihop lightwave networks
On minimum congestion routing in rearrangeable multihop lightwave networks
1995
In this article we consider the problem of minimizing the congestion in logically...
Tight linear programming relaxations of uncapacitated p-hub median problems
Tight linear programming relaxations of uncapacitated p-hub median problems
1996
The problem of locating hub facilities and allocating non-hub nodes to those hubs...
On tabu search for the location of interacting hub facilities
On tabu search for the location of interacting hub facilities
1994
A new heuristic method based on tabu search is developed for the problem of locating p...
A constructive method for improving lower bounds for a class of quadratic assignment problems
A constructive method for improving lower bounds for a class of quadratic assignment problems
1994
A new approach to evaluate lower bounds for a class of quadratic assignment problems (...
Massively parallel tabu search for the Quadratic Assignment Problem
Massively parallel tabu search for the Quadratic Assignment Problem
1993
A new heuristic algorithm to perform tabu search on the Quadratic Assignment Problem...
On polynomial solvability of the high multiplicity total weighted tardiness problem
On polynomial solvability of the high multiplicity total weighted tardiness problem
1993
In a recent paper Hochbaum et al. developed a polynomial algorithm for solving a...
A connectionist approach to the quadratic assignment problem
A connectionist approach to the quadratic assignment problem
1992
The possibilities of applying a Boltzmann machine, and a related connectionist model...
Some proximity and sensitivity results in quadratic integer programming
Some proximity and sensitivity results in quadratic integer programming
1990
The authors show that for any optimal solution nz for a given separable quadratic...
Towards a strongly polynomial algorithm for strictly convex quadratic programs: An extension of Tardos’ algorithm
Towards a strongly polynomial algorithm for strictly convex quadratic programs: An extension of Tardos’ algorithm
1990
In a recent paper Tardos described a polynomial algorithm for solving linear...
On simultaneous approximation in quadratic integer programming
On simultaneous approximation in quadratic integer programming
1989
It is shown how to replace the objective function of an integer quadratic programming...
Papers per page: