Le informazioni sugli articoli di fonte ISI sono coperte da copyright

Per ulteriori informazioni selezionare i riferimenti di interesse.

1. Smith, JM; Li, WJ
   Quadratic assignment problems and M/G/C/C state dependent network flows
   JOURNAL OF COMBINATORIAL OPTIMIZATION
   
   J.M. Smith e W.J. Li, "Quadratic assignment problems and M/G/C/C state dependent network flows", J COMB OPTI, 5(4), 2001, pp. 421-443
2. Niitsuma, H; Ishii, S; Ito, M
   Chaotic optimization method combined with coordinate transformation
   ELECTRONICS AND COMMUNICATIONS IN JAPAN PART III-FUNDAMENTAL ELECTRONIC SCIENCE
   
   H. Niitsuma et al., "Chaotic optimization method combined with coordinate transformation", ELEC C JP 3, 84(2), 2001, pp. 12-20
3. Hahn, PM; Krarup, J
   A hospital facility layout problem finally solved
   JOURNAL OF INTELLIGENT MANUFACTURING
   
   P.M. Hahn e J. Krarup, "A hospital facility layout problem finally solved", J INTELL M, 12(5-6), 2001, pp. 487-496
4. Randall, M; Abramson, D
   A general meta-heuristic based solver for combinatorial optimisation problems
   COMPUTATIONAL OPTIMIZATION AND APPLICATIONS
   
   M. Randall e D. Abramson, "A general meta-heuristic based solver for combinatorial optimisation problems", COMPUT OP A, 20(2), 2001, pp. 185-210
5. Ferland, JA; Ichoua, S; Lavoie, A; Gagne, E
   Scheduling using tabu search methods with intensification and diversification
   COMPUTERS & OPERATIONS RESEARCH
   
   J.A. Ferland et al., "Scheduling using tabu search methods with intensification and diversification", COMPUT OPER, 28(11), 2001, pp. 1075-1092
6. Angel, E; Zissimopoulos, V
   On the landscape ruggedness of the quadratic assignment problem
   THEORETICAL COMPUTER SCIENCE
   
   E. Angel e V. Zissimopoulos, "On the landscape ruggedness of the quadratic assignment problem", THEOR COMP, 263(1-2), 2001, pp. 159-172
7. Lee, GH
   Design of components and layout of machines for material handling
   INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY
   
   G.H. Lee, "Design of components and layout of machines for material handling", INT J ADV M, 17(5), 2001, pp. 371-382
8. Lapointe, FJ; Garland, T
   A generalized permutation model for the analysis of cross-species data
   JOURNAL OF CLASSIFICATION
   
   F.J. Lapointe e T. Garland, "A generalized permutation model for the analysis of cross-species data", J CLASSIF, 18(1), 2001, pp. 109-127
9. Talbi, EG; Roux, O; Fonlupt, C; Robillard, D
   Parallel Ant Colonies for the quadratic assignment problem
   FUTURE GENERATION COMPUTER SYSTEMS
   
   E.G. Talbi et al., "Parallel Ant Colonies for the quadratic assignment problem", FUT GENER C, 17(4), 2001, pp. 441-449
10. Junger, M; Kaibel, V
    Box-inequalities for quadratic assignment polytopes
    MATHEMATICAL PROGRAMMING
    
    M. Junger e V. Kaibel, "Box-inequalities for quadratic assignment polytopes", MATH PROGR, 91(1), 2001, pp. 175-197
11. Anstreicher, KM; Brixius, NW
    A new bound for the quadratic assignment problem based on convex quadraticprogramming
    MATHEMATICAL PROGRAMMING
    
    K.M. Anstreicher e N.W. Brixius, "A new bound for the quadratic assignment problem based on convex quadraticprogramming", MATH PROGR, 89(3), 2001, pp. 341-357
12. Barbosa-Povoa, AP; Mateus, R; Novais, AQ
    Optimal two-dimensional layout of industrial facilities
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
    
    A.P. Barbosa-Povoa et al., "Optimal two-dimensional layout of industrial facilities", INT J PROD, 39(12), 2001, pp. 2567-2593
13. Arkin, EM; Hassin, R; Sviridenko, M
    Approximating the maximum quadratic assignment problem
    INFORMATION PROCESSING LETTERS
    
    E.M. Arkin et al., "Approximating the maximum quadratic assignment problem", INF PROCESS, 77(1), 2001, pp. 13-16
14. Junger, M; Kaibel, V
    The QAP-polytope and the star transformation
    DISCRETE APPLIED MATHEMATICS
    
    M. Junger e V. Kaibel, "The QAP-polytope and the star transformation", DISCR APP M, 111(3), 2001, pp. 283-306
15. Gambardella, LM; Dorigo, M
    An ant colony system hybridized with a new local search for the sequentialordering problem
    INFORMS JOURNAL ON COMPUTING
    
    L.M. Gambardella e M. Dorigo, "An ant colony system hybridized with a new local search for the sequentialordering problem", INFORMS J C, 12(3), 2000, pp. 237-255
16. Merz, P; Freisleben, B
    Fitness landscape analysis and memetic algorithms for the quadratic assignment problem
    IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION
    
    P. Merz e B. Freisleben, "Fitness landscape analysis and memetic algorithms for the quadratic assignment problem", IEEE T EV C, 4(4), 2000, pp. 337-352
17. Junger, M; Kaibel, V
    On the SQAP-polytope
    SIAM JOURNAL ON OPTIMIZATION
    
    M. Junger e V. Kaibel, "On the SQAP-polytope", SIAM J OPTI, 11(2), 2000, pp. 444-463
18. Anstreicher, KM
    Eigenvalue bounds versus semidefinite relaxations for the quadratic assignment problem
    SIAM JOURNAL ON OPTIMIZATION
    
    K.M. Anstreicher, "Eigenvalue bounds versus semidefinite relaxations for the quadratic assignment problem", SIAM J OPTI, 11(1), 2000, pp. 254-265
19. Lim, MH; Yuan, Y; Omatu, S
    Efficient genetic algorithms using simple genes exchange local search policy for the quadratic assignment problem
    COMPUTATIONAL OPTIMIZATION AND APPLICATIONS
    
    M.H. Lim et al., "Efficient genetic algorithms using simple genes exchange local search policy for the quadratic assignment problem", COMPUT OP A, 15(3), 2000, pp. 248-268
20. Liggett, RS
    Automated facilities layout: past, present and future
    AUTOMATION IN CONSTRUCTION
    
    R.S. Liggett, "Automated facilities layout: past, present and future", AUTO CONSTR, 9(2), 2000, pp. 197-215
21. Anstreicher, K; Wolkowicz, H
    Lagrangian relaxation of quadratic matrix constraints
    SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS
    
    K. Anstreicher e H. Wolkowicz, "Lagrangian relaxation of quadratic matrix constraints", SIAM J MATR, 22(1), 2000, pp. 41-55
22. Hasegawa, M; Ikeguchi, T; Aihara, K
    Exponential and chaotic neurodynamical tabu searches for quadratic assignment problems
    CONTROL AND CYBERNETICS
    
    M. Hasegawa et al., "Exponential and chaotic neurodynamical tabu searches for quadratic assignment problems", CONTROL CYB, 29(3), 2000, pp. 773-788
23. Ahuja, RK; Orlin, JB; Tiwari, A
    A greedy genetic algorithm for the quadratic assignment problem
    COMPUTERS & OPERATIONS RESEARCH
    
    R.K. Ahuja et al., "A greedy genetic algorithm for the quadratic assignment problem", COMPUT OPER, 27(10), 2000, pp. 917-934
24. Winter, T; Zimmermann, UT
    Real-time dispatch of trams in storage yards
    ANNALS OF OPERATIONS RESEARCH
    
    T. Winter e U.T. Zimmermann, "Real-time dispatch of trams in storage yards", ANN OPER R, 96, 2000, pp. 287-315
25. Brusco, MJ; Stahl, S
    Using quadratic assignment methods to generate initial permutations for least-squares unidimensional scaling of symmetric proximity matrices
    JOURNAL OF CLASSIFICATION
    
    M.J. Brusco e S. Stahl, "Using quadratic assignment methods to generate initial permutations for least-squares unidimensional scaling of symmetric proximity matrices", J CLASSIF, 17(2), 2000, pp. 197-223
26. Dorigo, M; Bonabeau, E; Theraulaz, G
    Ant algorithms and stigmergy
    FUTURE GENERATION COMPUTER SYSTEMS
    
    M. Dorigo et al., "Ant algorithms and stigmergy", FUT GENER C, 16(8), 2000, pp. 851-871
27. Stutzle, T; Hoos, HH
    MAX-MIN Ant System
    FUTURE GENERATION COMPUTER SYSTEMS
    
    T. Stutzle e H.H. Hoos, "MAX-MIN Ant System", FUT GENER C, 16(8), 2000, pp. 889-914
28. Bonabeau, E; Dorigo, M; Theraulaz, G
    Inspiration for optimization from social insect behaviour
    NATURE
    
    E. Bonabeau et al., "Inspiration for optimization from social insect behaviour", NATURE, 406(6791), 2000, pp. 39-42
29. Deineko, VG; Woeginger, GJ
    A study of exponential neighborhoods for the Travelling Salesman Problem and for the Quadratic Assignment Problem
    MATHEMATICAL PROGRAMMING
    
    V.G. Deineko e G.J. Woeginger, "A study of exponential neighborhoods for the Travelling Salesman Problem and for the Quadratic Assignment Problem", MATH PROGR, 87(3), 2000, pp. 519-542
30. Ho, YC; Moodie, CL
    A hybrid approach for concurrent layout design of cells and their flow paths in a tree configuration
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
    
    Y.C. Ho e C.L. Moodie, "A hybrid approach for concurrent layout design of cells and their flow paths in a tree configuration", INT J PROD, 38(4), 2000, pp. 895-928
31. Angel, E; Zissimopoulos, V
    On the classification of NP-complete problems in terms of their correlation coefficient
    DISCRETE APPLIED MATHEMATICS
    
    E. Angel e V. Zissimopoulos, "On the classification of NP-complete problems in terms of their correlation coefficient", DISCR APP M, 99(1-3), 2000, pp. 261-277
32. Sherali, HD; Smith, JC; Adams, WP
    Reduced first-level representations via the reformulation-linearization technique: results, counterexamples, and computations
    DISCRETE APPLIED MATHEMATICS
    
    H.D. Sherali et al., "Reduced first-level representations via the reformulation-linearization technique: results, counterexamples, and computations", DISCR APP M, 101(1-3), 2000, pp. 247-267
33. Fleurent, C; Glover, F
    Improved constructive multistart strategies for the quadratic assignment problem using adaptive memory
    INFORMS JOURNAL ON COMPUTING
    
    C. Fleurent e F. Glover, "Improved constructive multistart strategies for the quadratic assignment problem using adaptive memory", INFORMS J C, 11(2), 1999, pp. 198-204
34. Maniezzo, V; Colorni, A
    The ant system applied to the quadratic assignment problem
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING
    
    V. Maniezzo e A. Colorni, "The ant system applied to the quadratic assignment problem", IEEE KNOWL, 11(5), 1999, pp. 769-778
35. Grama, A; Kumar, V
    State of the art in parallel search techniques for discrete optimization problems
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING
    
    A. Grama e V. Kumar, "State of the art in parallel search techniques for discrete optimization problems", IEEE KNOWL, 11(1), 1999, pp. 28-35
36. Bland, JA
    Space-planning by ant colony optimisation
    INTERNATIONAL JOURNAL OF COMPUTER APPLICATIONS IN TECHNOLOGY
    
    J.A. Bland, "Space-planning by ant colony optimisation", INT J COM A, 12(6), 1999, pp. 320-328
37. Lee, GH
    Design of components and manufacturing system for material handling in CIM
    INTERNATIONAL JOURNAL OF COMPUTER INTEGRATED MANUFACTURING
    
    G.H. Lee, "Design of components and manufacturing system for material handling in CIM", I J COMP IN, 12(1), 1999, pp. 39-53
38. Palubeckis, G
    Generating hard test instances with known optimal solution for the rectilinear quadratic assignment problem
    JOURNAL OF GLOBAL OPTIMIZATION
    
    G. Palubeckis, "Generating hard test instances with known optimal solution for the rectilinear quadratic assignment problem", J GLOB OPT, 15(2), 1999, pp. 127-156
39. de Abreu, NMM; Querido, TM; Boaventura-Netto, PO
    RedInv-SA: A simulated annealing for the quadratic assignment problem
    RAIRO-RECHERCHE OPERATIONNELLE-OPERATIONS RESEARCH
    
    N.M.M. de Abreu et al., "RedInv-SA: A simulated annealing for the quadratic assignment problem", RAIRO RE OP, 33(3), 1999, pp. 249-273
40. Rossin, DF; Springer, MC; Klein, BD
    New complexity measures for the facility layout problem: an empirical study using traditional and neural network analysis
    COMPUTERS & INDUSTRIAL ENGINEERING
    
    D.F. Rossin et al., "New complexity measures for the facility layout problem: an empirical study using traditional and neural network analysis", COM IND ENG, 36(3), 1999, pp. 585-602
41. Clausen, J; Perregaard, M
    On the best search strategy in parallel branch-and-bound: Best-First Search versus Lazy Depth-First Search
    ANNALS OF OPERATIONS RESEARCH
    
    J. Clausen e M. Perregaard, "On the best search strategy in parallel branch-and-bound: Best-First Search versus Lazy Depth-First Search", ANN OPER R, 90, 1999, pp. 1-17
42. Amin, S
    Simulated Jumping
    ANNALS OF OPERATIONS RESEARCH
    
    S. Amin, "Simulated Jumping", ANN OPER R, 86, 1999, pp. 23-38
43. Brusco, MJ
    Morph-based local-search heuristics for large-scale combinatorial data analysis
    JOURNAL OF CLASSIFICATION
    
    M.J. Brusco, "Morph-based local-search heuristics for large-scale combinatorial data analysis", J CLASSIF, 16(2), 1999, pp. 163-180
44. Gambardella, LM; Taillard, ED; Dorigo, M
    Ant colonies for the quadratic assignment problem
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
    
    L.M. Gambardella et al., "Ant colonies for the quadratic assignment problem", J OPER RES, 50(2), 1999, pp. 167-176
45. Anstreicher, K; Chen, X; Wolkowicz, H; Yuan, YX
    Strong duality for a trust-region type relaxation of the quadratic assignment problem
    LINEAR ALGEBRA AND ITS APPLICATIONS
    
    K. Anstreicher et al., "Strong duality for a trust-region type relaxation of the quadratic assignment problem", LIN ALG APP, 301(1-3), 1999, pp. 121-136
46. Chen, CW; Sha, DY
    A design approach to the multi-objective facility layout problem
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
    
    C.W. Chen e D.Y. Sha, "A design approach to the multi-objective facility layout problem", INT J PROD, 37(5), 1999, pp. 1175-1196
47. Malmborg, CJ
    Empirical approximation of volume distance distributions for line layout problems
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
    
    C.J. Malmborg, "Empirical approximation of volume distance distributions for line layout problems", INT J PROD, 37(2), 1999, pp. 375-392
48. Karisch, SE; Cela, E; Clausen, J; Espersen, T
    A dual framework for lower bounds of the quadratic assignment problem based on linearization
    COMPUTING
    
    S.E. Karisch et al., "A dual framework for lower bounds of the quadratic assignment problem based on linearization", COMPUTING, 63(4), 1999, pp. 351-403
49. ZHAO Q; KARISCH SE; RENDL F; WOLKOWICZ H
    SEMIDEFINITE PROGRAMMING RELAXATIONS FOR THE QUADRATIC ASSIGNMENT PROBLEM
    Journal of combinatorial optimization
    
    Q. Zhao et al., "SEMIDEFINITE PROGRAMMING RELAXATIONS FOR THE QUADRATIC ASSIGNMENT PROBLEM", Journal of combinatorial optimization, 2(1), 1998, pp. 71-109
50. SKORINKAPOV J; LABOURDETTE JF
    REARRANGEABLE MULTIHOP LIGHTWAVE NETWORKS - CONGESTION MINIMIZATION ON REGULAR TOPOLOGIES
    Telecommunication systems
    
    J. Skorinkapov e J.F. Labourdette, "REARRANGEABLE MULTIHOP LIGHTWAVE NETWORKS - CONGESTION MINIMIZATION ON REGULAR TOPOLOGIES", Telecommunication systems, 9(1), 1998, pp. 113-132
51. HAGHANI A; CHEN MC
    OPTIMIZING GATE ASSIGNMENTS AT AIRPORT TERMINALS
    Transportation research. Part A, Policy and practice
    
    A. Haghani e M.C. Chen, "OPTIMIZING GATE ASSIGNMENTS AT AIRPORT TERMINALS", Transportation research. Part A, Policy and practice, 32(6), 1998, pp. 437-454
52. IOANNOU G; MINIS I
    A REVIEW OF CURRENT RESEARCH IN MANUFACTURING SHOP DESIGN INTEGRATION
    Journal of intelligent manufacturing
    
    G. Ioannou e I. Minis, "A REVIEW OF CURRENT RESEARCH IN MANUFACTURING SHOP DESIGN INTEGRATION", Journal of intelligent manufacturing, 9(1), 1998, pp. 57-72
53. CLAUSEN J; KARISCH SE; PERREGAARD M; RENDL F
    ON THE APPLICABILITY OF LOWER BOUNDS FOR SOLVING RECTILINEAR QUADRATIC ASSIGNMENT PROBLEMS IN PARALLEL
    COMPUTATIONAL OPTIMIZATION AND APPLICATIONS
    
    J. Clausen et al., "ON THE APPLICABILITY OF LOWER BOUNDS FOR SOLVING RECTILINEAR QUADRATIC ASSIGNMENT PROBLEMS IN PARALLEL", COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 10(2), 1998, pp. 127-147
54. ISHII S; SATO M
    CONSTRAINED NEURAL APPROACHES TO QUADRATIC ASSIGNMENT PROBLEMS
    Neural networks
    
    S. Ishii e M. Sato, "CONSTRAINED NEURAL APPROACHES TO QUADRATIC ASSIGNMENT PROBLEMS", Neural networks, 11(6), 1998, pp. 1073-1082
55. SARKER BR; WILHELM WE; HOGG GL
    ONE-DIMENSIONAL MACHINE LOCATION-PROBLEMS IN A MULTIPRODUCT FLOWLINE WITH EQUIDISTANT LOCATIONS
    European journal of operational research
    
    B.R. Sarker et al., "ONE-DIMENSIONAL MACHINE LOCATION-PROBLEMS IN A MULTIPRODUCT FLOWLINE WITH EQUIDISTANT LOCATIONS", European journal of operational research, 105(3), 1998, pp. 401-426
56. RAMACHANDRAN B; PEKNY JF
    LOWER BOUNDS FOR NONLINEAR ASSIGNMENT PROBLEMS USING MANY-BODY INTERACTIONS
    European journal of operational research
    
    B. Ramachandran e J.F. Pekny, "LOWER BOUNDS FOR NONLINEAR ASSIGNMENT PROBLEMS USING MANY-BODY INTERACTIONS", European journal of operational research, 105(1), 1998, pp. 202-215
57. Tavakkoli-Moghaddain, R; Shayan, E
    Facilities layout design by genetic algorithms
    COMPUTERS & INDUSTRIAL ENGINEERING
    
    R. Tavakkoli-Moghaddain e E. Shayan, "Facilities layout design by genetic algorithms", COM IND ENG, 35(3-4), 1998, pp. 527-530
58. KOCHHAR JS; FOSTER BT; HERAGU SS
    HOPE - A GENETIC ALGORITHM FOR THE UNEQUAL AREA FACILITY LAYOUT PROBLEM
    Computers & operations research
    
    J.S. Kochhar et al., "HOPE - A GENETIC ALGORITHM FOR THE UNEQUAL AREA FACILITY LAYOUT PROBLEM", Computers & operations research, 25(7-8), 1998, pp. 583-594
59. LI HL; HSIEH MC
    SOLVING FACILITY-LAYOUT OPTIMIZATION PROBLEMS WITH CLUSTERING CONSTRAINTS
    Environment and planning. B, Planning & design
    
    H.L. Li e M.C. Hsieh, "SOLVING FACILITY-LAYOUT OPTIMIZATION PROBLEMS WITH CLUSTERING CONSTRAINTS", Environment and planning. B, Planning & design, 25(2), 1998, pp. 299-308
60. SARKER BR; WILHELM WE; HOGG GL
    LOCATING SETS OF IDENTICAL MACHINES IN A LINEAR LAYOUT
    Annals of operations research
    
    B.R. Sarker et al., "LOCATING SETS OF IDENTICAL MACHINES IN A LINEAR LAYOUT", Annals of operations research, 77, 1998, pp. 183-207
61. URBAN TL
    SOLUTION PROCEDURES FOR THE DYNAMIC FACILITY LAYOUT PROBLEM
    Annals of operations research
    
    T.L. Urban, "SOLUTION PROCEDURES FOR THE DYNAMIC FACILITY LAYOUT PROBLEM", Annals of operations research, 76, 1998, pp. 323-342
62. Talbi, EG; Hafidi, Z; Geib, JM
    A parallel adaptive tabu search approach
    PARALLEL COMPUTING
    
    E.G. Talbi et al., "A parallel adaptive tabu search approach", PARALLEL C, 24(14), 1998, pp. 2003-2019
63. Talbi, EG; Hafidi, Z; Kebbal, D; Geib, JM
    A fault-tolerant parallel heuristic for assignment problems
    FUTURE GENERATION COMPUTER SYSTEMS
    
    E.G. Talbi et al., "A fault-tolerant parallel heuristic for assignment problems", FUT GENER C, 14(5-6), 1998, pp. 425-438
64. DEINEKO VG; WOEGINGER GJ
    A SOLVABLE CASE OF THE QUADRATIC ASSIGNMENT PROBLEM
    Operations research letters
    
    V.G. Deineko e G.J. Woeginger, "A SOLVABLE CASE OF THE QUADRATIC ASSIGNMENT PROBLEM", Operations research letters, 22(1), 1998, pp. 13-17
65. SRIVASTAVA B
    AN EFFECTIVE HEURISTIC FOR MINIMIZING MAKESPAN ON UNRELATED PARALLEL MACHINES
    The Journal of the Operational Research Society
    
    B. Srivastava, "AN EFFECTIVE HEURISTIC FOR MINIMIZING MAKESPAN ON UNRELATED PARALLEL MACHINES", The Journal of the Operational Research Society, 49(8), 1998, pp. 886-894
66. BURKARD RE; CELA E; ROTE G; WOEGINGER GJ
    THE QUADRATIC ASSIGNMENT PROBLEM WITH A MONOTONE ANTI-MONGE AND A SYMMETRICAL TOEPLITZ MATRIX - EASY AND HARD CASES
    Mathematical programming
    
    R.E. Burkard et al., "THE QUADRATIC ASSIGNMENT PROBLEM WITH A MONOTONE ANTI-MONGE AND A SYMMETRICAL TOEPLITZ MATRIX - EASY AND HARD CASES", Mathematical programming, 82(1-2), 1998, pp. 125-158
67. LEE SD
    CONFIGURING LAYOUT FOR A CELLULAR MANUFACTURING SYSTEM
    International Journal of Systems Science
    
    S.D. Lee, "CONFIGURING LAYOUT FOR A CELLULAR MANUFACTURING SYSTEM", International Journal of Systems Science, 29(6), 1998, pp. 557-564
68. MALMBORG CJ; BUKHARI FA; MCDERMOTT C
    PREDICTING VOLUME DISTANCE PERFORMANCE FOR LAYOUT PROBLEMS WITH STATIC DISTANCE FUNCTIONS
    International Journal of Production Research
    
    C.J. Malmborg et al., "PREDICTING VOLUME DISTANCE PERFORMANCE FOR LAYOUT PROBLEMS WITH STATIC DISTANCE FUNCTIONS", International Journal of Production Research, 36(9), 1998, pp. 2339-2354
69. HAGE P; HARARY F; KRACKHARDT D
    A TEST OF COMMUNICATION AND CULTURAL SIMILARITY IN POLYNESIAN PREHISTORY
    Current anthropology
    
    P. Hage et al., "A TEST OF COMMUNICATION AND CULTURAL SIMILARITY IN POLYNESIAN PREHISTORY", Current anthropology, 39(5), 1998, pp. 699-703
70. ANGEL E; ZISSIMOPOULOS V
    ON THE QUALITY OF LOCAL SEARCH FOR THE QUADRATIC ASSIGNMENT PROBLEM
    Discrete applied mathematics
    
    E. Angel e V. Zissimopoulos, "ON THE QUALITY OF LOCAL SEARCH FOR THE QUADRATIC ASSIGNMENT PROBLEM", Discrete applied mathematics, 82(1-3), 1998, pp. 15-25
71. MARTIN W
    FAST EQUI-PARTITIONING OF RECTANGULAR DOMAINS USING STRIPE DECOMPOSITION
    Discrete applied mathematics
    
    W. Martin, "FAST EQUI-PARTITIONING OF RECTANGULAR DOMAINS USING STRIPE DECOMPOSITION", Discrete applied mathematics, 82(1-3), 1998, pp. 193-207
72. GARCIA G
    QUADRATIC GUARANTEED COST AND DISC POLE LOCATION CONTROL FOR DISCRETE-TIME UNCERTAIN SYSTEMS
    IEE proceedings. Control theory and applications
    
    G. Garcia, "QUADRATIC GUARANTEED COST AND DISC POLE LOCATION CONTROL FOR DISCRETE-TIME UNCERTAIN SYSTEMS", IEE proceedings. Control theory and applications, 144(6), 1997, pp. 545-548
73. PARDALOS PM; RAMAKRISHNAN KG; RESENDE MGC; LI Y
    IMPLEMENTATION OF A VARIANCE REDUCTION-BASED LOWER-BOUND IN A BRANCH-AND-BOUND ALGORITHM FOR THE QUADRATIC ASSIGNMENT PROBLEM
    SIAM journal on optimization
    
    P.M. Pardalos et al., "IMPLEMENTATION OF A VARIANCE REDUCTION-BASED LOWER-BOUND IN A BRANCH-AND-BOUND ALGORITHM FOR THE QUADRATIC ASSIGNMENT PROBLEM", SIAM journal on optimization, 7(1), 1997, pp. 280-294
74. CLAUSEN J; PERREGAARD M
    SOLVING LARGE QUADRATIC ASSIGNMENT PROBLEMS IN PARALLEL
    COMPUTATIONAL OPTIMIZATION AND APPLICATIONS
    
    J. Clausen e M. Perregaard, "SOLVING LARGE QUADRATIC ASSIGNMENT PROBLEMS IN PARALLEL", COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 8(2), 1997, pp. 111-127
75. MICHELENA NF; PAPALAMBROS PY
    A HYPERGRAPH FRAMEWORK FOR OPTIMAL MODEL-BASED DECOMPOSITION OF DESIGN-PROBLEMS
    COMPUTATIONAL OPTIMIZATION AND APPLICATIONS
    
    N.F. Michelena e P.Y. Papalambros, "A HYPERGRAPH FRAMEWORK FOR OPTIMAL MODEL-BASED DECOMPOSITION OF DESIGN-PROBLEMS", COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 8(2), 1997, pp. 173-196
76. MAVRIDOU TD; PARDALOS PM
    SIMULATED ANNEALING AND GENETIC ALGORITHMS FOR THE FACILITY LAYOUT PROBLEM - A SURVEY
    COMPUTATIONAL OPTIMIZATION AND APPLICATIONS
    
    T.D. Mavridou e P.M. Pardalos, "SIMULATED ANNEALING AND GENETIC ALGORITHMS FOR THE FACILITY LAYOUT PROBLEM - A SURVEY", COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 7(1), 1997, pp. 111-126
77. GEORGE A; POTHEN A
    AN ANALYSIS OF SPECTRAL ENVELOPE REDUCTION VIA QUADRATIC ASSIGNMENT PROBLEMS
    SIAM journal on matrix analysis and applications
    
    A. George e A. Pothen, "AN ANALYSIS OF SPECTRAL ENVELOPE REDUCTION VIA QUADRATIC ASSIGNMENT PROBLEMS", SIAM journal on matrix analysis and applications, 18(3), 1997, pp. 706-732
78. GEORGIADIS MC; ROTSTEIN GE; MACCHIETTO S
    OPTIMAL LAYOUT DESIGN IN MULTIPURPOSE BATCH PLANTS
    Industrial & engineering chemistry research
    
    M.C. Georgiadis et al., "OPTIMAL LAYOUT DESIGN IN MULTIPURPOSE BATCH PLANTS", Industrial & engineering chemistry research, 36(11), 1997, pp. 4852-4863
79. FU MC; KAKU BK
    MINIMIZING WORK-IN-PROCESS AND MATERIAL HANDLING IN THE FACILITIES LAYOUT PROBLEM
    IIE transactions
    
    M.C. Fu e B.K. Kaku, "MINIMIZING WORK-IN-PROCESS AND MATERIAL HANDLING IN THE FACILITIES LAYOUT PROBLEM", IIE transactions, 29(1), 1997, pp. 29-36
80. SORIANO P; GENDREAU M
    FOUNDATIONS AND APPLICATIONS OF TABU SEAR CH METHODS
    RAIRO. Recherche operationnelle
    
    P. Soriano e M. Gendreau, "FOUNDATIONS AND APPLICATIONS OF TABU SEAR CH METHODS", RAIRO. Recherche operationnelle, 31(2), 1997, pp. 133-159
81. HOUSHYAR A; WHITE B
    COMPARISON OF SOLUTION PROCEDURES TO THE FACILITY LOCATION PROBLEM
    Computers & industrial engineering
    
    A. Houshyar e B. White, "COMPARISON OF SOLUTION PROCEDURES TO THE FACILITY LOCATION PROBLEM", Computers & industrial engineering, 32(1), 1997, pp. 77-87
82. MASON A; RONNQVIST M
    SOLUTION METHODS FOR THE BALANCING OF JET TURBINES
    Computers & operations research
    
    A. Mason e M. Ronnqvist, "SOLUTION METHODS FOR THE BALANCING OF JET TURBINES", Computers & operations research, 24(2), 1997, pp. 153-167
83. MELLER RD; BOZER YA
    ALTERNATIVE APPROACHES TO SOLVE THE MULTI-FLOOR FACILITY LAYOUT PROBLEM
    Journal of manufacturing systems
    
    R.D. Meller e Y.A. Bozer, "ALTERNATIVE APPROACHES TO SOLVE THE MULTI-FLOOR FACILITY LAYOUT PROBLEM", Journal of manufacturing systems, 16(3), 1997, pp. 192-203
84. OSTROWSKI T; RUOPPILA VT
    GENETIC ANNEALING SEARCH FOR INDEX ASSIGNMENT IN VECTOR QUANTIZATION
    Pattern recognition letters
    
    T. Ostrowski e V.T. Ruoppila, "GENETIC ANNEALING SEARCH FOR INDEX ASSIGNMENT IN VECTOR QUANTIZATION", Pattern recognition letters, 18(4), 1997, pp. 311-318
85. GUTJAHR WJ; HITZ M; MUECK TA
    TASK ASSIGNMENT IN CAYLEY INTERCONNECTION TOPOLOGIES
    Parallel computing
    
    W.J. Gutjahr et al., "TASK ASSIGNMENT IN CAYLEY INTERCONNECTION TOPOLOGIES", Parallel computing, 23(10), 1997, pp. 1429-1460
86. NORI VS; SARKER BR
    REDUCING WORK-IN-PROCESS MOVEMENT FOR MULTIPLE PRODUCTS IN ONE-DIMENSIONAL LAYOUT PROBLEMS
    The Journal of the Operational Research Society
    
    V.S. Nori e B.R. Sarker, "REDUCING WORK-IN-PROCESS MOVEMENT FOR MULTIPLE PRODUCTS IN ONE-DIMENSIONAL LAYOUT PROBLEMS", The Journal of the Operational Research Society, 48(4), 1997, pp. 412-422
87. PARDALOS PM; PITSOULIS LS; RESENDE MGC
    ALGORITHM 769 - FORTRAN SUBROUTINES FOR APPROXIMATE SOLUTION OF SPARSE QUADRATIC ASSIGNMENT PROBLEMS USING GRASP
    ACM transactions on mathematical software
    
    P.M. Pardalos et al., "ALGORITHM 769 - FORTRAN SUBROUTINES FOR APPROXIMATE SOLUTION OF SPARSE QUADRATIC ASSIGNMENT PROBLEMS USING GRASP", ACM transactions on mathematical software, 23(2), 1997, pp. 196-208
88. BURKARD RE
    EFFICIENTLY SOLVABLE SPECIAL CASES OF HARD COMBINATORIAL OPTIMIZATIONPROBLEMS
    Mathematical programming
    
    R.E. Burkard, "EFFICIENTLY SOLVABLE SPECIAL CASES OF HARD COMBINATORIAL OPTIMIZATIONPROBLEMS", Mathematical programming, 79(1-3), 1997, pp. 55-69
89. MALMBORG CJ; BUKHARI FA
    MATERIAL FLOW-ANALYSIS AND VOLUME DISTANCE SAMPLING IN HEURISTIC LINELAYOUT PROCEDURES
    International Journal of Production Research
    
    C.J. Malmborg e F.A. Bukhari, "MATERIAL FLOW-ANALYSIS AND VOLUME DISTANCE SAMPLING IN HEURISTIC LINELAYOUT PROCEDURES", International Journal of Production Research, 35(7), 1997, pp. 2045-2063
90. OBUCHI Y; MASUI H; OHKI M
    WEIGHTED PARALLEL PROBLEM-SOLVING BY OPTIMIZATION NETWORKS
    Neural networks
    
    Y. Obuchi et al., "WEIGHTED PARALLEL PROBLEM-SOLVING BY OPTIMIZATION NETWORKS", Neural networks, 9(2), 1996, pp. 357-366
91. TORKI A; YAJIMA Y; ENKAWA T
    A LOW-RANK BILINEAR-PROGRAMMING APPROACH FOR SUBOPTIMAL SOLUTION OF THE QUADRATIC ASSIGNMENT PROBLEM
    European journal of operational research
    
    A. Torki et al., "A LOW-RANK BILINEAR-PROGRAMMING APPROACH FOR SUBOPTIMAL SOLUTION OF THE QUADRATIC ASSIGNMENT PROBLEM", European journal of operational research, 94(2), 1996, pp. 384-391
92. VAITHYANATHAN S; BURKE LI; MAGENT MA
    MASSIVELY-PARALLEL ANALOG TABU SEARCH USING NEURAL NETWORKS APPLIED TO SIMPLE PLANT LOCATION-PROBLEMS
    European journal of operational research
    
    S. Vaithyanathan et al., "MASSIVELY-PARALLEL ANALOG TABU SEARCH USING NEURAL NETWORKS APPLIED TO SIMPLE PLANT LOCATION-PROBLEMS", European journal of operational research, 93(2), 1996, pp. 317-330
93. ROUCAIROL C
    PARALLEL-PROCESSING FOR DIFFICULT COMBINATORIAL OPTIMIZATION PROBLEMS
    European journal of operational research
    
    C. Roucairol, "PARALLEL-PROCESSING FOR DIFFICULT COMBINATORIAL OPTIMIZATION PROBLEMS", European journal of operational research, 92(3), 1996, pp. 573-590
94. BOLTE A; THONEMANN UW
    OPTIMIZING SIMULATED ANNEALING SCHEDULES WITH GENETIC PROGRAMMING
    European journal of operational research
    
    A. Bolte e U.W. Thonemann, "OPTIMIZING SIMULATED ANNEALING SCHEDULES WITH GENETIC PROGRAMMING", European journal of operational research, 92(2), 1996, pp. 402-416
95. TSUCHIYA K; BHARITKAR S; TAKEFUJI Y
    A NEURAL-NETWORK APPROACH TO FACILITY LAYOUT PROBLEMS
    European journal of operational research
    
    K. Tsuchiya et al., "A NEURAL-NETWORK APPROACH TO FACILITY LAYOUT PROBLEMS", European journal of operational research, 89(3), 1996, pp. 556-563
96. ANDERSON EJ
    MECHANISMS FOR LOCAL SEARCH
    European journal of operational research
    
    E.J. Anderson, "MECHANISMS FOR LOCAL SEARCH", European journal of operational research, 88(1), 1996, pp. 139-151
97. TIAN P; WANG HC; ZHANG DM
    SIMULATED ANNEALING FOR THE QUADRATIC ASSIGNMENT PROBLEM - A FURTHER STUDY
    Computers & industrial engineering
    
    P. Tian et al., "SIMULATED ANNEALING FOR THE QUADRATIC ASSIGNMENT PROBLEM - A FURTHER STUDY", Computers & industrial engineering, 31(3-4), 1996, pp. 925-928
98. BOZER YA; RIM SC
    A BRANCH-AND-BOUND METHOD FOR SOLVING THE BIDIRECTIONAL CIRCULAR LAYOUT PROBLEM
    Applied mathematical modelling
    
    Y.A. Bozer e S.C. Rim, "A BRANCH-AND-BOUND METHOD FOR SOLVING THE BIDIRECTIONAL CIRCULAR LAYOUT PROBLEM", Applied mathematical modelling, 20(5), 1996, pp. 342-351
99. SOROUSH HM
    OPTIMAL SEQUENCES IN STOCHASTIC SINGLE-MACHINE SHOPS
    Computers & operations research
    
    H.M. Soroush, "OPTIMAL SEQUENCES IN STOCHASTIC SINGLE-MACHINE SHOPS", Computers & operations research, 23(7), 1996, pp. 705-721
100. HUNTLEY CL; BROWN DE
     PARALLEL GENETIC ALGORITHMS WITH LOCAL SEARCH
     Computers & operations research
     
     C.L. Huntley e D.E. Brown, "PARALLEL GENETIC ALGORITHMS WITH LOCAL SEARCH", Computers & operations research, 23(6), 1996, pp. 559-571