2
votes
3answers
187 views
Graph Coloring Solvers
Hey,
I'm curious about the state of the art in solving graph coloring (by solving I mean finding the optimal coloring and proving that it is optimal).
Can someone point me to pap …
2
votes
3answers
80 views
Minimal Backtracking Proof Tree
When trying to prove that a particular instance of a problem like SAT is unsatisfiable, generally one explores the search tree using an algorithm like DPLL and the proof of unsatis …
2
votes
1answer
408 views
Any finite domain NLP benchmark tests?
Hi all,
I would like to perform some benchmarks over a set of nonlinear problems where some functions (objective or nonlinear constrains) are defined over restricted domains, e.g.
…
-2
votes
2answers
77 views
question about OR
Maximize P= 10x + 2y [rest deleted. No really: no homework!]
1
vote
1answer
93 views
Extracting Gomory cuts out of Cgl (Coin-or)
Hey,
I'm trying to extract Cgl Gomory cuts out of the Cgl (Cut Generation Library) of Coin-Or The following is the code I'm using to extract the cuts -
OsiCuts cutlist;
CglGomory …
3
votes
3answers
260 views
CP and Integer programming
Hi everybody,
Does anyone know a good reference or tutorial in the spirit of the book "Model building in mathematical programming" for Constraint Programming techniques for solvin …
3
votes
3answers
228 views
How do you decide whether MIP or CP is more appropriate?
What are some guidelines for deciding whether a MIP or CP approach is more appropriate for modeling an optimization problem? Or in what cases should CP be used instead of MIP?
