CPC G06F 16/2453 (2019.01) | 15 Claims |
1. A computer-implemented method comprising:
constructing, by a processor, a representation of a Mixed Integer Programming (MIP) problem by defining nodes and arcs that are parametrized independent of input data;
generating, by the processor, one or more flow nodes, one or more production nodes and one or more arcs in a production network model for specific instances of the MIP problem by mapping the input data to parameters, each production node incorporating variables that are in three or more constraints, with the production network model incorporating one or more directionality bits; and
determining, by the processor, a solution to the representation of the MIP problem based on feasible flows on the arcs in conjunction with a parametrized multi-level search heuristic.
|