One of the most well-known of all network optimization problems is the shortest path problem, where a shortest connection between two locations in a road network is to be found. This problem is the basis of route planners in vehicles and on the Internet. Networks are very common structures; they consist primarily of a ?nite number of locations (points, nodes), together with a number of links (edges, arcs, connections) between the locations. Very often a certain number is attached to the links, expressing the distance or the cost between the end points of that connection. Networks occur in an extremely wide range of applications, among them are: road networks; cable networks; human relations networks; project scheduling networks; production networks; distribution networks; neural networks; networks of atoms in molecules. In all these cases there are objects and relations between the objects. A n- work optimization problem is actually nothing else than the problem of ?nding a subset of the objects and the relations, such that a certain optimization objective is satis?ed.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Most books covering network optimization explain the theory but offer only exercises that support the understanding of that theory, and case studies that are offered are not suitable for classroom analysis, either because data sets are missing or theyre just too large to handle in the classroom. Networks in Action: Text and Computer Exercises in Network Optimization contains a wide range of not-too-large network optimization problems that need to be analyzed and solved by using the computer. Using case studies based on a single fictitious company throughout, the book presents exercises in each chapter that are at once small enough to solve in the classroom, while too large to be solved by eye.
After providing an overview of the modeling and implementing process, a look at network theory, and comprehensive listing of references with comments, the book looks shortest paths, minimum spanning trees, network flows, matchings, facility location, and cyclic routing on networks. Each chapter contains exercises that have been rigorously classroom-tested. The result is a perfect text for a one-semester course on network optimization, whether at the advanced undergraduate or the graduate level within an operations research program, econometrics, or as part of an MBA program.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Da: Brook Bookstore On Demand, Napoli, NA, Italia
Condizione: new. Questo è un articolo print on demand. Codice articolo 0da1f584fc711a60c87fb93a05386d0b
Quantità: Più di 20 disponibili
Da: Zubal-Books, Since 1961, Cleveland, OH, U.S.A.
Condizione: New. *Price HAS BEEN REDUCED by 10% until Monday, May 18 (weekend sale item)* 195 pp., hardcover, new, this is the 2015 edition. - If you are reading this, this item is actually (physically) in our stock and ready for shipment once ordered. We are not bookjackers. Buyer is responsible for any additional duties, taxes, or fees required by recipient's country. Codice articolo ZB1317037
Quantità: 1 disponibili
Da: Ria Christie Collections, Uxbridge, Regno Unito
Condizione: New. In. Codice articolo ria9781441955128_new
Quantità: Più di 20 disponibili
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Buch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -One of the most well-known of all network optimization problems is the shortest path problem, where a shortest connection between two locations in a road network is to be found. This problem is the basis of route planners in vehicles and on the Internet. Networks are very common structures; they consist primarily of a nite number of locations (points, nodes), together with a number of links (edges, arcs, connections) between the locations. Very often a certain number is attached to the links, expressing the distance or the cost between the end points of that connection. Networks occur in an extremely wide range of applications, among them are: road networks; cable networks; human relations networks; project scheduling networks; production networks; distribution networks; neural networks; networks of atoms in molecules. In all these cases there are 'objects' and 'relations' between the objects. A n- work optimization problem is actually nothing else than the problem of nding a subset of the objects and the relations, such that a certain optimization objective is satis ed. 184 pp. Englisch. Codice articolo 9781441955128
Quantità: 1 disponibili
Da: Biblios, Frankfurt am main, HESSE, Germania
Condizione: New. PRINT ON DEMAND pp. 202. Codice articolo 181152515
Quantità: 4 disponibili
Da: Books Puddle, New York, NY, U.S.A.
Condizione: New. pp. 202. Codice articolo 261152521
Quantità: 4 disponibili
Da: Majestic Books, Hounslow, Regno Unito
Condizione: New. Print on Demand pp. 202 96 Illus. Codice articolo 6695382
Quantità: 4 disponibili
Da: THE SAINT BOOKSTORE, Southport, Regno Unito
Hardback. Condizione: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days. Codice articolo C9781441955128
Quantità: Più di 20 disponibili
Da: moluna, Greven, Germania
Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Presents optimization problems small enough to be solved in class yet too large to be solved by eyeUses fictitious case study format for all exercisesAll exercises rigorously classroom-testedOne of the most well-known of all network. Codice articolo 4175818
Quantità: Più di 20 disponibili
Da: AHA-BUCH GmbH, Einbeck, Germania
Buch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - One of the most well-known of all network optimization problems is the shortest path problem, where a shortest connection between two locations in a road network is to be found. This problem is the basis of route planners in vehicles and on the Internet. Networks are very common structures; they consist primarily of a nite number of locations (points, nodes), together with a number of links (edges, arcs, connections) between the locations. Very often a certain number is attached to the links, expressing the distance or the cost between the end points of that connection. Networks occur in an extremely wide range of applications, among them are: road networks; cable networks; human relations networks; project scheduling networks; production networks; distribution networks; neural networks; networks of atoms in molecules. In all these cases there are 'objects' and 'relations' between the objects. A n- work optimization problem is actually nothing else than the problem of nding a subset of the objects and the relations, such that a certain optimization objective is satis ed. Codice articolo 9781441955128
Quantità: 1 disponibili