An n‐step, 2‐variable search algorithm for the component placement problem
- 1 December 1973
- journal article
- Published by Wiley in Naval Research Logistics Quarterly
- Vol. 20 (4), 699-724
- https://doi.org/10.1002/nav.3800200409
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Computer-aided interconnection routing: General survey of the state-of-the-artNetworks, 1972
- Tree-search algorithms for quadratic assignment problemsNaval Research Logistics Quarterly, 1971
- An Algorithm for the Quadratic Assignment ProblemManagement Science, 1970
- Quadratic Assignment Problem Algorithms and the Location of Indivisible FacilitiesManagement Science, 1966
- The Optimal Assignment of Facilities to Locations by Branch and BoundOperations Research, 1966
- The formulation of some allocation and connection problems as integer programsNaval Research Logistics Quarterly, 1966
- A Heuristic Algorithm and Simulation Approach to Relative Location of FacilitiesManagement Science, 1963
- Optimal and Suboptimal Algorithms for the Quadratic Assignment ProblemJournal of the Society for Industrial and Applied Mathematics, 1962
- The Backboard Wiring Problem: A Placement AlgorithmSIAM Review, 1961
- Assignment Problems and the Location of Economic ActivitiesEconometrica, 1957