Last update: Wed Sep 26 02:10:21 MDT 2018
Top |
Symbols |
Numbers |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z
BibTeX entry
@InProceedings{Pardalos:1989:PAQ,
author = "P. M. Pardalos and J. V. Crouse",
title = "A parallel algorithm for the quadratic assignment
problem",
crossref = "ACM:1989:PSN",
pages = "351--360",
year = "1989",
bibdate = "Wed Apr 15 19:32:44 MDT 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/supercomputing89.bib",
acknowledgement = ack-nhfb,
classification = "C1180 (Optimisation techniques); C4240 (Programming
and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Pennsylvania State Univ.,
University Park, PA, USA",
keywords = "branch-and-bound algorithm; computational results; IBM
3090-400E vector multiprocessor; parallel algorithm;
parallel algorithms; quadratic assignment problem;
quadratic programming; standard test problem;
VS/Fortran",
sponsororg = "ACM; IEEE",
treatment = "P Practical",
}
Related entries
- algorithm,
0(0)xviii--849,
0(0)2,
0(0)10,
0(0)21,
0(0)32,
0(0)42,
0(0)58,
0(0)106,
0(0)123,
0(0)152,
0(0)197,
0(0)205,
0(0)215,
0(0)225,
0(0)243,
0(0)248,
0(0)257,
0(0)266,
0(0)276,
0(0)294,
0(0)304,
0(0)314,
0(0)326,
0(0)333,
0(0)337,
0(0)344,
0(0)361,
0(0)380,
0(0)399,
0(0)580,
0(0)597,
0(0)616,
0(0)665,
0(0)779,
0(0)789
- and-bound, branch-,
0(0)152
- assignment,
0(0)399,
0(0)551
- bound, branch-and-,
0(0)152
- branch-and-bound,
0(0)152
- C1180,
0(0)699
- C4240,
0(0)xviii--849,
0(0)152,
0(0)243,
0(0)248,
0(0)276,
0(0)294,
0(0)304,
0(0)314,
0(0)326,
0(0)333,
0(0)337,
0(0)344,
0(0)380,
0(0)399,
0(0)789
- computational,
0(0)xviii--849,
0(0)2,
0(0)10,
0(0)21,
0(0)32,
0(0)42,
0(0)51,
0(0)58,
0(0)71,
0(0)113,
0(0)123,
0(0)133,
0(0)266,
0(0)276,
0(0)344,
0(0)647
- IBM,
0(0)162,
0(0)225,
0(0)257
- multiprocessor,
0(0)xviii--849,
0(0)2,
0(0)10,
0(0)21,
0(0)32,
0(0)42,
0(0)106,
0(0)197,
0(0)205,
0(0)243,
0(0)248,
0(0)257,
0(0)266,
0(0)276,
0(0)283,
0(0)314,
0(0)371,
0(0)389,
0(0)426,
0(0)457,
0(0)466,
0(0)476,
0(0)485,
0(0)495,
0(0)505,
0(0)531,
0(0)589,
0(0)637,
0(0)647,
0(0)675,
0(0)699,
0(0)704,
0(0)713,
0(0)721,
0(0)747,
0(0)759,
0(0)765,
0(0)775,
0(0)779,
0(0)797,
0(0)809,
0(0)826,
0(0)832,
0(0)842
- optimisation,
0(0)32,
0(0)699
- problem,
0(0)141,
0(0)197,
0(0)344,
0(0)399,
0(0)765
- programming,
0(0)xviii--849,
0(0)10,
0(0)21,
0(0)81,
0(0)96,
0(0)106,
0(0)152,
0(0)162,
0(0)187,
0(0)197,
0(0)234,
0(0)243,
0(0)248,
0(0)276,
0(0)294,
0(0)304,
0(0)314,
0(0)326,
0(0)333,
0(0)337,
0(0)344,
0(0)361,
0(0)380,
0(0)389,
0(0)399,
0(0)410,
0(0)511,
0(0)521,
0(0)531,
0(0)540,
0(0)551,
0(0)557,
0(0)562,
0(0)568,
0(0)574,
0(0)580,
0(0)589,
0(0)607,
0(0)616,
0(0)627,
0(0)637,
0(0)647,
0(0)655,
0(0)665,
0(0)675,
0(0)699,
0(0)789
- result,
0(0)759,
0(0)775
- standard,
0(0)589
- techniques,
0(0)xviii--849,
0(0)2,
0(0)10,
0(0)21,
0(0)32,
0(0)42,
0(0)58,
0(0)71,
0(0)152,
0(0)187,
0(0)243,
0(0)248,
0(0)257,
0(0)266,
0(0)276,
0(0)283,
0(0)389,
0(0)446,
0(0)457,
0(0)466,
0(0)476,
0(0)485,
0(0)495,
0(0)574,
0(0)597,
0(0)627,
0(0)647,
0(0)675,
0(0)693,
0(0)699,
0(0)704,
0(0)713,
0(0)721,
0(0)732,
0(0)737,
0(0)747,
0(0)759,
0(0)765,
0(0)775,
0(0)779,
0(0)789,
0(0)797,
0(0)809,
0(0)826,
0(0)832,
0(0)842
- test,
0(0)113
- theory,
0(0)xviii--849,
0(0)2,
0(0)10,
0(0)32,
0(0)42,
0(0)71,
0(0)96,
0(0)113,
0(0)152,
0(0)162,
0(0)175,
0(0)197,
0(0)205,
0(0)243,
0(0)248,
0(0)276,
0(0)294,
0(0)304,
0(0)314,
0(0)326,
0(0)333,
0(0)337,
0(0)344,
0(0)371,
0(0)380,
0(0)399,
0(0)426,
0(0)531,
0(0)597,
0(0)647,
0(0)699,
0(0)704,
0(0)713,
0(0)789
- vector,
0(0)xviii--849,
0(0)10,
0(0)187,
0(0)197,
0(0)205,
0(0)225,
0(0)234,
0(0)257,
0(0)495,
0(0)531,
0(0)775,
0(0)779,
0(0)797,
0(0)820,
0(0)826