nonlinear integer programming di sun xiaoling (35 risultati)

2006th ed. 16 x 23 cm. 460 pages. Hardcover. Versand aus Deutschland / We dispatch from Germany via Air Mail. Einband bestoßen, daher Mängelexemplar gestempelt, sonst sehr guter Zustand. Imperfect copy due to slightly bumped cover, apart from this in very good condition. Stamped. Sprache: Englisch.

Condizione: New. pp. 464.

Condizione: New. pp. 464 52:B&W 6.14 x 9.21in or 234 x 156mm (Royal 8vo) Case Laminate on White w/Gloss Lam.

Hardcover. Condizione: Wie neu. 1st ed. XXX, 436 S.; Ill. Like new. Shrink wrapped. Sprache: Englisch Gewicht in Gramm: 995.

Condizione: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.

Condizione: New. pp. 464.

Brand new book. Fast ship. Please provide full street address as we are not able to ship to P O box address.

Condizione: New.

Condizione: New.

Condizione: New. SUPER FAST SHIPPING.

Condizione: New. SUPER FAST SHIPPING.

Condizione: New.

Condizione: New.

Condizione: New. In.

Condizione: New. In.

Condizione: New.

Condizione: As New. Unread book in perfect condition.

Condizione: New.

Hardcover. Condizione: new. Hardcover. It is not an exaggeration that much of what people devote in their hfe re solves around optimization in one way or another. On one hand, many decision making problems in real applications naturally result in optimization problems in a form of integer programming. On the other hand, integer programming has been one of the great challenges for the optimization research community for many years, due to its computational difficulties: Exponential growth in its computational complexity with respect to the problem dimension. Since the pioneering work of R. Gomory [80] in the late 1950s, the theoretical and methodological development of integer programming has grown by leaps and bounds, mainly focusing on linear integer programming. The past few years have also witnessed certain promising theoretical and methodological achieve ments in nonlinear integer programming. When the first author of this book was working on duality theory for n- convex continuous optimization in the middle of 1990s, Prof. Douglas J. White suggested that he explore an extension of his research results to integer pro gramming. The two authors of the book started their collaborative work on integer programming and global optimization in 1997. The more they have investigated in nonlinear integer programming, the more they need to further delve into the subject. Both authors have been greatly enjoying working in this exciting and challenging field. Gomory [80] in the late 1950s, the theoretical and methodological development of integer programming has grown by leaps and bounds, mainly focusing on linear integer programming. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.

Condizione: As New. Unread book in perfect condition.

Condizione: As New. Unread book in perfect condition.

Condizione: New. pp. 464.

Buch. Condizione: Neu. Neuware -It is not an exaggeration that much of what people devote in their hfe re solves around optimization in one way or another. On one hand, many decision making problems in real applications naturally result in optimization problems in a form of integer programming. On the other hand, integer programming has been one of the great challenges for the optimization research community for many years, due to its computational difficulties: Exponential growth in its computational complexity with respect to the problem dimension. Since the pioneering work of R. Gomory [80] in the late 1950s, the theoretical and methodological development of integer programming has grown by leaps and bounds, mainly focusing on linear integer programming. The past few years have also witnessed certain promising theoretical and methodological achieve ments in nonlinear integer programming. When the first author of this book was working on duality theory for n- convex continuous optimization in the middle of 1990s, Prof. Douglas J. White suggested that he explore an extension of his research results to integer pro gramming. The two authors of the book started their collaborative work on integer programming and global optimization in 1997. The more they have investigated in nonlinear integer programming, the more they need to further delve into the subject. Both authors have been greatly enjoying working in this exciting and challenging field.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 464 pp. Englisch.

Taschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - It is not an exaggeration that much of what people devote in their hfe re solves around optimization in one way or another. On one hand, many decision making problems in real applications naturally result in optimization problems in a form of integer programming. On the other hand, integer programming has been one of the great challenges for the optimization research community for many years, due to its computational difficulties: Exponential growth in its computational complexity with respect to the problem dimension. Since the pioneering work of R. Gomory [80] in the late 1950s, the theoretical and methodological development of integer programming has grown by leaps and bounds, mainly focusing on linear integer programming. The past few years have also witnessed certain promising theoretical and methodological achieve ments in nonlinear integer programming. When the first author of this book was working on duality theory for n- convex continuous optimization in the middle of 1990s, Prof. Douglas J. White suggested that he explore an extension of his research results to integer pro gramming. The two authors of the book started their collaborative work on integer programming and global optimization in 1997. The more they have investigated in nonlinear integer programming, the more they need to further delve into the subject. Both authors have been greatly enjoying working in this exciting and challenging field.

Buch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - It is not an exaggeration that much of what people devote in their hfe re solves around optimization in one way or another. On one hand, many decision making problems in real applications naturally result in optimization problems in a form of integer programming. On the other hand, integer programming has been one of the great challenges for the optimization research community for many years, due to its computational difficulties: Exponential growth in its computational complexity with respect to the problem dimension. Since the pioneering work of R. Gomory [80] in the late 1950s, the theoretical and methodological development of integer programming has grown by leaps and bounds, mainly focusing on linear integer programming. The past few years have also witnessed certain promising theoretical and methodological achieve ments in nonlinear integer programming. When the first author of this book was working on duality theory for n- convex continuous optimization in the middle of 1990s, Prof. Douglas J. White suggested that he explore an extension of his research results to integer pro gramming. The two authors of the book started their collaborative work on integer programming and global optimization in 1997. The more they have investigated in nonlinear integer programming, the more they need to further delve into the subject. Both authors have been greatly enjoying working in this exciting and challenging field.

Condizione: New. Investigates theory and solution methodologies for general nonlinear integer programming. This book discusses duality theory for nonlinear integer programming. It explains and demonstrates Convergent Lagrangian and cutting methods for separable nonlinear integer programming. Series: International Series in Operations Research & Management Science. Num Pages: 438 pages, 52 black & white tables, biography. BIC Classification: PBT. Category: (P) Professional & Vocational. Dimension: 234 x 156 x 25. Weight in Grams: 824. . 2006. Hardback. . . . .

Condizione: New. Investigates theory and solution methodologies for general nonlinear integer programming. This book discusses duality theory for nonlinear integer programming. It explains and demonstrates Convergent Lagrangian and cutting methods for separable nonlinear integer programming. Series: International Series in Operations Research & Management Science. Num Pages: 438 pages, 52 black & white tables, biography. BIC Classification: PBT. Category: (P) Professional & Vocational. Dimension: 234 x 156 x 25. Weight in Grams: 824. . 2006. Hardback. . . . . Books ship from the US and Ireland.

Hardcover. Condizione: new. Hardcover. It is not an exaggeration that much of what people devote in their hfe re solves around optimization in one way or another. On one hand, many decision making problems in real applications naturally result in optimization problems in a form of integer programming. On the other hand, integer programming has been one of the great challenges for the optimization research community for many years, due to its computational difficulties: Exponential growth in its computational complexity with respect to the problem dimension. Since the pioneering work of R. Gomory [80] in the late 1950s, the theoretical and methodological development of integer programming has grown by leaps and bounds, mainly focusing on linear integer programming. The past few years have also witnessed certain promising theoretical and methodological achieve ments in nonlinear integer programming. When the first author of this book was working on duality theory for n- convex continuous optimization in the middle of 1990s, Prof. Douglas J. White suggested that he explore an extension of his research results to integer pro gramming. The two authors of the book started their collaborative work on integer programming and global optimization in 1997. The more they have investigated in nonlinear integer programming, the more they need to further delve into the subject. Both authors have been greatly enjoying working in this exciting and challenging field. Gomory [80] in the late 1950s, the theoretical and methodological development of integer programming has grown by leaps and bounds, mainly focusing on linear integer programming. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.

Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -A combination of both Integer Programming and Nonlinear Optimization, this is a powerful book that surveys the field and provides a state-of-the-art treatment of Nonlinear Integer Programming. It is the first book available on the subject. The book aims to bring the theoretical foundation and solution methods for nonlinear integer programming to students and researchers in optimization, operations research, and computer science. 464 pp. Englisch.

Buch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -A combination of both Integer Programming and Nonlinear Optimization, this is a powerful book that surveys the field and provides a state-of-the-art treatment of Nonlinear Integer Programming. It is the first book available on the subject. The book aims to bring the theoretical foundation and solution methods for nonlinear integer programming to students and researchers in optimization, operations research, and computer science. 464 pp. Englisch.