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:
Sí
Sí
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).
AR$1.546.805
60% OFF
AR$618.723
IMPORT EASILY
By purchasing this product you can deduct VAT with your RUT number
AR$1.546.805
60% OFF
AR$618.723
Llega en 12 a 18 días hábiles
con envío
Tienes garantía de entrega
Este producto viaja
de USA ![]()
a tus manos en
![]()
a tus manos en
Compra protegida
Disfruta de una experiencia de compra segura y confiable
Tarjetas de Crédito y Débito
Visa
Mastercard
American Express
Pagos a través de PayPal
Compra procesada en dólares con dinero en cuenta o tarjetas internacionales.
Paypal
Pagos a través de MODO
Compra procesada en pesos desde la App de tu banco.
PayPal
