Handbook of Combinatorial Optimization

Name: Handbook of Combinatorial Optimization
Rating: 4 (2 reviews)

Ding-Zhu Du · Panos M. Pardalos

дец 2013. · Springer Science & Business Media

4,0

2 рецензијe

Е-књига

2406

Страница

Оцене и рецензије нису верификоване Сазнајте више

О овој е-књизи

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).

Оцене и рецензије

4,0

2 рецензијe

Оцените ову е-књигу

Јавите нам своје мишљење.

Информације о читању

Паметни телефони и таблети

Инсталирајте апликацију Google Play књиге за Android и iPad/iPhone. Аутоматски се синхронизује са налогом и омогућава вам да читате онлајн и офлајн где год да се налазите.

Лаптопови и рачунари

Можете да слушате аудио-књиге купљене на Google Play-у помоћу веб-прегледача на рачунару.

Е-читачи и други уређаји

Да бисте читали на уређајима које користе е-мастило, као што су Kobo е-читачи, треба да преузмете фајл и пренесете га на уређај. Пратите детаљна упутства из центра за помоћ да бисте пренели фајлове у подржане е-читаче.

Пријавите незаконит садржај