Algebraic, logical and network representations in the design of software for combinatorial optimization

C. Coullard, R. Fourer

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

Abstract

We survey three problem representations that are popularly applied in combinatorial optimization: algebraic modeling languages, constraint logic programming languages, and network diagrams. After first describing the kinds of optimization methods and systems most commonly associated with these alternatives, we consider how each representation has been advantageous and how its advantages have come to influence (or ought to influence) the design of the others. We focus especially on the possibility that general-purpose system designs, which are highly successful in other areas, might be extended to combinatorial optimization.

Original languageEnglish (US)
Title of host publicationInformation Systems - Decision Support and Knowledge-Based Systems
PublisherIEEE Computer Society
Pages407-416
Number of pages10
ISBN (Electronic)0818673249
DOIs
StatePublished - 1996
Event29th Hawaii International Conference on System Sciences, HICSS 1996 - Wailea, United States
Duration: Jan 3 1996Jan 6 1996

Publication series

NameProceedings of the Annual Hawaii International Conference on System Sciences
Volume2
ISSN (Print)1530-1605

Conference

Conference29th Hawaii International Conference on System Sciences, HICSS 1996
Country/TerritoryUnited States
CityWailea
Period1/3/961/6/96

ASJC Scopus subject areas

  • General Engineering

Fingerprint

Dive into the research topics of 'Algebraic, logical and network representations in the design of software for combinatorial optimization'. Together they form a unique fingerprint.

Cite this