Results 1  10
of
11
Practical Problem Solving with Cutting Plane Algorithms in Combinatorial Optimization
, 1994
"... Cutting plane algorithms have turned out to be practically successful computational tools in combinatorial optimization, in particular, when they are embedded in a branch and bound framework. Implementations of such "branch and cut" algorithms are rather complicated in comparison to many p ..."
Abstract

Cited by 24 (5 self)
 Add to MetaCart
Cutting plane algorithms have turned out to be practically successful computational tools in combinatorial optimization, in particular, when they are embedded in a branch and bound framework. Implementations of such "branch and cut" algorithms are rather complicated in comparison to many purely combinatorial algorithms. The purpose of this article is to give an introduction to cutting plane algorithms from an implementor's point of view. Special emphasis is given to control and data structures used in practically successful implementations of branch and cut algorithms. We also address the issue of parallelization. Finally, we point out that in important applications branch and cut algorithms are not only able to produce optimal solutions but also approximations to the optimum with certified good quality in moderate computation times. We close with an overview of successful practical applications in the literature.
An Approach for Mixed Upward Planarization
 In Proc. 7th International Workshop on Algorithms and Data Structures (WADS’01
, 2003
"... In this paper, we consider the problem of finding a mixed upward planarization of a mixed graph, i.e., a graph with directed and undirected edges. The problem is a generalization of the planarization problem for undirected graphs and is motivated by several applications in graph drawing. ..."
Abstract

Cited by 17 (2 self)
 Add to MetaCart
In this paper, we consider the problem of finding a mixed upward planarization of a mixed graph, i.e., a graph with directed and undirected edges. The problem is a generalization of the planarization problem for undirected graphs and is motivated by several applications in graph drawing.
A New Approximation Algorithm for Finding Heavy Planar Subgraphs
 ALGORITHMICA
, 1997
"... We provide the first nontrivial approximation algorithm for MAXIMUM WEIGHT PLANAR SUBGRAPH, the NPHard problem of finding a heaviest planar subgraph in an edgeweighted graph G. This problem has applications in circuit layout, facility layout, and graph drawing. No previous algorithm for MAXIMUM ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
We provide the first nontrivial approximation algorithm for MAXIMUM WEIGHT PLANAR SUBGRAPH, the NPHard problem of finding a heaviest planar subgraph in an edgeweighted graph G. This problem has applications in circuit layout, facility layout, and graph drawing. No previous algorithm for MAXIMUM WEIGHT PLANAR SUBGRAPH had performance ratio exceeding 1=3, which is obtained by any algorithm that produces a maximum weight spanning tree in G. Based on the BermanRamaiyer Steiner tree algorithm, the new algorithm has performance ratio at least 1/3 + 1/72. We also show that if G is complete and its edge weights satisfy the triangle inequality, then the performance ratio is at least 3/8. Furthermore, we derive the first nontrivial performance ratio (7/12 instead of 1/2) for the NPHard MAXIMUM WEIGHT OUTERPLANAR SUBGRAPH problem.
Polyhedral Techniques in Combinatorial Optimization II: Computations
 Statistica Neerlandica
, 1995
"... The polyhedral approach is one of the most powerful techniques available for solving hard combinatorial optimization problems. The main idea behind the technique is to consider the linear relaxation of the integer combinatorial optimization problem, and try to iteratively strengthen the linear formu ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
The polyhedral approach is one of the most powerful techniques available for solving hard combinatorial optimization problems. The main idea behind the technique is to consider the linear relaxation of the integer combinatorial optimization problem, and try to iteratively strengthen the linear formulation by adding violated strong valid inequalities, i.e., inequalities that are violated by the current fractional solution but satisfied by all feasible solutions, and that define highdimensional faces, preferably facets, of the convex hull of feasible solutions. If we have the complete description of the convex hull of feasible solutions all extreme points of this formulation are integral, which means that we can solve the problem as a linear programming problem. Linear programming problems are known to be computationally easy. In Part I of this article we discuss theoretical aspects of polyhedral techniques. Here we will mainly concentrate on the computational aspects. In particular we ...
An Analysis of Some Heuristics for the Maximum Planar Subgraph Problem
 Proc. 6 th Annual ACMSIAM Symp. on Discrete Algorithms
, 1995
"... Introduction The problem of extracting a maximum planar subgraph from a nonplanar graph, referred to as graph planarization, has important applications in circuit layout, facility layout, and automated graphical display systems [F, TDB]. The problem is NPhard [LG]; hence, research has focused on h ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
(Show Context)
Introduction The problem of extracting a maximum planar subgraph from a nonplanar graph, referred to as graph planarization, has important applications in circuit layout, facility layout, and automated graphical display systems [F, TDB]. The problem is NPhard [LG]; hence, research has focused on heuristics. There are several algorithms for finding maximal planar subgraphs [CHT, CNS, GT, JTS, JM, K, OT]. However, there are graphs (see [CC]) for which the size ratio between two maximal planar subgraphs can be as small as 1=3. Hence, unless some precautions are taken to avoid the extraction of small subgraphs, these heuristics have the potential for poor behavior. In this paper, we analyze the worstcase performance of some heuristics and show that there are graphs which can cause each of them to achieve the 1=3 bound. However, a theoretical analysis of an algorithm's performance is often too pessimistic and somew
Transitive packing
 Integer Programming and Combinatorial Optimization, Lecture Notes in Computer Science 1084
, 1996
"... This paper is intended to give a concise understanding of the facial structure of previously separately investigated polyhedra. It introduces the notion of transitive packing and the transitive packing polytope and gives cutting plane proofs for huge classes of valid inequalities of this polytope. ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
(Show Context)
This paper is intended to give a concise understanding of the facial structure of previously separately investigated polyhedra. It introduces the notion of transitive packing and the transitive packing polytope and gives cutting plane proofs for huge classes of valid inequalities of this polytope. We introduce generalized cycle, generalized clique, generalized antihole, generalized antiweb, generalized web, and odd partition inequalities. These classes subsume several known classes of valid inequalities for several of the special cases but give also many new inequalities for several other special cases. For some of the classes we prove as well a lower bound for their Chv'atal rank. Finally, we relate the concept of transitive packing to generalized (set) packing and covering as well as to balanced and ideal matrices.
A tabu search procedure based on a random roulette diversification for the weighted maximal planar graph problem
 Forthcoming in the special issue on Tabu search of Computers & Operations Research
, 2006
"... www.elsevier.com/locate/cor ..."
(Show Context)
Transitive packing: A unifying concept in combinatorial optimization
, 2002
"... This paper attempts to provide a better understanding of the facial structure of polyhedra previously investigated separately. It introduces the notion of transitive packing and the transitive packing polytope. Polytopes that turn out to be special cases of the transitive packing polytope include t ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
(Show Context)
This paper attempts to provide a better understanding of the facial structure of polyhedra previously investigated separately. It introduces the notion of transitive packing and the transitive packing polytope. Polytopes that turn out to be special cases of the transitive packing polytope include the node packing, acyclic subdigraph, bipartite subgraph, planar subgraph, clique partitioning, partition, transitive acyclic subdigraph, interval order, and relatively transitive subgraph polytopes. We give cutting plane proofs for several rich classes of valid inequalities of the transitive packing polytope, thereby introducing generalized cycle, generalized clique, generalized antihole, generalized antiweb, and odd partition inequalities. On the one hand, these classes subsume several known classes of valid inequalities for several special cases; on the other hand, they yield many new inequalities for several other special cases. For some of the classes we also prove a lower bound on their Gomory–Chvátal rank. Finally, we relate the concept of transitive packing to generalized (set) packing and covering, as well as to balanced and ideal matrices.
A Polynomial Time Randomized Parallel Approximation Algorithm for Finding Heavy Planar Subgraphs
, 2006
"... We provide an approximation algorithm for the Maximum Weight Planar Subgraph problem, the NPhard problem of finding a heaviest planar subgraph in an edgeweighted graph G. In the general case our algorithm has performance ratio at least 1/3 + 1/72 matching the best algorithm known so far, though in ..."
Abstract
 Add to MetaCart
We provide an approximation algorithm for the Maximum Weight Planar Subgraph problem, the NPhard problem of finding a heaviest planar subgraph in an edgeweighted graph G. In the general case our algorithm has performance ratio at least 1/3 + 1/72 matching the best algorithm known so far, though in several special cases we prove stronger results. In particular, we obtain performance ratio 2/3 (instead of 7/12) for the NPhard Maximum Weight Outerplanar Subgraph problem meeting the performance ratio of the best algorithm for the unweighted case. When the maximum weight planar subgraph is one of several special types of Hamiltonian graphs, we show performance ratios at least 2/5 and 4/9 (instead of 1/3 + 1/72), and 1/2 (instead of 4/9) for the unweighted case.
unknown title
"... In the domain of facility and factory layout planning, the di cult problem of ® nding a maximum weight planar subgraph of an edgeweighted complete graph has many important practical applications. We introduce new neighbourhood structures to generate an initial solution and yield feasible modi ® ca ..."
Abstract
 Add to MetaCart
In the domain of facility and factory layout planning, the di cult problem of ® nding a maximum weight planar subgraph of an edgeweighted complete graph has many important practical applications. We introduce new neighbourhood structures to generate an initial solution and yield feasible modi ® cations of a current layout. We compare our constructive algorithm to a couple of approaches from the literature in order to receive an initial feasible solution. Moreover, a new implementation of Leung’s greedy heuristic outperforms all other layout approximation algorithms in quality. Computational results demonstrate the performance characteristics. 1. Introduction and