forked from google/or-tools
-
Notifications
You must be signed in to change notification settings - Fork 0
/
ColoringMIP.java
executable file
·155 lines (138 loc) · 4.73 KB
/
ColoringMIP.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
/*
* Copyright 2017 Darian Sastre [email protected]
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*
* ************************************************************************
*
* This model was created by Hakan Kjellerstrand ([email protected])
*
* Java version by Darian Sastre ([email protected])
*/
package com.google.ortools.contrib;
import com.google.ortools.linearsolver.MPConstraint;
import com.google.ortools.linearsolver.MPObjective;
import com.google.ortools.linearsolver.MPSolver;
import com.google.ortools.linearsolver.MPVariable;
public class ColoringMIP {
public static class Edge {
public int a, b;
public Edge(int a, int b) {
this.a = a;
this.b = b;
}
}
static {
System.loadLibrary("jniortools");
}
private static MPSolver createSolver(String solverType) {
return new MPSolver("MIPDiet", MPSolver.OptimizationProblemType.valueOf(solverType));
}
private static void solve(String solverType) {
MPSolver solver = createSolver(solverType);
double infinity = MPSolver.infinity();
/** invariants */
int noCols = 5; // variables number
int noNodes = 11; // constraints number
Edge[] edges = {
new Edge(1, 2),
new Edge(1, 4),
new Edge(1, 7),
new Edge(1, 9),
new Edge(2, 3),
new Edge(2, 6),
new Edge(2, 8),
new Edge(3, 5),
new Edge(3, 7),
new Edge(3, 10),
new Edge(4, 5),
new Edge(4, 6),
new Edge(4, 10),
new Edge(5, 8),
new Edge(5, 9),
new Edge(6, 11),
new Edge(7, 11),
new Edge(8, 11),
new Edge(9, 11),
new Edge(10, 11)
};
/** variables */
MPVariable[][] x = new MPVariable[noNodes][noCols];
for (Integer i = 0; i < noNodes; i++) {
x[i] = solver.makeBoolVarArray(noCols);
}
MPVariable[] colUsed = solver.makeBoolVarArray(noCols);
MPObjective obj = solver.objective();
for (MPVariable objVar : colUsed) {
obj.setCoefficient(objVar, 1);
}
/** Bound each vertex to only one color */
MPConstraint[] constraints = new MPConstraint[noNodes];
for (int i = 0; i < noNodes; i++) {
constraints[i] = solver.makeConstraint(1, 1);
for (int j = 0; j < noCols; j++) {
constraints[i].setCoefficient(x[i][j], 1);
}
}
/** Set adjacent nodes to have different colors */
MPConstraint[][] adjacencies = new MPConstraint[edges.length][noCols];
for (int i = 0; i < edges.length; i++) {
for (int j = 0; j < noCols; j++) {
adjacencies[i][j] = solver.makeConstraint(-infinity, 0);
adjacencies[i][j].setCoefficient(x[edges[i].a - 1][j], 1);
adjacencies[i][j].setCoefficient(x[edges[i].b - 1][j], 1);
adjacencies[i][j].setCoefficient(colUsed[j], -1);
}
}
/** Minimize by default */
final MPSolver.ResultStatus resultStatus = solver.solve();
/** printing */
if (resultStatus != MPSolver.ResultStatus.OPTIMAL) {
System.err.println("The problem does not have an optimal solution!");
return;
} else {
System.out.print("Colors used: ");
for (MPVariable var : colUsed) {
System.out.print((int) var.solutionValue() + " ");
}
System.out.println("\n");
for (int i = 0; i < noNodes; i++) {
System.out.print("Col of vertex " + i + " : ");
for (int j = 0; j < noCols; j++) {
if (x[i][j].solutionValue() > 0) {
System.out.println(j);
}
}
}
}
}
public static void main(String[] args) {
try {
System.out.println("---- Integer programming example with SCIP (recommended) ----");
solve("SCIP_MIXED_INTEGER_PROGRAMMING");
} catch (java.lang.IllegalArgumentException e) {
System.err.println("Bad solver type: " + e);
}
try {
System.out.println("---- Integer programming example with CBC ----");
solve("CBC_MIXED_INTEGER_PROGRAMMING");
} catch (java.lang.IllegalArgumentException e) {
System.err.println("Bad solver type: " + e);
}
try {
System.out.println("---- Integer programming example with GLPK ----");
solve("GLPK_MIXED_INTEGER_PROGRAMMING");
} catch (java.lang.IllegalArgumentException e) {
System.err.println("Bad solver type: " + e);
}
}
}