This paper proposes a Mixed-Integer Linear Pro-gramming (MILP) formulation for Soft Graph Clustering that can be applied to both weighted and unweighted graphs and is polynomial in size. It can ...

At particular unlucky zoom values the x-axis of the graph of a benchmark's performance can pick label points for "Order" which are non-integer, for example in the attached image over the range of runs ...

Then, using Olariu'scharacterization and other structural properties of interval graphs, we derive an integer programming model for the MOSP. Some computational results for the model are presented.

Next, a linear programming formulation, based on the graph coloring approach discussed above, is used to find the optimal solution to the Sudoku puzzle shown in SudokuPuzzle.png. The script Sudoku.py ...

However, GST requires an unbounded amount of memory at each node and preparation of the entire graph state in a single network node. In this poster, we present an integer programming formulation that ...