Integer Programming and Combinatorial Optimization整数规划与组合最优化

出版时间：2005-7  出版社：北京燕山出版社  作者：Junger, M.; Jnger, Michael; Kaibel, Volker  页数：484  
Tag标签：无  

内容概要

This book constitutes the refereed proceedings of the 11th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2005, held in Berlin, Germany in June 2005.    The 34 revised full papers presented were carefully reviewed and selected from 119 submissions. Among the topics addressed are mixed-integer programming, graph theory, graph algorithms, approximation, linear programming, approximability, packing, scheduling, computational geometry, randomization, network algorithms, sequencing, TSP, and travelling salesman problem.

书籍目录

Mixed-Integer Cuts from Cyclic GroupsOptimizing over the First Chvktal ClosureSequential Pairing of Mixed Integer InequalitiesApproximate Min-max Relations for Odd Cycles in Planar GraphsDisjoint Cycles: Integrality Gap, Hardness, and ApproximationA Combinatorial Algorithm to Find a Maximum Even FactorImproved Approximation Schemes for Linear Programming Relaxations of Combinatorial Optimization ProblemsOn the Approximability of the Minimum Congestion Unsplittable Shortest Path Routing ProblemInventory and Facility Location Models with Market SelectionOn Approximating Complex Quadratic Optimization Problems via Semidefinite Programming RelaxationsSemidefinite Bounds for the Stability Number of a Graph via Sums of Squares of PolynomialsApproximation Algorithms for Semidefinite Packing Problems with Applications to MAXCUT and Graph Coloring                     On the Inefficiency of Equilibria in Congestion GamesUnrelated Parallel Machine Scheduling with Resource Dependent Processing TimesLP-Based Online Scheduling: From Single to Parallel MachinesUnique Sink Orientations of GridsJumping Doesn't Help in Abstract CubesComputing the Inertia from Sign PatternsRandomized Relaxation Methods for the Maximum Feasible Subsystem ProblemOn Clique Separators, Nearly Chordal Graphs, and the Maximum Weight Stable Set ProblemSmoothed Analysis of Integer ProgrammingCircular Ones Matrices and the Stable Set Polytope of Quasi-line GraphsApproximation Algorithms for Stochastic Inventory Control ModelsOn Two-Stage Stochastic Minimum Spanning TreesCombinatorial Analysis of Generic Matrix Pencils……Author Index