Optimal Algorithm Design Of Center of Graph Based on IBM ILOG OPL Model

DOI

10.2991/icimm-15.2015.175How to use a DOI?

Keywords

OPL;Shortest-path Problem;Center of Graph

Abstract

In this paper, Optimization problem is introduced. Some computer tool-kits used to solve optimization problems are outlined with their respective strength and weakness. A state of the art optimization programming language-IBM ILOG OPL is presented. This high level OPL facilitates modeling and solving optimal problem in all application fields significantly. An IBM ILOG OPL model of the shortest-path problem is implemented. Then, with IBM ILOG OPL model of Shortest-path problem as building block, an algorithm of center of graph is illustrated through calling this building block but with different data in consecutive way.This algorithm can be implemented with IBM ILOG Script language.This approach enable engineers in all kinds of field to solve optimal problems since no underlying mechanism of optimization need to be grasped.

Copyright

© 2015, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Lixin Zhao
AU  - Lishuan Hu
PY  - 2015/07
DA  - 2015/07
TI  - Optimal Algorithm Design Of Center of Graph Based on IBM ILOG OPL Model
BT  - Proceedings of the 5th International Conference on Information Engineering for Mechanics and Materials
PB  - Atlantis Press
SP  - 960
EP  - 964
SN  - 2352-5401
UR  - https://doi.org/10.2991/icimm-15.2015.175
DO  - 10.2991/icimm-15.2015.175
ID  - Zhao2015/07
ER  -