Handbook of Combinatorial Optimization

افزودن به بوکمارک اشتراک گذاری 0 دیدگاه کاربران 5 (0)

Supplement Volume a

مشارکت: عنوان و توضیح کوتاه هر کتاب را ترجمه کنید این ترجمه بعد از تایید با نام شما در سایت نمایش داده خواهد شد.

ترجمه این کتاب مشاهده همه کتاب های ترجمه نشده

Supplement Volume a

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

لغو

گزارش تخلف

مغایرت عنوان کتاب با توضیحات و تصویر جلد
عدم رعایت حقوق نشر طبق قوانین جمهوری اسلامی ایران
محتوای مستهجن
توهین به قومیتها و محتوای نژادپرستی
توهین به اقیلیتهای مذهبی
اهانت به مقامات سیاسی و مذهبی
اشاعه ی کودک آزاری
سایر موارد

بستن

فرمت کتاب

ebook

زبان

english

تاریخ انتشار

1999

نویسنده

Panos M. Pardalos

ناشر

Springer

شابک

9780792359241

20,000 تومان

خرید کتاب مطالعه نمونه درخواست ترجمه کتاب

خرید کتاب Handbook of Combinatorial Optimization

Handbook of Combinatorial Optimization

گزارش تخلف

فرمت کتاب

ebook

زبان

english

تاریخ انتشار

1999

نویسنده

ناشر

شابک

کتاب های مرتبط

Metaheuristics for Big Data

Optimal interconnection trees in the plane : theory, algorithms and applications

Cohort Intelligence

Handbook of Combinatorial Optimization

Advances in Steiner Trees

Combinatorial Data Analysis

A Java Library of Graph Algorithms and Optimization

Optimization Algorithms in Physics

Biologically Inspired Optimization Methods

Composite Systems Decisions

Heuristic And Optimization For Knowledge Discovery

Otimização combinatória e programmação linear : modelos e algoritmos

Graphs, networks, and algorithms

Algorithms 23rd Annual European symposium ; proceedings

Combinatorial Optimization Theory and Algorithms

Neo 2016

Combinatorial Methods and Models

Evolve - A Bridge Between Probability, Set Oriented Numerics, and Evolutionary Computation V

Problems from the Discrete to the Continuous

Combinatorial Optimization

Algorithms - ESA 2015

دیدگاه کاربران