New and elegant proofs of classical results and makes difficult results accessible.
"Sinopsis" puede pertenecer a otra edición de este libro.
Librería: Row By Row Bookshop, Sugar Grove, NC, Estados Unidos de America
Trade Paperback. Condición: Good. Estado de la sobrecubierta: 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. Nº de ref. del artículo: 062930
Cantidad disponible: 1 disponibles
Librería: Rarewaves.com USA, London, LONDO, Reino Unido
Paperback. Condición: 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. Nº de ref. del artículo: LU-9780898714814
Cantidad disponible: 2 disponibles
Librería: Brook Bookstore On Demand, Napoli, NA, Italia
Condición: new. Nº de ref. del artículo: 756aa728861384d526f46ee5306840d1
Cantidad disponible: 3 disponibles
Librería: Revaluation Books, Exeter, Reino Unido
Paperback. Condición: Brand New. 132 pages. 10.00x6.75x0.50 inches. In Stock. Nº de ref. del artículo: __0898714818
Cantidad disponible: 2 disponibles
Librería: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
Condición: New. 1987. paperback. . . . . . Nº de ref. del artículo: V9780898714814
Cantidad disponible: 1 disponibles
Librería: PBShop.store UK, Fairford, GLOS, Reino Unido
PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000. Nº de ref. del artículo: FW-9780898714814
Cantidad disponible: 3 disponibles
Librería: Majestic Books, Hounslow, Reino Unido
Condición: New. pp. 144. Nº de ref. del artículo: 46396352
Cantidad disponible: 3 disponibles
Librería: THE SAINT BOOKSTORE, Southport, Reino Unido
Paperback. Condición: New. New copy - Usually dispatched within 4 working days. Nº de ref. del artículo: B9780898714814
Cantidad disponible: 1 disponibles
Librería: Kennys Bookstore, Olney, MD, Estados Unidos de America
Condición: New. 1987. paperback. . . . . . Books ship from the US and Ireland. Nº de ref. del artículo: V9780898714814
Cantidad disponible: 1 disponibles
Librería: Rarewaves.com UK, London, Reino Unido
Paperback. Condición: 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. Nº de ref. del artículo: LU-9780898714814
Cantidad disponible: 2 disponibles