Handbook of Combinatorial Optimization
This is the first of a multi-volume set. The various volumes deal with several algorithmic approaches for discrete problems as well as with many combinatorial problems. Almost every aspect of the enormous field with emphasis on recent developments is covered. Each chapter is essentially expository in nature, but of scholarly treatment. This volume is addressed not only to researchers in discrete optimization, but to all scientists who use combinatorial optimization methods to model and solve problems.
- Paperback | 2410 pages
- 31 Dec 1998
- Kluwer Academic Publishers
- United States
Table of contents
Mixed-integer nonlinear optimization in process synthesis, C.S. Adjiman, et al; approximate algorithms and heuristics for MAX-SAT, R. Battiti, M. Protasi; connections between nonlinear programming and discrete optimization, F. Giannessi, F. Tardella; interior point methods for combinatorial optimization, J.E. Mitchell et al; knapsack problems, D. Pisinger, P. Toth; fractional combinatorial optimization, T. Radzik; reformulation-linearization techniques for discrete optimization problems, H.D. Sherali, W.P. Adams; Grobner bases in integer programming, R.R. Thomas; applications of set covering, set packing and set partitioning models - a survey, R.R. Vemuganti.