Greedy randomized adaptive search procedure for maximum independent set

Operations Research

Volumn 42, Issue 5, 1994, Pages 860-878

  Feo, Thomas A ^a   Resende, Mauricio G C ^a   Smith, Stuart H ^a  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; GRAPH THEORY; HEURISTIC METHODS; HEURISTIC PROGRAMMING; OPERATIONS RESEARCH; PARALLEL PROCESSING SYSTEMS; PROBABILITY; RANDOM PROCESSES; SET THEORY;

EXACT PARTIAL ENUMERATION METHOD; GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURE; MAXIMUM INDEPENDENT SET; SIMULATED ANNEALING; TABU SEARCH;

OPTIMIZATION;

EID: 0028510982     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.42.5.860     Document Type: Article

References (0)