- 5 Ergebnisse
Kleinster Preis: € 87,45, größter Preis: € 123,07, Mittelwert: € 103,30
1
Integer Programming and Combinatorial Optimization
Bestellen
bei Orellfuessli.ch
CHF 125,90
(ca. € 120,84)
Versand: € 17,281
Bestellengesponserter Link

Integer Programming and Combinatorial Optimization - neues Buch

2007, ISBN: 9783540727927

This book constitutes the refereed proceedings of the 12th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2007, held in Ithaca, NY, USA, in June 2007… Mehr…

Nr. A1038250160. Versandkosten:Lieferzeiten außerhalb der Schweiz 3 bis 21 Werktage, , Sofort per Download lieferbar, zzgl. Versandkosten. (EUR 17.28)
2
Integer Programming and Combinatorial Optimization
Bestellen
bei Orellfuessli.ch
CHF 125,90
(ca. € 123,07)
Versand: € 17,601
Bestellengesponserter Link
Integer Programming and Combinatorial Optimization - neues Buch

2007, ISBN: 9783540727927

This book constitutes the refereed proceedings of the 12th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2007, held in Ithaca, NY, USA, in June 2007… Mehr…

Nr. A1038250160. Versandkosten:Lieferzeiten außerhalb der Schweiz 3 bis 21 Werktage, , Sofort per Download lieferbar, zzgl. Versandkosten. (EUR 17.60)
3
Integer Programming and Combinatorial Optimization : 12th International IPCO Conference, Ithaca, NY, USA, June 25-27, 2007, Proceedings - Michael J Krische
Bestellen
bei hive.co.uk
£ 76,08
(ca. € 88,85)
Bestellengesponserter Link
Michael J Krische:
Integer Programming and Combinatorial Optimization : 12th International IPCO Conference, Ithaca, NY, USA, June 25-27, 2007, Proceedings - neues Buch

2007

ISBN: 9783540727927

This book constitutes the refereed proceedings of the 12th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2007, held in Ithaca, NY, USA, in June 2007… Mehr…

No. 9783540727927. Versandkosten:Instock, Despatched same working day before 3pm, zzgl. Versandkosten.
4
Integer Programming and Combinatorial Optimization - Springer
Bestellen
bei Thalia.de
€ 96,29
Versand: € 0,001
Bestellengesponserter Link
Springer:
Integer Programming and Combinatorial Optimization - neues Buch

2007, ISBN: 9783540727927

This book constitutes the refereed proceedings of the 12th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2007, held in Ithaca, NY, USA, in June 2007… Mehr…

Nr. 44257081. Versandkosten:, Sofort per Download lieferbar, DE. (EUR 0.00)
5
Integer Programming and Combinatorial Optimization : 12th International IPCO Conference, Ithaca, NY, USA, June 25-27, 2007, Proceedings - Franz Jurgen Sacker
Bestellen
bei hive.co.uk
£ 76,50
(ca. € 87,45)
Bestellengesponserter Link
Franz Jurgen Sacker:
Integer Programming and Combinatorial Optimization : 12th International IPCO Conference, Ithaca, NY, USA, June 25-27, 2007, Proceedings - neues Buch

2007, ISBN: 9783540727927

; PDF; Scientific, Technical and Medical > Mathematics > Probability & statistics, Peter Lang GmbH, Internationaler Verlag der Wissen

No. 9783540727927. Versandkosten:Instock, Despatched same working day before 3pm, zzgl. Versandkosten.

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): 9783540727927
Erscheinungsjahr: 2007
Herausgeber: Springer Berlin Heidelberg

Buch in der Datenbank seit 2017-04-19T00:31:11+02:00 (Zurich)
Detailseite zuletzt geändert am 2024-03-12T19:54:39+01:00 (Zurich)
ISBN/EAN: 9783540727927

ISBN - alternative Schreibweisen:
978-3-540-72792-7
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: williamson, verlag gmbh, jürgen lang, peter jürgen, peter franz
Titel des Buches: combinatorial optimization, integer programming


Daten vom Verlag:

Autor/in: Matteo Fischetti; David P. Williamson
Titel: Theoretical Computer Science and General Issues; Lecture Notes in Computer Science; Integer Programming and Combinatorial Optimization - 12th International IPCO Conference, Ithaca, NY, USA, June 25-27, 2007, Proceedings
Verlag: Springer; Springer Berlin
502 Seiten
Erscheinungsjahr: 2007-06-26
Berlin; Heidelberg; DE
Sprache: Englisch
53,49 € (DE)
55,00 € (AT)
59,00 CHF (CH)
Available
IX, 502 p.

EA; E107; eBook; Nonbooks, PBS / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; algorithm; algorithms; combinatorial optimization; combinatorics; complexity; computational geometry; game theory; optimization; programming; algorithm analysis and problem complexity; C; Theory of Computation; Software Engineering; Probability Theory; Discrete Mathematics in Computer Science; Numerical Analysis; Algorithms; Computer Science; Software Engineering; Wahrscheinlichkeitsrechnung und Statistik; Stochastik; Mathematik für Informatiker; Diskrete Mathematik; Numerische Mathematik; Algorithmen und Datenstrukturen; BC

Session 1.- Inequalities from Two Rows of a Simplex Tableau.- Cuts for Conic Mixed-Integer Programming.- Sequential-Merge Facets for Two-Dimensional Group Problems.- Session 2.- Triangle-Free Simple 2-Matchings in Subcubic Graphs (Extended Abstract).- The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization.- Finding a Polytope from Its Graph in Polynomial Time.- Session 3.- Orbitopal Fixing.- New Variants of Lift-and-Project Cut Generation from the LP Tableau: Open Source Implementation and Testing.- Orbital Branching.- Session 4.- Distinct Triangle Areas in a Planar Point Set.- Scheduling with Precedence Constraints of Low Fractional Dimension.- Approximation Algorithms for 2-Stage Stochastic Scheduling Problems.- Session 5.- On Integer Programming and the Branch-Width of the Constraint Matrix.- Matching Problems in Polymatroids Without Double Circuits.- Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract).- Session 6.- On a Generalization of the Master Cyclic Group Polyhedron.- A Framework to Derive Multidimensional Superadditive Lifting Functions and Its Applications.- On the Exact Separation of Mixed Integer Knapsack Cuts.- Session 7.- A Faster Strongly Polynomial Time Algorithm for Submodular Function Minimization.- On Convex Minimization over Base Polytopes.- Computational Geometric Approach to Submodular Function Minimization for Multiclass Queueing Systems.- Session 8.- Generating Multiple Solutions for Mixed Integer Programming Problems.- A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations.- DINS, a MIP Improvement Heuristic.- Session 9.- Mixed-Integer Vertex Covers on Bipartite Graphs.- On the MIR Closure of Polyhedra.- The Intersection of ContinuousMixing Polyhedra and the Continuous Mixing Polyhedron with Flows.- Session 10.- Simple Explicit Formula for Counting Lattice Points of Polyhedra.- Characterizations of Total Dual Integrality.- Sign-Solvable Linear Complementarity Problems.- Session 11.- An Integer Programming Approach for Linear Programs with Probabilistic Constraints.- Infrastructure Leasing Problems.- Robust Combinatorial Optimization with Exponential Scenarios.- Session 12.- Approximation Algorithms for the Multi-item Capacitated Lot-Sizing Problem Via Flow-Cover Inequalities.- Optimal Efficiency Guarantees for Network Design Mechanisms.- The Set Connector Problem in Graphs.

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