Titlebook: Integer Programming and Combinatorial Optimization; 9th International IP William J. Cook,Andreas S. Schulz Conference proceedings 2002 Spri

無動于衷

Lecture Notes in Computer Sciencehttp://image.papertrans.cn/i/image/468255.jpg

opalescence

A Faster Scaling Algorithm for Minimizing Submodular Functions,chrijver. The IFF algorithm employs a scaling scheme for submodular functions, whereas Schrijver’s algorithm exploits distance labeling. This paper combines these two techniques to yield a faster combinatorial algorithm for submodular function minimization. The resulting algorithm improves over the

輕快帶來危險

,A Generalization of Edmonds’ Matching and Matroid Intersection Algorithms,roved that this problem is solvable in polynomial time via the ellipsoid method. We present a polynomial-time combinatorial algorithm for its unweighted version that generalizes the known combinatorial algorithms for the cardinality matching problem and the matroid intersection problem.

神圣在玷污

Neonatal

The Quickest Multicommodity Flow Problem,this method makes available the whole algorithmic toolbox developed for static flows, its main and often fatal drawback is the enormous size of the time-expanded network. In particular, this approach usually does not lead to efficient algorithms with running time polynomial in the input size since t

大門在匯總

A New Min-Cut Max-Flow Ratio for Multicommodity Flows,tio, capacity of a cut is scaled by the demand that has to cross the cut. In the denominator, the maximum concurrent flow value is used. Our new bound is proportional to log(.*) where .* is the cardinality of the minimal vertex cover of the demand graph.

deficiency

Improved Rounding Techniques for the MAX 2-SAT and MAX DI-CUT Problems,s for the MAX 2-SAT and MAX DI-CUT problems. These approximation algorithms start by solving semidefinite programming relaxations of these problems. They then . the solution obtained, as suggested by Feige and Goemans. Finally, they round the rotated vectors using random hyperplanes chosen according

地殼

Finding the Exact Integrality Gap for Small Traveling Salesman Problems,hich seems promising for finding improved solutions for the STSP is the study of a linear relaxation of this problem called the Subtour Elimination Problem (SEP). A well known conjecture in combinatorial optimization says that the integrality gap of the SEP is 4/3 in the metric case. Currently the b

Dedication

包租車船