QAPLIB – A Quadratic Assignment Problem Library RE Burkard, SE Karisch, F Rendl Journal of Global Optimization 10 (4), 391–403, 1997 | 950 | 1997 |
Tabu search applied to the quadratic assignment problem J Skorin-Kapov ORSA Journal on computing 2 (1), 33-45, 1990 | 689 | 1990 |
Tight linear programming relaxations of uncapacitated p-hub median problems D Skorin-Kapov, J Skorin-Kapov, M O'Kelly European journal of operational research 94 (3), 582-593, 1996 | 657 | 1996 |
On tabu search for the location of interacting hub facilities D Skorin-Kapov, J Skorin-Kapov European Journal of Operational Research 73 (3), 502-509, 1994 | 395 | 1994 |
Handbook of optimization in telecommunications MGC Resende, PM Pardalos Springer Science & Business Media, 2008 | 348 | 2008 |
Hub network design with single and multiple allocation: A computational study ME O'Kelly, D Bryan, D Skorin-Kapov, J Skorin-Kapov Location Science 4 (3), 125-138, 1996 | 296 | 1996 |
Quadratic Assignment and Related Problems: DIMACS Workshop, May 20-21, 1993 PM Pardalos, H Wolkowicz American Mathematical Soc., 1994 | 183 | 1994 |
Massively parallel tabu search for the quadratic assignment problem J Chakrapani, J Skorin-Kapov Annals of Operations Research 41 (4), 327-341, 1993 | 177 | 1993 |
Extensions of a tabu search adaptation to the quadratic assignment problem J Skorin-Kapov Computers & Operations Research 21 (8), 855-865, 1994 | 156 | 1994 |
Lower bounds for the hub location problem M O'Kelly, D Skorin-Kapov, J Skorin-Kapov Management Science 41 (4), 713-721, 1995 | 142 | 1995 |
Scheduling a flow-line manufacturing cell: a tabu search approach J Skorin-Kapov, AJ Vakharia The International Journal of Production Research 31 (7), 1721-1734, 1993 | 100 | 1993 |
The 0-1 knapsack problem S Martello, P Toth Combinatorial optimization, 237-279, 1979 | 89 | 1979 |
Network cost minimization using threshold-based discounting H Podnar, J Skorin-Kapov, D Skorin-Kapov European Journal of Operational Research 137 (2), 371-386, 2002 | 68 | 2002 |
A connectionist approach to the quadratic assignment problem J Chakrapani, J Skorin-Kapov Computers & Operations Research 19 (3-4), 287-295, 1992 | 56 | 1992 |
Some proximity and sensitivity results in quadratic integer programming F Granot, J Skorin-Kapov Mathematical Programming 47 (1), 259-268, 1990 | 55 | 1990 |
A branch and bound algorithm for the quadratic assignment problem using a lower bound based on linear programming KG Ramakrishnan, MGC Resende, PM Pardalos State of the Art in Global Optimization: Computational Methods and …, 1996 | 36 | 1996 |
Darren Aronofsky? s Films and the Fragility of Hope J Skorin-Kapov Bloomsbury Publishing USA, 2015 | 35 | 2015 |
Non-linear integer programming: sensitivity analysis for branch and bound J Skorin-Kapov, F Granot Operations Research Letters 6 (6), 269-274, 1987 | 32 | 1987 |
Connection machine implementation of a tabu search algorithm for the traveling salesman problem J Chakrapani, J Skorin-Kapov Journal of Computing and Information Technology 1 (1), 29-36, 1993 | 30 | 1993 |
On minimum congestion routing in rearrangeable multihop lightwave networks J Skorin-Kapov, JF Labourdette Journal of Heuristics 1, 129-145, 1995 | 26 | 1995 |