# zbMATH — the first resource for mathematics

Compute Distance To:
 Documents Indexed: 32 Publications since 1987, including 1 Book
all top 5

#### Co-Authors

 4 single-authored 9 Skorin-Kapov, Darko 6 Granot, Frieda 5 Chakrapani, Jaishankar 4 Podnar, Hrvoje 3 Boljunčić, Valter 3 Labourdette, Jean-François P. 3 O’Kelly, Morton E. 1 Błażewicz, Jacek 1 Martello, Silvano 1 Tang, K. Wendy
all top 5

#### Serials

 4 European Journal of Operational Research 2 Operations Research Letters 2 Computers & Operations Research 2 Mathematical Programming. Series A. Series B 2 Mathematical Communications 1 Discrete Applied Mathematics 1 Management Science 1 Networks 1 Operations Research 1 Algorithmica 1 Annals of Operations Research 1 ORSA Journal on Computing 1 1 Location Science 1 Journal of Heuristics 1 Journal of Scheduling 1 Journal of Applied Mathematics and Decision Sciences

#### Fields

 27 Operations research, mathematical programming (90-XX) 8 Computer science (68-XX) 2 Numerical analysis (65-XX) 2 Game theory, economics, finance, and other social and behavioral sciences (91-XX) 1 General and overarching topics; collections (00-XX)

#### Citations contained in zbMATH Open

21 Publications have been cited 400 times in 281 Documents Cited by Year
Tight linear programming relaxations of uncapacitated $$p$$-hub median problems. Zbl 0947.90602
Skorin-Kapov, Darko; Skorin-Kapov, Jadranka; O’Kelly, Morton
1996
Tabu search applied to the quadratic assignment problem. Zbl 0752.90054
1990
On tabu search for the location of interacting hub facilities. Zbl 0806.90075
1994
Hub network design with single and multiple allocation: A computational study. Zbl 0927.90069
O’Kelly, M. E.; Bryan, D.; Skorin-Kapov, D.; Skorin-Kapov, J.
1996
Massively parallel tabu search for the quadratic assignment problem. Zbl 0775.90288
1993
Extensions of a tabu search adaptation to the quadratic assignment problem. Zbl 0812.90098
1994
Lower bounds for the hub location problem. Zbl 0836.90109
O’Kelly, Morton; Skorin-Kapov, Darko; Skorin-Kapov, Jadranka
1995
Some proximity and sensitivity results in quadratic integer programming. Zbl 0714.90073
1990
Network cost minimization using threshold-based discounting. Zbl 1008.90004
Podnar, Hrvoje; Skorin-Kapov, Jadranka; Skorin-Kapov, Darko
2002
A connectionist approach to the quadratic assignment problem. Zbl 0757.90060
1992
Towards a strongly polynomial algorithm for strictly convex quadratic programs: An extension of Tardos’ algorithm. Zbl 0694.90075
1990
On polynomial solvability of the high multiplicity total weighted tardiness problem. Zbl 0779.90041
1993
Threshold based discounting networks: the cost allocation provided by the nucleolus. Zbl 1066.90015
2005
Using quadratic programming to solve high multiplicity scheduling problems on parallel machines. Zbl 0865.68008
Granot, F.; Skorin-Kapov, J.; Tamir, A.
1997
A note on Steiner tree games. Zbl 1241.90024
2012
Mapping tasks to processors to minimize communication time in a multiprocessor system. Zbl 0939.68639
1995
Genetic algorithm for network cost minimization using threshold based discounting. Zbl 1076.90006
2003
On simultaneous approximation in quadratic integer programming. Zbl 1418.90187
1989
On minimum congestion routing in rearrangeable multihop lightwave networks. Zbl 0857.90040
1995
A constructive method for improving lower bounds for a class of quadratic assignment problems. Zbl 0815.90106
1994
A constructive method to improve lower bounds for the quadratic assignment problem. Zbl 0817.90055
1994
A note on Steiner tree games. Zbl 1241.90024
2012
Threshold based discounting networks: the cost allocation provided by the nucleolus. Zbl 1066.90015
2005
Genetic algorithm for network cost minimization using threshold based discounting. Zbl 1076.90006
2003
Network cost minimization using threshold-based discounting. Zbl 1008.90004
Podnar, Hrvoje; Skorin-Kapov, Jadranka; Skorin-Kapov, Darko
2002
Using quadratic programming to solve high multiplicity scheduling problems on parallel machines. Zbl 0865.68008
Granot, F.; Skorin-Kapov, J.; Tamir, A.
1997
Tight linear programming relaxations of uncapacitated $$p$$-hub median problems. Zbl 0947.90602
Skorin-Kapov, Darko; Skorin-Kapov, Jadranka; O&rsquo;Kelly, Morton
1996
Hub network design with single and multiple allocation: A computational study. Zbl 0927.90069
O&rsquo;Kelly, M. E.; Bryan, D.; Skorin-Kapov, D.; Skorin-Kapov, J.
1996
Lower bounds for the hub location problem. Zbl 0836.90109
O&rsquo;Kelly, Morton; Skorin-Kapov, Darko; Skorin-Kapov, Jadranka
1995
Mapping tasks to processors to minimize communication time in a multiprocessor system. Zbl 0939.68639
1995
On minimum congestion routing in rearrangeable multihop lightwave networks. Zbl 0857.90040
1995
On tabu search for the location of interacting hub facilities. Zbl 0806.90075
1994
Extensions of a tabu search adaptation to the quadratic assignment problem. Zbl 0812.90098
1994
A constructive method for improving lower bounds for a class of quadratic assignment problems. Zbl 0815.90106
1994
A constructive method to improve lower bounds for the quadratic assignment problem. Zbl 0817.90055
1994
Massively parallel tabu search for the quadratic assignment problem. Zbl 0775.90288
1993
On polynomial solvability of the high multiplicity total weighted tardiness problem. Zbl 0779.90041
1993
A connectionist approach to the quadratic assignment problem. Zbl 0757.90060
1992
Tabu search applied to the quadratic assignment problem. Zbl 0752.90054
1990
Some proximity and sensitivity results in quadratic integer programming. Zbl 0714.90073
1990
Towards a strongly polynomial algorithm for strictly convex quadratic programs: An extension of Tardos’ algorithm. Zbl 0694.90075
1990
On simultaneous approximation in quadratic integer programming. Zbl 1418.90187
1989
all top 5