- 5 Ergebnisse
Kleinster Preis: € 74,89, größter Preis: € 96,49, Mittelwert: € 83,71
1
Integer Programming and Combinatorial Optimization : 9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002. Proceedings - Michael Beyer
Bestellen
bei hive.co.uk
£ 67,58
(ca. € 75,65)
Bestellengesponserter Link
Michael Beyer:

Integer Programming and Combinatorial Optimization : 9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002. Proceedings - neues Buch

2002, ISBN: 9783540478676

This volume contains the papers selected for presentation at IPCO 2002, the NinthInternationalConferenceonIntegerProgrammingandCombinatorial- timization, Cambridge, MA (USA), May 27-29, 2… Mehr…

No. 9783540478676. Versandkosten:Instock, Despatched same working day before 3pm, zzgl. Versandkosten.
2
Integer Programming and Combinatorial Optimization : 9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002. Proceedings - Young S. Kim
Bestellen
bei hive.co.uk
£ 67,58
(ca. € 78,93)
Bestellengesponserter Link

Young S. Kim:

Integer Programming and Combinatorial Optimization : 9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002. Proceedings - neues Buch

2002, ISBN: 9783540478676

This volume contains the papers selected for presentation at IPCO 2002, the NinthInternationalConferenceonIntegerProgrammingandCombinatorial- timization, Cambridge, MA (USA), May 27-29, 2… Mehr…

No. 9783540478676. Versandkosten:Instock, Despatched same working day before 3pm, zzgl. Versandkosten.
3
Bestellen
bei lehmanns.de
€ 92,58
Versand: € 0,001
Bestellengesponserter Link
William J. Cook; Andreas S. Schulz:
Integer Programming and Combinatorial Optimization - neues Buch

2003

ISBN: 9783540478676

9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002. Proceedings, eBooks, eBook Download (PDF), This volume contains the papers selected for presentation at IPCO 2002, … Mehr…

Versandkosten:Download sofort lieferbar. (EUR 0.00)
4
Integer Programming and Combinatorial Optimization - William J. Cook; Andreas S. Schulz
Bestellen
bei Springer.com
€ 74,89
Versand: € 0,001
Bestellengesponserter Link
William J. Cook; Andreas S. Schulz:
Integer Programming and Combinatorial Optimization - neues Buch

2002, ISBN: 9783540478676

This volume contains the papers selected for presentation at IPCO 2002, the NinthInternationalConferenceonIntegerProgrammingandCombinatorial- timization, Cambridge, MA (USA), May 27â??29,… Mehr…

new in stock. Versandkosten:zzgl. Versandkosten. (EUR 0.00)
5
Integer Programming and Combinatorial Optimization
Bestellen
bei eBook.de
€ 96,49
Versand: € 0,001
Bestellengesponserter Link
Integer Programming and Combinatorial Optimization - neues Buch

2002, ISBN: 9783540478676

Integer Programming and Combinatorial Optimization - 9th International IPCO Conference Cambridge MA USA May 27-29 2002. Proceedings: ab 96.49 € eBooks > Fachthemen & Wissenschaft > Mathem… Mehr…

Versandkosten:in stock, , , DE. (EUR 0.00)

1Da einige Plattformen keine Versandkonditionen übermitteln und diese vom Lieferland, dem Einkaufspreis, dem Gewicht und der Größe des Artikels, einer möglichen Mitgliedschaft der Plattform, einer direkten Lieferung durch die Plattform oder über einen Drittanbieter (Marketplace), etc. abhängig sein können, ist es möglich, dass die von eurobuch angegebenen Versandkosten nicht mit denen der anbietenden Plattform übereinstimmen.

Bibliographische Daten des bestpassenden Buches

Details zum Buch

Detailangaben zum Buch - Integer Programming and Combinatorial Optimization


EAN (ISBN-13): 9783540478676
Erscheinungsjahr: 2002
Herausgeber: Springer Berlin Heidelberg

Buch in der Datenbank seit 2017-02-18T15:08:02+01:00 (Zurich)
Detailseite zuletzt geändert am 2023-02-08T14:41:23+01:00 (Zurich)
ISBN/EAN: 9783540478676

ISBN - alternative Schreibweisen:
978-3-540-47867-6
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: william cook, william schulz, schulz andreas
Titel des Buches: combinatorial optimization, integer programming


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: 2003-08-01
Berlin; Heidelberg; DE
Sprache: Englisch
53,49 € (DE)
55,00 € (AT)
59,00 CHF (CH)
Available
XI, 487 p.

EA; E107; eBook; Nonbooks, PBS / 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; C; Theory of Computation; Probability Theory; Software Engineering; Discrete Mathematics in Computer Science; Numerical Analysis; Algorithms; Computer Science; Wahrscheinlichkeitsrechnung und Statistik; Stochastik; Software Engineering; Mathematik für Informatiker; Diskrete Mathematik; Numerische Mathematik; Algorithmen und Datenstrukturen; BC

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:
9783030738785 Integer Programming and Combinatorial Optimization (David P. Williamson)


< zum Archiv...