Extended formulations for multiways cuts in graphs

Conference · Sat Dec 31 00:00:00 EST 1994

OSTI ID:35904

Chopra, S; Owen, J

Given and undirected graph G = (V, E) and a subset A of V, we consider the problem of finding a minimum cost set of edges whose deletion separates every pair of nodes in A. Two extended formulations using both node and edge variables are presented. The LP-relaxations of the extended formulations are shown to give a tighter lower bound than the LP-relaxation of the natural edge variable formulation (even with an extra class of valid inequalities added). This is interesting because the LP-relaxations of the extended formulations can be solved in polynomial time while the LP-relaxation of the natural formulation cannot. Computational results using the extended formulations are presented.

• OSTI ID: 35904
• Report Number(s): CONF-9408161-; TRN: 94:009753-0167
• Resource Relation: Conference: 15. international symposium on mathematical programming, Ann Arbor, MI (United States), 15-19 Aug 1994; Other Information: PBD: 1994; Related Information: Is Part Of Mathematical programming: State of the art 1994; Birge, J.R.; Murty, K.G. [eds.]; PB: 312 p.
• Country of Publication: United States
• Language: English

Related Subjects

99 MATHEMATICS
COMPUTERS
INFORMATION SCIENCE
MANAGEMENT
LAW
MISCELLANEOUS
ALGORITHMS
OPTIMIZATION
NUMERICAL SOLUTION
EFFICIENCY
MATRICES
ITERATIVE METHODS
VARIATIONAL METHODS