Pages that link to "Item:Q1850990"

The following pages link to Probability distribution of solution time in GRASP: an experimental investigation (Q1850990):

Displaying 42 items.

• A biased random-key genetic algorithm to maximize the number of accepted lightpaths in WDM optical networks (Q312488) (← links)
• An ILS-based algorithm to solve a large-scale real heterogeneous fleet VRP with multi-trips and docking constraints (Q322469) (← links)
• Heuristics for the generalized median graph problem (Q323345) (← links)
• A GRASP metaheuristic for microarray data analysis (Q336713) (← links)
• Power optimization in ad hoc wireless network topology control with biconnectivity requirements (Q336735) (← links)
• A nonmonotone GRASP (Q340011) (← links)
• Finding multiple roots of a box-constrained system of nonlinear equations with a biased random-key genetic algorithm (Q486399) (← links)
• Adaptive memory in multistart heuristics for multicommodity network design (Q535395) (← links)
• Comparative performance of tabu search and simulated annealing heuristics for the quadratic assignment problem (Q614047) (← 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)
• A bus driver scheduling problem: A new mathematical model and a GRASP approximate solution (Q763242) (← links)
• GRASP with path-relinking for the generalized quadratic assignment problem (Q763245) (← links)
• A biased random-key genetic algorithm for routing and wavelength assignment under a sliding scheduled traffic model (Q785640) (← links)
• Routing and wavelength assignment by partition colouring (Q819072) (← links)
• Statistical inferences for termination of Markov type random search algorithms (Q1035887) (← links)
• GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem (Q1044091) (← links)
• Grice-representability of response time distribution families (Q1261626) (← links)
• A biased random-key genetic algorithm for the maximum quasi-clique problem (Q1653365) (← links)
• Variable neighborhood descent with iterated local search for routing and wavelength assignment (Q1761137) (← links)
• Efficient solutions for the far from most string problem (Q1761847) (← links)
• \texttt{tttplots-compare}: a Perl program to compare time-to-target plots or general runtime distributions of randomized algorithms (Q2018872) (← links)
• Solving the traveling delivery person problem with limited computational time (Q2103948) (← links)
• Solving the integrated multi-period scheduling routing problem for cleaning debris in the aftermath of disasters (Q2106726) (← links)
• Efficient approaches for the flooding problem on graphs (Q2178332) (← links)
• Analysis of variable neighborhood descent as a local search operator for total weighted tardiness problem on unrelated parallel machines (Q2297569) (← links)
• Large-scale parallelism for constraint-based local search: the costas array case study (Q2342606) (← links)
• Designing vehicle routes for a mix of different request types, under time windows and loading constraints (Q2355860) (← links)
• Combinatorial search from an energy perspective (Q2419800) (← links)
• TTT plots: a perl program to create time-to-target plots (Q2468777) (← links)
• Hybridizations of GRASP with path relinking for the far from most string problem (Q2811940) (← links)
• GENVNS-TS-CL-PR: a heuristic approach for solving the vehicle routing problem with simultaneous pickup and delivery (Q2840778) (← links)
• A GRASP/VND heuristic for the phylogeny problem using a new neighborhood structure (Q3025048) (← links)
• Parallel Greedy Randomized Adaptive Search Procedures (Q3424837) (← links)
• Randomized heuristics for the Max-Cut problem (Q4405937) (← links)
• Extending time‐to‐target plots to multiple instances (Q4624885) (← links)
• Models and heuristics for the <i>k</i> ‐degree constrained minimum spanning tree problem with node‐degree costs (Q4648687) (← links)
• Artificial Intelligence and Soft Computing - ICAISC 2004 (Q4666349) (← links)
• On the problem of minimizing the cost with optical devices in Wavelength Division Multiplexing optical networks: complexity analysis, mathematical formulation and improved heuristics (Q5214308) (← links)
• Using sequential runtime distributions for the parallel speedup prediction of SAT local search (Q5398300) (← links)
• Model and methods to address urban road network problems with disruptions (Q6069920) (← links)
• Combining integer linear programming with a state‐of‐the‐art heuristic for the 2‐path network design problem (Q6070982) (← links)