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
|
/* asnokalg.c (solve assignment problem with out-of-kilter alg.) */
/***********************************************************************
* This code is part of GLPK (GNU Linear Programming Kit).
*
* Copyright (C) 2009-2016 Andrew Makhorin, Department for Applied
* Informatics, Moscow Aviation Institute, Moscow, Russia. All rights
* reserved. E-mail: <mao@gnu.org>.
*
* GLPK is free software: you can redistribute it and/or modify it
* under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* GLPK is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
* or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public
* License for more details.
*
* You should have received a copy of the GNU General Public License
* along with GLPK. If not, see <http://www.gnu.org/licenses/>.
***********************************************************************/
#include "env.h"
#include "glpk.h"
#include "okalg.h"
int glp_asnprob_okalg(int form, glp_graph *G, int v_set, int a_cost,
double *sol, int a_x)
{ /* solve assignment problem with out-of-kilter algorithm */
glp_vertex *v;
glp_arc *a;
int nv, na, i, k, *tail, *head, *low, *cap, *cost, *x, *pi, ret;
double temp;
if (!(form == GLP_ASN_MIN || form == GLP_ASN_MAX ||
form == GLP_ASN_MMP))
xerror("glp_asnprob_okalg: form = %d; invalid parameter\n",
form);
if (v_set >= 0 && v_set > G->v_size - (int)sizeof(int))
xerror("glp_asnprob_okalg: v_set = %d; invalid offset\n",
v_set);
if (a_cost >= 0 && a_cost > G->a_size - (int)sizeof(double))
xerror("glp_asnprob_okalg: a_cost = %d; invalid offset\n",
a_cost);
if (a_x >= 0 && a_x > G->a_size - (int)sizeof(int))
xerror("glp_asnprob_okalg: a_x = %d; invalid offset\n", a_x);
if (glp_check_asnprob(G, v_set))
return GLP_EDATA;
/* nv is the total number of nodes in the resulting network */
nv = G->nv + 1;
/* na is the total number of arcs in the resulting network */
na = G->na + G->nv;
/* allocate working arrays */
tail = xcalloc(1+na, sizeof(int));
head = xcalloc(1+na, sizeof(int));
low = xcalloc(1+na, sizeof(int));
cap = xcalloc(1+na, sizeof(int));
cost = xcalloc(1+na, sizeof(int));
x = xcalloc(1+na, sizeof(int));
pi = xcalloc(1+nv, sizeof(int));
/* construct the resulting network */
k = 0;
/* (original arcs) */
for (i = 1; i <= G->nv; i++)
{ v = G->v[i];
for (a = v->out; a != NULL; a = a->t_next)
{ k++;
tail[k] = a->tail->i;
head[k] = a->head->i;
low[k] = 0;
cap[k] = 1;
if (a_cost >= 0)
memcpy(&temp, (char *)a->data + a_cost, sizeof(double));
else
temp = 1.0;
if (!(fabs(temp) <= (double)INT_MAX && temp == floor(temp)))
{ ret = GLP_EDATA;
goto done;
}
cost[k] = (int)temp;
if (form != GLP_ASN_MIN) cost[k] = - cost[k];
}
}
/* (artificial arcs) */
for (i = 1; i <= G->nv; i++)
{ v = G->v[i];
k++;
if (v->out == NULL)
tail[k] = i, head[k] = nv;
else if (v->in == NULL)
tail[k] = nv, head[k] = i;
else
xassert(v != v);
low[k] = (form == GLP_ASN_MMP ? 0 : 1);
cap[k] = 1;
cost[k] = 0;
}
xassert(k == na);
/* find minimal-cost circulation in the resulting network */
ret = okalg(nv, na, tail, head, low, cap, cost, x, pi);
switch (ret)
{ case 0:
/* optimal circulation found */
ret = 0;
break;
case 1:
/* no feasible circulation exists */
ret = GLP_ENOPFS;
break;
case 2:
/* integer overflow occured */
ret = GLP_ERANGE;
goto done;
case 3:
/* optimality test failed (logic error) */
ret = GLP_EFAIL;
goto done;
default:
xassert(ret != ret);
}
/* store solution components */
/* (objective function = the total cost) */
if (sol != NULL)
{ temp = 0.0;
for (k = 1; k <= na; k++)
temp += (double)cost[k] * (double)x[k];
if (form != GLP_ASN_MIN) temp = - temp;
*sol = temp;
}
/* (arc flows) */
if (a_x >= 0)
{ k = 0;
for (i = 1; i <= G->nv; i++)
{ v = G->v[i];
for (a = v->out; a != NULL; a = a->t_next)
{ k++;
if (ret == 0)
xassert(x[k] == 0 || x[k] == 1);
memcpy((char *)a->data + a_x, &x[k], sizeof(int));
}
}
}
done: /* free working arrays */
xfree(tail);
xfree(head);
xfree(low);
xfree(cap);
xfree(cost);
xfree(x);
xfree(pi);
return ret;
}
/* eof */
|
