"Very clear exposition. I jumped right into [the] heuristic methods chapter and understood it almost instantly..." - Dean H. Judson, Ph.D., Nevada State Demographer "book serves as an introduction to the basic problems and methodsstyle is clear, transparentThe algorithmic problems are always considered and they are in the center of the discussionhas a fresh approach to combinatorics that is available for readers, students in computer science, electrical engineering without any background in mathematics." - Piter Hajnal, Acta Science Math

"Sobre este t�tulo" puede pertenecer a otra edici�n de este libro.

Descripci�n de la librer�a

The Saint Bookstore has a range of over 1 million titles available.

Ver la p�gina web de la librer�a

Informaci�n empresarial del vendedor

SB ONLINE LTD
50 Devonshire Road, Southport, PR9 7BZ, United Kingdom

Condiciones de venta:

Please order through the Abebooks checkout. We only take orders through Abebooks - We don't take direct orders by email or phone.

Refunds or Returns: A full refund of the purchase price will be given if returned within 30 days in undamaged condition.

As a seller on abebooks we adhere to the terms explained at http://www.abebooks.co.uk/docs/HelpCentral/buyerIndex.shtml - if you require further assistance please email us at orders@thesaintbookstore.co.uk

Condiciones de env�o:

Most orders usually ship within 1-3 business days, but some can take up to 7 days.

M�todos de pago
aceptados por la librer�a

A�adir una petici�n

Art�culos relacionados a Combinatorial Algorithms: Generation, Enumeration,...

Combinatorial Algorithms: Generation, Enumeration, and Search

Donald L. Kreher

Nuevos - Encuadernaci�n de tapa dura

Informaci�n empresarial del vendedor