A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
From MaRDI portal
Publication:4319768
DOI10.1287/opre.42.5.860zbMath0815.90121OpenAlexW2117942072MaRDI QIDQ4319768
Stuart H. Smith, Thomas A. Feo, Mauricio G. C. Resende
Publication date: 12 January 1995
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.42.5.860
simulated annealingtabu searchmaximum independent setrandomly generated graphsrandomized heuristicexact partial enumeration
Related Items (74)
A heuristic approach for minimizing weighted tardiness and overtime costs in single resource scheduling ⋮ A grasp-knapsack hybrid for a nurse-scheduling problem ⋮ Multiobjective GRASP with path relinking ⋮ On the unified dispersion problem: efficient formulations and exact algorithms ⋮ An ILS-based algorithm to solve a large-scale real heterogeneous fleet VRP with multi-trips and docking constraints ⋮ Advanced greedy randomized adaptive search procedure for the obnoxious \(p\)-median problem ⋮ A multi-objective model for environmental investment decision making ⋮ A GRASP with path-relinking heuristic for the survivable IP/MPLS-over-WSON multi-layer network optimization problem ⋮ GRASP with evolutionary path-relinking for the capacitated arc routing problem ⋮ A Pareto-metaheuristic for a bi-objective winner determination problem in a combinatorial reverse auction ⋮ Metaheuristics for the tabu clustered traveling salesman problem ⋮ An iterated sample construction with path relinking method: application to switch allocation in electrical distribution networks ⋮ Branch and bound for the cutwidth minimization problem ⋮ A hybrid metaheuristic algorithm for the vehicle routing problem with stochastic demands ⋮ A PERCENTILE SEARCH HEURISTIC FOR GENERALIZED ASSIGNMENT PROBLEMS WITH A VERY LARGE NUMBER OF JOBS ⋮ Discrete dynamical system approaches for Boolean polynomial optimization ⋮ Finding near-optimal independent sets at scale ⋮ Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem ⋮ Metaheuristics: A bibliography ⋮ Mathematical models to improve the current practice in a home healthcare unit ⋮ Reinforcement learning for combinatorial optimization: a survey ⋮ GRASP with strategic oscillation for the \(\alpha \)-neighbor \(p\)-center problem ⋮ MIP formulations for induced graph optimization problems: a tutorial ⋮ Variable neighborhood descent for the incremental graph drawing ⋮ An enhanced GRASP approach for the index tracking problem ⋮ Strategic oscillation for the balanced minimum sum-of-squares clustering problem ⋮ Maximum independent sets and supervised learning ⋮ A heterogeneous cellular processing algorithm for minimizing the power consumption in wireless communications systems ⋮ A variable neighborhood search approach for the vertex bisection problem ⋮ Solving the weighted MAX-SAT problem using the dynamic convexized method ⋮ GRASP for set packing problems. ⋮ Combining metaheuristics with mathematical programming, constraint programming and machine learning ⋮ Extending time‐to‐target plots to multiple instances ⋮ Turbo-Charging Dominating Set with an FPT Subroutine: Further Improvements and Experimental Analysis ⋮ GRASP and VNS for solving the \(p\)-next center problem ⋮ A GRASP for a difficult single machine scheduling problem ⋮ Simulated versus reduced noise quantum annealing in maximum independent set solution to wireless network scheduling ⋮ Balancing and scheduling tasks in assembly lines with sequence-dependent setup times ⋮ TTT plots: a perl program to create time-to-target plots ⋮ An efficient variable neighborhood search for the space-free multi-row facility layout problem ⋮ Fast local search for the maximum independent set problem ⋮ The generalized independent set problem: polyhedral analysis and solution approaches ⋮ Combining metaheuristics with mathematical programming, constraint programming and machine learning ⋮ Good solutions to discrete noxious location problems via metaheuristics ⋮ Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP ⋮ Methods to compare expensive stochastic optimization algorithms with random restarts ⋮ A distributed and hierarchical strategy for autonomic grid-enabled cooperative metaheuristics with applications ⋮ Embedding signed graphs in the line ⋮ Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms ⋮ Clonal selection: an immunological algorithm for global optimization over continuous spaces ⋮ Variable neighborhood search for the maximum clique ⋮ A hybrid heuristic for the maximum clique problem ⋮ A study of ACO capabilities for solving the maximum clique problem ⋮ \texttt{tttplots-compare}: a Perl program to compare time-to-target plots or general runtime distributions of randomized algorithms ⋮ A branch-and-cut algorithm for partition coloring ⋮ Multistart search for the cyclic cutwidth minimization problem ⋮ Mining relevant information on the Web: a clique-based approach ⋮ Simple and fast surrogate constraint heuristics for the maximum independent set problem ⋮ Greedy randomized adaptive search procedures ⋮ On the Power of Simple Reductions for the Maximum Independent Set Problem ⋮ The life span method -- a new variant of local search ⋮ GRASP with path relinking heuristics for the antibandwidth problem ⋮ GRASP and path relinking for the max-min diversity problem ⋮ A New Scatter Search Design for Multiobjective Combinatorial Optimization with an Application to Facility Location ⋮ An effective local search for the maximum clique problem ⋮ A grasp for single machine scheduling with sequence dependent setup costs and linear delay penalties ⋮ Randomized methods for the number partitioning problem ⋮ Toward unification of exact and heuristic optimization methods ⋮ Hybrid algorithms for placement of virtual machines across geo-separated data centers ⋮ Solving maximum independent set by asynchronous distributed hopfield-type neural networks ⋮ Solving the traveling delivery person problem with limited computational time ⋮ The maximum clique problem ⋮ An efficient tabu search approach for the 0-1 multidimensional knapsack problem ⋮ The maximum balanced subgraph of a signed graph: applications and solution approaches
This page was built for publication: A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
