Combinatorial Optimization: Packing and Covering (CBMS-NSF Regional Conference Series in Applied Mathematics, Series Number 74) - Softcover
Synopsis
This monograph presents new and elegant proofs of classical results and makes difficult results accessible. The integer programming models known as set packing and set covering have a wide range of applications. Sometimes, owing to the special structure of the constraint matrix, the natural linear programming relaxation yields an optimal solution that is integral, thus solving the problem. Sometimes, both the linear programming relaxation and its dual have integral optimal solutions. Under which conditions do such integrality conditions hold? This question is of both theoretical and practical interest. Min-max theorems, polyhedral combinatorics, and graph theory all come together in this rich area of discrete mathematics. This monograph presents several of these beautiful results as it introduces mathematicians to this active area of research.
"synopsis" may belong to another edition of this title.
About the Author
Dr. Gérard Cornuéjols, a professor at Carnegie Mellon University in Pittsburgh, Pennsylvania, is a past co-winner of the Lanchester Prize (1977) and the Fulkerson Prize (2000) and is a co-developer of MIPO, a mixed integer optimizer. He is editor-in-chief of Mathematics of Operations Research and is currently involved in research in combinatorial optimization, graph theory, and integer programming.
"About this title" may belong to another edition of this title.
Search results for Combinatorial Optimization: Packing and Covering (CBMS-NSF...
Stock Image
Combinatorial Optimization: Packing and Covering (CBMS-NSF Regional Conference Series in Applied Mathematics, Series Number 74)
Published by
Society for Industrial and Appli, 1987
ISBN 10: 0898714818
ISBN 13: 9780898714814
Used
paperback
Seller: HPB-Red, Dallas, TX, U.S.A.
Seller rating 5 out of 5 stars
paperback. Condition: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority! Seller Inventory # S_419803882
Stock Image
Combinatorial Optimization: Packing and Covering
Published by
Society for Industrial and Applied Mathematics, Philadelphia, 2001
ISBN 10: 0898714818
ISBN 13: 9780898714814
Used
Trade Paperback
First Edition
Seller: Row By Row Bookshop, Sugar Grove, NC, U.S.A.
Seller rating 5 out of 5 stars
Trade Paperback. Condition: Good. Dust Jacket Condition: No Dust Jacket. First Edition. An ex-library copy in original paper covers, with the usual ex-libris markings. The binding is sound, the text is clean/unmarked, and there is little cover wear. Book. Seller Inventory # 062930
Stock Image
Combinatorial Optimization : Packing and Covering
Published by
Society for Industrial and Applied Mathematics, 1987
ISBN 10: 0898714818
ISBN 13: 9780898714814
New
Softcover
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # 773704-n
Seller Image
Combinatorial Optimization
Published by
Society for Industrial and Applied Mathematics,U.S., US, 2001
ISBN 10: 0898714818
ISBN 13: 9780898714814
New
Paperback
Seller: Rarewaves.com USA, London, LONDO, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: New. This monograph presents new and elegant proofs of classical results and makes difficult results accessible.The integer programming models known as set packing and set covering have a wide range of applications. Sometimes, owing to the special structure of the constraint matrix, the natural linear programming relaxation yields an optimal solution that is integral, thus solving the problem. Sometimes, both the linear programming relaxation and its dual have integral optimal solutions. Under which conditions do such integrality conditions hold? This question is of both theoretical and practical interest. Min-max theorems, polyhedral combinatorics, and graph theory all come together in this rich area of discrete mathematics. This monograph presents several of these beautiful results as it introduces mathematicians to this active area of research.To encourage research on the many intriguing open problems that remain, Dr. Cornuéjols is offering a $5000 prize to the first paper solving or refuting each of the 18 conjectures described in the book. To claim one of the prizes mentioned in the preface, papers must be accepted by a quality refereed journal (such as Journal of Combinatorial Theory B, Combinatorica, SIAM Journal on Discrete Mathematics, or others to be determined by Dr. Cornuéjols) before 2020. Claims must be sent to Dr. Cornuéjols at Carnegie Mellon University during his lifetime. Seller Inventory # LU-9780898714814
Buy New
US$ 80.64
Free Shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 1 available
Stock Image
Combinatorial Optimization : Packing and Covering
Published by
Society for Industrial and Applied Mathematics, 1987
ISBN 10: 0898714818
ISBN 13: 9780898714814
Used
Softcover
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Seller rating 5 out of 5 stars
Condition: As New. Unread book in perfect condition. Seller Inventory # 773704
Seller Image
Combinatorial Optimization
Published by
Society for Industrial and Applied Mathematics,U.S., US, 2001
ISBN 10: 0898714818
ISBN 13: 9780898714814
New
Paperback
Seller: Rarewaves.com UK, London, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: New. This monograph presents new and elegant proofs of classical results and makes difficult results accessible.The integer programming models known as set packing and set covering have a wide range of applications. Sometimes, owing to the special structure of the constraint matrix, the natural linear programming relaxation yields an optimal solution that is integral, thus solving the problem. Sometimes, both the linear programming relaxation and its dual have integral optimal solutions. Under which conditions do such integrality conditions hold? This question is of both theoretical and practical interest. Min-max theorems, polyhedral combinatorics, and graph theory all come together in this rich area of discrete mathematics. This monograph presents several of these beautiful results as it introduces mathematicians to this active area of research.To encourage research on the many intriguing open problems that remain, Dr. Cornuéjols is offering a $5000 prize to the first paper solving or refuting each of the 18 conjectures described in the book. To claim one of the prizes mentioned in the preface, papers must be accepted by a quality refereed journal (such as Journal of Combinatorial Theory B, Combinatorica, SIAM Journal on Discrete Mathematics, or others to be determined by Dr. Cornuéjols) before 2020. Claims must be sent to Dr. Cornuéjols at Carnegie Mellon University during his lifetime. Seller Inventory # LU-9780898714814
Buy New
US$ 103.75
US$ 87.16 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 1 available
Stock Image
Combinatorial Optimization: Packing and Covering (CBMS-NSF Regional Conference Series in Applied Mathematics)
Published by
Society for Industrial and Applied Mathematics, 1987
ISBN 10: 0898714818
ISBN 13: 9780898714814
Used
Paperback
Seller: Mispah books, Redhill, SURRE, United Kingdom
Seller rating 4 out of 5 stars
Paperback. Condition: Good. Good .Ships From Multiple Locations. book. Seller Inventory # ERICA82908987148184
Buy Used
US$ 157.45
US$ 33.52 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 1 available