## Algorithms and Software for Optimization, Volume 4 |

### What people are saying - Write a review

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

### Contents

A COMPUTATIONAL COMPARISON OF ALGORITHMS | 3 |

SENSITIVITY ANALYSIS FOR THE MATCHING PROBLEM | 25 |

THE DESIGN OF BRANCH AND BOUND ALGORITHMS | 55 |

Copyright | |

11 other sections not shown

### Common terms and phrases

2-interchange 5-autonomous algorithm approach assignment problem best solution Boolean functions branch and bound clutters coefficients combinatorial optimization combinatorial optimization problems complete computational results constructed corresponding cost decomposition defined denote dual solution edges efficient elements feasible posets feasible solution formulation FORTRAN given GMKP Grotschel heuristic IEEE Transactions implementation inequalities integer programming integer solution knapsack problem linear ordering linear programming lower bound LSAP Math matrix matroid maximal method minimal minimax node objective function obtained Operations Research optimal calculation optimal solution Padberg parameter partition perfect matching polynomial polytope posets primal procedure Proof relaxation reoptimization routing scheduling problems sect set systems shortest augmenting path solving spanning arborescence strategy structure subproblem Subroutine subset Table theorem tion tour Transactions on Reliability traveling salesman problem tree undirected graph upper bound variables vector vertex vertices zero