Spedizione gratuita per ordini superiori a 69,99 euro.

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

Spedizione gratuita con Packeta per un prezzo superiore a 69.99 €

Bartolini 4.49 € Punto Poste 5.49 € Punto Poste 5.49 € Punto Bartolini 3.49 € DHL 6.99 € GLS 7.99 €

Contatto

Come acquistare

Aiuto

Il mio account

▸ Vuoto :-(

Spedizione gratuita per ordini superiori a 69,99 euro.

Combinatorial And Global Optimization

Name: Combinatorial And Global Optimization
Brand: World Scientific Publishing Co Pte Ltd
SKU: 05066987
Price: 159.49 EUR
Availability: InStock
Author: Athanasios Migdalas
ISBN: 9789810248024

Athanasios Migdalas

Panos M Pardalos

Lingua

Inglese

Libro Rigido

Codice Libristo: 05066987

Casa editrice World Scientific Publishing Co Pte Ltd, aprile 2002

Combinatorial and global optimization problems appear in a wide range of applications in operations... Descrizione completa

Codice Libristo: 05066987

390 b

159.49 €

50% di possibilità Cercheremo nel mondo Quando riceverò il libro?

30 giorni per il reso

I clienti hanno acquistato anche

Ministere de l'Instruction Publique Et Des Beaux-Arts. Enseignement Secondaire IMPR NATIONALE

In brossura

21.99 €

Los saqueadores de sueños MAGGIE STIEFVATER

In brossura

18.79 €

Pozdní host Jenny Nowak

In brossura

10.39 €

Principios Jurídicos en la definición del Derecho Sánchez de la Torre

In brossura

25.29 €

Francuski w podróży. 100 Fiszek Opracowanie zbiorowe

In brossura

4.39 €

Thérèse de Lisieux et Maria Valtorta Laudazi

In brossura

13.89 €

Már négyen vagyunk! Sabine Cuno

Leporello

10.29 €

Mesopotamia Erika Roboz

Rigido

55.39 €

Шiсть багряних журавлiв. Книга 1/Фантастичнi свiти Elizabeth Lim

Rigido

38.09 €

Joseph Kardinal Hergenroethers Handbuch der allgemeinen Kirchngeschichte Kirsch

In brossura

74.39 €

Combinatorial and global optimization problems appear in a wide range of applications in operations research, engineering, biological science and computer science. In combinatorial optimization and graph theory, many approaches have been developed that link the discrete universe to the continuous universe through geometric, analytic and algebraic techniques. Such techniques include global optimization formulations, semidefinite programming, and spectral theory. Recent major successes based on these approaches include interior point algorithms for linear and discrete problems, the celebrated Goemans-Williamson relaxation of the maximum cut problem, and the Du-Hwang solution of the Gilbert-Pollak conjecture. Since integer constraints are equivalent to nonconvex constraints, the fundamental difference between classes of optimization problems is not between discrete and continuous problems but between convex and nonconvex optimization problems. This volume is a selection of refereed papers based on talks presented at a conference on "Combinatorial and Global Optimization" held at Crete, Greece.