Library

feed icon rss

Your email was sent successfully. Check your inbox.

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

Proceed reservation?

Export
Filter
  • Key words: Arc Routing Problems – Undirected Rural Postman Problem – branch-and-cut – polyhedral analysis – facets  (1)
  • greedy random adaptive search procedure  (1)
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Annals of operations research 63 (1996), S. 511-623 
    ISSN: 1572-9338
    Keywords: Artificial intelligence ; bibliography ; combinatorial optimization ; constraint logic programming ; evolutionary computation ; genetic algorithms ; greedy random adaptive search procedure ; heuristics ; hybrids ; local search ; metaheuristics ; neural networks ; non-monotonic search strategies ; problem-space method ; simulated annealing ; tabu search ; threshold algorithms
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract Metaheuristics are the most exciting development in approximate optimization techniques of the last two decades. They have had widespread successes in attacking a variety of difficult combinatorial optimization problems that arise in many practical areas. This bibliography provides a classification of a comprehensive list of 1380 references on the theory and application of metaheuristics. Metaheuristics include but are not limited to constraint logic programming; greedy random adaptive search procedures; natural evolutionary computation; neural networks; non-monotonic search strategies; space-search methods; simulated annealing; tabu search; threshold algorithms and their hybrids. References are presented in alphabetical order under a number of subheadings.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 87 (2000), S. 467-481 
    ISSN: 1436-4646
    Keywords: Key words: Arc Routing Problems – Undirected Rural Postman Problem – branch-and-cut – polyhedral analysis – facets ; Mathematics Subject Classification (1991): 05c45
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract. The well-known Undirected Rural Postman Problem is considered and a binary linear problem using new dominance relations is presented. Polyhedral properties are investigated and a branch-and-cut algorithm is developed. Extensive computational results indicate that the algorithm is capable of solving much larger instances than previously reported.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...