Hybrid mixed-integer/constraint logic programming strategies for solving scheduling and combinatorial optimization problems

In this paper, we present two methods to overcome the combinatorial complexity when solving large discrete optimization problems. The basic idea relies on combining mixed integer programming (MIP) and constraint logic programming (CLP) to exploit their complementary strengths. These strategies are i...

Full description

Saved in:

Bibliographic Details
Published in:	Computers & chemical engineering Vol. 24; no. 2; pp. 337 - 343
Main Authors:	Harjunkoski, Iiro, Jain, Vipul, Grossman, Ignacio E.
Format:	Journal Article
Language:	English
Published:	Elsevier Ltd 15.07.2000
Subjects:	Constraint logic programming Hybrid MIP/CLP Mixed integer programming Mixed integer programming Constraint logic programming Hybrid MIP/CLP
ISSN:	0098-1354, 1873-4375
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	In this paper, we present two methods to overcome the combinatorial complexity when solving large discrete optimization problems. The basic idea relies on combining mixed integer programming (MIP) and constraint logic programming (CLP) to exploit their complementary strengths. These strategies are illustrated in the area of job-shop scheduling and trim-loss problems. Comparisons of the strategies are presented with direct solutions on MIP and CLP problems.
ISSN:	0098-1354 1873-4375
DOI:	10.1016/S0098-1354(00)00470-1