Library

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    A Constraint Programming Framework for Local Search Methods (1999)
    Springer
    Journal of heuristics 5 (1999), S. 255-279 
    Details
    ISSN: 1572-9397
    Keywords: local search ; constraint programming ; neighborhood model ; interface constraints ; tabu search ; traveling salesman problem with time windows ; personnel scheduling problem
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We propose in this paper a novel integration of local search algorithms within a constraint programming framework for combinatorial optimization problems, in an attempt to gain both the efficiency of local search methods and the flexibility of constraint programming while maintaining a clear separation between the constraints of the problem and the actual search procedure. Each neighborhood exploration is performed by branch-and-bound search, whose potential pruning capabilities open the door to more elaborate local moves, which could lead to even better approximate results. Two illustrations of this framework are provided, including computational results for the traveling salesman problem with time windows. These results indicate that it is one order of magnitude faster than the customary constraint programming approach to local search and that it is competitive with a specialized local search algorithm.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1009694016861
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Solving the maximum clique problem using a tabu search approach (1993)
    Springer
    Annals of operations research 41 (1993), S. 385-403 
    Details
    ISSN: 1572-9338
    Keywords: Maximum clique ; tabu search ; probabilistic tabu ; random graph generator ; approximate methods
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract We describe two variants of a tabu search heuristic, a deterministic one and a probabilistic one, for the maximum clique problem. This heuristic may be viewed as a natural alternative implementation of tabu search for this problem when compared to existing ones. We also present a new random graph generator, the $$\hat p$$ -generator, which produces graphs with larger clique sizes than comparable ones obtained by classical random graph generating techniques. Computational results on a large set of test problems randomly generated with this new generator are reported and compared with those of other approximate methods.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02023002
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...