ISBN: 9783540684534
This volume presents the proceedings of the Fifth Integer Programming and Combinatorial Optimization Conference, IPCO V, held in Vancouver, British Columbia, Canada, in June 1996. The 36 … Mehr…
| Springer.com new in stock. Versandkosten:zzgl. Versandkosten. Details... |
ISBN: 9783540684534
This volume presents the proceedings of the Fifth Integer Programming and Combinatorial Optimization Conference, IPCO V, held in Vancouver, British Columbia, Canada, in June 1996. The 36 … Mehr…
| Springer.com Nr. 978-3-540-68453-4. Versandkosten:Worldwide free shipping, , DE. (EUR 0.00) Details... |
ISBN: 9783540684534
Computer Science; Theory of Computation; Probability Theory and Stochastic Processes; Software Engineering/Programming and Operating Systems; Algorithm Analysis and Problem Complexity; Ca… Mehr…
| Springer.com Versandkosten: EUR 0.00 Details... |
ISBN: 9783540684534
Computer Science; Theory of Computation; Probability Theory and Stochastic Processes; Software Engineering/Programming and Operating Systems; Algorithm Analysis and Problem Complexity; Ca… Mehr…
| Springer.com Versandkosten:zzgl. Versandkosten. Details... |
ISBN: 9783540684534
Computer Science; Theory of Computation; Probability Theory and Stochastic Processes; Software Engineering/Programming and Operating Systems; Algorithm Analysis and Problem Complexity; Ca… Mehr…
| Springer.com Versandkosten:zzgl. Versandkosten. Details... |
ISBN: 9783540684534
This volume presents the proceedings of the Fifth Integer Programming and Combinatorial Optimization Conference, IPCO V, held in Vancouver, British Columbia, Canada, in June 1996. The 36 … Mehr…
ISBN: 9783540684534
This volume presents the proceedings of the Fifth Integer Programming and Combinatorial Optimization Conference, IPCO V, held in Vancouver, British Columbia, Canada, in June 1996. The 36 … Mehr…
ISBN: 9783540684534
Computer Science; Theory of Computation; Probability Theory and Stochastic Processes; Software Engineering/Programming and Operating Systems; Algorithm Analysis and Problem Complexity; Ca… Mehr…
ISBN: 9783540684534
Computer Science; Theory of Computation; Probability Theory and Stochastic Processes; Software Engineering/Programming and Operating Systems; Algorithm Analysis and Problem Complexity; Ca… Mehr…
ISBN: 9783540684534
Computer Science; Theory of Computation; Probability Theory and Stochastic Processes; Software Engineering/Programming and Operating Systems; Algorithm Analysis and Problem Complexity; Ca… Mehr…
Bibliographische Daten des bestpassenden Buches
| Autor: | |
| Titel: | |
| ISBN-Nummer: |
Detailangaben zum Buch - Integer Programming and Combinatorial Optimization
EAN (ISBN-13): 9783540684534
Herausgeber: Springer Science+Business Media
Buch in der Datenbank seit 2017-05-08T08:35:43+02:00 (Zurich)
Detailseite zuletzt geändert am 2024-03-13T14:05:58+01:00 (Zurich)
ISBN/EAN: 9783540684534
ISBN - alternative Schreibweisen:
978-3-540-68453-4
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: william thomas, cunningham, maurice william, mccormick
Titel des Buches: combinatorial optimization, integer programming
Daten vom Verlag:
Autor/in: William H. Cunningham; S. Thomas McCormick; Maurice Queyranne
Titel: Lecture Notes in Computer Science; Integer Programming and Combinatorial Optimization - 5th International IPCO Conference Vancouver, British Columbia, Canada June 3–5, 1996 Proceedings
Verlag: Springer; Springer Berlin
514 Seiten
Erscheinungsjahr: 2005-07-15
Berlin; Heidelberg; DE
Sprache: Englisch
53,49 € (DE)
55,00 € (AT)
59,00 CHF (CH)
Available
X, 514 p. 18 illus.
EA; E107; eBook; Nonbooks, PBS / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; Ganzzahliges Programmieren; Handlungsreisendenproblem (TSP); Kombiatorische Algorithmen; Kombinatorische Optimierung; algorithms; combinatorial algorithms; combinatorial optimization; integer programming; programming; scheduling; traveling salesman problem (TSP); algorithm analysis and problem complexity; combinatorics; C; Theory of Computation; Probability Theory; Software Engineering; Algorithms; Calculus of Variations and Optimization; Discrete Mathematics; Computer Science; Wahrscheinlichkeitsrechnung und Statistik; Stochastik; Software Engineering; Algorithmen und Datenstrukturen; Optimierung; Diskrete Mathematik; BC
Colourful linear programming.- Test sets and inequalities for integer programs.- An optimal, stable continued fraction algorithm for arbitrary dimension.- Algorithms and extended formulations for one and two facility network design.- Integer multicommodity flow problems.- A heuristic algorithm for the set covering problem.- An ?-Relaxation method for generalized separable convex cost network flow problems.- Finding real-valued single-source shortest paths in o(n 3) expected time.- A network-flow technique for finding low-weight bounded-degree spanning trees.- Approximating k-set cover and complementary graph coloring.- On minimum 3-cuts and approximating k-cuts using Cut Trees.- Primal-dual approximation algorithms for feedback problems in planar graphs.- Cone-LP's and semidefinite programs: Geometry and a simplex-type method.- Quadratic knapsack relaxations using cutting planes and semidefinite programming.- A semidefinite bound for mixing rates of Markov chains.- The quadratic assignment problem with a monotone anti-monge and a symmetric toeplitz matrix: Easy and hard cases.- On optimizing multiplications of sparse matrices.- Continuous relaxations for Constrained Maximum-Entropy Sampling.- A submodular optimization problem with side constraints.- Convexity and Steinitz's exchange property.- On ideal clutters, metrics and multiflows.- A supermodular relaxation for scheduling with release dates.- Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds.- Implementation of a linear time algorithm for certain generalized traveling salesman problems.- On dependent randomized rounding algorithms.- Coloring bipartite hypergraphs.- Improved randomized approximation algorithms for lot-sizing problems.- Minimizingtotal completion time in a two-machine flowshop: Analysis of special cases.- A new approach to computing optimal schedules for the job-shop scheduling problem.- Optimal on-line algorithms for single-machine scheduling.- The strongest facets of the acyclic subgraph polytope are unknown.- Transitive packing.- A polyhedral approach to the feedback vertex set problem.- Separating over classes of TSP inequalities defined by 0 node-lifting in polynomial time.- Separating maximally violated comb inequalities in planar graphs.- The travelling salesman and the PQ-tree.Weitere, andere Bücher, die diesem Buch sehr ähnlich sein könnten:
Neuestes ähnliches Buch:
9783030738785 Integer Programming and Combinatorial Optimization (David P. Williamson)
- 9783030738785 Integer Programming and Combinatorial Optimization (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)
- 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)
- 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)
< zum Archiv...