Solving Combinatorial Optimization Problems with Constraint Programming and OscaR

[@nashoniasimmons8096]

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.

[@RahulKumar-qv3km]

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

[@shgo]

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

[@lefizois]

Hi, the documentation of OscaR is quite poor oscarlib.readthedocs.io/en/latest/ . If you want to learn CP, we made a system just for that www.minicp.org that is very well documented. OscaR uses the same architecture and ideas but the code is just more optimized.

[@suryanarayan5519]

I'm trying to use OscaR as well. I was trying to connect it to minizinc. If someone had success, please let me know.

[@alexandrefrias2147]

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.

[@zx3796]

MIP?

[@alexandrefrias2147]

Mixed Integer Programming

[@alexanderschiendorfer2203]

MIP is very good when you can actually apply it (only linear constraints etc.). The techniques described here are based on constraint programming (CP), using algorithms that remove infeasible options from the domains of variables, by specialized filtering algorithms

[@alexandrefrias2147]

Yes, constraint programming problem, CP, is a mix of MIP and SAT problems, there is a lot of techniques for solving them. The efficiency of each approach is related to the specific properties of each problem. My point is that you can reduce one in another.

[@suprayz5321]

Je prefere Choco Solver

[@medjadicherifahmedyoucefme7103]

tu peux m'aider stp en donnant une documentation sur Choco ???

[@suprayz5321]

@@medjadicherifahmedyoucefme7103 hada nta? 😂