* This function is the entry poidx_t of the bisection balancing algorithms. **************************************************************************

/ ! This function performs a node-based FM refinement. Each refinement iteration is split into two sub-iterations. In each sub-iteration onl

/ ! This function performs a node-based FM refinement */ /

* This function performs an edge-based FM refinement **************************************************************************/

Invalidates the pattern.

/ ! This function uses MMD to order the graph. The vertices are numbered from lastvtx downwards. */ /

/ ! This function matches the unmatched vertices whose degree is less than maxdegree using a 2-hop matching that involves vertices that are two

primal projection: project x to [lower, upper]

Multiplies column j by s.

x = weight * x */

/ ! Set's up the label info */ /

/ ! Setup the various arrays for the split graph */ /

Internal method to add a constraint to the model.

Retrieves the dual values of all constraints in the solution. Returns: A list of dual values for all constraints in the

Retrieves the values of all constraints in the solution. Returns: A list of values for all constraints in the solution.

Retrieves the names of all variables in the model. Returns: A list of strings representing the names of all variables.

Retrieves the values of all variables in the solution. Returns: A list of values for all variables in the solution.

Specify the application index of a validator

Determine validity, primal feasibility and (when relevant) integer feasibility of a solution

Requires "--" to be removed from string

Requires "-" to be removed from string