The life span method -- a new variant of local search
type: Item
instance of: scholarly article
title: The life span method -- a new variant of local search
zbMATH Open document ID: 0912.90239
DOI: 10.1007/BF03167318
author: Mikio Kubo
author: Katsuki Fujisawa
published in: Japan Journal of Industrial and Applied Mathematics
publication date: 1999-05-25T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 1239886
zbMATH Keywords: heuristic algorithms
zbMATH Keywords: local search
zbMATH Keywords: life span method
zbMATH Keywords: tabu search
zbMATH Keywords: maximum stable set problem
zbMATH Keywords: traveling salesman
zbMATH Keywords: quadratic assignment
zbMATH Keywords: graph partitioning
zbMATH Keywords: graph coloring
zbMATH Keywords: job-shop scheduling
describes a project that uses: Genocop
describes a project that uses: Tabu search
MaRDI profile type: Publication
cites work: Q3994799
cites work: The Shifting Bottleneck Procedure for Job Shop Scheduling
cites work: The Reactive Tabu Search
cites work: Massively parallel tabu search for the quadratic assignment problem
cites work: Some experiments with simulated annealing for coloring graphs
cites work: Simulated Annealing – An Annotated Bibliography
cites work: Applying tabu search to the job-shop scheduling problem
cites work: A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
cites work: Q4350052
cites work: STABULUS: A technique for finding stable sets in large graphs with tabu search
cites work: Optimization of resource location in hierarchical computer networks
cites work: Q4198056
cites work: Solving the maximum clique problem using a tabu search approach
cites work: Tabu Search—Part I
cites work: Tabu Search—Part II
cites work: A user's guide to tabu search
cites work: Q4692508
cites work: Using tabu search techniques for graph coloring
cites work: Q4079017
cites work: Collective Computation With Continuous Variables
cites work: Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
cites work: Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
cites work: An Efficient Heuristic Procedure for Partitioning Graphs
cites work: Optimization by Simulated Annealing
cites work: Q3048571
cites work: Computer Solutions of the Traveling Salesman Problem
cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem
cites work: Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem
cites work: Q4315824
cites work: Q4350036
cites work: Q4739657
cites work: The maximum clique problem
cites work: Tabu Search Applied to the Quadratic Assignment Problem
cites work: Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
cites work: Job Shop Scheduling by Simulated Annealing
cites work: Q3785827
full work available at URL: https://doi.org/10.1007/bf03167318
OpenAlex ID: W2090255633
Recommended article: Q3441216
Recommended article: Q4739600
Recommended article: A new approach to choosing initial points in local search
Recommended article: Visiting near-optimal solutions using local search algorithms
Recommended article: A local search method for continuous global optimization
Recommended article: Randomized local search, evolutionary algorithms, and the minimum spanning tree problem
description: scientific article; zbMATH DE number 1239886