Integer Programming and Combinatorial Optimization : 9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002. Proceedings - Taschenbuch
2002, ISBN: 3540436766
[EAN: 9783540436768], Neubuch, [SC: 0.0], [PU: Springer Berlin Heidelberg], ALGORITHMUS; KOMBINATORIK; APPROXIMATION; COMBINATORICS; COMPUTATIONALCOMPLEXITY; COMPUTATIONALGEOMETRY; GRAPHA… Mehr…
ZVAB.com AHA-BUCH GmbH, Einbeck, Germany [51283250] [Rating: 5 (von 5)] NEW BOOK. Versandkosten:Versandkostenfrei. (EUR 0.00) Details... |
2002, ISBN: 9783540436768
This volume contains the papers selected for presentation at IPCO 2002, the Ninth International Conferenceon Integer Programming and Combinatorial- timization, Cambridge, MA (USA), May 27… Mehr…
BarnesandNoble.com new in stock. Versandkosten:zzgl. Versandkosten. Details... |
2002, ISBN: 9783540436768
This volume contains the papers selected for presentation at IPCO 2002, the NinthInternationalConferenceonIntegerProgrammingandCombinatorial- timization, Cambridge, MA (USA), May 27–29, 2… Mehr…
Springer.com Nr. 978-3-540-43676-8. Versandkosten:Worldwide free shipping, , DE. (EUR 0.00) Details... |
Integer Programming and Combinatorial Optimization: 9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002. Proceedings (Lecture Notes in Computer Science, 2337, Band 2337) - Taschenbuch
2008, ISBN: 9783540436768
Springer, Taschenbuch, Auflage: 2002, 504 Seiten, Publiziert: 2008-06-13T00:00:01Z, Produktgruppe: Buch, Hersteller-Nr.: 1, 3.4 kg, Informatik, IT-Ausbildung & -Berufe, Computer & Interne… Mehr…
amazon.de buecherhof Gebraucht, wie neu. Versandkosten:Auf Lager. Die angegebenen Versandkosten können von den tatsächlichen Kosten abweichen. (EUR 3.00) Details... |
Integer Programming and Combinatorial Optimization 9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002. Proceedi Auflage: 2002 - gebrauchtes Buch
2013, ISBN: 9783540436768
Auflage: 2002 504 Seiten mittel Lecture Notes in Computer Science 2337.. xi, 487 S. XI, 487 pp. 235 mm.Einband kartoniert; Gewicht 699g 2002. English Edition. , mit leichten äusserlichen … Mehr…
buchfreund.de |
Integer Programming and Combinatorial Optimization : 9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002. Proceedings - Taschenbuch
2002, ISBN: 3540436766
[EAN: 9783540436768], Neubuch, [SC: 0.0], [PU: Springer Berlin Heidelberg], ALGORITHMUS; KOMBINATORIK; APPROXIMATION; COMBINATORICS; COMPUTATIONALCOMPLEXITY; COMPUTATIONALGEOMETRY; GRAPHA… Mehr…
2002, ISBN: 9783540436768
This volume contains the papers selected for presentation at IPCO 2002, the Ninth International Conferenceon Integer Programming and Combinatorial- timization, Cambridge, MA (USA), May 27… Mehr…
2002
ISBN: 9783540436768
This volume contains the papers selected for presentation at IPCO 2002, the NinthInternationalConferenceonIntegerProgrammingandCombinatorial- timization, Cambridge, MA (USA), May 27–29, 2… Mehr…
Integer Programming and Combinatorial Optimization: 9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002. Proceedings (Lecture Notes in Computer Science, 2337, Band 2337) - Taschenbuch
2008, ISBN: 9783540436768
Springer, Taschenbuch, Auflage: 2002, 504 Seiten, Publiziert: 2008-06-13T00:00:01Z, Produktgruppe: Buch, Hersteller-Nr.: 1, 3.4 kg, Informatik, IT-Ausbildung & -Berufe, Computer & Interne… Mehr…
Integer Programming and Combinatorial Optimization 9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002. Proceedi Auflage: 2002 - gebrauchtes Buch
2013, ISBN: 9783540436768
Auflage: 2002 504 Seiten mittel Lecture Notes in Computer Science 2337.. xi, 487 S. XI, 487 pp. 235 mm.Einband kartoniert; Gewicht 699g 2002. English Edition. , mit leichten äusserlichen … Mehr…
Bibliographische Daten des bestpassenden Buches
Autor: | |
Titel: | |
ISBN-Nummer: |
Detailangaben zum Buch - Integer Programming and Combinatorial Optimization: 9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002. Proceedings William J. Coo
EAN (ISBN-13): 9783540436768
ISBN (ISBN-10): 3540436766
Taschenbuch
Erscheinungsjahr: 2002
Herausgeber: Springer Berlin Heidelberg Core >1 >T
504 Seiten
Gewicht: 0,754 kg
Sprache: eng/Englisch
Buch in der Datenbank seit 2007-12-16T22:18:56+01:00 (Zurich)
Detailseite zuletzt geändert am 2024-03-13T14:05:59+01:00 (Zurich)
ISBN/EAN: 9783540436768
ISBN - alternative Schreibweisen:
3-540-43676-6, 978-3-540-43676-8
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: andrea schulz, william cook, andreas schulz, andreas willi, andreas mayer, may
Titel des Buches: integer programming combinatorial optimization, usa, viz salesman african american captain, international optimization, programm, 2002
Daten vom Verlag:
Autor/in: William J. Cook; Andreas S. Schulz
Titel: Lecture Notes in Computer Science; Integer Programming and Combinatorial Optimization - 9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002. Proceedings
Verlag: Springer; Springer Berlin
487 Seiten
Erscheinungsjahr: 2002-05-14
Berlin; Heidelberg; DE
Sprache: Englisch
53,49 € (DE)
54,99 € (AT)
59,00 CHF (CH)
Available
XI, 487 p.
BC; Hardcover, Softcover / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; Approximation; Combinatorics; Computational Complexity; Computational Geometry; Graph Algorithms; Integer Programming; Mathematical Programming; Network Algorithms; Scheduling; algorithms; combinatorial optimization; optimization; programming; algorithm analysis and problem complexity; Theory of Computation; Probability Theory; Software Engineering; Discrete Mathematics in Computer Science; Numerical Analysis; Algorithms; Wahrscheinlichkeitsrechnung und Statistik; Stochastik; Software Engineering; Mathematik für Informatiker; Diskrete Mathematik; Numerische Mathematik; Algorithmen und Datenstrukturen; EA
A Faster Scaling Algorithm for Minimizing Submodular Functions.- A Generalization of Edmonds’ Matching and Matroid Intersection Algorithms.- A Coordinatewise Domain Scaling Algorithm for M-convex Function Minimization.- The Quickest Multicommodity Flow Problem.- A New Min-Cut Max-Flow Ratio for Multicommodity Flows.- Improved Rounding Techniques for the MAX 2-SAT and MAX DI-CUT Problems.- Finding the Exact Integrality Gap for Small Traveling Salesman Problems.- Polynomial-Time Separation of Simple Comb Inequalities.- A New Approach to Cactus Construction Applied to TSP Support Graphs.- Split Closure and Intersection Cuts.- An Exponential Lower Bound on the Length of Some Classes of Branch-and-Cut Proofs.- Lifted Inequalities for 0-1 Mixed Integer Programming: Basic Theory and Algorithms.- On a Lemma of Scarf.- A Short Proof of Seymour’s Characterization of the Matroids with the Max-Flow Min-Cut Property.- Integer Programming and Arrovian Social Welfare Functions.- Integrated Logistics: Approximation Algorithms Combining Facility Location and Network Design.- The Minimum Latency Problem Is NP-Hard for Weighted Trees.- An Improved Approximation Algorithm for the Metric Uncapacitated Facility Location Problem.- A Polyhedral Approach to Surface Reconstruction from Planar Contours.- The Semidefinite Relaxation of the k-Partition Polytope Is Strong.- A Polyhedral Study of the Cardinality Constrained Knapsack Problem.- A PTAS for Minimizing Total Completion Time of Bounded Batch Scheduling.- An Approximation Scheme for the Two-Stage, Two-Dimensional Bin Packing Problem.- On Preemptive Resource Constrained Scheduling: Polynomial-Time Approximation Schemes.- Hard Equality Constrained Integer Knapsacks.- The Distribution of Values in the Quadratic Assignment Problem.- A NewSubadditive Approach to Integer Programming.- Improved Approximation Algorithms for Resource Allocation.- Approximating the Advertisement Placement Problem.- Algorithms for Minimizing Response Time in Broadcast Scheduling.- Building Edge-Failure Resilient Networks.- The Demand Matching Problem.- The Single-Sink Buy-at-Bulk LP Has Constant Integrality Gap.Includes supplementary material: sn.pub/extras
Weitere, andere Bücher, die diesem Buch sehr ähnlich sein könnten:
Neuestes ähnliches Buch:
9783030738792 Integer Programming and Combinatorial Optimization: 22nd International Conference, IPCO 2021, Atlanta, GA, USA, May 19-21, 2021, Proceedings Mohit Sin (Mohit Singh; David P. Williamson)
- 9783030738792 Integer Programming and Combinatorial Optimization: 22nd International Conference, IPCO 2021, Atlanta, GA, USA, May 19-21, 2021, Proceedings Mohit Sin (Mohit Singh; David P. Williamson)
- 9783030457709 Integer Programming and Combinatorial Optimization: 21st International Conference, IPCO 2020, London, UK, June 8-10, 2020, Proceedings Daniel Bienstoc (Herausgegeben:Zambelli, Giacomo; Bienstock, Daniel)
- 9783030738785 Integer Programming and Combinatorial Optimization (David P. Williamson)
- 9783030179533 Integer Programming and Combinatorial Optimization (Andrea Lodi; Viswanath Nagarajan)
- 9783030457716 Integer Programming and Combinatorial Optimization (Daniel Bienstock; Giacomo Zambelli)
- 9783030179526 Integer Programming and Combinatorial Optimization: 20th International Conference, IPCO 2019, Ann Arbor, MI, USA, May 22-24, 2019, Proceedings (Lecture Notes in Computer Science, Band 11480) (Andrea Lodi)
- 9780387594088 Integer Programming and Combinatorial Optimization: 4th International Ipco Conference Copenhagen, Denmark, May 29-31, 1995 : Proceedings (Lecture Notes in Computer Science) (Egon Balas, Jens Clausen)
- Integer Programming and Combinatorial Optimization: 19th International Conference, IPCO 2017, Waterloo, ON, Canada, June 26-28, 2017, Proceedings (Lecture ... Science Book 10328) (English Edition) (William J. Cook)
< zum Archiv...