Combinatorial Optimization 9th International (38 results)

paperback. Condition: Very Good. Connecting readers with great books since 1972! Used books may not include companion materials, and may have some shelf wear or limited writing. We ship orders daily and Customer Service is our top priority.

Condition: 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.

Condition: New.

Condition: New.

Condition: New.

Paperback or Softback. Condition: New. Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems: 9th International Conference, CPAIOR 2012, Nant. Book.

Paperback or Softback. Condition: New. Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques: 9th International Workshop on Approximation Algorithms for Com. Book.

Condition: As New. Unread book in perfect condition.

Condition: New.

Condition: New.

Condition: As New. Unread book in perfect condition.

Condition: New.

Condition: New. In English.

Condition: New.

Condition: New. In English.

Condition: As New. Unread book in perfect condition.

Condition: As New. Unread book in perfect condition.

Condition: New.

Paperback. Condition: Brand New. 2012 edition. 408 pages. 9.00x6.00x1.00 inches. In Stock.

Paperback. Condition: Brand New. 1st edition. 522 pages. 9.00x6.00x1.25 inches. In Stock.

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - Contributed Talks of APPROX.- The Network as a Storage Device: Dynamic Routing with Bounded Buffers.- Rounding Two and Three Dimensional Solutions of the SDP Relaxation of MAX CUT.- What Would Edmonds Do Augmenting Paths and Witnesses for Degree-Bounded MSTs.- A Rounding Algorithm for Approximating Minimum Manhattan Networks.- Packing Element-Disjoint Steiner Trees.- Approximating the Bandwidth of Caterpillars.- Where's the Winner Max-Finding and Sorting with Metric Costs.- What About Wednesday Approximation Algorithms for Multistage Stochastic Optimization.- The Complexity of Making Unique Choices: Approximating 1-in-k SAT.- Approximating the Distortion.- Approximating the Best-Fit Tree Under L p Norms.- Beating a Random Assignment.- Scheduling on Unrelated Machines Under Tree-Like Precedence Constraints.- Approximation Algorithms for Network Design and Facility Location with Service Capacities.- Finding Graph Matchings in Data Streams.- A Primal-Dual Approximation Algorithm for Partial Vertex Cover: Making Educated Guesses.- Efficient Approximation of Convex Recolorings.- Approximation Algorithms for Requirement Cut on Graphs.- Approximation Schemes for Node-Weighted Geometric Steiner Tree Problems.- Towards Optimal Integrality Gaps for Hypergraph Vertex Cover in the Lovász-Schrijver Hierarchy.- Contributed Talks of RANDOM.- Bounds for Error Reduction with Few Quantum Queries.- Sampling Bounds for Stochastic Optimization.- An Improved Analysis of Mergers.- Finding a Maximum Independent Set in a Sparse Random Graph.- On the Error Parameter of Dispersers.- Tolerant Locally Testable Codes.- A Lower Bound on List Size for List Decoding.- A Lower Bound for Distribution-Free Monotonicity Testing.- On Learning Random DNF Formulas Under the Uniform Distribution.-Derandomized Constructions of k-Wise (Almost) Independent Permutations.- Testing Periodicity.- The Parity Problem in the Presence of Noise, Decoding Random Linear Codes, and the Subset Sum Problem.- The Online Clique Avoidance Game on Random Graphs.- A Generating Function Method for the Average-Case Analysis of DPLL.- A Continuous-Discontinuous Second-Order Transition in the Satisfiability of Random Horn-SAT Formulas.- Mixing Points on a Circle.- Derandomized Squaring of Graphs.- Tight Bounds for String Reconstruction Using Substring Queries.- Reconstructive Dispersers and Hitting Set Generators.- The Tensor Product of Two Codes Is Not Necessarily Robustly Testable.- Fractional Decompositions of Dense Hypergraphs.…

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book constitutes the refereed proceedings of the 9th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR 2012, held in Nantes, France, in May/June 2012.The 26 revised full papers presented were carefully reviewed andselected from 64 submissions. The papers are focused on both theoretical and practical, application-oriented issues in combinatorial optimization and feature current research with a special focus on inference and relaxation methods, integration methods, modeling methods, innovative applications of CP/AI/OR techniques, and implementation of CP/AI/OR techniques and optimization systems. …

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - This volume contains the papers selected for presentation at IPCO 2002, the NinthInternationalConferenceonIntegerProgrammingandCombinatorial- timization, Cambridge, MA (USA), May 27-29, 2002. The IPCO series of c- ferences highlights recent developments in theory, computation, and application of integer programming and combinatorial optimization. IPCO was established in 1988 when the rst IPCO program committee was formed. IPCO is held every year in which no International Symposium on Ma- ematical Programming (ISMP) takes places. The ISMP is triennial, so IPCO conferences are held twice in every three-year period. The eight previous IPCO conferences were held in Waterloo (Canada) 1990, Pittsburgh (USA) 1992, Erice (Italy) 1993, Copenhagen (Denmark) 1995, Vancouver (Canada) 1996, Houston (USA) 1998, Graz (Austria) 1999, and Utrecht (The Netherlands) 2001. In response to the call for papers for IPCO 2002, the program committee received 110 submissions, a record number for IPCO. The program committee met on January 7 and 8, 2002, in Aussois (France), and selected 33 papers for inclusion in the scienti c program of IPCO 2002. The selection was based on originality and quality, and re ects many of the current directions in integer programming and combinatorial optimization research. …

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book constitutes the refereed proceedings of the 9th International Symposium on Combinatorial Optimization, ISCO 2026, held in Kusadasi, Türkiye, during May 4 8, 2026.The 41 full papers were included in this were carefully reviewed and selected from 64 submissions. The papers cover the following topical sections: Scheduling; Mathematical Programming; Combinatorial Optimization; Polyhedral Combinatorics; Complexity; Approximation Algorithms; Network Design; Stochastic Optimization; Graphs and Combinatorics, and Applications.…

Paperback. Condition: Brand New. 828 pages. 9.25x6.10x1.87 inches. In Stock.

Condition: New. In English.

Taschenbuch. Condition: Neu. Combinatorial Optimization | 9th International Symposium, ISCO 2026, Kusadasi, Turkiye, May 4-8, 2026, Proceedings | A. Ridha Mahjoub (u. a.) | Taschenbuch | Lecture Notes in Computer Science | xv | Englisch | 2027 | Springer Nature Switzerland AG | EAN 9783032345189 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.…

Condition: Gut. Zustand: Gut | Seiten: 504 | Sprache: Englisch | Produktart: Bücher | This volume contains the papers selected for presentation at IPCO 2002, the NinthInternationalConferenceonIntegerProgrammingandCombinatorial- timization, Cambridge, MA (USA), May 27¿29, 2002. The IPCO series of c- ferences highlights recent developments in theory, computation, and application of integer programming and combinatorial optimization. IPCO was established in 1988 when the ?rst IPCO program committee was formed. IPCO is held every year in which no International Symposium on Ma- ematical Programming (ISMP) takes places. The ISMP is triennial, so IPCO conferences are held twice in every three-year period. The eight previous IPCO conferences were held in Waterloo (Canada) 1990, Pittsburgh (USA) 1992, Erice (Italy) 1993, Copenhagen (Denmark) 1995, Vancouver (Canada) 1996, Houston (USA) 1998, Graz (Austria) 1999, and Utrecht (The Netherlands) 2001. In response to the call for papers for IPCO 2002, the program committee received 110 submissions, a record number for IPCO. The program committee met on January 7 and 8, 2002, in Aussois (France), and selected 33 papers for inclusion in the scienti?c program of IPCO 2002. The selection was based on originality and quality, and re?ects many of the current directions in integer programming and combinatorial optimization research. …

Condition: Sehr gut. Zustand: Sehr gut | Seiten: 424 | Sprache: Englisch | Produktart: Bücher | This book constitutes the refereed proceedings of the 9th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR 2012, held in Nantes, France, in May/June 2012.The 26 revised full papers presented were carefully reviewed andselected from 64 submissions. The papers are focused on both theoretical and practical, application-oriented issues in combinatorial optimization and feature current research with a special focus on inference and relaxation methods, integration methods, modeling methods, innovative applications of CP/AI/OR techniques, and implementation of CP/AI/OR techniques and optimization systems. …

Condition: As New. Unread book in perfect condition.