Combinatorial optimization 5th international (48 résultats)

IX, 296 p. Softcover. Versand aus Deutschland / We dispatch from Germany via Air Mail. Einband bestoßen, daher Mängelexemplar gestempelt, sonst sehr guter Zustand. Imperfect copy due to slightly bumped cover, apart from this in very good condition. Stamped. Lecture Notes in Computer Science, Vol. 2129. Sprache: Englisch. …

Etat : Very Good. Former library copy. Pages intact with possible writing/highlighting. Binding strong with minor wear. Dust jackets/supplements may not be included. Includes library markings. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.

Etat : Good. Former library copy. Pages intact with minimal writing/highlighting. The binding may be loose and creased. Dust jackets/supplements are not included. Includes library markings. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.

Etat : Very Good. Pages intact with possible writing/highlighting. Binding strong with minor wear. Dust jackets/supplements may not be included. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.

Etat : New.

Paperback or Softback. Etat : New. Integer Programming and Combinatorial Optimization: 5th International Ipco Conference Vancouver, British Columbia, Canada June 3-5, 1996 Proceedings. Book.

Etat : As New. Unread book in perfect condition.

Etat : New.

Etat : As New. Unread book in perfect condition.

Etat : As New. Unread book in perfect condition.

Etat : New.

Etat : New.

Etat : As New. Unread book in perfect condition.

Etat : New.

Etat : New.

Etat : New.

Etat : New.

Etat : As New. Unread book in perfect condition.

Etat : New.

Etat : As New. Unread book in perfect condition.

Paperback. Etat : Brand New. 1st edition. 394 pages. 9.25x6.00x1.00 inches. In Stock.

Paperback. Etat : Brand New. 2011 edition. 562 pages. 9.00x6.00x1.25 inches. In Stock.

Taschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - This book constitutes the joint refereed proceedings of the 4th International Workshop on Approximation Algorithms for Optimization Problems, APPROX 2001 and of the 5th International Workshop on Ranomization and Approximation Techniques in Computer Science, RANDOM 2001, held in Berkeley, California, USA in August 2001. The 26 revised full papers presented were carefully reviewed and selected from a total of 54 submissions. Among the issues addressed are design and analysis of approximation algorithms, inapproximability results, on-line problems, randomization, de-randomization, average-case analysis, approximation classes, randomized complexity theory, scheduling, routing, coloring, partitioning, packing, covering, computational geometry, network design, and applications in various fields.…

Taschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - 'Eureka - You Skrink!'.- 'Eureka - You Shrink!'.- Submodular Functions, Matroids, and Certain Polyhedra.- Matching: A Well-Solved Class of Integer Linear Programs.- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems.- Connected Matchings.- Hajós' Construction and Polytopes.- Algorithmic Characterization of Bipartite b-Matching and Matroid Intersection.- Solving Real-World ATSP Instances by Branch-and-Cut.- The Bundle Method for Hard Combinatorial Optimization Problems.- The One-Commodity Pickup-and-Delivery Travelling Salesman Problem.- Reconstructing a Simple Polytope from Its Graph.- An Augment-and-Branch-and-Cut Framework for Mixed 0-1 Programming.- A Procedure of Facet Composition for the Symmetric Traveling Salesman Polytope.- Constructing New Facets of the Consecutive Ones Polytope.- A Simplex-Based Algorithm for 0-1 Mixed Integer Programming.- Mixed-Integer Value Functions in Stochastic Programming.- Exact Algorithms for NP-Hard Problems: A Survey.…

Taschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - The 5th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2008) was held in Paris, France May 20-23, 2008. The purpose of this conference series is to bring together researchers in the elds of constraint programming, arti cial intelligence, and operations research to explore ways of solving large-scale, practical optimization problems through integration and hybridization of the elds' di erent techniques. Through the years, this research community is discovering that the elds have much in c- mon, and there has been tremendous richness in the resulting cross-fertilization of elds. This year, we allowed submissions of both long (15 page) and short (5 page) papers, with short papers either being original work, a reduced version of a long paper, or an extended abstract of work published elsewhere. We were not s- prised by the 69 submissions in the long paper category: this is an active eld with many researchers. We were surprised by the 61 short paper submissions. This was far more than predicted. With 130 high-quality submissions, compe- tion for acceptance in this year's program was particularly erce. In the end, we accepted 18 long papers and 22 short papers for presentation and publication in this volume.…

Taschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - Search and Classification of High Dimensional Data.- Bicriteria Spanning Tree Problems.- Improved Approximation Algorithms for Multilevel Facility Location Problems.- On Constrained Hypergraph Coloring and Scheduling.- On the Power of Priority Algorithms for Facility Location and Set Cover.- Two Approximation Algorithms for 3-Cycle Covers.- Approximation Algorithms for the Unsplittable Flow Problem.- 1.5-Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a Minor.- Typical Rounding Problems.- Approximating Min-sum Set Cover.- Approximating Maximum Edge Coloring in Multigraphs.- Approximating the Complement of the Maximum Compatible Subset of Leaves of k Trees.- A 27/26-Approximation Algorithm for the Chromatic Sum Coloring of Bipartite Graphs.- Facility Location and the Geometric Minimum-Diameter Spanning Tree.- Improved Approximation Algorithms for the Partial Vertex Cover Problem.- Minimum Restricted Diameter Spanning Trees.- Hardness of Approximation for Vertex-Connectivity Network-Design Problems.- Non-abusiveness Helps: An % MathType!MTEF!2!1!+- % feaafiart1ev1aaatCvAUfKttLearuqr1ngBPrgarmWu51MyVXgatC % vAUfeBSjuyZL2yd9gzLbvyNv2CaeHbuLwBLnhiov2DGi1BTfMBaeHb % d9wDYLwzYbItLDharqqtubsr4rNCHbGeaGqiVu0Je9sqqrpepC0xbb % L8F4rqqrFfpeea0xe9Lq-Jc9vqaqpepm0xbba9pwe9Q8fs0-yqaqpe % pae9pg0FirpepeKkFr0xfr-xfr-xb9adbaqaaeGaciGaaiaadeWaaq % aadaqbaaGcbaGaaGOmamaaCaaaleqabaGagiiBaWMaei4Ba8Maei4z % aCgaaOWaaWbaaSqabeaadaahaaadbeqaamaaBaaabaWaaWbaaeqaba % GaaGymaiabgkHiTiabgIGiodaaaeqaaaaaaaGcdaahaaWcbeqaaiab % d6gaUbaaaaa!4546! [ 2^{log } ^{^{_{^{1 - in } } } } ^n ] (1)-Competitive Algorithm for Minimizing the Maximum Flow Time in the Online Traveling Salesman Problem.- Routing and Admission Control in Networks with Advance Reservations.- Improved Approximation Algorithms for Metric Facility Location Problems.- Complexity of Makespan Minimization for Pipeline Transportation of Petroleum Products.- Primal-Dual Algorithms for Connected Facility Location Problems.…

Taschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - This volume presents the proceedings of the Fifth Integer Programming and Combinatorial Optimization Conference, IPCO V, held in Vancouver, British Columbia, Canada, in June 1996.The 36 revised papers included in the book were selected from a total of 99 submissions; they highlight recent developments in theory, computation, and applications of integer programming and combinatorial optimization. The volume is organized in sections on integer programming theory and models, network flow algorithms, approximation algorithms, semi-definite methods, matrix models, set systems and submodularity, scheduling, probabilistic methods, polyhedral methods, and the traveling salesman problem.…

Taschenbuch. Etat : Neu. Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems | 5th International Conference, CPAIOR 2008 Paris, France, May 20-23, 2008 Proceedings | Laurent Perron (u. a.) | Taschenbuch | Einband - flex.(Paperback) | Englisch | 2008 | Springer | EAN 9783540681540 | Verantwortliche Person für die EU: Springer Nature Customer Service Center GmbH, Europaplatz 3, 69115 Heidelberg, productsafety[at]springernature[dot]com | Anbieter: preigu.…

Etat : New. pp. 430 1st ed. 2018 edition NO-PA16APR2015-KAP.

paperback. Etat : New. In shrink wrap. Looks like an interesting title.