Primal separation for 0/1 polytopes |
| |
Authors: | Friedrich Eisenbrand Giovanni Rinaldi Paolo Ventura |
| |
Affiliation: | (1) Max-Planck-Institut für Informatik, Stuhlsatzenhausweg 85, 66123 Saarbrücken, Germany, e-mail: eisen@mpi-sb.mpg.de, DE;(2) Istituto di Analisi dei Sistemi ed Informatica ``Antonio Ruberti' del CNR, Viale Manzoni 30-00185 Roma, Italy, e-mail: rinaldi@iasi.rm.cnr.it, ventura@iasi.rm.cnr.it, IT |
| |
Abstract: | The 0/1 primal separation problem is: Given an extreme point xˉ of a 0/1 polytope P and some point x *, find an inequality which is tight at xˉ, violated by x * and valid for P or assert that no such inequality exists. It is known that this separation variant can be reduced to the standard separation problem for P. We show that 0/1 optimization and 0/1 primal separation are polynomial time equivalent. This implies that the problems 0/1 optimization, 0/1 standard separation, 0/1 augmentation, and 0/1 primal separation are polynomial time equivalent. Then we provide polynomial time primal separation procedures for matching, stable set, maximum cut, and maximum bipartite graph problems, giving evidence that these algorithms are conceptually simpler and easier to implement than their corresponding counterparts for standard separation. In particular, for perfect matching we present an algorithm for primal separation that rests only on simple max-flow computations. In contrast, the known standard separation method relies on an explicit minimum odd cut algorithm. Consequently, we obtain a very simple proof that a maximum weight perfect matching of a graph can be computed in polynomial time. Received: August 20, 2001 / Accepted: April 2002 Published online: December 9, 2002 RID="⋆" ID="⋆" This research was developed while the author was on leave at the Istituto di Analisi dei Sistemi ed Informatica, Viale Manzoni 30, 00185 Roma, supported by the project TMR-DONET nr. ERB FMRX-CT98-0202 of the European Union. Mathematics Subject Classification (2000): 90C10, 90C60, 90C57 |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|