A Network Flow Algorithm for Solving Generalized Assignment Problem

<div>Average CPU time of algorithms <i>A</i><sub>1</sub>, <i>A</i><sub>2</sub>, and <i>A</i><sub>3</sub> for different sizes of problem with density <span class="nowrap"><svg height="8.85534pt" id="M232" style="vertical-align:-0.4673595pt" version="1.1" viewbox="-0.0498162 -8.38798 22.4913 8.85534" width="22.4913pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M249 635C141 635 70 555 70 471C70 401 114 353 179 316C143 294 106 267 90 252C68 231 45 202 45 157C45 50 130 -12 237 -12C322 -12 435 52 435 169C435 256 372 304 303 343C349 374 375 398 383 407C401 429 411 458 411 487C411 569 344 635 249 635ZM238 603C285 603 337 567 337 482C337 422 310 385 276 358C205 393 145 426 145 500C145 552 179 603 238 603ZM248 20C183 20 125 70 125 163C125 218 158 268 206 300C284 261 355 217 355 143C355 66 308 20 248 20Z"></path></g><g transform="matrix(.013,0,0,-0.013,6.24,0)"><path d="M241 635C89 635 35 457 35 312C35 153 89 -12 240 -12C390 -12 443 166 443 312C443 466 390 635 241 635ZM238 602C329 602 354 454 354 312C354 172 330 22 240 22C152 22 124 173 124 313S148 602 238 602Z"></path></g><g transform="matrix(.013,0,0,-0.013,12.48,0)"><path d="M594 629L561 652L159 -9L190 -32L594 629ZM194 635C92 635 49 534 49 453C49 374 92 272 193 272C295 272 338 374 338 454S295 635 194 635ZM193 605C257 605 265 504 265 453C265 405 257 302 194 302C133 302 122 403 122 454S133 605 193 605ZM567 351C465 351 421 250 421 169C421 90 465 -12 566 -12S710 90 710 170S667 351 567 351ZM566 322C628 322 637 221 637 169C637 121 628 18 567 18S494 119 494 170C494 223 506 322 566 322Z"></path></g></svg>.</span></div>

Mathematical Problems in Engineering

A Network Flow Algorithm for Solving Generalized Assignment Problem

Figure 2