整數(shù)編程與組合優(yōu)化/Integer programming and combinatorial optimization

內(nèi)容概要

This book constitutes the refereed proceedings of the 9th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2002, held in Cambridge, MA, USA, in May 2002.The 33 revised full papers presented were carefully reviewed and selected from a total of 110 submissions. Among the topics covered are scaling algorithms, flow algorithms, combinatorial optimization algorithms, approximate TSP solutions, graph computations, algorithmic geometry, mixed integer programming, network design, logistic scheduling, constraint solving, resource allocation, matching algorithms, and matroid intersection algorithms.

書籍目錄

A Faster Scaling Algorithm for Minimizing Submodular FunctionsA Generalization of Edmonds' Matching and Matroid Intersection AlgorithmsA Coordinatewise Domain Scaling Algorithm for M-convex Function MinimizationThe Quickest Multicommodity Flow ProblemA New Min-Cut Max-Flow Ratio for Multicommodity FlowsImproved Rounding Techniques for the MAX 2-SAT and MAX DI-CUT ProblemsFinding the Exact Integrality Gap for Small Traveling Salesman ProblemsPolynomial-Time Separation of Simple Comb Inequalities A New Approach to Cactus Construction Applied to TSP Support GraphsSplit Closure and Intersection CutsAn Exponential Lower Bound on the Length of Some Classes of Branch-and-Cut ProofsLifted Inequalities for 0-1 Mixed Integer Programming: Basic Theory and AlgorithmsOn a Lemma of ScarfA Short Proof of Seymour's Characterization of the Matroids with the Max-Flow Min-Cut PropertyInteger Programming and Arrovian Social Welfare FunctionsIntegrated Logistics: Approximation Algorithms Combining Facility Location and Network DesignThe Minimum Latency Problem Is NP-Hard for Weighted TreesAn Improved Approximation Algorithm for the Metric Uncapacitated Facility Location ProblemA Polyhedral Approach to Surface Reconstruction from Planar ContoursThe Semidefinite Relaxation of the k-Partition Polytope Is StrongA Polyhedral Study of the Cardinality Constrained Knapsack ProblemA PTAS for Minimizing Total Completion Time of Bounded Batch SchedulingAn Approximation Scheme for the Two-Stage, Two-Dimensional Bin Packing ProblemOn Preemptive Resource Constrained Scheduling: Polynomial-Time Approximation SchemesHard Equality Constrained Integer KnapsacksThe Distribution of Values in the Quadratic Assignment ProblemA New Subadditive Approach to Integer Programming……Author Index

圖書封面

評(píng)論、評(píng)分、閱讀與下載

---

    整數(shù)編程與組合優(yōu)化/Integer programming and combinatorial optimization PDF格式下載

---