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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Computers & chemical engineering Ročník 24; číslo 2; s. 337 - 343
Hlavní autoři:	Harjunkoski, Iiro, Jain, Vipul, Grossman, Ignacio E.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier Ltd 15.07.2000
Témata:	Constraint logic programming Hybrid MIP/CLP Mixed integer programming Mixed integer programming Constraint logic programming Hybrid MIP/CLP
ISSN:	0098-1354, 1873-4375
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Popis
Shrnutí:	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