Shopping Cart  My Account  Help  Contact Us
			By KeywordBy TitleBy AuthorBy ISBNBy ISSN

	Wiley > Mathematics & Statistics > Discrete Mathematics > Theory of Linear and Integer Programming

Related Subjects General Interest Computer Science General Computer Engineering Finite Mathematics General Statistics Geometry & Topology Logic & Foundations Special Topics in Mathematics Related Titles More From This Series Simulated Annealing and Boltzmann Machines: A Stochastic Approach to Combinatorial Optimization and Neural Computing (Hardcover) by Emile Aarts, Jan Korst The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization (Hardcover) by E. L. Lawler, Jan Karel Lenstra, A. H. G. Rinnooy Kan, D. B. Shmoys Perfect Graphs (Hardcover) by Jorge L. Ramirez-Alfonsin (Editor), Bruce A. Reed (Editor) More By This Author Combinatorial Optimization (Hardcover) Join a Mathematics & Statistics Mailing List

Discrete Mathematics Theory of Linear and Integer Programming Alexander Schrijver ISBN: 0-471-98232-6 Paperback 484 pages October 1999 US $73.95 Add to Cart Description Table of Contents Author Information Reviews This book describes the theory of linear and integer programming and surveys the algorithms for linear and integer programming problems, focusing on complexity analysis. It aims at complementing the more practically oriented books in this field. A special feature is the author s coverage of important recent developments in linear and integer programming. Applications to combinatorial optimization are given, and the author also includes extensive historical surveys and bibliographies. The book is intended for graduate students and researchers in operations research, mathematics and computer science. It will also be of interest to mathematical historians. Printer-ready version E-mail a friend

Copyright © 2000-2003 by John Wiley & Sons, Inc. or related companies. All rights reserved. Please read our Privacy Policy