From the reviews:
“The book presents in a very interesting way different problems connected with network optimization. ... I would strongly recommend the book as a complementary material for a graduate course on network optimization or related subjects.” (Jacek Błazewicz, Zentralblatt MATH, Vol. 1217, 2011)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.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
EUR 45,00 für den Versand von Deutschland nach USA
Versandziele, Kosten & DauerGratis für den Versand innerhalb von/der USA
Versandziele, Kosten & DauerAnbieter: Zubal-Books, Since 1961, Cleveland, OH, USA
Zustand: New. *FREE DOMESTIC SHIPPING until Monday, May 19** 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. Bestandsnummer des Verkäufers ZB1317037
Anzahl: 1 verfügbar
Anbieter: Lucky's Textbooks, Dallas, TX, USA
Zustand: New. Bestandsnummer des Verkäufers ABLIING23Mar2411530296848
Anzahl: Mehr als 20 verfügbar
Anbieter: Buchpark, Trebbin, Deutschland
Zustand: Sehr gut. Zustand: Sehr gut - Neubindung, 1. Auflage 2010, Buchschhnitt leicht verkürzt | Seiten: 184 | Sprache: Englisch | Produktart: Bücher. Bestandsnummer des Verkäufers 5831164/12
Anzahl: 2 verfügbar
Anbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Deutschland
Buch. Zustand: 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. Bestandsnummer des Verkäufers 9781441955128
Anzahl: 2 verfügbar
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Zustand: New. In. Bestandsnummer des Verkäufers ria9781441955128_new
Anzahl: Mehr als 20 verfügbar
Anbieter: THE SAINT BOOKSTORE, Southport, Vereinigtes Königreich
Hardback. Zustand: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 492. Bestandsnummer des Verkäufers C9781441955128
Anzahl: Mehr als 20 verfügbar
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Buch. Zustand: 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. Bestandsnummer des Verkäufers 9781441955128
Anzahl: 2 verfügbar
Anbieter: moluna, Greven, Deutschland
Gebunden. Zustand: 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. Bestandsnummer des Verkäufers 4175818
Anzahl: Mehr als 20 verfügbar
Anbieter: Mispah books, Redhill, SURRE, Vereinigtes Königreich
Hardcover. Zustand: Like New. Like New. book. Bestandsnummer des Verkäufers ERICA77314419551276
Anzahl: 1 verfügbar