Solving Combinatorial Optimization Problems with Constraint Programming and OscaR

preview_player
Показать описание

Institute of Information and Communication Technologies,
Electronics and Applied Mathematics (ICTEAM)

Ecole Polytechnique de Louvain (EPL)

Universite catholique de Louvain (UCL)
Рекомендации по теме
Комментарии
Автор

Amazing simplicity are your analogies for teaching. I am a writer researching on this concept, but your simple explanation made it so much easier for me.

nashoniasimmons
Автор

I could not find a documentation page on OscaR bitbucket page nor on professor Schaus homepage. Is the documentation available?

shgo
Автор

I suppose It is correct to say that the reduction (equivalence proof in this case) from NP-complete problem into MIP is the most common in every paper about computer science and optimization.

alexandrefrias
Автор

can i use this for million size knapsack problem for fast solution?

RahulKumar-qvkm