FGILP: An integer linear program solver based on function graphs

Yung Te Lai, Massoud Pedram, Sarma B.K. Vrudhula

Research output: Chapter in Book/Report/Conference proceedingConference contribution

14 Scopus citations

Abstract

Edge-Valued Binary-Decision Diagrams (EVBDD)s are directed acyclic graphs which can represent and manipulate integer functions as effectively as Ordered Binary-Decision Diagrams (OBDDs) do for Boolean functions. They have been used to perform logic verification and compute decomposability of Boolean functions. In this paper, we present a new EVBDD application for solving Integer Linear Programs (ILP), which is an NP-hard problem that appears in many applications. Our approach is to combine the benefits of the EVBDD data structure (in terms of subgraph sharing and caching of computational results) with the state-of-the-art ILP solving techniques. Our program, called FGILP, has been implemented in C under the SIS environment. The preliminary results of FGILP are comparable to those of LINDO.

Original languageEnglish (US)
Title of host publicationProc 1993 IEEE ACM Int Conf Comput Aided Des
Editors Anon
PublisherPubl by IEEE
Pages685-689
Number of pages5
ISBN (Print)0818644923
StatePublished - Dec 1 1993
Externally publishedYes
EventProceedings of the 1993 IEEE/ACM International Conference on Computer-Aided Design - Santa Clara, CA, USA
Duration: Nov 7 1993Nov 11 1993

Publication series

NameProc 1993 IEEE ACM Int Conf Comput Aided Des

Other

OtherProceedings of the 1993 IEEE/ACM International Conference on Computer-Aided Design
CitySanta Clara, CA, USA
Period11/7/9311/11/93

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'FGILP: An integer linear program solver based on function graphs'. Together they form a unique fingerprint.

Cite this