Integer Programming and Combinatorial Optimization
Subtitle: 10th International IPCO Conference, New York, NY, USA, June 7-11, 2004, Proceedings (Lecture Notes in Computer Science)
Contributors: George Nemhauser (Editor); Daniel Bienstock (Editor)
Edition: 1 edition
Publisher: Springer
Published: August 5, 2004
Language: eng
Format: Paperback
Number of pages: 445
ISBN-13: 9783540221135
Subjects: Computer Programming; Mathematical theory of computation; Probability & statistics; Linear Programming; Computers; Mathematics; Computer Books: General; Computer Science; Discrete Mathematics; Computers / Computer Science; algorithms; approximation; combinatorial optimization; combinatorics; computational complexity; computational geometry; game theory; graph algorithms; integer programming; General
First sentence: Let G = (V, E) be an undirected graph with vertices V  {0,1,..., n}.