Order Total (1 Item Items):
Shipping Destination:
Mixed Integer Nonlinear Programming (72 results)
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (72)
- Magazines & Periodicals (No further results match this refinement)
- Comics (No further results match this refinement)
- Sheet Music (No further results match this refinement)
- Art, Prints & Posters (No further results match this refinement)
- Photographs (No further results match this refinement)
- Maps (No further results match this refinement)
- Manuscripts & Paper Collectibles (No further results match this refinement)
Condition Learn more
- New (63)
- As New, Fine or Near Fine (5)
- Very Good or Good (4)
- Fair or Poor (No further results match this refinement)
- As Described (No further results match this refinement)
Binding
Collectible Attributes
- First Edition (No further results match this refinement)
- Signed (No further results match this refinement)
- Dust Jacket (No further results match this refinement)
- Seller-Supplied Images (33)
- Not Print on Demand (48)
Language (2)
Free Shipping
Seller Location
Seller Rating
-
Condition: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.
-
Rounded Branch and Bound Method for Mixed Integer Nonlinear Programming Problems
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 5 out of 5 stars
US$ 24.86
US$ 4.40 shipping
Ships from United Kingdom to U.S.A.Quantity: 15 available
Add to basketPAP. Condition: New. New Book. Shipped from UK. Established seller since 2000.
-
-
Rounded Branch and Bound Method for Mixed Integer Nonlinear Programming Problems January 1977 Classic Reprint
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 5 out of 5 stars
US$ 31.64
US$ 5.57 shipping
Ships from United Kingdom to U.S.A.Quantity: 15 available
Add to basketHRD. Condition: New. New Book. Shipped from UK. Established seller since 2000.
-
-
Mathematical Programming Approaches for Multi-Vehicle Motion Planning: Linear, Nonlinear, and Mixed Integer Programming (Foundations and Trends(r) in Robotics)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
US$ 63.50
US$ 16.03 shipping
Ships from United Kingdom to U.S.A.Quantity: 1 available
Add to basketCondition: New. In.
-
US$ 18.35
Free Shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketPaperback. Condition: New. Print on Demand. This book presents an innovative method for addressing mixed-integer nonlinear programming, a prevalent type of mathematical optimization problem frequently encountered in various fields, such as engineering, economics, and finance. The technique, known as the Bounded Branch and Bound method, is thoroughly described, encompassing its theoretical foundations, practical implementation, and diverse applications. The author delves into both convex and non-convex formulations, offering comprehensive guidance on solving such complex problems. At its core, this book contributes to the broader realm of applied mathematics, particularly optimization theory. By extending existing knowledge on nonlinear programming, it provides a valuable tool for researchers grappling with intricate real-world scenarios. The author's in-depth analysis of the proposed method, coupled with its wide range of applications, makes this book an indispensable reference for academics, professionals, and students seeking advanced insights into this crucial area of research. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item.
-
Mathematical Programming Approaches for Multi-Vehicle Motion Planning: Linear, Nonlinear, and Mixed Integer Programming (Foundations and Trends (R) in . 23 (Foundations and Trends in Robotics)
Language: English
Published by now publishers Inc 2013-10-03, 2013
ISBN 10: 1601987226 ISBN 13: 9781601987228
US$ 60.32
US$ 20.73 shipping
Ships from United Kingdom to U.S.A.Quantity: 1 available
Add to basketPaperback. Condition: New.
-
Mathematical Programming Approaches for Multi-Vehicle Motion Planning: Linear, Nonlinear, and Mixed Integer Programming
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
Seller rating 5 out of 5 stars
US$ 73.43
US$ 16.67 shipping
Ships from United Kingdom to U.S.A.Quantity: 1 available
Add to basketPaperback / softback. Condition: New. New copy - Usually dispatched within 3 working days.
-
-
![Seller image for Rounded [i.e. Bounded] Branch and Bound Method for Mixed Integer Nonlinear Programming Problems for sale by moluna](https://pictures.abebooks.com/inventory/md/md31546715319.jpg)
Rounded [i.e. Bounded] Branch and Bound Method for Mixed Integer Nonlinear Programming Problems
Language: English
Published by LIGHTNING SOURCE INC, 2015
ISBN 10: 1341949753 ISBN 13: 9781341949753
Gebunden. Condition: New. KlappentextThis work has been selected by scholars as being culturally important, and is part of the knowledge base of civilization as we know it. This work was reproduced from the original artifact, and remains as true to the origi.
-
Mathematical Programming Approaches for Multi-Vehicle Motion Planning: Linear, Nonlinear, and Mixed Integer Programming (Foundations and Trends (R) in . 23 (Foundations and Trends® in Robotics) [Paperback] Pramod Abichandani; Hande Benson and Moshe Kam
Seller: Hay-on-Wye Booksellers, Hay-on-Wye, HEREF, United Kingdom
Seller rating 5 out of 5 stars
US$ 27.13
US$ 86.97 shipping
Ships from United Kingdom to U.S.A.Quantity: 1 available
Add to basketCondition: Very Good. Unused, some outer edges have minor scuffs, cover has light scratches, some outer pages have marks from shelf wear, content unread as new.
-
-
-
![Seller image for Rounded [i.e. Bounded] Branch and Bound Method for Mixed Integer Nonlinear Programming Problems for sale by AHA-BUCH GmbH](https://pictures.abebooks.com/inventory/md/md31894750699.jpg)
Rounded [i.e. Bounded] Branch and Bound Method for Mixed Integer Nonlinear Programming Problems
Language: English
Published by Touchladybirdlucky Studios Sep 2015, 2015
ISBN 10: 1341949753 ISBN 13: 9781341949753
Buch. Condition: Neu. Neuware - This work has been selected by scholars as being culturally important, and is part of the knowledge base of civilization as we know it. This work was reproduced from the original artifact, and remains as true to the original work as possible. Therefore, you will see the original copyright references, library stamps (as most of these works have been housed in our most important libraries around the world), and other notations in the work. This work is in the public domain in the United States of America, and possibly other nations. Within the United States, you may freely copy and distribute this work, as no entity (individual or corporate) has a copyright on the body of the work.As a reproduction of a historical artifact, this work may contain missing or blurred pages, poor pictures, errant marks, etc. Scholars believe, and we concur, that this work is important enough to be preserved, reproduced, and made generally available to the public. We appreciate your support of the preservation process, and thank you for being an important part of keeping this knowledge alive and relevant.
-
Condition: New. Inhaltsverzeichnis1: The Future is Bright. and Driverless 2: The Building Blocks 3: The Building Blocks 4: Formulating and Solving Multi-Vehicle Motion Planning Problems 5: Observations and Design Considerations. A Time-Optimal co.
-
Relaxation And Decomposition Methods for Mixed Integer Nonlinear Programming
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
US$ 145.22
US$ 20.07 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New.
-
Condition: New. pp. 232.
-
hardcover. Condition: Very Good. Crease on cover*.
-
Condition: 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.
-
US$ 178.43
US$ 16.72 shipping
Ships from United Kingdom to U.S.A.Quantity: 2 available
Add to basketHardcover. Condition: Brand New. 1st edition. 213 pages. 9.25x6.50x0.75 inches. In Stock.
-
Buch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - Nonlinearoptimizationproblemscontainingbothcontinuousanddiscretevar iables are called mixed integer nonlinear programs (MINLP). Such problems arise in many elds, such as process industry, engineering design, communications, and nance. There is currently a huge gap between MINLP and mixed integer linear programming(MIP) solvertechnology.With a modernstate-of-the-artMIP solver itispossibletosolvemodelswithmillionsofvariablesandconstraints,whereasthe dimensionofsolvableMINLPsisoftenlimitedbyanumberthatissmallerbythree or four orders of magnitude. It is theoretically possible to approximate a general MINLP by a MIP with arbitrary precision. However, good MIP approximations are usually much larger than the original problem. Moreover, the approximation of nonlinear functions by piecewise linear functions can be di cult and ti- consuming. In this book relaxation and decomposition methods for solving nonconvex structured MINLPs are proposed. In particular, a generic branch-cut-and-price (BCP) framework for MINLP is presented. BCP is the underlying concept in almost all modern MIP solvers. Providing a powerful decomposition framework for both sequential and parallel solvers, it made the success of the current MIP technology possible. So far generic BCP frameworks have been developed only for MIP, for example,COIN/BCP (IBM, 2003) andABACUS (OREAS GmbH, 1999). In order to generalize MIP-BCP to MINLP-BCP, the following points have to be taken into account: - A given (sparse) MINLP is reformulated as a block-separable program with linear coupling constraints.The block structure makes it possible to generate Lagrangian cuts and to apply Lagrangian heuristics. - In order to facilitate the generation of polyhedral relaxations, nonlinear c- vex relaxations are constructed.- The MINLP separation and pricing subproblems for generating cuts and columns are solved with specialized MINLP solvers.
-
Brand new book. Fast ship. Please provide full street address as we are not able to ship to P O box address.
-
Relaxation And Decomposition Methods for Mixed Integer Nonlinear Programming
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
US$ 205.32
US$ 20.07 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: As New. Unread book in perfect condition.
-
US$ 194.31
US$ 33.45 shipping
Ships from United Kingdom to U.S.A.Quantity: 1 available
Add to basketHardcover. Condition: Like New. Like New. book.
-
Condition: As New. Unread book in perfect condition.
-
Mathematical Programming Approaches for Multi-Vehicle Motion Planning: Linear, Nonlinear, and Mixed Integer Programming (Foundations and Trends(r) in Robotics)
Seller: Phatpocket Limited, Waltham Abbey, HERTS, United Kingdom
Seller rating 5 out of 5 stars
US$ 25.58
US$ 14.24 shipping
Ships from United Kingdom to U.S.A.Quantity: 1 available
Add to basketCondition: Good. Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre'. Ex-library, so some stamps and wear, but in good overall condition. Our donations to The Rainbow Centre have helped provide an education and a safe haven to hundreds of children who live in appalling conditions.
-
-
HRD. Condition: New. New Book. Shipped from UK. Established seller since 2000.
-
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000.
