The life span method -- a new variant of local search

DOI10.1007/BF03167318zbMath0912.90239OpenAlexW2090255633MaRDI QIDQ1275844

Mikio Kubo, Katsuki Fujisawa

Publication date: 25 May 1999

Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf03167318

zbMATH Keywords

tabu searchtraveling salesmanlocal searchgraph coloringquadratic assignmentgraph partitioningheuristic algorithmsjob-shop schedulingmaximum stable set problemlife span method

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Uses Software

• Genocop
• Tabu search

Cites Work

• Optimization by Simulated Annealing
• Using tabu search techniques for graph coloring
• Some experiments with simulated annealing for coloring graphs
• Optimization of resource location in hierarchical computer networks
• Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem
• STABULUS: A technique for finding stable sets in large graphs with tabu search
• The maximum clique problem
• A user's guide to tabu search
• Applying tabu search to the job-shop scheduling problem
• Massively parallel tabu search for the quadratic assignment problem
• Solving the maximum clique problem using a tabu search approach
• Collective Computation With Continuous Variables
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• Simulated Annealing – An Annotated Bibliography
• Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
• Job Shop Scheduling by Simulated Annealing
• Tabu Search—Part I
• Tabu Search—Part II
• Tabu Search Applied to the Quadratic Assignment Problem
• An Efficient Heuristic Procedure for Partitioning Graphs
• Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
• The Reactive Tabu Search
• A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
• Computer Solutions of the Traveling Salesman Problem
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item