Pages that link to "Item:Q4319768"

The following pages link to A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set (Q4319768):

Displaying 50 items.

• An ILS-based algorithm to solve a large-scale real heterogeneous fleet VRP with multi-trips and docking constraints (Q322469) (← links)
• Advanced greedy randomized adaptive search procedure for the obnoxious \(p\)-median problem (Q322911) (← links)
• A GRASP with path-relinking heuristic for the survivable IP/MPLS-over-WSON multi-layer network optimization problem (Q336733) (← links)
• GRASP with evolutionary path-relinking for the capacitated arc routing problem (Q336740) (← links)
• A Pareto-metaheuristic for a bi-objective winner determination problem in a combinatorial reverse auction (Q336792) (← links)
• An iterated sample construction with path relinking method: application to switch allocation in electrical distribution networks (Q339534) (← links)
• Branch and bound for the cutwidth minimization problem (Q339558) (← links)
• Fast local search for the maximum independent set problem (Q519101) (← links)
• Simulated versus reduced noise quantum annealing in maximum independent set solution to wireless network scheduling (Q669802) (← links)
• Good solutions to discrete noxious location problems via metaheuristics (Q689250) (← links)
• Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP (Q689251) (← links)
• Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms (Q693145) (← links)
• Clonal selection: an immunological algorithm for global optimization over continuous spaces (Q695337) (← links)
• Variable neighborhood search for the maximum clique (Q705505) (← links)
• A grasp-knapsack hybrid for a nurse-scheduling problem (Q835758) (← links)
• Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem (Q875414) (← links)
• A heterogeneous cellular processing algorithm for minimizing the power consumption in wireless communications systems (Q902099) (← links)
• Simple and fast surrogate constraint heuristics for the maximum independent set problem (Q1009195) (← links)
• GRASP and path relinking for the max-min diversity problem (Q1038285) (← links)
• An effective local search for the maximum clique problem (Q1041822) (← links)
• A GRASP for a difficult single machine scheduling problem (Q1184452) (← links)
• The life span method -- a new variant of local search (Q1275844) (← links)
• The maximum clique problem (Q1318271) (← links)
• GRASP for set packing problems. (Q1420382) (← links)
• An efficient tabu search approach for the 0-1 multidimensional knapsack problem (Q1609923) (← links)
• Metaheuristics for the tabu clustered traveling salesman problem (Q1652436) (← links)
• A hybrid metaheuristic algorithm for the vehicle routing problem with stochastic demands (Q1654357) (← links)
• Variable neighborhood descent for the incremental graph drawing (Q1687677) (← links)
• GRASP and VNS for solving the \(p\)-next center problem (Q1725619) (← links)
• The generalized independent set problem: polyhedral analysis and solution approaches (Q1753398) (← links)
• Methods to compare expensive stochastic optimization algorithms with random restarts (Q1756805) (← links)
• Greedy randomized adaptive search procedures (Q1804580) (← links)
• A heuristic approach for minimizing weighted tardiness and overtime costs in single resource scheduling (Q1885984) (← links)
• Metaheuristics: A bibliography (Q1919858) (← links)
• \texttt{tttplots-compare}: a Perl program to compare time-to-target plots or general runtime distributions of randomized algorithms (Q2018872) (← links)
• Multistart search for the cyclic cutwidth minimization problem (Q2026984) (← links)
• Solving the traveling delivery person problem with limited computational time (Q2103948) (← links)
• Discrete dynamical system approaches for Boolean polynomial optimization (Q2161551) (← links)
• Mathematical models to improve the current practice in a home healthcare unit (Q2178910) (← links)
• A variable neighborhood search approach for the vertex bisection problem (Q2201641) (← links)
• An efficient variable neighborhood search for the space-free multi-row facility layout problem (Q2242375) (← links)
• Embedding signed graphs in the line (Q2253962) (← links)
• Hybrid algorithms for placement of virtual machines across geo-separated data centers (Q2331587) (← links)
• The maximum balanced subgraph of a signed graph: applications and solution approaches (Q2356257) (← links)
• A multi-objective model for environmental investment decision making (Q2384603) (← links)
• Finding near-optimal independent sets at scale (Q2401330) (← links)
• Solving the weighted MAX-SAT problem using the dynamic convexized method (Q2439524) (← links)
• Balancing and scheduling tasks in assembly lines with sequence-dependent setup times (Q2467265) (← links)
• TTT plots: a perl program to create time-to-target plots (Q2468777) (← links)
• A hybrid heuristic for the maximum clique problem (Q2491328) (← links)