Constraint logic programming and mixed integer programming

Ho Geun Lee, Ronald M. Lee, Gang Yu

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

1 Citation (Scopus)

Abstract

Constraint logic programming (CLP), which combines the complementary strengths of the artificial intelligence (AI) and OR approaches, is introduced as a new tool for formalizing constraint satisfaction problems that include both qualitative and quantitative constraints. CLP(R), one CLP language, is used to contrast the CLP approach with mixed integer programming (MIP). Three relative advantages of CLP over MIP are analyzed: representational efficiency for domain-specific knowledge; partial solutions; and ease of model revision. A case example of constraint satisfaction problems is implemented by MIP and CLP(R) for comparison of the two approaches. The results exhibit the representational economics of CLP with computational efficiency comparable to that of MIP.

Original languageEnglish
Title of host publicationProceedings of the 26th Hawaii International Conference on System Sciences, HICSS 1993
PublisherIEEE Computer Society
Pages543-552
Number of pages10
ISBN (Electronic)0818632305
DOIs
Publication statusPublished - 1993 Jan 1
Event26th Hawaii International Conference on System Sciences, HICSS 1993 - Wailea, United States
Duration: 1993 Jan 8 → …

Publication series

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

Conference

Conference26th Hawaii International Conference on System Sciences, HICSS 1993
CountryUnited States
CityWailea
Period93/1/8 → …

Fingerprint

Logic programming
Integer programming
Constraint satisfaction problems
Computational efficiency
Computer programming languages
Artificial intelligence
Economics

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Cite this

Lee, H. G., Lee, R. M., & Yu, G. (1993). Constraint logic programming and mixed integer programming. In Proceedings of the 26th Hawaii International Conference on System Sciences, HICSS 1993 (pp. 543-552). [284354] (Proceedings of the Annual Hawaii International Conference on System Sciences; Vol. 3). IEEE Computer Society. https://doi.org/10.1109/HICSS.1993.284354
Lee, Ho Geun ; Lee, Ronald M. ; Yu, Gang. / Constraint logic programming and mixed integer programming. Proceedings of the 26th Hawaii International Conference on System Sciences, HICSS 1993. IEEE Computer Society, 1993. pp. 543-552 (Proceedings of the Annual Hawaii International Conference on System Sciences).
@inproceedings{65b34a9c6cb1460cb079d543389cdc9e,
title = "Constraint logic programming and mixed integer programming",
abstract = "Constraint logic programming (CLP), which combines the complementary strengths of the artificial intelligence (AI) and OR approaches, is introduced as a new tool for formalizing constraint satisfaction problems that include both qualitative and quantitative constraints. CLP(R), one CLP language, is used to contrast the CLP approach with mixed integer programming (MIP). Three relative advantages of CLP over MIP are analyzed: representational efficiency for domain-specific knowledge; partial solutions; and ease of model revision. A case example of constraint satisfaction problems is implemented by MIP and CLP(R) for comparison of the two approaches. The results exhibit the representational economics of CLP with computational efficiency comparable to that of MIP.",
author = "Lee, {Ho Geun} and Lee, {Ronald M.} and Gang Yu",
year = "1993",
month = "1",
day = "1",
doi = "10.1109/HICSS.1993.284354",
language = "English",
series = "Proceedings of the Annual Hawaii International Conference on System Sciences",
publisher = "IEEE Computer Society",
pages = "543--552",
booktitle = "Proceedings of the 26th Hawaii International Conference on System Sciences, HICSS 1993",
address = "United States",

}

Lee, HG, Lee, RM & Yu, G 1993, Constraint logic programming and mixed integer programming. in Proceedings of the 26th Hawaii International Conference on System Sciences, HICSS 1993., 284354, Proceedings of the Annual Hawaii International Conference on System Sciences, vol. 3, IEEE Computer Society, pp. 543-552, 26th Hawaii International Conference on System Sciences, HICSS 1993, Wailea, United States, 93/1/8. https://doi.org/10.1109/HICSS.1993.284354

Constraint logic programming and mixed integer programming. / Lee, Ho Geun; Lee, Ronald M.; Yu, Gang.

Proceedings of the 26th Hawaii International Conference on System Sciences, HICSS 1993. IEEE Computer Society, 1993. p. 543-552 284354 (Proceedings of the Annual Hawaii International Conference on System Sciences; Vol. 3).

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

TY - GEN

T1 - Constraint logic programming and mixed integer programming

AU - Lee, Ho Geun

AU - Lee, Ronald M.

AU - Yu, Gang

PY - 1993/1/1

Y1 - 1993/1/1

N2 - Constraint logic programming (CLP), which combines the complementary strengths of the artificial intelligence (AI) and OR approaches, is introduced as a new tool for formalizing constraint satisfaction problems that include both qualitative and quantitative constraints. CLP(R), one CLP language, is used to contrast the CLP approach with mixed integer programming (MIP). Three relative advantages of CLP over MIP are analyzed: representational efficiency for domain-specific knowledge; partial solutions; and ease of model revision. A case example of constraint satisfaction problems is implemented by MIP and CLP(R) for comparison of the two approaches. The results exhibit the representational economics of CLP with computational efficiency comparable to that of MIP.

AB - Constraint logic programming (CLP), which combines the complementary strengths of the artificial intelligence (AI) and OR approaches, is introduced as a new tool for formalizing constraint satisfaction problems that include both qualitative and quantitative constraints. CLP(R), one CLP language, is used to contrast the CLP approach with mixed integer programming (MIP). Three relative advantages of CLP over MIP are analyzed: representational efficiency for domain-specific knowledge; partial solutions; and ease of model revision. A case example of constraint satisfaction problems is implemented by MIP and CLP(R) for comparison of the two approaches. The results exhibit the representational economics of CLP with computational efficiency comparable to that of MIP.

UR - http://www.scopus.com/inward/record.url?scp=0346647328&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0346647328&partnerID=8YFLogxK

U2 - 10.1109/HICSS.1993.284354

DO - 10.1109/HICSS.1993.284354

M3 - Conference contribution

AN - SCOPUS:0346647328

T3 - Proceedings of the Annual Hawaii International Conference on System Sciences

SP - 543

EP - 552

BT - Proceedings of the 26th Hawaii International Conference on System Sciences, HICSS 1993

PB - IEEE Computer Society

ER -

Lee HG, Lee RM, Yu G. Constraint logic programming and mixed integer programming. In Proceedings of the 26th Hawaii International Conference on System Sciences, HICSS 1993. IEEE Computer Society. 1993. p. 543-552. 284354. (Proceedings of the Annual Hawaii International Conference on System Sciences). https://doi.org/10.1109/HICSS.1993.284354