Garantía de entrega
SKU/Artículo: AMZ-0792350197
Handbook of Combinatorial Optimization
Format:
Hardcover
Detalles del producto
Disponibilidad:
En stock
En stock
Peso con empaque:
3.99 kg
3.99 kg
Devolución:
No
No
Condición
Nuevo
Nuevo
Producto de:
Amazon
Amazon
Viaja desde
USA
USA
Sobre este producto
- Combinatorial (or discrete) optimization is one of the most active fields in the interface of operations research, computer science, and applied math ematics. Combinatorial optimization problems arise in various applications, including communications network design, VLSI design, machine vision, air line crew scheduling, corporate planning, computer-aided design and man ufacturing, database query design, cellular telephone frequency assignment, constraint directed reasoning, and computational biology. Furthermore, combinatorial optimization problems occur in many diverse areas such as linear and integer programming, graph theory, artificial intelligence, and number theory. All these problems, when formulated mathematically as the minimization or maximization of a certain function defined on some domain, have a commonality of discreteness. Historically, combinatorial optimization starts with linear programming. Linear programming has an entire range of important applications including production planning and distribution, personnel assignment, finance, alloca tion of economic resources, circuit simulation, and control systems. Leonid Kantorovich and Tjalling Koopmans received the Nobel Prize (1975) for their work on the optimal allocation of resources. Two important discover ies, the ellipsoid method (1979) and interior point approaches (1984) both provide polynomial time algorithms for linear programming. These algo rithms have had a profound effect in combinatorial optimization. Many polynomial-time solvable combinatorial optimization problems are special cases of linear programming (e.g. matching and maximum flow). In addi tion, linear programming relaxations are often the basis for many approxi mation algorithms for solving NP-hard problems (e.g. dualheuristics).
U$S 824,98
60% OFF
U$S 329,99
IMPORTÁ FACIL
Comprando este producto podrás descontar el IVA con tu número de RUT
NO CONSUME FRANQUICIA
Si tu carrito tiene solo libros o CD’s, no consume franquicia y podés comprar hasta U$S 1000 al año.
U$S 824,98
60% OFF
U$S 329,99
¡Comprá en hasta 12 cuotas sin interés con todas tus tarjetas!
Llega en 15 a 25 días hábiles
con envío
Tienes garantía de entrega
Compra protegida
Disfruta de una experiencia de compra segura y confiable
![]()
Garantía de entrega
Con Tiendamia todas tus compras cuentan con Garantía de Entrega o devolución total de tu dinero.
Compras 100% seguras y garantizadas, para que pidas lo que soñás y lo recibas del mundo a tu puerta.
Saber más.
Tarjetas prepagas, debito, y credito
Paga hasta en 12 cuotas sin interés con tarjetas de crédito.
Visa
Mastercard
American Express
Dinners
Discover
Lider
Midinero
OCA
OCA Blue
Tarjeta PREX
Pagos a través de PayPal
Paga en dólares con Tarjetas internacionales a través de PayPal.
PayPal
