- 5 Ergebnisse
Kleinster Preis: € 39,99, größter Preis: € 55,60, Mittelwert: € 49,85
1
Integer Programming and Combinatorial Optimization: 4th International IPCO Conference, Copenhagen, Denmark, May 29 - 31, 1995. Proceedings Egon Balas
Bestellen
bei BarnesandNoble.com
€ 54,99
Bestellengesponserter Link

Integer Programming and Combinatorial Optimization: 4th International IPCO Conference, Copenhagen, Denmark, May 29 - 31, 1995. Proceedings Egon Balas - neues Buch

ISBN: 9783540594086

This volume constitutes the proceedings of the Fourth International Conference on Integer Programming and Combinatorial Optimization, IPCO '95, held in Copenhagen in May 1995 under the sp… Mehr…

new in stock. Versandkosten:zzgl. Versandkosten.
2
Integer Programming and Combinatorial Optimization
Bestellen
bei Springer.com
€ 53,49
Versand: € 0,001
Bestellengesponserter Link
Integer Programming and Combinatorial Optimization - neues Buch

ISBN: 9783540594086

This volume constitutes the proceedings of the Fourth International Conference on Integer Programming and Combinatorial Optimization, IPCO '95, held in Copenhagen in May 1995 under the sp… Mehr…

Nr. 978-3-540-59408-6. Versandkosten:Worldwide free shipping, , DE. (EUR 0.00)
3
Integer Programming and Combinatorial Optimization 4th International IPCO Conference, Copenhagen, Denmark, May 29 - 31, 1995. Proceedings - Clausen, Jens (Herausgeber); Balas, Egon (Herausgeber)
Bestellen
bei Achtung-Buecher.de
€ 55,60
Versand: € 0,001
Bestellengesponserter Link
Clausen, Jens (Herausgeber); Balas, Egon (Herausgeber):
Integer Programming and Combinatorial Optimization 4th International IPCO Conference, Copenhagen, Denmark, May 29 - 31, 1995. Proceedings - neues Buch

1995

ISBN: 3540594086

1995 Kartoniert / Broschiert EDV / Theorie / Programmieren / Allgemeines, Kombinatorik, Optimierung, Diskrete Mathematik, Wahrscheinlichkeitsrechnung und Statistik, Angewandte Mathemati… Mehr…

Versandkosten:Versandkostenfrei innerhalb der BRD. (EUR 0.00) MARZIES.de Buch- und Medienhandel, 14621 Schönwalde-Glien
4
Bestellen
bei ZVAB.com
€ 45,18
Versand: € 0,001
Bestellengesponserter Link
Balas, Egon und Jens Clausen:
Integer Programming and Combinatorial Optimization 4th International IPCO Conference, Copenhagen, Denmark, May 29 - 31, 1995. Proceedings - Taschenbuch

1995, ISBN: 3540594086

[EAN: 9783540594086], Gebraucht, guter Zustand, [SC: 0.0], [PU: Springer Berlin], POLYHEDRAL,COMBINATORIAL OPTIMIZATION,COMBINATORICS,ALGORITHM,INTEGER-PROGRAMMING,MATHEMATIAL PROGRAMMING… Mehr…

NOT NEW BOOK. Versandkosten:Versandkostenfrei. (EUR 0.00) Buchpark, Trebbin, Germany [83435977] [Rating: 5 (von 5)]
5
Integer Programming and Combinatorial Optimization 4th International IPCO Conference, Copenhagen, Denmark, May 29 - 31, 1995. Proceedings 1995 - Balas, Egon und Jens Clausen
Bestellen
bei buchfreund.de
€ 39,99
Versand: € 0,001
Bestellengesponserter Link
Balas, Egon und Jens Clausen:
Integer Programming and Combinatorial Optimization 4th International IPCO Conference, Copenhagen, Denmark, May 29 - 31, 1995. Proceedings 1995 - gebrauchtes Buch

1995, ISBN: 9783540594086

1995 Gepflegter, sauberer Zustand. Aus der Auflösung einer renommierten Bibliothek. Kann Stempel beinhalten. 425428/202 Versandkostenfreie Lieferung Polyhedral,CombinatoriaL Optimization,… Mehr…

Versandkosten:Versandkostenfrei innerhalb der BRD. (EUR 0.00) Buchpark GmbH, 14959 Trebbin

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
Integer Programming and Combinatorial Optimization: 4th International IPCO Conference, Copenhagen, Denmark, May 29 - 31, 1995. Proceedings Egon Balas

This volume constitutes the proceedings of the Fourth International Conference on Integer Programming and Combinatorial Optimization, IPCO '95, held in Copenhagen in May 1995 under the sponsorship of the Mathematical Programming Society.Integer programming and combinatorial optimization provide a fruitful theoretical and algorithmic basis for the solution of a number of optimization problems occuring in real-world situations, such as production planning and scheduling, routing, crew scheduling, or network construction. This volume presents 36 revised papers selected from a total of 105 submissions and offers a representative up-to-date snapshot on the state of the art in this interdisciplinary area of research and applications.

Detailangaben zum Buch - Integer Programming and Combinatorial Optimization: 4th International IPCO Conference, Copenhagen, Denmark, May 29 - 31, 1995. Proceedings Egon Balas


EAN (ISBN-13): 9783540594086
ISBN (ISBN-10): 3540594086
Gebundene Ausgabe
Taschenbuch
Erscheinungsjahr: 1995
Herausgeber: Springer Berlin Heidelberg Core >1 >T
463 Seiten
Gewicht: 0,725 kg

Buch in der Datenbank seit 2007-05-08T17:19:15+02:00 (Zurich)
Detailseite zuletzt geändert am 2024-01-17T22:10:44+01:00 (Zurich)
ISBN/EAN: 9783540594086

ISBN - alternative Schreibweisen:
3-540-59408-6, 978-3-540-59408-6
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: clausen jens, egon balas
Titel des Buches: integer programming combinatorial optimization, international optimization, lecture notes computer science, pro, denmark, copenhagen, 1995


Daten vom Verlag:

Autor/in: Egon Balas; Jens Clausen
Titel: Lecture Notes in Computer Science; Integer Programming and Combinatorial Optimization - 4th International IPCO Conference, Copenhagen, Denmark, May 29 - 31, 1995. Proceedings
Verlag: Springer; Springer Berlin
474 Seiten
Erscheinungsjahr: 1995-05-17
Berlin; Heidelberg; DE
Sprache: Englisch
53,49 € (DE)
54,99 € (AT)
59,00 CHF (CH)
Available
X, 474 p.

BC; Hardcover, Softcover / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; Algorithms; CombinatoriaL Optimization; Integer-Programming; Kombinatorische Optimierung; Mathematial Programming; Optimerungsalgorithmen; Optimization Algorithms; Polyhedral; algorithm; optimization; programming; algorithm analysis and problem complexity; combinatorics; Theory of Computation; Probability Theory; Applications of Mathematics; Algorithms; Numerical Analysis; Discrete Mathematics; Wahrscheinlichkeitsrechnung und Statistik; Stochastik; Angewandte Mathematik; Algorithmen und Datenstrukturen; Numerische Mathematik; Diskrete Mathematik; EA

Improved approximation algorithms for MAX k-CUT and MAX BISECTION.- Approximating minimum feedback sets and multi-cuts in directed graphs.- Nonlinear formulations and improved randomized approximation algorithms for multicut problems.- Separating clique tree and bipartition inequalities in polynomial time.- The interval order polytope of a digraph.- Separation problems for the stable set polytope.- Computational study of a family of mixed-integer quadratic programming problems.- A minimal algorithm for the Bounded Knapsack Problem.- A framework for tightening 0–1 programs based on extensions of pure 0–1 KP and SS problems.- Combining semidefinite and polyhedral relaxations for integer programs.- Distributed near-optimal matching.- The random linear bottleneck assignment problem.- On implementing push-relabel method for the maximum flow problem.- Use of hidden network structure in the set partitioning problem.- Generalized max flows and augmenting paths.- Oriented matroid polytopes and polyhedral fans are signable.- On combinatorial properties of binary spaces.- Coverings and delta-coverings.- The topological structure of maximal lattice free convex bodies: The general case.- The Hilbert basis of the cut cone over the complete graph K 6.- GRIN: An implementation of Gröbner bases for integer programming.- Scheduling jobs of equal length: Complexity, facets and computational results.- Formulating a scheduling problem with almost identical jobs by using positional completion times.- Scheduling unit jobs with compatible release dates on parallel machines with nonstationary speeds.- A mickey-mouse decomposition theorem.- Minimum cost dynamic flows: The series-parallel case.- (0, ±1) ideal matrices.- Embedding graphs in the torus in linear time.- A characterization ofSeymour graphs.- The Markov chain of colourings.- Packing algorithms for arborescences (and spanning trees) in capacitated graphs.- A faster edge splitting algorithm in multigraphs and its application to the edge-connectivity augmentation problem.- How to make a strongly connected digraph two-connected.- Polyhedra and optimization in connection with a weak majorization ordering.- Combining and strengthening Gomory cuts.- Sequence independent lifting of cover inequalities.

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)


< zum Archiv...