Visualization and ILOG CPLEX

  • Georg Sander
  • Adrian Vasiliu
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3383)

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.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Georg Sander
    • 1
  • Adrian Vasiliu
    • 1
  1. 1.ILOG SAGentilly CedexFrance

Personalised recommendations