Multispace Search for Combinatorial Optimization

Jun Gu ()
Additional contact information
Jun Gu: University of Calgary, Dept. of Electrical and Computer Engineering

A chapter in Handbook of Combinatorial Optimization, 1998, pp 1929-2013 from Springer

Abstract: 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.

Keywords: Search Space; Local Search; Directed Acyclic Graph; Travel Salesman Problem; Travel Salesman Problem (search for similar items in EconPapers)
Date: 1998
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4613-0303-9_30

Ordering information: This item can be ordered from
http://www.springer.com/9781461303039

DOI: 10.1007/978-1-4613-0303-9_30

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().