Integer Programming and Combinatorial Optimization: 6Th International Ipco Conference, Houston, Texas, June 22-24, 1998, Proceedings (Lecture Notes In ... Notes in Computer Science, 1412, Band 1412) - Taschenbuch

EAN (ISBN-13): 9783540645900
ISBN (ISBN-10): 354064590X
Gebundene Ausgabe
Taschenbuch
Erscheinungsjahr: 1998
Herausgeber: Bixby, Robert E. Boyd, Andrew E. Rios-Mercado, Roger Z. Springer

Buch in der Datenbank seit 2007-10-25T19:46:25+02:00 (Zurich)
Detailseite zuletzt geändert am 2023-11-10T19:24:08+01:00 (Zurich)
ISBN/EAN: 9783540645900

ISBN - alternative Schreibweisen:
3-540-64590-X, 978-3-540-64590-0
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: integer, robert boyd, boyd rice, mercado, bixby
Titel des Buches: integer programming combinatorial optimization, international conference computer science

---

Daten vom Verlag:

Autor/in: Robert E. Bixby; Andrew E. Boyd; Roger Z. Rios-Mercado
Titel: Lecture Notes in Computer Science; Integer Programming and Combinatorial Optimization - 6th International IPCO Conference Houston, Texas, June 22–24, 1998 Proceedings
Verlag: Springer; Springer Berlin
435 Seiten
Erscheinungsjahr: 1998-06-05
Berlin; Heidelberg; DE
Sprache: Englisch
53,49 € (DE)
54,99 € (AT)
59,00 CHF (CH)
Available
IX, 435 p. 55 illus., 18 illus. in color.

BC; Hardcover, Softcover / Mathematik/Wahrscheinlichkeitstheorie, Stochastik, Mathematische Statistik; Algorithmen und Datenstrukturen; Verstehen; Approximation Algorithms; Graph Computations; Integer Programming; Networking; Scheduling; algorithms; combinatorial optimization; optimization; algorithm analysis and problem complexity; combinatorics; Algorithms; Discrete Mathematics in Computer Science; Calculus of Variations and Optimization; Discrete Mathematics; Mathematik für Informatiker; Diskrete Mathematik; Optimierung; EA

0,1 Matrices, Matroids.- The Packing Property.- A Characterization of Weakly Bipartite Graphs.- Bipartite Designs.- Characterizing Noninteger Polyhedra with 0–1 Constraints.- A Theorem of Truemper.- The Generalized Stable Set Problem for Claw-Free Bidirected Graphs.- On a Min-max Theorem of Cacti.- Edge Connectivity.- Edge-Splitting and Edge-Connectivity Augmentation in Planar Graphs.- A New Bound for the 2-Edge Connected Subgraph Problem.- An Improved Approximation Algorithm for Minimum Size 2-Edge Connected Spanning Subgraphs.- Algorithms.- Multicuts in Unweighted Graphs with Bounded Degree and Bounded Tree-Width.- Approximating Disjoint-Path Problems Using Greedy Algorithms and Packing Integer Programs.- Approximation Algorithms for the Mixed Postman Problem.- Improved Approximation Algorithms for Uncapacitated Facility Location.- The Maximum Traveling Salesman Problem Under Polyhedral Norms.- Integer Programming Applications.- Polyhedral Combinatorics of Benzenoid Problems.- Consecutive Ones and a Betweenness Problem in Computational Biology.- Solving a Linear Diophantine Equation with Lower and Upper Bounds on the Variables.- Integer Programming Computation.- The Intersection of Knapsack Polyhedra and Extensions.- New Classes of Lower Bounds for Bin Packing Problems.- Solving Integer and Disjunctive Programs by Lift and Project.- A Class of Hard Small 0—1 Programs.- Network Flows.- Building Chain and Cactus Representations of All Minimum Cuts from Hao-Orlin in the Same Asymptotic Run Time.- Simple Generalized Maximum Flow Algorithms.- The Pseudoflow Algorithm and the Pseudoflow-Based Simplex for the Maximum Flow Problem.- An Implementation of a Combinatorial Approximation Algorithm for Minimum-Cost Multicommodity Flow.- Scheduling.- Non-approximability Resultsfor Scheduling Problems with Minsum Criteria.- Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems.- An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines.- On the Relationship Between Combinatorial and LP-Based Approaches to NP-Hard Scheduling Problems.- Quadratic Assignment Problems.- Polyhedral Combinatorics of Quadratic Assignment Problems with Less Objects than Locations.- Incorporating Inequality Constraints in the Spectral Bundle Method.