Pages that link to "Item:Q1804580"

The following pages link to Greedy randomized adaptive search procedures (Q1804580):

Displaying 50 items.

• A heterogeneous cellular processing algorithm for minimizing the power consumption in wireless communications systems (Q902099) (← links)
• A constraint programming approach to the additional relay placement problem in wireless sensor networks (Q903915) (← links)
• Solving the capacitated location-routing problem. Abstract of Thesis (Q926566) (← links)
• Logic classification and feature selection for biomedical data (Q929151) (← links)
• Facility location for market capture when users rank facilities by shorter travel and waiting times (Q930936) (← links)
• Scatter search for the single source capacitated facility location problem (Q940848) (← links)
• A GRASP algorithm for the multi-criteria minimum spanning tree problem (Q940883) (← links)
• Expanding neighborhood search-GRASP for the probabilistic traveling salesman problem (Q941025) (← links)
• The GLOBAL optimization method revisited (Q941038) (← links)
• Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times (Q941547) (← links)
• A hybrid stochastic genetic-GRASP algorithm for clustering analysis (Q949381) (← links)
• Design of hybrids for the minimum sum-of-squares clustering problem (Q951921) (← links)
• A reactive GRASP for a commercial territory design problem with multiple balancing requirements (Q955609) (← links)
• A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem (Q959510) (← links)
• Honey bees mating optimization algorithm for large scale vehicle routing problems (Q968387) (← links)
• A greedy randomized adaptive search procedure (GRASP) for inferring logical clauses from examples in polynomial time and some extensions (Q969776) (← links)
• A GRASP\(\times \)ELS approach for the capacitated location-routing problem (Q976006) (← links)
• Speeding up continuous GRASP (Q976348) (← links)
• Capacitated lot sizing and sequence dependent setup scheduling: An iterative approach for integration (Q983631) (← links)
• Industrial aspects and literature survey: fleet composition and routing (Q991360) (← links)
• A hybrid heuristic algorithm for the open-pit-mining operational planning problem (Q992718) (← links)
• A route set construction algorithm for the transit network design problem (Q1010301) (← links)
• Analysis of new variable selection methods for discriminant analysis (Q1010495) (← links)
• Developing work schedules for an inter-city transit system with multiple driver types and fleet types (Q1011229) (← links)
• The equitable dispersion problem (Q1011261) (← links)
• Heuristics for the bi-objective path dissimilarity problem (Q1025234) (← links)
• A mathematical program to refine gene regulatory networks (Q1026217) (← links)
• Solving systems of nonlinear equations with continuous GRASP (Q1026675) (← links)
• Greedy randomized adaptive search and variable neighbourhood search for the minimum labelling spanning tree problem (Q1027523) (← links)
• A hybrid multi-swarm particle swarm optimization algorithm for the probabilistic traveling salesman problem (Q1038278) (← links)
• A hybrid evolution strategy for the open vehicle routing problem (Q1038279) (← links)
• GRASP and path relinking for the max-min diversity problem (Q1038285) (← links)
• A cross entropy based algorithm for reliability problems (Q1038840) (← links)
• Using a greedy random adaptative search procedure to solve the cover printing problem (Q1040963) (← links)
• GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem (Q1044091) (← links)
• A GRASP for a difficult single machine scheduling problem (Q1184452) (← links)
• A GRASP for the biquadratic assignment problem (Q1291786) (← links)
• Heuristics for the flow line problem with setup costs (Q1303708) (← links)
• Variable neighborhood search for the degree-constrained minimum spanning tree problem (Q1348252) (← links)
• Computational aspects of the maximum diversity problem (Q1360111) (← links)
• A minimax assignment problem in treelike communication networks (Q1390338) (← links)
• A variable neighborhood search for graph coloring. (Q1410622) (← links)
• GRASP and path relinking for the matrix bandwidth minimization. (Q1417505) (← links)
• GRASP for set packing problems. (Q1420382) (← links)
• The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations (Q1569939) (← links)
• New strategies for stochastic resource-constrained project scheduling (Q1617288) (← links)
• Heuristics for the constrained incremental graph drawing problem (Q1634310) (← links)
• Detecting robust cliques in graphs subject to uncertain edge failures (Q1640046) (← links)
• A combined multistart random constructive heuristic and set partitioning based formulation for the vehicle routing problem with time dependent travel times (Q1651555) (← links)
• An iterated ``hyperplane exploration'' approach for the quadratic knapsack problem (Q1652040) (← links)