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.
"synopsis" may belong to another edition of this title.
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 they’re 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.
"About this title" may belong to another edition of this title.
US$ 33.23 shipping from United Kingdom to U.S.A.
Destination, rates & speedsUS$ 26.65 shipping from Germany to U.S.A.
Destination, rates & speedsSeller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Taschenbuch. Condition: 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. 196 pp. Englisch. Seller Inventory # 9781461425434
Quantity: 2 available
Seller: Books Puddle, New York, NY, U.S.A.
Condition: New. pp. 198. Seller Inventory # 2648028508
Quantity: 4 available
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Condition: New. In. Seller Inventory # ria9781461425434_new
Quantity: Over 20 available
Seller: Majestic Books, Hounslow, United Kingdom
Condition: New. Print on Demand pp. 198 96 Illus. Seller Inventory # 44786819
Quantity: 4 available
Seller: Chiron Media, Wallingford, United Kingdom
PF. Condition: New. Seller Inventory # 6666-IUK-9781461425434
Quantity: 10 available
Seller: AHA-BUCH GmbH, Einbeck, Germany
Taschenbuch. Condition: 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. Seller Inventory # 9781461425434
Quantity: 1 available
Seller: Revaluation Books, Exeter, United Kingdom
Paperback. Condition: Brand New. 196 pages. 9.20x6.10x0.45 inches. In Stock. Seller Inventory # x-1461425433
Quantity: 2 available
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
Paperback / softback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 334. Seller Inventory # C9781461425434
Quantity: Over 20 available
Seller: Biblios, Frankfurt am main, HESSE, Germany
Condition: New. PRINT ON DEMAND pp. 198. Seller Inventory # 1848028502
Quantity: 4 available
Seller: moluna, Greven, Germany
Condition: 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. Seller Inventory # 4197538
Quantity: Over 20 available