## Assignment Problems, Revised ReprintAssignment Problems is a useful tool for researchers, practitioners and graduate students. In 10 self-contained chapters, it provides a comprehensive treatment of assignment problems from their conceptual beginnings through present-day theoretical, algorithmic and practical developments. The topics covered include bipartite matching algorithms, linear assignment problems, quadratic assignment problems, multi-index assignment problems and many variations of these. Researchers will benefit from the detailed exposition of theory and algorithms related to assignment problems, including the basic linear sum assignment problem and its variations. Practitioners will learn about practical applications of the methods, the performance of exact and heuristic algorithms, and software options. This book also can serve as a text for advanced courses in areas related to discrete mathematics and combinatorial optimisation. The revised reprint provides details on a recent discovery related to one of Jacobi's results, new material on inverse assignment problems and quadratic assignment problems, and an updated bibliography. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

OT106_ch1 | 1 |

OT106_ch2 | 13 |

OT106_ch3 | 35 |

OT106_ch4 | 73 |

OT106_ch5 | 145 |

OT106_ch6 | 171 |

OT106_ch7 | 205 |

OT106_ch8 | 253 |

OT106_ch9 | 287 |

OT106_ch10 | 311 |

OT106_bm | 327 |

### Other editions - View all

Assignment Problems, Revised Reprint Rainer E. Burkard,Mauro Dell'Amico,Silvano Martello Limited preview - 2009 |

Assignment Problems Rainer E. Burkard,Mauro Dell'Amico,Silvano Martello No preview available - 2009 |

### Common terms and phrases

adjacency matrix admissible transformation algorithm for LSAP assignment polytope augmenting path axial 3AP bipartite graph bottleneck assignment problem Cited combinatorial optimization complexity computational constraints convex corresponding cost coefficients cost matrix defined denote Discr dual variables edge i,j elements entries feasible solution feasible tree flow given graph G heuristic Hungarian algorithm implementation instances integer iteration Koopmans—Beckmann labeled layered graph LBAP linear assignment problem linear programming lower bound LSAP Math matroid maximum matching method minimum Monge matrix Monge property node nonnegative NP-hard objective function objective function value obtained Oper optimal solution path algorithm perfect matching permutation matrix pivots planar polynomial polytope primal solution Procedure processors Proposition quadratic assignment problem R.E. Burkard random reduced cost Rendl rows and columns Section shortest path simplex algorithm solved sum assignment problem symmetric tabu search Theorem unassigned updated vector vertices Volgenant