Rainer e burkard (55 Ergebnisse)

Hardcover. Zustand: Near Fine. Zustand des Schutzumschlags: Fine. First Edition. 355p. Bookplate o/w fine.

Softcover-Großformat. Zustand: Gut. 292 Seiten; Das hier angebotene Buch stammt aus einer teilaufgelösten wissenschaftlichen Bibliothek und trägt die entsprechenden Kennzeichnungen (Rückenschild, Instituts-Stempel.); der Buchzustand ist ansonsten ordentlich und dem Alter entsprechend gut. Einbandkanten sind leicht bestoßen. Sprache: Deutsch Gewicht in Gramm: 465. …

Broschiert. Zustand: Gut. VIII, 292 S. : 45 graph. Darst.; Das hier angebotene Buch stammt aus einer teilaufgelösten wissenschaftlichen Bibliothek und trägt die entsprechenden Kennzeichnungen (Rückenschild, Instituts-Stempel.); leichte altersbedingte Anbräunung des Papiers; Buchrücken beginnt sich hinten zu lösen, es sind aber keine losen Buchseiten vorhanden; der Buchzustand ist ansonsten ordentlich und dem Alter entsprechend gut. Sprache: Deutsch Gewicht in Gramm: 480.…

Broschiert. Zustand: Gut. 292 Seiten; Das Buch befindet sich in einem ordentlich erhaltenen Zustand. Einbandkanten sind leicht bestoßen. Leichte altersbedingte Anbräunung des Papiers. Sprache: Deutsch Gewicht in Gramm: 440.

Zustand: New.

Paperback or Softback. Zustand: New. Integer Programming and Combinatorial Optimization: 7th International Ipco Conference, Graz, Austria, June 9-11, 1999, Proceedings. Book.

Zustand: New.

Zustand: New.

Zustand: As New. Unread book in perfect condition.

Dt. Erstausg. 24 cm 247 S. Oktn. tadellos. Ill., graph. Darst.

Zustand: New.

Zustand: New.

Zustand: New.

Zustand: New. In English.

Zustand: New.

Zustand: As New. Unread book in perfect condition.

Zustand: New.

Zustand: As New. Unread book in perfect condition.

Zustand: New.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Market Split and Basis Reduction: Towards a Solution of the Cornuéjols-Dawande Instances.- Approximation Algorithms for Maximum Coverage and Max Cut with Given Sizes of Parts.- Solving the Convex Cost Integer Dual Network Flow Problem.- Some Structural and Algorithmic Properties of the Maximum Feasible Subsystem Problem.- Valid Inequalities for Problems with Additive Variable Upper Bounds.- A Min-Max Theorem on Feedback Vertex Sets (Preliminary Version).- On the Separation of Maximally Violated mod-k Cuts.- Improved Approximation Algorithms for Capacitated Facility Location Problems.- Optimal 3-Terminal Cuts and Linear Programming.- Semidefinite Programming Methods for the Symmetric Traveling Salesman Problem.- Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube.- Universally Maximum Flow with Piecewise-Constant Capacities.- Critical Extreme Points of the 2-Edge Connected Spannning Subgraph Polytope.- An Orientation Theorem with Parity Conditions.- Parity Constrained k-Edge-Connected Orientations.- Approximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs.- On the Chvátal Rank of Certain Inequalities.- The Square-Free 2-Factor Problem in Bipartite Graphs.- The m-Cost ATSP.- A Strongly Polynomial Cut Canceling Algorithm for the Submodular Flow Problem.- Edge-Splitting Problems with Demands.- Integral Polyhedra Associated with Certain Submodular Functions Defined on 012-Vectors.- Optimal Compaction of Orthogonal Grid Drawings (Extended Abstract).- On the Number of Iterations for Dantzig-Wolfe Optimization and Packing-Covering Approximation Algorithms.- Experimental Evaluation of Approximation Algorithms for Single-Source Unsplittable Flow.- Approximation Algorithms for a Directed Network Design Problem.- Optimizing over AllCombinatorial Embeddings of a Planar Graph (Extended Abstract).- A Fast Algorithm for Computing Minimum 3-Way and 4-Way Cuts.- Scheduling Two Machines with Release Times.- An Introduction to Empty Lattice Simplices.- On Optimal Ear-Decompositions of Graphs.- Gale-Shapley Stable Marriage Problem Revisited: Strategic Issues and Applications (Extended Abstract).- Vertex-Disjoint Packing of Two Steiner Trees: Polyhedra and Branch-and-Cut.…

Zustand: New.

Zustand: New. In German.

Zustand: As New. Unread book in perfect condition.

Zustand: As New. Unread book in perfect condition.

Zustand: As New. Unread book in perfect condition.

Zustand: As New. Unread book in perfect condition.

Zustand: As New. Unread book in perfect condition.

Paperback. Zustand: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Zustand: Sehr gut. Zustand: Sehr gut | Seiten: 372 | Sprache: Englisch | Produktart: Bücher | Combinatorial and global optimization problems appear in a wide range of applications in operations research, engineering, biological science, and computer science. In combinatorial optimization and graph theory, many approaches have been developed that link the discrete universe to the continuous universe through geometric, analytic, and algebraic techniques. Such techniques include global optimization formulations, semidefinite programming, and spectral theory. Recent major successes based on these approaches include interior point algorithms for linear and discrete problems, the celebrated Goemans-Williamson relaxation of the maximum cut problem, and the Du-Hwang solution of the Gilbert-Pollak conjecture. Since integer constraints are equivalent to nonconvex constraints, the fundamental difference between classes of optimization problems is not between discrete and continuous problems but between convex and nonconvex optimization problems. This volume is a selection of refereed papers based on talks presented at a conference on "Combinatorial and Global Optimization" held at Crete, Greece.…

Zustand: New. pp. 328.