This volume can be considered as a supplementary volume to the three-volume "Handbook of Combinatorial Optimization" published by Kluwer. It can also be regarded as a stand-alone volume which presents chapters dealing with various aspects of the subject including optimization problems and algorithmic approaches for discrete problems. This handbook deals with several algorithmic approaches for discrete problems as well as with many combinatorial optimization problems. Each chapter in the handbook is expository in nature, but scholarly in treatment. The book is addressed not only to researchers in discrete optimization, but to all scientists in various disciplines who use combinatorial optimization methods to model and solve problems.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Preface. The Maximum Clique Problem; I.M. Bomze, et al. Linear Assignment Problems and Extensions; R.E. Burkard, E. Çela. Bin Packing Approximation Algorithms: Combinatorial Analysis; E.G. Coffman, et al. Feedback Set Problems; P. Festa, et al. Neural Networks Approaches for Combinatorial Optimization Problems; T.B. Trafalis, S. Kasap. Frequency Assignment Problems; R.A. Murphey, et al. Algorithms for the Satisfiability (SAT) Problem; J. Gu, et al. The Steiner Ratio of Lp-planes; J. Albrecht, D. Cieslik. A Cogitative Algorithm for Solving the Equal Circles Packing Problem; W. Huang, et al. Author Index. Subject Index.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: New. Codice articolo 3487585-n
Quantità: Più di 20 disponibili
Da: California Books, Miami, FL, U.S.A.
Condizione: New. Codice articolo I-9780792359241
Quantità: Più di 20 disponibili
Da: Ria Christie Collections, Uxbridge, Regno Unito
Condizione: New. In English. Codice articolo ria9780792359241_new
Quantità: Più di 20 disponibili
Da: GreatBookPricesUK, Woodford Green, Regno Unito
Condizione: New. Codice articolo 3487585-n
Quantità: Più di 20 disponibili
Da: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
Condizione: New. Presents chapters dealing with various aspects of combinatorial optimization, including optimization problems and algorithmic approaches for discrete problems. This book is suitable for those who use combinatorial optimization methods to model and solve problems. Editor(s): Du, Ding-Zhu; Pardalos, Panos M. Num Pages: 656 pages, biography. BIC Classification: PBT; PBV. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 234 x 156 x 34. Weight in Grams: 1094. . 1999. Hardback. . . . . Codice articolo V9780792359241
Quantità: 15 disponibili
Da: moluna, Greven, Germania
Gebunden. Condizione: New. Codice articolo 5969024
Quantità: Più di 20 disponibili
Da: Books Puddle, Woodside, NY, U.S.A.
Condizione: New. pp. 660. Codice articolo 26556596
Quantità: 4 disponibili
Da: Kennys Bookstore, Olney, MD, U.S.A.
Condizione: New. Presents chapters dealing with various aspects of combinatorial optimization, including optimization problems and algorithmic approaches for discrete problems. This book is suitable for those who use combinatorial optimization methods to model and solve problems. Editor(s): Du, Ding-Zhu; Pardalos, Panos M. Num Pages: 656 pages, biography. BIC Classification: PBT; PBV. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 234 x 156 x 34. Weight in Grams: 1094. . 1999. Hardback. . . . . Books ship from the US and Ireland. Codice articolo V9780792359241
Quantità: 15 disponibili
Da: AHA-BUCH GmbH, Einbeck, Germania
Buch. Condizione: Neu. Neuware - 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). Codice articolo 9780792359241
Quantità: 1 disponibili
Da: Majestic Books, Hounslow, Regno Unito
Condizione: New. Print on Demand pp. 660 52:B&W 6.14 x 9.21in or 234 x 156mm (Royal 8vo) Case Laminate on White w/Gloss Lam. Codice articolo 8372715
Quantità: 4 disponibili