Combinatorial optimization 7th international (45 resultados)

Paperback. Condición: Very Good. 1st ed. 2022. It's a well-cared-for item that has seen limited use. The item may show minor signs of wear. All the text is legible, with all pages included. It may have slight markings and/or highlighting.

Condición: New.

Condición: New.

Paperback or Softback. Condición: New. Integer Programming and Combinatorial Optimization: 7th International Ipco Conference, Graz, Austria, June 9-11, 1999, Proceedings. Book.

Condición: New.

Condición: New.

Condición: New.

Condición: As New. Unread book in perfect condition.

PF. Condición: New.

Condición: New. In English.

Condición: New. In English.

PF. Condición: New.

Paperback. Condición: New.

Condición: New.

Condición: New.

Condición: New.

Condición: New. In English.

Condición: New. In English.

Condición: As New. Unread book in perfect condition.

Paperback. Condición: Brand New. 2010 edition. 380 pages. 9.25x6.25x1.00 inches. In Stock.

Paperback. Condición: Brand New. 2013 edition. 452 pages. 9.25x6.10x1.00 inches. In Stock.

Condición: New.

Condición: New.

Paperback. Condición: New.

Taschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - Thisvolumecontainsthepaperspresentedatthe7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2004) and the 8th International Workshop on Randomization and Compu- tion (RANDOM 2004), which took place concurrently at Harvard University, Cambridge, on August 22 24, 2004. APPROX focuses on algorithmic and c- plexity issues surrounding the development of e cient approximate solutions to computationally hard problems, and this year s workshop was the seventh in the series after Aalborg (1998), Berkeley (1999), Saarbru cken (2000), Berkeley (2001), Rome (2002), and Princeton (2003). RANDOM is concerned with app- cations of randomness to computational and combinatorial problems, and this year sworkshopwasthe eighth in the seriesfollowing Bologna(1997),Barcelona (1998), Berkeley (1999), Geneva (2000), Berkeley (2001), Harvard (2002), and Princeton (2003). Topics of interest for APPROX and RANDOM are: design and analysis of approximation algorithms, inapproximability results, approximationclasses, - line problems, small space and data streaming algorithms, sub-linear time al- rithms, embeddings and metric space methods in approximation, math prog- ming in approximation algorithms, coloring and partitioning, cuts and conn- tivity, geometric problems, network design and routing, packing and covering, scheduling, game theory, design and analysis of randomized algorithms, r- domized complexity theory, pseudorandomness and derandomization, random combinatorial structures, random walks/Markov chains, expander graphs and randomness extractors,probabilistic proof systems,random projectionsand - beddings,error-correctingcodes,average-caseanalysis,propertytesting,com- tational learning theory, and other applications of approximation and rand- ness. The volumecontains19+18contributed papers,selected by the two program committees from 54+33 submissions received in response to the call for papers.…

Taschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - This volume contains the papers selected for presentation at IPCO VII, the Seventh Conference on Integer Programming and Combinatorial Optimization, Graz,Austria,June9{11,1999.Thismeetingisaforumforresearchersandpr- titioners working on various aspects of integer programming and combinatorial optimization. The aim is to present recent developments in theory, compu- tion, and applications of integer programming and combinatorial optimization. Topics include, but are not limited to: approximation algorithms, branch and bound algorithms, computational biology, computational complexity, compu- tional geometry, cutting plane algorithms, diophantine equations, geometry of numbers, graph and network algorithms, integer programming, matroids and submodular functions, on-line algorithms, polyhedral combinatorics, scheduling theory and algorithms, and semide nite programs. IPCO was established in 1988 when the rst IPCO program committee was formed. IPCO I took place in Waterloo (Canada) in 1990, IPCO II was held in Pittsburgh (USA) in 1992, IPCO III in Erice (Italy) 1993, IPCO IV in Cop- hagen (Denmark) 1995, IPCO V in Vancouver (Canada) 1996, and IPCO VI in Houston (USA) 1998. IPCO is held every year in which no MPS (Mathematical Programming Society) International Symposium takes place: 1990, 1992, 1993, 1995,1996,1998,1999,2001,2002,2004,2005,2007,2008,::::::Since the MPS meeting is triennial, IPCO conferences are held twice in everythree-year period. As a rule, in even years IPCO is held somewhere in Northern America, and in odd years it is held somewhere in Europe. In response to the call for papers for IPCO 99, the program committee - ceived99submissions,indicatingastrongandgrowinginterestintheconference. …

Taschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book constitutes the refereed proceedings of the 7th International Conference on Combinatorial Optimization and Applications, COCOA 2013, held in Chengdu, China, in December 2013. The 36 full papers presented were carefully reviewed and selected from 72 submissions. The papers feature original research in the areas of combinatorial optimization and its applications. In addition to theoretical results there are reports on experimental and applied research of general algorithmic interest.…

Condición: New. In English.

Condición: As New. Unread book in perfect condition.

Taschenbuch. Condición: Neu. Combinatorial Optimization and Applications | 7th International Conference, COCOA 2013, Chengdu, China, December 12-14, 2013, Proceedings | Peter Widmayer (u. a.) | Taschenbuch | Lecture Notes in Computer Science | xviii | Englisch | 2013 | Springer | EAN 9783319037790 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.…