|
|
|
|
| LEADER |
00000nam a22000005i 4500 |
| 001 |
b3229078 |
| 003 |
MWH |
| 005 |
20191025172539.0 |
| 007 |
cr nn 008mamaa |
| 008 |
130125s1998 xxu| s |||| 0|eng d |
| 020 |
|
|
|a 9781475727876
|
| 024 |
7 |
|
|a 10.1007/978-1-4757-2787-6
|2 doi
|
| 035 |
|
|
|a (DE-He213)978-1-4757-2787-6
|
| 050 |
|
4 |
|a E-Book
|
| 072 |
|
7 |
|a PBU
|2 bicssc
|
| 072 |
|
7 |
|a MAT003000
|2 bisacsh
|
| 072 |
|
7 |
|a PBU
|2 thema
|
| 100 |
1 |
|
|a Cela, E.
|e author.
|4 aut
|4 http://id.loc.gov/vocabulary/relators/aut
|
| 245 |
1 |
4 |
|a The Quadratic Assignment Problem
|h [electronic resource] :
|b Theory and Algorithms /
|c by E. Cela.
|
| 250 |
|
|
|a 1st ed. 1998.
|
| 264 |
|
1 |
|a New York, NY :
|b Springer US :
|b Imprint: Springer,
|c 1998.
|
| 300 |
|
|
|a XV, 287 p.
|b online resource.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
|
|
|a text file
|b PDF
|2 rda
|
| 490 |
1 |
|
|a Combinatorial Optimization,
|x 1388-3011 ;
|v 1
|
| 490 |
1 |
|
|a Springer eBook Collection
|
| 505 |
0 |
|
|a 1 Problem Statement and Complexity Aspects -- 2 Exact Algorithms and Lower Bounds -- 3 Heuristics and Asymptotic Behavior -- 4 QAPS on Specially Structured Matrices -- 5 Two More Restricted Versions of the QAP -- 6 QAPS Arising as Optimization Problems in Graphs -- 7 On the Biquadratic Assignment Problem (BIQAP) -- References -- Notation Index.
|
| 520 |
|
|
|a The quadratic assignment problem (QAP) was introduced in 1957 by Koopmans and Beckmann to model a plant location problem. Since then the QAP has been object of numerous investigations by mathematicians, computers scientists, ope- tions researchers and practitioners. Nowadays the QAP is widely considered as a classical combinatorial optimization problem which is (still) attractive from many points of view. In our opinion there are at last three main reasons which make the QAP a popular problem in combinatorial optimization. First, the number of re- life problems which are mathematically modeled by QAPs has been continuously increasing and the variety of the fields they belong to is astonishing. To recall just a restricted number among the applications of the QAP let us mention placement problems, scheduling, manufacturing, VLSI design, statistical data analysis, and parallel and distributed computing. Secondly, a number of other well known c- binatorial optimization problems can be formulated as QAPs. Typical examples are the traveling salesman problem and a large number of optimization problems in graphs such as the maximum clique problem, the graph partitioning problem and the minimum feedback arc set problem. Finally, from a computational point of view the QAP is a very difficult problem. The QAP is not only NP-hard and - hard to approximate, but it is also practically intractable: it is generally considered as impossible to solve (to optimality) QAP instances of size larger than 20 within reasonable time limits.
|
| 590 |
|
|
|a Loaded electronically.
|
| 590 |
|
|
|a Electronic access restricted to members of the Holy Cross Community.
|
| 650 |
|
0 |
|a Mathematical optimization.
|
| 650 |
|
0 |
|a Algorithms.
|
| 650 |
|
0 |
|a Computers.
|
| 650 |
|
0 |
|a Computer science—Mathematics.
|
| 650 |
|
0 |
|a Combinatorics.
|
| 690 |
|
|
|a Electronic resources (E-books)
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer eBooks
|
| 830 |
|
0 |
|a Combinatorial Optimization,
|x 1388-3011 ;
|v 1
|
| 830 |
|
0 |
|a Springer eBook Collection.
|
| 856 |
4 |
0 |
|u https://holycross.idm.oclc.org/login?auth=cas&url=https://doi.org/10.1007/978-1-4757-2787-6
|3 Click to view e-book
|t 0
|
| 907 |
|
|
|a .b32290780
|b 04-18-22
|c 02-26-20
|
| 998 |
|
|
|a he
|b 02-26-20
|c m
|d @
|e -
|f eng
|g xxu
|h 4
|i 1
|
| 912 |
|
|
|a ZDB-2-SMA
|
| 912 |
|
|
|a ZDB-2-BAE
|
| 950 |
|
|
|a Mathematics and Statistics (Springer-11649)
|
| 902 |
|
|
|a springer purchased ebooks
|
| 903 |
|
|
|a SEB-COLL
|
| 945 |
|
|
|f - -
|g 1
|h 0
|j - -
|k - -
|l he
|o -
|p $0.00
|q -
|r -
|s b
|t 38
|u 0
|v 0
|w 0
|x 0
|y .i21422436
|z 02-26-20
|
| 999 |
f |
f |
|i 0778bfca-363e-56db-91fa-16a373345bf7
|s 809b77a3-1895-5afd-8d06-71314a908aab
|t 0
|
| 952 |
f |
f |
|p Online
|a College of the Holy Cross
|b Main Campus
|c E-Resources
|d Online
|t 0
|e E-Book
|h Library of Congress classification
|i Elec File
|