Combinatorial Methods of Discrete Programming
Author: László Béla Kovács
Publisher:
Published: 1980
Total Pages: 292
ISBN-13:
DOWNLOAD EBOOKRead and Download eBook Full
Author: László Béla Kovács
Publisher:
Published: 1980
Total Pages: 292
ISBN-13:
DOWNLOAD EBOOKAuthor: Emile Aarts
Publisher: Princeton University Press
Published: 2018-06-05
Total Pages: 525
ISBN-13: 0691187568
DOWNLOAD EBOOKIn the past three decades, local search has grown from a simple heuristic idea into a mature field of research in combinatorial optimization that is attracting ever-increasing attention. Local search is still the method of choice for NP-hard problems as it provides a robust approach for obtaining high-quality solutions to problems of a realistic size in reasonable time. Local Search in Combinatorial Optimization covers local search and its variants from both a theoretical and practical point of view, each topic discussed by a leading authority. This book is an important reference and invaluable source of inspiration for students and researchers in discrete mathematics, computer science, operations research, industrial engineering, and management science. In addition to the editors, the contributors are Mihalis Yannakakis, Craig A. Tovey, Jan H. M. Korst, Peter J. M. van Laarhoven, Alain Hertz, Eric Taillard, Dominique de Werra, Heinz Mühlenbein, Carsten Peterson, Bo Söderberg, David S. Johnson, Lyle A. McGeoch, Michel Gendreau, Gilbert Laporte, Jean-Yves Potvin, Gerard A. P. Kindervater, Martin W. P. Savelsbergh, Edward J. Anderson, Celia A. Glass, Chris N. Potts, C. L. Liu, Peichen Pan, Iiro Honkala, and Patric R. J. Östergård.
Author: Jonathan L. Gross
Publisher: CRC Press
Published: 2016-04-19
Total Pages: 664
ISBN-13: 1584887443
DOWNLOAD EBOOKCombinatorial Methods with Computer Applications provides in-depth coverage of recurrences, generating functions, partitions, and permutations, along with some of the most interesting graph and network topics, design constructions, and finite geometries. Requiring only a foundation in discrete mathematics, it can serve as the textbook in a combinat
Author: Lawrence Hubert
Publisher: SIAM
Published: 2001-01-01
Total Pages: 172
ISBN-13: 0898714788
DOWNLOAD EBOOKCombinatorial data analysis refers to methods for the study of data sets where the arrangement of objects is central.
Author: George L. Nemhauser
Publisher: Wiley-Interscience
Published: 1988-06-30
Total Pages: 792
ISBN-13:
DOWNLOAD EBOOK"A unifying approach to optimization problems is to formulate them like linear programming problems, while restricting some or all of the variables to the integers. This book is an encyclopedic resource for such formulations, as well as for understanding the structure of and solving the resulting integer programming problems." --Computing Reviews.
Author: Dingzhu Du
Publisher: Springer Science & Business Media
Published: 1998
Total Pages: 808
ISBN-13: 9780792350187
DOWNLOAD EBOOKThe first of a multi-volume set, which deals with several algorithmic approaches for discrete problems as well as many combinatorial problems. It is addressed to researchers in discrete optimization, and to all scientists who use combinatorial optimization methods to model and solve problems.
Author: Vladimir N. Sachkov
Publisher: Cambridge University Press
Published: 1996-01-11
Total Pages: 324
ISBN-13: 0521455138
DOWNLOAD EBOOKThis is an attempt to present some complex problems of discrete mathematics in a simple and unified form using a unique, general combinatorial scheme. The author's aim is not always to present the most general results, but rather to focus attention on ones that illustrate the methods described. A distinctive aspect of the book is the large number of asymptotic formulae derived.This is an important book, describing many ideas not previously available in English; the author has taken the chance to update the text and references where appropriate.
Author: Ding-Zhu Du
Publisher: Springer Science & Business Media
Published: 2013-03-14
Total Pages: 650
ISBN-13: 1475730233
DOWNLOAD EBOOKCombinatorial (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).
Author: Hanif D. Sherali
Publisher: Springer Science & Business Media
Published: 1998-12-31
Total Pages: 544
ISBN-13: 9780792354871
DOWNLOAD EBOOKSets out a new method for generating tight linear or convex programming relaxations for discrete and continuous nonconvex programming problems, featuring a model that affords a useful representation and structure, further strengthened with an automatic reformulation and constraint generation technique. Offers a unified treatment of discrete and continuous nonconvex programming problems, bridging these two types of nonconvexities with a polynomial representation of discrete constraints, and discusses special applications to discrete and continuous nonconvex programs. Material comprises original work of the authors compiled from several journal publications. No index. Annotation copyrighted by Book News, Inc., Portland, OR
Author: E. Boros
Publisher: Elsevier
Published: 2003-03-19
Total Pages: 587
ISBN-13: 008093028X
DOWNLOAD EBOOKOne of the most frequently occurring types of optimization problems involves decision variables which have to take integer values. From a practical point of view, such problems occur in countless areas of management, engineering, administration, etc., and include such problems as location of plants or warehouses, scheduling of aircraft, cutting raw materials to prescribed dimensions, design of computer chips, increasing reliability or capacity of networks, etc. This is the class of problems known in the professional literature as "discrete optimization" problems. While these problems are of enormous applicability, they present many challenges from a computational point of view. This volume is an update on the impressive progress achieved by mathematicians, operations researchers, and computer scientists in solving discrete optimization problems of very large sizes. The surveys in this volume present a comprehensive overview of the state of the art in discrete optimization and are written by the most prominent researchers from all over the world. This volume describes the tremendous progress in discrete optimization achieved in the last 20 years since the publication of Discrete Optimization '77, Annals of Discrete Mathematics, volumes 4 and 5, 1979 (Elsevier). It contains surveys of the state of the art written by the most prominent researchers in the field from all over the world, and covers topics like neighborhood search techniques, lift and project for mixed 0-1 programming, pseudo-Boolean optimization, scheduling and assignment problems, production planning, location, bin packing, cutting planes, vehicle routing, and applications to graph theory, mechanics, chip design, etc. Key features: • state of the art surveys • comprehensiveness • prominent authors • theoretical, computational and applied aspects. This book is a reprint of Discrete Applied Mathematics Volume 23, Numbers 1-3