Abstract
Search problems are ubiquitous. The search process is an adaptive process of cumulative performance selection. The structure of a given problem and the environment impose constraints. With the given constraints, a search process transforms a given problem from an initial state to a solution state.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
B. Abramson and M. Yung. Divide and conquer under global constraints: A solution to the n-queens problem. Journal of Parallel and Distributed Computing, 6: 649–662, 1989.
T.L. Adam, K.M. Chandy, and J.R. Dickson. A comparison of list scheduling for parallel processing systems. Communications of ACM, 17 (12): 685–690, Dec. 1974.
W. Ahrens. Mathematische Unterhaltungen und Spiele (in German). B.G. Teubner (Publishing Company), Leipzig, 1918–1921.
B. Bernhardsson. Explicit solutions to the n-queens problems for all n. ACM SIG ART Bulletin,2(2):7, Apr. 1991, ACM Press.
R.E. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Trans. on Computers, C-35(8): 677–691, Aug. 1986.
R.E. Bryant. Symbolic Botllean manipulation with ordered binary-decision diagrams. ACM Computing Surveys, 24 (3): 293–318, Sept. 1992.
H.R. Charney and D.L. Plato. Efficient partitioning of components. Proc. of the 5th Annual Design Automation Workshop, pages 16.0–16. 21, Jul. 1968.
Y.C. Chung and S. Ranka. Applications and performance analysis of a compile-time optimization approach for list scheduling algorithms on distributed memory multiprocessors. Supercomputer’92, Nov. 1992.
E. Coffman, editor. Computer and Job-Shop Scheduling Theory. John Wiley & Sons, 1976.
V. Cĕrny. A thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm. Technical report, Institute of Physics and Biophysics, Comenius University, Bratislava, 1982.
Ding-Zhu Du. Private Communications, 1993.
H. El-Rewini and T.G. Lewis. Scheduling parallel program tasks onto arbitrary target machines. Journal of Parallel and Distributed Computing, Jun. 1990.
H. El-Rewini, T.G. Lewis, and H. H. Ali. Task Scheduling in Parallel and Distributed Systems. Prentice Hall, 1994.
B.-J. Falkowski and L. Schmitz. A note on the queens’ problem. Information Processing Letters, Vol. 23: 39–46, July 1986.
C.M. Fiduccia and R.M. Matteyses. A linear-time heuristic for improving network partitioning. In Proc. 19th ACM/IEEE Design Automation Conference, pages 175–181. IEEE Computer Society Press, 1982.
L.R. Ford and D.R. Fulkerson. Flows in Networks. Princeton University Press, New Jersey, 1962.
J. Frankle and R.M. Karp. Circuit placement and cost bounds by eigenvector decomposition. In Proc. International Conference on Computer-Aided Design, pages 414–417, 1986.
M.R. Garey and D.S. Johnson. The complexity of near-optimal graph coloring. Journal of the ACM, 23: 43–49, Jan. 1976.
M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, San Francisco, 1979.
F. Glover. Tabu search — Part I. ORSA Journal on Computing, 1 (3): 190–206, Summer 1989.
B.L. Golden and W.R. Stewart. Empirical Analysis of Heuristics. In The Traveling Salesman Problem. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys, editors,pages 207–249. John Wiley & Sons, New York, 1985.
R.L. Graham, E.L. Lawler, J.K. Lenstra, and A.H.G. Rinnoy Kan. Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics, (5): 287–326, 1979.
G.A. Groes. A method for solving traveling-salesman problems. Operation Research, 6: 791–812, 1958.
J. Gu. Parallel algorithms and architectures for very fast search (PhD Thesis). Technical Report UUCS-TR-88–005, Jul. 1988.
J. Gu. Mapping a Computing Structure to the Problem Structure. In Parallel Algorithms and Architectures for Very Fast Search, chapter 5, pages 105–115. Technical Report UUCS-TR-88–005. Jul. 1988.
J. Gu. How to solve Very Large-Scale Satisfiability problems. Technical Report UUCS-TR-88–032. 1988, and UCECE-TR-90–002, 1990.
J. Gu. Optimization by multispace search. Technical Report UCECETR-90–001, Jan. 1990.
J. Gu. An αβ-relaxation for global optimization. Technical Report UCECE-TR-91–003, Apr. 1991.
J. Gu. Local search for large-scale scheduling and task assignment problems. Lecture Notes in Algorithm and Optimization, 1991–1996.
J. Gu. Efficient local search for very large-scale satisfiability problem. SIGART Bulletin,3(1):8–12, Jan. 1992, ACM Press.
J. Gu. On Optimizing a Search Problem. In Advanced Series on Artificial Intelligence, Vol. 1, chapter 2, pages 63–105. World Scientific, New Jersey, Jan. 1992.
J. Gu. Local search for satisfiability (SAT) problem. IEEE Trans. on Systems, Man, and Cybernetics, 23(4):1108–1129, Jul. 1993, and 24 (4): 709, Apr. 1994.
J. Gu. Multispace Search: A New Optimization Approach (Summary). In Lecture Notes in Computer Science, Vol. 834, pages 252–260. 1994.
J. Gu. Optimization Algorithms for the Satisfiability (SAT) Problem. In Advances in Optimization and Approximation., pages 72–154. Kluwer Academic Publishers, 1994.
J. Gu. Global optimization for satisfiability (SAT) problem. IEEE Trans. on Knowledge and Data Engineering, 6(3):361–381, Jun. 1994, and 7 (1): 192, Feb. 1995.
J. Gu, H. Li, Z. Zhou, and B. Du. An efficient implementation of SAT1.5 algorithm. Technical report, USTC, Sept. 1995.
J. Gu and R. Puri. Asynchronous circuit synthesis by Boolean satisfiability. IEEE Transactions on CAD of Integrated Circuits and Systems, 14 (8): 961–973, Aug. 1995.
J. Gu. An aß Relaxation for Global Optimization. In Minimax and Applications, pages 251–268. Kluwer Academic Publishers, 1995.
J. Gu. Multispace search for satisfiability and NP-hard problems. DI-MACS Volume Series on Discrete Mathematics and Theoretical Computer Science, Vol. 35, pages 407–517, American Mathematical Society, 1997.
J. Gu. Randomized and deterministic local search for sat and scheduling problems. DIMACS Volume Series on Discrete Mathematics and Theoretical Computer Science, American Mathematical Society, 1998.
J. Gu and B. Du. Graph partitioning by simulated evolution. Technical Report UCECE-TR-92–001, Dept. of Electrical and Computer Engineering, Univ. of Calgary, Apr. 1992.
J. Gu, B. Du, and Y.K. Kwok. Design an efficient local search algorithm for DAG scheduling. COMP680 Applied Optimization Course Project Meeting, HKUST, Fall 1995.
J. Gu, B. Du, and D. Tsang. Quorumcast routing by multispace search. IEEE Transactions on Computers,to appear.
J. Gu and X. Huang. Local search with search space smoothing: A case study of the traveling salesman problem (TSP).Technical Report UCECE-TR-91–006, Aug. 1991. In IEEE Trans. on Systems, Man, and Cybernetics, 24(5):728–735, May 1994.
J. Gu and W. Wang. A novel discrete relaxation architecture. IEEE Trans. on Pattern Analysis and Machine Intelligence, 14 (8): 857–865, Aug. 1992.
J. Gu and X. Huang. A constraint network based approach to a shape from shading analysis of a polyhedron. In Proceedings of IJCNN’92, pages 441–446, Beijing, Nov. 1992.
J. Gu, W. Wang, and T. C. Henderson. A parallel architecture for discrete relaxation algorithm. IEEE Trans. on Pattern Analysis and Machine Intelligence, PAMI-9(6): 816–831, Nov. 1987.
J. Gu, M.Y. Wu, and W. Shu. Fast local search algorithms for DAG scheduling. Research Collaborations, Summer 1995.
J. Gu. Constraint-Based Search. Cambridge University Press, New York, to appear.
J.Gu. Optimization by Multispace Search. Kluwer Academic Publishers, to appear.
E. J. Hoffman, J. C. Loessi, and R. C. Moore. Constructions for the solution of the m queens problem. Mathematics Magazine, pages 66–72, 1969.
J. Holland. Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor, 1975.
E. Horowitz and S. Sahni. Fundamentals of Computer Algorithms. Computer Science Press, Rockville, 1978.
T.C. Hu. Parallel sequencing and assembly line problems. Operations Research, 9 (6): 841–848, 1961.
X. Huang, J. Gu, and Y. Wu. A constrained approach to multifont character recognition. IEEE Transactions on Pattern Analysis And Machine Intelligence, 15 (8): 838–843, Aug. 1993.
D.S.Johnson and L.A. McGeoch. The Traveling Salesman Problem (TSP): A Case Study in Local Optimization. In Local Search in Combinatorial Optimization, E.H.L. Aarts and J.K. Lenstra, editors. John Wiley and Sons, New York.
R. R. Johnson. Elements of a theory for computer performance. Unpublished Manuscript, Aug. 1988.
W. Lewis Johnson. Letter from the editor. SIGART Bulletin, 2(2):1, April 1991, ACM Press.
M.D. Johnston. Scheduling with neural networks — the case of the hubble space telescope. NASA Memo, 1989.
B. W. Kernighan and S. Lin. An Efficient Heuristic Procedure for Partitioning Graphs. The Bell Systems Technical Journal, pages 291–307, Feb. 1970.
A.A. Khan, C.L. McCreary, and M.S. Jones. A comparison of multiprocessor scheduling heuristics. Int’l Conf. on Parallel Processing, II: 243–250, Aug. 1994.
S. Kirkpatrick, C.D. Gelat, and M.P. Vecchi. Optimization by simulated annealing. Science, 220: 671–680, 1983.
B. Krishnamurthy. An improved min-cut algorithm for partitioning vlsi networks. IEEE Trans. on Computers, C-33: 438–446, May 1984.
B. Kruatrachue and T.G. Lewis. Grain size determination for parallel processing. IEEE Software, pages 23–32, Jan. 1988.
V. Kumar. Algorithms for constraint satisfaction problems: A survey. Technical Report TR-91–28, Dept. of Computer Science, Univ. of Minnesota, 1991.
V. Kumar. Algorithms for constraint satisfaction problems: A survey. The AI Magazine, 13 (1): 32–44, 1992.
Y.K. Kwok, I. Ahmad, and J. Gu. FAST: A low-complexity algorithm for efficient scheduling of DAGs on parallel processors. In Proc. of Int’l Conference on Parallel Processing, pages (II) 150–157, Aug. 1996.
E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys, editors. The Traveling Salesman Problem. John Wiley & Sons, New York, 1985.
M. Li. Private Communications, 1993.
H.-T. Liaw and C.-S. Lin. On the OBDD-representation of general Boolean functions. IEEE Trans. on Computers, C-41(6): 611–664, Jun. 1992.
S. Lin. Computer solutions of the traveling salesman problem. Bell Sys. Tech. Journal, 44 (10): 2245–2269, Dec. 1965.
S. Lin and B.W. Kernighan. An effective heuristic algorithm for the traveling salesman problem. Operation Research, 21: 498–516, 1973.
R. Margalef. Perspectives in Ecology Theory. University of Chicago Press, Chicago, 1968.
S. Minton, M.D. Johnston, A.B. Philips, and P. Laird. Solving large-scale constraint satisfaction and scheduling problems using a heuristic repair method. In Proceedings of AAAI’90, pages 17–24, Aug. 1990.
S. Minton, M.D. Johnston, A.B. Philips, and P. Laird. A heuristic repair method for constraint satisfaction and scheduling problems. Artificial Intelligence, 58: 161–205, 1992.
H. Morowitz. Energy Flow in Biology. Academic Press, New York, 1968.
J.P. Norback and R.F. Love. Geometric approaches to solving the traveling salesman problem. Management Science, 23: 1208–1223, 1977.
J.P. Norback and R.F. Love. Heuristic for the hamiltonian path problem in euclidian two space. J. Oper. Res. Soc. , 30: 363–368, 1979.
I. Or. Traveling Salesman-Type Combinatorial Problems and their Relation to the Logistics of Regional Blood Banking. PhD thesis, Northwestern University, Evanston, IL, 1976.
J.C. Park and C.G. Han. Solving the survivable network design problem with search space smoothing. In Proc. of Conference on Network Optimization, University of Florida, Feb. 1996.
I. Prigogine. From Being to Becoming: Time and Complexity in the Physical Sciences. W.H. Freeman and Company, New York, 1980.
P.W. Purdom and G.N. Haven. Backtracking and probing. Technical Report No. 387, Dept. of Computer Science, Indiana University, Aug. 1993.
R. Puri and J. Gu. An efficient algorithm for computer microword length minimization. IEEE Transactions on CAD, 12 (10): 1449–1457, Oct. 1993.
R. Puri and J. Gu. An efficient algorithm to search for minimal closed covers in sequential machines. IEEE Transactions on CAD, 12 (6): 737–745, Jun. 1993.
M. Reichling. A simplified solution of the n queens’ problem. Information Processing Letters, Vol. 25: 253–255, June 1987.
D.J. Rosenkrantz, R.E. Stearns, and P.M. Lewis. An analysis of several heuristics for the traveling salesman problem. SIAM J. on Computing, 6: 563–581, 1977.
S. Russell and P. Norvig. Artificial Intelligence: A Modern Approach. Prentice-Hall, Englewood Cliffs, 1995.
L.A. Sanchis. Multi-way network partitioning. IEEE Trans. on Computers, 38: 62–81, Jan. 1989.
V. Sarkar. Partitioning and Scheduling Parallel Programs for Multiprocessors. The MIT Press, 1989.
J. Schneider, M. Dankesreiter, W. Fettes, I. Morgenstern, M. Schmid, and J.M. Singer. Search-space smoothing for combinatorial optimization problems. Physica A, 243: 77–112, 1997.
E. Schröedinger. What Is Life? Cambridge University Press, Cambridge, 1944.
D.M. Schuler and E.G. Ulrich. Clustering and linear placement. In Proc. of the 9th Annual Design Automation Workshop, pages 50–56, 1972.
B.M. Schwartzschild. Statistical mechanics algorithm for Monte Carlo optimization. Physics Today, 35: 17–19, 1982.
D.G. Schweikert and B.W. Kernighan. A proper model for the partitioning of electrical circuits. In Proc. 9th Design Automation Workshop, pages 57–62, 1972.
C. Sechen and D. Chen. An improved objective function for mincut circuit partitioning. In Proc. International Conference on Computer-Aided Design, pages 502–505, 1988.
B. Selman, H. Levesque, and D. Mitchell. A new method for solving hard satisfiability problems. In Proceedings of AAAI’92, pages 440–446, Jul. 1992.
G.C. Sih and E.A. Lee. A compile-time scheduling heuristic for interconnection-constrained heterogeneous processor architectures. IEEE Transactions on Parallel and Distributed Systems, 4 (2): 175–187, Feb. 1993.
R. Sosič and J. Gu. How to search for million queens. Technical Report UUCS-TR-88–008, Dept. of Computer Science, Univ. of Utah, Feb. 1988.
R. Sosič and J. Gu. A polynomial time algorithm for the n-queens problem. SIGART Bulletin,1(3):7–11, Oct. 1990, ACM Press.
R. Sosič and J. Gu. Fast search algorithms for the n-queens problem. IEEE Trans. on Systems, Man, and Cybernetics,SMC-21(6):1572–1576, Nov./Dec. 1991.
R. Sosič and J. Gu. 3,000,000 queens in less than one minute. SIGART Bulletin, 2(2):22–24, Apr. 1991, and IEEE Trans. on Knowledge and Data Engineering, Vol. 6, No. 5, pp. 661–668, Oct. 1994.
R. Sosič and J. Gu. Efficient local search with conflict minimization. IEEE Trans. on Knowledge and Data Engineering, 6 (5): 661–668, Oct. 1994.
R. Sosič and J. Gu. Quick n-queen search on VAX and Bobcat machines. CS 547 AI Class Project, Winter Quarter Feb. 1988.
W.R. Stewart. A computationally efficient heuristic for the traveling salesman problem. In Proc. 13th Annual Meeting of S.E. TIMS, pages 75–85, 1977.
H.S. Stone and J.M. Stone. Efficient search techniques-an empirical study of the n-queens problem. IBM J. Res. Develop. , 31 (4): 464–474, July 1987.
W. Wang and C.K. Rushforth. An adaptive local search algorithm for channel assignment problem. IEEE Trans. on Vehicular Technology, 45 (3): 459–466, Aug. 1996.
W. Wang and C.K. Rushforth. Structured partitioning for channel assignment problem. IEEE Trans. on Vehicular Technology, 1996.
Y.-C. Wei and C.-K. Cheng. Towards efficient hierarchical designs by radio cut partitioning. In Proc. International Conference on Computer-Aided Design, pages 298–301. IEEE Computer Society Press, 1989.
Y.-C. Wei and C.-K. Cheng. A two-level two-way partitioning algorithm. In Proc. International Conference on Computer-Aided Design, pages 516–519. IEEE Computer Society Press, 1990.
Y.-C. Wei and C.-K. Cheng. Ratio cut partitioning for hierarchical designs. IEEE Transactions on CAD, 10 (7): 438–446, Jul 1991.
M.Y. Wu and D.D. Gajski. Hypertool: A programming aid for message-passing systems. IEEE Transactions on Parallel and Distributed Systems, 1 (3): 330–343, July 1990.
M.Y. Wu, W. Shu, and J. Gu. Efficient local search for DAG scheduling. In Submitted for publication, 1996.
T. Yang and A. Gerasoulis. DSC: Scheduling parallel tasks on an unbounded number of processors. IEEE Transactions on Parallel and Distributed Systems, 5 (9): 951–967, Sept. 1994.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Kluwer Academic Publishers
About this chapter
Cite this chapter
Gu, J. (1998). Multispace Search for Combinatorial Optimization. In: Du, DZ., Pardalos, P.M. (eds) Handbook of Combinatorial Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-0303-9_30
Download citation
DOI: https://doi.org/10.1007/978-1-4613-0303-9_30
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7987-4
Online ISBN: 978-1-4613-0303-9
eBook Packages: Springer Book Archive