תמונות העטיפה

Integer Programming and Combinatorial Optimization 11th International IPCO Conference, Berlin, Germany, June 8-10, 2005, Proceedings /

Since its start in 1990, the IPCO conference series (held under the auspices of theMathematicalProgrammingSociety)hasbecomeanimportantforumforthe presentation of recent results in Integer Programming and Combinatorial Op- mization. This volume compiles the papers presented at IPCO XI, the eleventh c...

תיאור מלא

שמור ב:
מידע ביבליוגרפי
מחבר תאגידי: SpringerLink (Online service)
מחברים אחרים: Jünger, Michael. (Editor, http://id.loc.gov/vocabulary/relators/edt), Kaibel, Volker. (Editor, http://id.loc.gov/vocabulary/relators/edt)
פורמט: אלקטרוני ספר אלקטרוני
שפה:English
יצא לאור: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2005.
מהדורה:1st ed. 2005.
סדרה:Theoretical Computer Science and General Issues ; 3509
נושאים:
Computer science—Mathematics.
Numerical analysis.
Algorithms.
Computer graphics.
Discrete Mathematics in Computer Science.
Numeric Computing.
Algorithm Analysis and Problem Complexity.
Computer Graphics.
גישה מקוונת:https://doi.org/10.1007/b137143
תגים: הוספת תג
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!
תוכן הענינים:
  • Mixed-Integer Cuts from Cyclic Groups
  • Optimizing over the First Chvàtal Closure
  • Sequential Pairing of Mixed Integer Inequalities
  • Approximate Min-max Relations for Odd Cycles in Planar Graphs
  • Disjoint Cycles: Integrality Gap, Hardness, and Approximation
  • A Combinatorial Algorithm to Find a Maximum Even Factor
  • Improved Approximation Schemes for Linear Programming Relaxations of Combinatorial Optimization Problems
  • On the Approximability of the Minimum Congestion Unsplittable Shortest Path Routing Problem
  • Inventory and Facility Location Models with Market Selection
  • On Approximating Complex Quadratic Optimization Problems via Semidefinite Programming Relaxations
  • Semidefinite Bounds for the Stability Number of a Graph via Sums of Squares of Polynomials
  • Approximation Algorithms for Semidefinite Packing Problems with Applications to Maxcut and Graph Coloring
  • On the Inefficiency of Equilibria in Congestion Games
  • Unrelated Parallel Machine Scheduling with Resource Dependent Processing Times
  • LP-Based Online Scheduling: From Single to Parallel Machines
  • Unique Sink Orientations of Grids
  • Jumping Doesn’t Help in Abstract Cubes
  • Computing the Inertia from Sign Patterns
  • Randomized Relaxation Methods for the Maximum Feasible Subsystem Problem
  • On Clique Separators, Nearly Chordal Graphs, and the Maximum Weight Stable Set Problem
  • Smoothed Analysis of Integer Programming
  • Circular Ones Matrices and the Stable Set Polytope of Quasi-Line Graphs
  • Approximation Algorithms for Stochastic Inventory Control Models
  • On Two-Stage Stochastic Minimum Spanning Trees
  • Combinatorial Analysis of Generic Matrix Pencils
  • Power Optimization for Connectivity Problems
  • Packing Steiner Forests
  • Bidimensional Packing by Bilinear Programming
  • On the L ???-Norm of Extreme Points for Crossing Supermodular Directed Network LPs
  • Virtual Private Network Design: A Proof of the Tree Routing Conjecture on Ring Networks
  • Approximation Algorithms for the Minimum Cardinality Two-Connected Spanning Subgraph Problem
  • Using Grammars to Generate Very Large Scale Neighborhoods for the Traveling Salesman Problem and Other Sequencing Problems
  • A Study of Domino-Parity and k-Parity Constraints for the TSP
  • Not Every GTSP Facet Induces an STSP Facet.

פריטים דומים