Handbook of Combinatorial Optimization: Supplement Volume A - Rilegato

Rilegato

ISBN 10: 0792359240 ISBN 13: 9780792359241

Casa editrice: Kluwer Academic Publishers, 1999

Riassunto

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.

Su questo libro

Contenuti

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.

Dettagli dell'edizione

• Editore: Kluwer Academic Publishers
• Data di pubblicazione: 1999
• Lingua: Inglese
• ISBN 10: 0792359240
• ISBN 13: 9780792359241
• Rilegatura: Copertina rigida
• Numero di pagine: 656
• Redattore: Du Ding-Zhu, Pardalos Panos M.
• Contatto del produttore: non disponibile
• Persona responsabile: CMN Printpool Inh. Mathis Neumann; https://www.also.com/ec/cms5/en_6000/6000/index.jsp; ; Friedrich-Karl-Str. 9; Hamburg; Germania