## An exploration of approximate solution strategies for combinatorial optimization problems |

### What people are saying - Write a review

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

### Contents

TABLE OF CONTENTS M I Z k 2 | 2 |

A General Formulation | 6 |

ApplIcations | 12 |

Copyright | |

12 other sections not shown

### Common terms and phrases

activity-location adjacent applied Armour-Buffa ASSIGNED TO LOCATION ASSIGNMENTS ACTIVITY average backtrack BEST ALTERNATE ASSIGNMENTS better solutions Biased Sampling calculated Candidate Departments candidate set cluster analysis combinatorial optimization combinatorial optimization problems computation requirements considered constructive initial placement constructive procedure cost of assigning criteria D-matrix decision process decision tree distance efficient enumeration process EOLUTION et.al exchange improvement procedure exchange procedure expected value fixed cost floor plan layout flow dominance graph partitioning Graves-Whinston algorithm heuristic implemented implicit enumeration algorithm improved solution initial solution large problems large scale problems limiting location modules ment method minimize N30 problems NP-complete Nugent objective function options order exchange pair-wise exchange improvement partitioning scheme plant layout problem possible assignments quadratic assignment formulation quadratic assignment problem random starting solutions reducing scheduling set of locations shaded square shown in Figure solu solution process solution quality solving Steinberg problem step sub-department modules sub-problems thesis tion traveling salesman problem