LIBRISTO
LIBROAMANTO
mandatory
Become part of a community of book lovers from all over the world and get access to a whole bunch of benefits. Create an account for free
0
DPD courier 4.99 GLS courier 9.99

Tree-Search Algorithms for Quadratic Assignment Problems

Language EnglishEnglish
Book Hardback
Book Tree-Search Algorithms for Quadratic Assignment Problems John F Pierce
Libristo code: 10248470
Publishers Palala Press, September 2015
This work has been selected by scholars as being culturally important, and is part of the knowledge... Full description
? points 72 b
29.69
In stock at our supplier Shipping in 9-15 days

Up to 30 days for returns


Customers also purchased


Impulsions maths 2de Martineau-Robin / Book Book
common.buy 42.42

This work has been selected by scholars as being culturally important, and is part of the knowledge base of civilization as we know it. This work was reproduced from the original artifact, and remains as true to the original work as possible. Therefore, yo

Actress & Polyglot
EWA KASP for
Play video
Ewa Kasp
Libristo has the largest selection of foreign-language books. That’s why I buy my books there.

About the book

Full name Tree-Search Algorithms for Quadratic Assignment Problems
Language English
Binding Book - Hardback
Date of issue 2015
Number of pages 82
EAN 9781342207968
ISBN 9781342207968
Libristo code 10248470
Publishers Palala Press
Weight 295
Dimensions 156 x 234 x 6
Give this book today
It's easy
1 Add to cart and choose Deliver as present at the checkout 2 We'll send you a voucher 3 The book will arrive at the recipient's address

You might also be interested in


Top
How To Read Egyptian Hieroglyphs Mark Collier / Book Hardback
common.buy 16.05

Login

Log in to your account. Don't have a Libristo account? Create one now!

 
mandatory
mandatory

Don’t have an account? Discover the benefits of having a Libristo account!

With a Libristo account, you'll have everything under control.

Create a Libristo account
Book advisor Libroamiko
Hi, I'm Libroamiko, can I help?