integer combinatorial optimization de wolsey laurence (32 résultats)

Etat : acceptable. Book shows noticeable wear from use. May include writing, highlighting, or other markings, but not excessive. Cover or edges may have visible wear. The book remains complete and fully readable.

Hardcover. Etat : Acceptable. Connecting readers with great books since 1972. Used textbooks may not include companion materials such as access codes, etc. May have condition issues including wear and notes/highlighting. We ship orders daily and Customer Service is our top priority!

Etat : acceptable. Used - Acceptable: All pages and the cover are intact, but shrink wrap, dust covers, or boxed set case may be missing. Pages may include limited notes, highlighting, or minor water damage but the text is readable. Pages may include limited notes and highlighting, but the text cannot be obscured or unreadable. Any access codes or passwords originally included with the book may be expired, used or no longer valid. Image is stock photo and cover art edition may be different than pictured.

Hardcover. Etat : Fair. 1. The item might be beaten up but readable. May contain markings or highlighting, as well as stains, bent corners, or any other major defect, but the text is not obscured in any way.

Etat : good. The item has minimal writing and or highlighting inside. The spine has minor damage.

Etat : Poor. This is an ex-library book and may have the usual library/used-book markings inside.This book has hardback covers. In poor condition, suitable as a reading copy. Dust jacket in fair condition. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,1550grams, ISBN:047182819X.

Etat : Very Good. Wraps are firm, text block clean, without highlights/underlining or markings. Some rubbing/curling to wraps. Very clean, nearly like new. Without any discs, access codes or extra items. Supporting Bay Area Friends of the Library since 2010. Well packaged and promptly shipped.

Paperback. Etat : new. Paperback. Rave reviews for INTEGER AND COMBINATORIAL OPTIMIZATION "This book provides an excellent introduction and survey of traditional fields of combinatorial optimization . . . It is indeed one of the best and most complete texts on combinatorial optimization . . . available. [And] with more than 700 entries, [it] has quite an exhaustive reference list."-Optima "A unifying approach to optimization problems is to formulate them like linear programming problems, while restricting some or all of the variables to the integers. This book is an encyclopedic resource for such formulations, as well as for understanding the structure of and solving the resulting integer programming problems."-Computing Reviews "[This book] can serve as a basis for various graduate courses on discrete optimization as well as a reference book for researchers and practitioners."-Mathematical Reviews "This comprehensive and wide-ranging book will undoubtedly become a standard reference book for all those in the field of combinatorial optimization."-Bulletin of the London Mathematical Society "This text should be required reading for anybody who intends to do research in this area or even just to keep abreast of developments."-Times Higher Education Supplement, London Also of interest . . . INTEGER PROGRAMMING Laurence A. Wolsey Comprehensive and self-contained, this intermediate-level guide to integer programming provides readers with clear, up-to-date explanations on why some problems are difficult to solve, how techniques can be reformulated to give better results, and how mixed integer programming systems can be used more effectively. 1998 (0-471-28366-5) 260 pp. Discrete optimization models are used to tackle a wide variety of problems in many fields, including operations research, management science, engineering, and mathematics. Written by two internationally recognized integer programming experts, this book presents the mathematical foundations, theory, and algorithms of discrete optimization methods. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.

Etat : New.

Etat : Gut. Zustand: Gut | Seiten: 782 | Sprache: Englisch | Produktart: Bücher | Keine Beschreibung verfügbar.

PAP. Etat : New. New Book. Shipped from UK. Established seller since 2000.

Etat : New.

Etat : As New. Unread book in perfect condition.

Etat : new.

paperback. Etat : Gut. dieselbe ISBN-anderes Cover, Buch ist durch Druckstellen etwas verlagert (durchgebogen), kleine Lagerspuren am Buch, Inhalt einwandfrei und ungelesen Sprache: Englisch Gewicht in Gramm: 1380.

Etat : As New. Unread book in perfect condition.

Paperback. Etat : new. Paperback. Rave reviews for INTEGER AND COMBINATORIAL OPTIMIZATION "This book provides an excellent introduction and survey of traditional fields of combinatorial optimization . . . It is indeed one of the best and most complete texts on combinatorial optimization . . . available. [And] with more than 700 entries, [it] has quite an exhaustive reference list."-Optima "A unifying approach to optimization problems is to formulate them like linear programming problems, while restricting some or all of the variables to the integers. This book is an encyclopedic resource for such formulations, as well as for understanding the structure of and solving the resulting integer programming problems."-Computing Reviews "[This book] can serve as a basis for various graduate courses on discrete optimization as well as a reference book for researchers and practitioners."-Mathematical Reviews "This comprehensive and wide-ranging book will undoubtedly become a standard reference book for all those in the field of combinatorial optimization."-Bulletin of the London Mathematical Society "This text should be required reading for anybody who intends to do research in this area or even just to keep abreast of developments."-Times Higher Education Supplement, London Also of interest . . . INTEGER PROGRAMMING Laurence A. Wolsey Comprehensive and self-contained, this intermediate-level guide to integer programming provides readers with clear, up-to-date explanations on why some problems are difficult to solve, how techniques can be reformulated to give better results, and how mixed integer programming systems can be used more effectively. 1998 (0-471-28366-5) 260 pp. Discrete optimization models are used to tackle a wide variety of problems in many fields, including operations research, management science, engineering, and mathematics. Written by two internationally recognized integer programming experts, this book presents the mathematical foundations, theory, and algorithms of discrete optimization methods. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.

Paperback. Etat : New. 1st. Das vielfach bewahrte Standard-Nachschlagewerk zur kombinatorischen Optimierung - jetzt als handliche und preisgunstige Paperback-Ausgabe! Mathematische Grundlagen, Theorie und Algorithmen der diskreten Optimierung werden diskutiert und an zahlreichen Beispielen und Modellformulierungen demonstriert. Die Notation ist konsistent und eindeutig; alle Rechenwege und Beweise werden leicht nachvollziehbar erklart. (11/99).

Etat : New. pp. 784.

Etat : New. Discrete optimization models are used to tackle a wide variety of problems in many fields, including operations research, management science, engineering, and mathematics. Written by two internationally recognized integer programming experts, this book presents the mathematical foundations, theory, and algorithms of discrete optimization methods. Series: Wiley Series in Discrete Mathematics and Optimization. Num Pages: 784 pages. BIC Classification: PBC; PBU; PBV; PDE; TBJ. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 253 x 178 x 41. Weight in Grams: 1302. . 1999. 1st Edition. Paperback. . . . .

Paperback. Etat : new. Paperback. Rave reviews for INTEGER AND COMBINATORIAL OPTIMIZATION "This book provides an excellent introduction and survey of traditional fields of combinatorial optimization . . . It is indeed one of the best and most complete texts on combinatorial optimization . . . available. [And] with more than 700 entries, [it] has quite an exhaustive reference list."-Optima "A unifying approach to optimization problems is to formulate them like linear programming problems, while restricting some or all of the variables to the integers. This book is an encyclopedic resource for such formulations, as well as for understanding the structure of and solving the resulting integer programming problems."-Computing Reviews "[This book] can serve as a basis for various graduate courses on discrete optimization as well as a reference book for researchers and practitioners."-Mathematical Reviews "This comprehensive and wide-ranging book will undoubtedly become a standard reference book for all those in the field of combinatorial optimization."-Bulletin of the London Mathematical Society "This text should be required reading for anybody who intends to do research in this area or even just to keep abreast of developments."-Times Higher Education Supplement, London Also of interest . . . INTEGER PROGRAMMING Laurence A. Wolsey Comprehensive and self-contained, this intermediate-level guide to integer programming provides readers with clear, up-to-date explanations on why some problems are difficult to solve, how techniques can be reformulated to give better results, and how mixed integer programming systems can be used more effectively. 1998 (0-471-28366-5) 260 pp. Discrete optimization models are used to tackle a wide variety of problems in many fields, including operations research, management science, engineering, and mathematics. Written by two internationally recognized integer programming experts, this book presents the mathematical foundations, theory, and algorithms of discrete optimization methods. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.

Etat : New. pp. 784 Indices.

Paperback. Etat : New. 1st. Das vielfach bewahrte Standard-Nachschlagewerk zur kombinatorischen Optimierung - jetzt als handliche und preisgunstige Paperback-Ausgabe! Mathematische Grundlagen, Theorie und Algorithmen der diskreten Optimierung werden diskutiert und an zahlreichen Beispielen und Modellformulierungen demonstriert. Die Notation ist konsistent und eindeutig; alle Rechenwege und Beweise werden leicht nachvollziehbar erklart. (11/99).

Paperback. Etat : New. 1st. Das vielfach bewahrte Standard-Nachschlagewerk zur kombinatorischen Optimierung - jetzt als handliche und preisgunstige Paperback-Ausgabe! Mathematische Grundlagen, Theorie und Algorithmen der diskreten Optimierung werden diskutiert und an zahlreichen Beispielen und Modellformulierungen demonstriert. Die Notation ist konsistent und eindeutig; alle Rechenwege und Beweise werden leicht nachvollziehbar erklart. (11/99).

Etat : Gut. Zustand: Gut | Seiten: 784 | Sprache: Englisch | Produktart: Bücher | Keine Beschreibung verfügbar.

Etat : Gut. Zustand: Gut | Seiten: 784 | Sprache: Englisch | Produktart: Bücher | Keine Beschreibung verfügbar.

Paperback. Etat : Brand New. 1st edition. 784 pages. 10.00x7.00x1.50 inches. In Stock.

Etat : New. Discrete optimization models are used to tackle a wide variety of problems in many fields, including operations research, management science, engineering, and mathematics. Written by two internationally recognized integer programming experts, this book presents the mathematical foundations, theory, and algorithms of discrete optimization methods. Series: Wiley Series in Discrete Mathematics and Optimization. Num Pages: 784 pages. BIC Classification: PBC; PBU; PBV; PDE; TBJ. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 253 x 178 x 41. Weight in Grams: 1302. . 1999. 1st Edition. Paperback. . . . . Books ship from the US and Ireland.

Paperback. Etat : New. 1st. Das vielfach bewahrte Standard-Nachschlagewerk zur kombinatorischen Optimierung - jetzt als handliche und preisgunstige Paperback-Ausgabe! Mathematische Grundlagen, Theorie und Algorithmen der diskreten Optimierung werden diskutiert und an zahlreichen Beispielen und Modellformulierungen demonstriert. Die Notation ist konsistent und eindeutig; alle Rechenwege und Beweise werden leicht nachvollziehbar erklart. (11/99).

Taschenbuch. Etat : Neu. Neuware - Rave reviews for INTEGER AND COMBINATORIAL OPTIMIZATION'This book provides an excellent introduction and survey of traditional fields of combinatorial optimization . . . It is indeed one of the best and most complete texts on combinatorial optimization . . . available. [And] with more than 700 entries, [it] has quite an exhaustive reference list.'-Optima'A unifying approach to optimization problems is to formulate them like linear programming problems, while restricting some or all of the variables to the integers. This book is an encyclopedic resource for such formulations, as well as for understanding the structure of and solving the resulting integer programming problems.'-Computing Reviews'[This book] can serve as a basis for various graduate courses on discrete optimization as well as a reference book for researchers and practitioners.'-Mathematical Reviews'This comprehensive and wide-ranging book will undoubtedly become a standard reference book for all those in the field of combinatorial optimization.'-Bulletin of the London Mathematical Society'This text should be required reading for anybody who intends to do research in this area or even just to keep abreast of developments.'-Times Higher Education Supplement, LondonAlso of interest . . .INTEGER PROGRAMMING Laurence A. Wolsey Comprehensive and self-contained, this intermediate-level guide to integer programming provides readers with clear, up-to-date explanations on why some problems are difficult to solve, how techniques can be reformulated to give better results, and how mixed integer programming systems can be used more effectively. 1998 (0-471-28366-5) 260 pp.; Das vielfach bewährte Standard-Nachschlagewerk zur kombinatorischen Optimierung - jetzt als handliche und preisgünstige Paperback-Ausgabe! Mathematische Grundlagen, Theorie und Algorithmen der diskreten Optimierung werden diskutiert und an zahlreichen Beispielen und Modellformulierungen demonstriert. Die Notation ist konsistent und eindeutig; alle Rechenwege und Beweise werden leicht nachvollziehbar erklärt. (11/99).