整数编程与组合优化/Integer programming and combinatorial optimization
点此进入淘宝搜索页搜索分類: 图书,进口原版书,科学与技术 Science & Techology ,
作者： William J. Cook著
出 版 社： 湖南文艺出版社
出版时间： 2002-12-1字数：版次： 1页数： 486印刷时间： 2002/12/01开本：印次：纸张： 胶版纸I S B N ： 9783540436768包装： 平装编辑推荐
The LNCS series reports state-of-the-art results in computer science research，development，and education，at a high level and in both printed and electronic form.Enjoying tight cooperation with the R&D community，with numerous individuals，as well as with prestigious organizations and societies，LNCS has grown into the most comprehensive computer science research forum available.
The scope of LNCS including its subseries LNAI spans the whole range of computer science and information technology including interdisciplinary topics in a variety of application fields.The type of material published traditionally includes.
—proceedings （published in time for the respective conference）
—post-proceedings （consisting of thoroughly revised final full papers）
—research monographs（which may be based on outstanding PhD work，research projects，technical reports，etc.）
内容简介
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 Functions
A Generalization of Edmonds' Matching and Matroid Intersection Algorithms
A Coordinatewise Domain Scaling Algorithm for M-convex Function Minimization
The Quickest Multicommodity Flow Problem
A New Min-Cut Max-Flow Ratio for Multicommodity Flows
Improved Rounding Techniques for the MAX 2-SAT and MAX DI-CUT Problems
Finding the Exact Integrality Gap for Small Traveling Salesman Problems
Polynomial-Time Separation of Simple Comb Inequalities
A New Approach to Cactus Construction Applied to TSP Support Graphs
Split Closure and Intersection Cuts
An Exponential Lower Bound on the Length of Some Classes of Branch-and-Cut Proofs
Lifted Inequalities for 0-1 Mixed Integer Programming: Basic Theory and Algorithms
On a Lemma of Scarf
A Short Proof of Seymour's Characterization of the Matroids with the Max-Flow Min-Cut Property
Integer Programming and Arrovian Social Welfare Functions
Integrated Logistics: Approximation Algorithms Combining Facility Location and Network Design
The Minimum Latency Problem Is NP-Hard for Weighted Trees
An Improved Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
A Polyhedral Approach to Surface Reconstruction from Planar Contours
The Semidefinite Relaxation of the k-Partition Polytope Is Strong
A Polyhedral Study of the Cardinality Constrained Knapsack Problem
A PTAS for Minimizing Total Completion Time of Bounded Batch Scheduling
An Approximation Scheme for the Two-Stage, Two-Dimensional Bin Packing Problem
On Preemptive Resource Constrained Scheduling: Polynomial-Time Approximation Schemes
Hard Equality Constrained Integer Knapsacks
The Distribution of Values in the Quadratic Assignment Problem
A New Subadditive Approach to Integer Programming
……
Author Index
