Skip to main content
Filter by
Sorted by
Tagged with
3 votes
1 answer
71 views

I'm exploring the use of ojAlgo in a project that involves solving QPQC problems (Quadratically Constrained Quadratic Programming). I've looked into the ojAlgo-extensions ecosystem and the various ...
ggallo's user avatar
  • 43
1 vote
0 answers
61 views

I am trying to install scipoptsuite v6.0.1 (https://scipopt.org/download.php?fname=scipoptsuite-6.0.1.tgz) on my Mac M1. Following the instruction in the website: Link to the changesoplex.cpp file: ...
Abdelouahed BEN MHAMED's user avatar
0 votes
1 answer
184 views

I am new to using SCIP, and I can't figure out why SCIP is not satisfying the constraints of my ILP. I have specified my ILP in the .lp format as described by IBM. For example, consider the following ...
vimodev's user avatar
0 votes
0 answers
327 views

I'm trying to add a series of constraints which make use of an indicator function, but it seems to be breaking the solver. This is the original formulation of the constraint: Which has to be broken ...
Winsor-Mavis's user avatar
0 votes
1 answer
360 views

I an using SCIPoptSuite in my code to solve a MINLP problem, and I would like to test if parallelization inproves the performance or not. However the UG Framework is not built in the SCIPoptSuite ...
ZYberTanC's user avatar
1 vote
1 answer
71 views

I feel like I knew the answer for this question before but I am unable to recall it. Is there a way to supply the SCIP program with a heuristic objective solution value?
Morpheus's user avatar
  • 3,603
0 votes
1 answer
240 views

I was wondering if there is a way to set the upper bound of the time taken to solve a MILP problem but only on the branch and bound time. I was able to find a parameter for the total running time but ...
Morpheus's user avatar
  • 3,603