The De Gruyter Series in Discrete Mathematics and Applications is devoted to the publication of high-level monographs in the whole spectrum of current discrete mathematics and applications in various fields, such as theoretical computer science, information theory, combinatorics, graph theory, probability, number theory, algebra, calculus of finite differences, discrete calculus or discrete analysis, geometry, topology, operations research, game theory, decision theory, utility theory, social choice theory, discretization, discrete analogues of continuous mathematics, hybrid discrete and continuous mathematics
One of its main objectives is to make available to the professional community expositions of results and foundations of methods that play an important role in both the theory and applications of discrete mathematics. Contributions which are on the borderline of discrete mathematics and related fields and which stimulate further research at the crossroads of these areas are particularly welcome.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Petrica C. Pop, North University of Baia Mare, Romania.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Vendeur : PBShop.store UK, Fairford, GLOS, Royaume-Uni
HRD. Etat : New. New Book. Shipped from UK. Established seller since 2000. N° de réf. du vendeur FW-9783110267587
Quantité disponible : 15 disponible(s)
Vendeur : moluna, Greven, Allemagne
Hardcover. Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Petrica C. Pop, North. N° de réf. du vendeur 4456381
Quantité disponible : Plus de 20 disponibles
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Etat : New. N° de réf. du vendeur 18970645-n
Quantité disponible : Plus de 20 disponibles
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
Etat : New. N° de réf. du vendeur 18970645-n
Quantité disponible : Plus de 20 disponibles
Vendeur : Brook Bookstore On Demand, Napoli, NA, Italie
Etat : new. N° de réf. du vendeur d4a66625bcbad762d3506f154d6ad776
Quantité disponible : Plus de 20 disponibles
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Buch. Etat : 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. N° de réf. du vendeur 9783110267587
Quantité disponible : 2 disponible(s)
Vendeur : preigu, Osnabrück, Allemagne
Buch. Etat : 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. N° de réf. du vendeur 106603882
Quantité disponible : 5 disponible(s)
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Etat : As New. Unread book in perfect condition. N° de réf. du vendeur 18970645
Quantité disponible : Plus de 20 disponibles
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Buch. Etat : 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. N° de réf. du vendeur 9783110267587
Quantité disponible : 1 disponible(s)
Vendeur : Majestic Books, Hounslow, Royaume-Uni
Etat : New. pp. x + 203 40 Figures. N° de réf. du vendeur 57969253
Quantité disponible : 3 disponible(s)