A Gradient-Based Interior-Point Method to Solve the Many-to-Many Assignment Problems

<p>Performance evaluation of the proposed algorithm in terms of convergence time for various <svg height="11.927pt" id="M354" style="vertical-align:-3.291101pt" version="1.1" viewbox="-0.0498162 -8.6359 13.9988 11.927" width="13.9988pt" xmlns="http://www.w3.org/2000/svg"><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M671 0V28C608 36 593 47 562 130C495 309 432 486 368 665L336 656C270 481 202 311 134 139C98 47 84 39 20 28V0H241V28C167 38 156 47 178 115C217 236 276 383 327 530H329C375 398 437 223 484 92C499 47 489 37 424 28V0H671Z"></path></g><g transform="matrix(.0091,0,0,-0.0091,10.803,3.132)"><path d="M250 606C250 634 233 656 203 656C168 656 146 618 146 593C146 564 169 545 192 545C227 545 250 573 250 606ZM227 95L212 119C187 98 152 71 135 71C129 71 128 78 134 102L207 373C219 418 217 451 194 451C165 451 92 411 30 351L44 326C77 353 106 371 114 371C124 371 121 357 117 341L55 97C32 5 46 -12 70 -12C108 -12 191 51 227 95Z"></path></g></svg> range.</p>

Complexity

fig4

Figure 4

Figure 4: A Gradient-Based Interior-Point Method to Solve the Many-to-Many Assignment Problems 