Andere Kunden interessierten sich auch für
![A Group Theoretic Branch and Bound Algorithm for the Zero-one Integer Programming Problem]( "A Group Theoretic Branch and Bound Algorithm for the Zero-one Integer Programming Problem")
A Group Theoretic Branch and Bound Algorithm for the Zero-one Integer Programming Problem32,99 €![Rounded [i.e. Bounded] Branch and Bound Method for Mixed Integer Nonlinear Programming Problems]( "Rounded [i.e. Bounded] Branch and Bound Method for Mixed Integer Nonlinear Programming Problems")
Rounded [i.e. Bounded] Branch and Bound Method for Mixed Integer Nonlinear Programming Problems32,99 €![The Probabilistic Minimum Spanning Tree Problem]( "The Probabilistic Minimum Spanning Tree Problem")
The Probabilistic Minimum Spanning Tree Problem28,99 €![Methods Of Operations Research]( "Methods Of Operations Research")
Methods Of Operations Research34,99 €![On the Organically Bound Phosphorus in the Soil]( "On the Organically Bound Phosphorus in the Soil")
On the Organically Bound Phosphorus in the Soil31,99 €![A Book Bound For Mary Queen Of Scots]( "A Book Bound For Mary Queen Of Scots")
A Book Bound For Mary Queen Of Scots36,99 €![Journal of Samuel Rutherford Dundass ... Including his Entire Route to California as a Member of the Steubenville Company Bound for San Francisco, in]( "Journal of Samuel Rutherford Dundass ... Including his Entire Route to California as a Member of the Steubenville Company Bound for San Francisco, in")
Journal of Samuel Rutherford Dundass ... Including his Entire Route to California as a Member of the Steubenville Company Bound for San Francisco, in32,99 €
![Rounded [i.e. Bounded] Branch and Bound Method for Mixed Integer Nonlinear Programming Problems](https://bilder.buecher.de/produkte/65/65278/65278557m.jpg "Rounded [i.e. Bounded] Branch and Bound Method for Mixed Integer Nonlinear Programming Problems")
Combinatorial problems arise in a wide variety of fields, from computer science to operations research to engineering. This book provides an in-depth introduction to the branch and bound method, a powerful algorithmic technique for solving combinatorial optimization problems. With clear explanations, detailed examples, and practical advice, John D. C. Little's work is an essential resource for anyone seeking to understand this important area of research. 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 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. 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.
Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.
Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.