Huib Meulenbelt

  • Investigator
  • Gurobi-versary
  • Conversationalist
  • Total activity 37
  • Last activity
  • Member since
  • Following 0 users
  • Followed by 0 users
  • Votes 3
  • Subscriptions 10

Activity overview

Latest activity by Huib Meulenbelt

  • Huib Meulenbelt commented,

    Hi Maliheh,Thank you for your solution. I am getting now the output that I expect import itertools from gurobipy import Model, GRB truth_table = dict.fromkeys(itertools.product([1, 0], repeat=2),...

    View comment Huib Meulenbelt Edited 0 votes

  • Huib Meulenbelt commented,

    Hi,There are two scenarios for `p`If p = 1` then r_p_min ≤ r ≤ r_p_max  I created this constraint by writing:m.addGenConstrIndicator(p, True, r_p_min <= r) m.addGenConstrIndicator(p, True, r <= r_p...

    View comment Huib Meulenbelt 0 votes

  • Huib Meulenbelt created a post,

    Create truth table of two events

    Answered

    Hi all, Let's assume there are two possible events in a fight that lasts r rounds between blue and red: fight lasts over 1.5 rounds red has more significant strikes in round 4 The corresponding tru...

    Huib Meulenbelt Edited 2 followers 4 comments 0 votes

  • Huib Meulenbelt commented,

    Hi Ronald, thank you for your insights. I am mainly interested in finding the value of `SUL_i` and `SUL_j`. You stated that its possible to retrieve these values without the paths. Is the following...

    View comment Huib Meulenbelt Edited 0 votes

  • Huib Meulenbelt created a post,

    Generate all paths that consists of specified number of visits of nodes / edges

    Answered

    In a graph/chain there are 3 different states: ST, GRC_i and GRC_j. The following edges between the states exists: EDGES = [ # source, target, name ('ST', 'GRC_i', 'TDL_i'), ('ST', ...

    Huib Meulenbelt Edited 2 followers 4 comments 0 votes

  • Huib Meulenbelt created a post,

    Find max unit flow in Networkx.Graph using Gurobi

    Answered

    Hi all, I have a `networkx.Graph`-object called G. import networkx as nximport gurobipy as grbfrom gurobipy import GRBimport matplotlib.pyplot as pltG = nx.hoffman_singleton_graph() G consists of...

    Huib Meulenbelt 2 followers 1 comment 0 votes

  • Huib Meulenbelt commented,

    Hi,   Thank you for your reply. I understand that the "nx.from_numpy_array"-function doesn't accept Gurobi decision variables as input. However, is it possible to convert the values of the decision...

    View comment Huib Meulenbelt Edited 0 votes

  • Huib Meulenbelt created a post,

    Convert values of gurobi.LineExpr to integers

    Answered

    Hi, I have the following graph `G` This is created using the following code   import networkx as nximport matplotlib.pyplot as pltG = nx.hoffman_singleton_graph()pos = nx.spring_layout(G)nx.draw(...

    Huib Meulenbelt Edited 2 followers 3 comments 0 votes

  • Huib Meulenbelt commented,

    Hi Riley, In the end that's exactly what I want to do; get all the different ways a score can be achieved. To be precise, I want all the ways A (B) can score a (b) points on his own serve. Below is...

    View comment Huib Meulenbelt Edited 0 votes

  • Huib Meulenbelt commented,

    Ah yes, thank you for taking a look at it. So, I was making it way too difficult.  You're right, I excluded that from my question to simplify the project. But a player wins when he reaches n points...

    View comment Huib Meulenbelt 0 votes