Visualization and ILOG CPLEX

Sander, Georg and Vasiliu, Adrian (2004) Visualization and ILOG CPLEX. In: Graph Drawing 12th International Symposium, GD 2004, September 29-October 2, 2004, New York, NY, USA , pp. 510-511 (Official URL: http://dx.doi.org/10.1007/978-3-540-31843-9_55).

Full text not available from this repository.

Abstract

Graph layout methodologies often solve difficult subproblems in order to satisfy the aesthetic constraints: finding the maximal planar subgraph, minimizing crossings, minimizing area, maximizing symmetries, etc. One standard approach is to translate the subproblem into a linear optimization problem (LOP) and to use a standard mathematical tool to find the solution. The standard solving tool for such LOPs is ILOG CPLEX. ILOG CPLEX delivers high-performance, robust, flexible optimizers for solving linear, mixed-integer and quadratic programming problems (including mixed integer quadratic constrained problems). It is a component that includes C, C++ and Java API, and it is integrated via the Concert Technology into the ILOG Optimization Suite. With ILOG JViews, we also offer a visualization suite that includes sophisticated graph layout algorithms. Our recent investigations focused on cross-product development and the question, how ILOG CPLEX can be used to help graph layout and how ILOG JViews can be used to help the LOP solving.

Item Type:Conference Paper
Additional Information:10.1007/978-3-540-31843-9_55
Classifications:S Software and Systems > S.001 General
ID Code:626

Repository Staff Only: item control page