Controllare lo stato dell'ordine

Entra a far parte di una comunità di amanti dei libri di tutto il mondo e ottieni numerosi vantaggi. Crea un account gratuito

Punto Poste 5.49 € Punto Poste 5.49 € Corriere DHL 6.99 € Corriere GLS 5.99 € Punto GLS 4.49 € Corriere Bartolini 4.49 € Punto Bartolini 3.49 €

Contatto

Come acquistare

Aiuto

Il mio account

▸ Vuoto :-(

Integer Programming and Combinatorial Optimization

Name: Integer Programming and Combinatorial Optimization
Brand: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
SKU: 01563553
Price: 50.99 EUR
Availability: InStock
Author: Karen Aardal
ISBN: 9783540422259

8th International IPCO Conference, Utrecht, The Netherlands, June 13-15, 2001. Proceedings

Karen Aardal

Bert Gerards

Lingua

Inglese

Libro In brossura

Codice Libristo: 01563553

Casa editrice Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, maggio 2001

This book constitutes the reviewed proceedings of the 8th International Conference on Integer Progra... Descrizione completa

Codice Libristo: 01563553

125 b

50.99 €

Magazzino esterno Inviamo tra 5-8 giorni

Fino a 30 giorni per il reso

I clienti hanno acquistato anche

100 Bilderbücher für die Grundschule Gudrun Hollstein

In brossura

16.99 €

100 recreaciones fáciles KARL CZERNY

In brossura

15.49 €

L.O.L. Surprise ! 07 - À l'abordage, Captain B.B. ! Libro

In brossura

7.39 €

Oli essenziali come detergenti per dentiere e agenti antimicotici Fauzia Khan

In brossura

43.99 €

This book constitutes the reviewed proceedings of the 8th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2001, held in Utrecht, The Netherlands in June 2001. The 32 revised full papers presented were carefully reviewed and selected from a total of 108 submissions. The proceedings reflect most current directions in integer programming and optimization research. Among the topics covered are approximation algorithms, branch and bound algorithms, computational biology, computational complexity, algorithmic geometry, cutting plane algorithms, diophantine equations, geometry of members, graph and network algorithms, online algorithms, polyhedral combinatorics, scheduling theory and algorithms, and semidefinite programs.