Integer Programming and Combinatorial Optimization: 9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002. Proceedings
William J. Cook, Andreas S. Schulz
Springer, Jun 20, 2002 - Computers - 487 pages
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.
What people are saying - Write a review
We haven't found any reviews in the usual places.
A Faster Scaling Algorithm for Minimizing Submodular Functions
A Coordinatewise Domain Scaling Algorithm
The Quickest Multicommodity Flow Problem
22 other sections not shown
Other editions - View all
approximation algorithm assume ASWF backup batch branch-and-cut cable cactus column comb inequalities Combinatorial Optimization compute consider constraints contains continuous variables corresponding cost CPLEX defined demand matching denote disjunction dual edges exists facet facility location feasible solution flow problem formulation FPTAS given graph G Hence heuristic implies input instance integer linear programming integer programming integrality gap IPCO iteration knapsack problem Lemma lifting linear programming LNCS lower bound LP relaxation Mathematics matrix matroid MAX 2-SAT MAX DI-CUT maximum mincut minimal minimum node NP-hard obtain Operations Research optimal solution packing partition path permutation polynomial polytope Proof Proposition random ratio relaxation resource constrained scheduling result rounding procedure satisfies schedule Sect semidefinite semidefinite programming shelves solve Steiner tree subadditive function submodular subset support graph surface Theorem tooth inequalities Traveling Salesman Problem triangle valid inequalities vector vertex vertices weight