Combinatorial optimization is a fascinating topic. Combinatorial optimization problems arise in a wide variety of important fields such as transportation, telecommunications, computer networking, location, planning, distribution problems, etc. Important and significant results have been obtained on the theory, algorithms and applications over the last few decades. In combinatorial optimization, many network design problems can be generalized in a natural way by considering a related problem on a clustered graph, where the original problem's feasibility constraints are expressed in terms of the clusters, i.e., node sets instead of individual nodes. This class of problems is usually referred to as generalized network design problems (GNDPs) or generalized combinatorial optimization problems.
The express purpose of this monograph is to describe a series of mathematical models, methods, propositions, algorithms developed in the last years on generalized network design problems in a unified manner. The book consists of seven chapters, where in addition to an introductory chapter, the following generalized network design problems are formulated and examined: the generalized minimum spanning tree problem, the generalized traveling salesman problem, the railway traveling salesman problem, the generalized vehicle routing problem, the generalized fixed-charge network design problem and the generalized minimum vertex-biconnected network problem.
The book will be useful for researchers, practitioners, and graduate students in operations research, optimization, applied mathematics and computer science. Due to the substantial practical importance of some presented problems, researchers in other areas will find this book useful, too.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Petrica C. Pop, North University of Baia Mare, Romania.
Combinatorial optimization is a fascinating topic. Combinatorial optimization problems arise in a wide variety of important fields such as transportation, telecommunications, computer networking, location, planning, distribution problems, etc. Important and significant results have been obtained on the theory, algorithms and applications over the last few decades. In combinatorial optimization, many network design problems can be generalized in a natural way by considering a related problem on a clustered graph, where the original problem's feasibility constraints are expressed in terms of the clusters, i.e., node sets instead of individual nodes. This class of problems is usually referred to as generalized network design problems (GNDPs) or generalized combinatorial optimization problems.
The express purpose of this monograph is to describe a series of mathematical models, methods, propositions, algorithms developed in the last years on generalized network design problems in a unified manner. The book consists of seven chapters, where in addition to an introductory chapter, the following generalized network design problems are formulated and examined: the generalized minimum spanning tree problem, the generalized traveling salesman problem, the railway traveling salesman problem, the generalized vehicle routing problem, the generalized fixed-charge network design problem and the generalized minimum vertex-biconnected network problem.
The book will be useful for researchers, practitioners, and graduate students in operations research, optimization, applied mathematics and computer science. Due to the substantial practical importance of some presented problems, researchers in other areas will find this book useful, too.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Da: PBShop.store UK, Fairford, GLOS, Regno Unito
HRD. Condizione: New. New Book. Shipped from UK. Established seller since 2000. Codice articolo FW-9783110267587
Quantità: 15 disponibili
Da: moluna, Greven, Germania
Hardcover. Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Petrica C. Pop, North. Codice articolo 4456381
Quantità: Più di 20 disponibili
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: New. Codice articolo 18970645-n
Quantità: Più di 20 disponibili
Da: GreatBookPricesUK, Woodford Green, Regno Unito
Condizione: New. Codice articolo 18970645-n
Quantità: Più di 20 disponibili
Da: Brook Bookstore On Demand, Napoli, NA, Italia
Condizione: new. Codice articolo d4a66625bcbad762d3506f154d6ad776
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 -Combinatorial optimization is a fascinating topic. Combinatorial optimization problems arise in a wide variety of important fields such as transportation, telecommunications, computer networking, location, planning, distribution problems, etc. Important and significant results have been obtained on the theory, algorithms and applications over the last few decades. In combinatorial optimization, many network design problems can be generalized in a natural way by considering a related problem on a clustered graph, where the original problem's feasibility constraints are expressed in terms of the clusters, i.e., node sets instead of individual nodes. This class of problems is usually referred to as generalized network design problems (GNDPs) or generalized combinatorial optimization problems. The express purpose of this monograph is to describe a series of mathematical models, methods, propositions, algorithms developed in the last years on generalized network design problems in a unified manner. The book consists of seven chapters, where in addition to an introductory chapter, the following generalized network design problems are formulated and examined: the generalized minimum spanning tree problem, the generalized traveling salesman problem, the railway traveling salesman problem, the generalized vehicle routing problem, the generalized fixed-charge network design problem and the generalized minimum vertex-biconnected network problem. The book will be useful for researchers, practitioners, and graduate students in operations research, optimization, applied mathematics and computer science. Due to the substantial practical importance of some presented problems, researchers in other areas will find this book useful, too. 216 pp. Englisch. Codice articolo 9783110267587
Quantità: 2 disponibili
Da: preigu, Osnabrück, Germania
Buch. Condizione: Neu. Generalized Network Design Problems | Modeling and Optimization | Petrica C. Pop | Buch | ISSN | X | Englisch | 2012 | De Gruyter | EAN 9783110267587 | Verantwortliche Person für die EU: Walter de Gruyter GmbH, De Gruyter GmbH, Genthiner Str. 13, 10785 Berlin, productsafety[at]degruyterbrill[dot]com | Anbieter: preigu Print on Demand. Codice articolo 106603882
Quantità: 5 disponibili
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: As New. Unread book in perfect condition. Codice articolo 18970645
Quantità: Più di 20 disponibili
Da: AHA-BUCH GmbH, Einbeck, Germania
Buch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - Combinatorial optimization is a fascinating topic. Combinatorial optimization problems arise in a wide variety of important fields such as transportation, telecommunications, computer networking, location, planning, distribution problems, etc. Important and significant results have been obtained on the theory, algorithms and applications over the last few decades. In combinatorial optimization, many network design problems can be generalized in a natural way by considering a related problem on a clustered graph, where the original problem's feasibility constraints are expressed in terms of the clusters, i.e., node sets instead of individual nodes. This class of problems is usually referred to as generalized network design problems (GNDPs) or generalized combinatorial optimization problems. The express purpose of this monograph is to describe a series of mathematical models, methods, propositions, algorithms developed in the last years on generalized network design problems in a unified manner. The book consists of seven chapters, where in addition to an introductory chapter, the following generalized network design problems are formulated and examined: the generalized minimum spanning tree problem, the generalized traveling salesman problem, the railway traveling salesman problem, the generalized vehicle routing problem, the generalized fixed-charge network design problem and the generalized minimum vertex-biconnected network problem. The book will be useful for researchers, practitioners, and graduate students in operations research, optimization, applied mathematics and computer science. Due to the substantial practical importance of some presented problems, researchers in other areas will find this book useful, too. Codice articolo 9783110267587
Quantità: 1 disponibili
Da: Majestic Books, Hounslow, Regno Unito
Condizione: New. pp. x + 203 40 Figures. Codice articolo 57969253
Quantità: 3 disponibili