A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
From MaRDI portal
Recommendations
Cited in
(85)- Simple and fast surrogate constraint heuristics for the maximum independent set problem
- GRASP and path relinking for the max-min diversity problem
- An effective local search for the maximum clique problem
- A GRASP for a difficult single machine scheduling problem
- The life span method -- a new variant of local search
- The maximum clique problem
- GRASP for set packing problems.
- An efficient tabu search approach for the 0-1 multidimensional knapsack problem
- Metaheuristics for the tabu clustered traveling salesman problem
- A hybrid metaheuristic algorithm for the vehicle routing problem with stochastic demands
- Variable neighborhood descent for the incremental graph drawing
- GRASP and VNS for solving the \(p\)-next center problem
- The generalized independent set problem: polyhedral analysis and solution approaches
- Methods to compare expensive stochastic optimization algorithms with random restarts
- Greedy randomized adaptive search procedures
- A heuristic approach for minimizing weighted tardiness and overtime costs in single resource scheduling
- Metaheuristics: A bibliography
- \texttt{tttplots-compare}: a Perl program to compare time-to-target plots or general runtime distributions of randomized algorithms
- Multistart search for the cyclic cutwidth minimization problem
- Solving the traveling delivery person problem with limited computational time
- Discrete dynamical system approaches for Boolean polynomial optimization
- Mathematical models to improve the current practice in a home healthcare unit
- A variable neighborhood search approach for the vertex bisection problem
- An efficient variable neighborhood search for the space-free multi-row facility layout problem
- Embedding signed graphs in the line
- Hybrid algorithms for placement of virtual machines across geo-separated data centers
- The maximum balanced subgraph of a signed graph: applications and solution approaches
- A multi-objective model for environmental investment decision making
- Solving the weighted MAX-SAT problem using the dynamic convexized method
- Balancing and scheduling tasks in assembly lines with sequence-dependent setup times
- TTT plots: a perl program to create time-to-target plots
- A hybrid heuristic for the maximum clique problem
- A study of ACO capabilities for solving 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
- Multiobjective GRASP with path relinking
- On the unified dispersion problem: efficient formulations and exact algorithms
- Reinforcement learning for combinatorial optimization: a survey
- GRASP with strategic oscillation for the \(\alpha \)-neighbor \(p\)-center problem
- On the power of simple reductions for the maximum independent set problem
- It is hard to know when greedy is good for finding independent sets
- Turbo-charging dominating set with an FPT subroutine: further improvements and experimental analysis
- A branch-and-cut algorithm for partition coloring
- GRASP with path relinking heuristics for the antibandwidth problem
- 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 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
- An iterated sample construction with path relinking method: application to switch allocation in electrical distribution networks
- Branch and bound for the cutwidth minimization problem
- Solving maximum independent set by asynchronous distributed hopfield-type neural networks
- scientific article; zbMATH DE number 4149905 (Why is no real title available?)
- scientific article; zbMATH DE number 1330075 (Why is no real title available?)
- Extending time-to-target plots to multiple instances
- A distributed and hierarchical strategy for autonomic grid-enabled cooperative metaheuristics with applications
- A New Scatter Search Design for Multiobjective Combinatorial Optimization with an Application to Facility Location
- Fast local search for the maximum independent set problem
- Toward unification of exact and heuristic optimization methods
- A PERCENTILE SEARCH HEURISTIC FOR GENERALIZED ASSIGNMENT PROBLEMS WITH A VERY LARGE NUMBER OF JOBS
- Mining relevant information on the Web: a clique-based approach
- Combining metaheuristics with mathematical programming, constraint programming and machine learning
- Combining metaheuristics with mathematical programming, constraint programming and machine learning
- A priori optimization for the probabilistic maximum independent set problem
- MIP formulations for induced graph optimization problems: a tutorial
- 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 unified pre-training and adaptation framework for combinatorial optimization on graphs
- The multiobjective traveling salesman-repairman problem with profits: design and implementation of a variable neighborhood descent algorithm for a real scenario
- Customized GRASP for rehabilitation therapy scheduling with appointment priorities and accounting for therapist satisfaction
- A metaheuristic algorithm for large maximum weight independent set problems
- Simulated versus reduced noise quantum annealing in maximum independent set solution to wireless network scheduling
- Good solutions to discrete noxious location problems via metaheuristics
- Avoiding local optima in the p-hub location problem using tabu search and GRASP
- Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms
- Clonal selection: an immunological algorithm for global optimization over continuous spaces
- A local search algorithm for large maximum weight independent set problems
- A GRASP-based multi-objective approach for the tuna purse seine fishing fleet routing problem
- Variable neighborhood search for the maximum clique
- Determining good solutions and validating them with a metaheuristic approach in social network influence minimization problems
- TABARIS: An exact algorithm based on tabu search for finding a maximum independent set in a graph
- A grasp-knapsack hybrid for a nurse-scheduling problem
- Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem
- A heterogeneous cellular processing algorithm for minimizing the power consumption in wireless communications systems
This page was built for publication: A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4319768)
