Isbn: 9789810248024 - combinatorial and global optimization: 14 (series on applied mathematics) (2 resultados)

ISBN: 
Refinar con la Búsqueda avanzada

Filtrar la búsqueda

  • Libros (2)

a

Intervalo de precios personalizado (EUR)

a

  • Idioma: Inglés

    Editorial: World Scientific Pub Co Inc, Hackensack, New Jersey, U.S.A., 2002

    9810248024 / 9789810248024

    • Tapa dura
    • Primera edición

    Librería: Alexander Books (ABAC/ILAB), Ancaster, ON, CanadaAlexander Books (ABAC/ILAB)

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Miembro de asociación: ABACILAB

    Condición: Usado - Muy bueno

    EUR 32,19

    Envío por EUR 7,14 
    Se envía de Canada a Estados Unidos de America

    Cantidad disponible: 1 disponible

    Hardcover. Condición: Near Fine. Estado de la sobrecubierta: Fine. First Edition. 355p. Bookplate o/w fine.

  • Idioma: Inglés

    Editorial: World Scientific Publishing Company, 2002

    9810248024 / 9789810248024

    • Tapa dura

    Librería: Buchpark, Trebbin, AlemaniaBuchpark

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Usado - Excelente

    EUR 134,36

    Envío por EUR 105,00 
    Se envía de Alemania a Estados Unidos de America

    Cantidad disponible: 1 disponible

    Condición: Sehr gut. Zustand: Sehr gut | Seiten: 372 | Sprache: Englisch | Produktart: Bücher | 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.…