Pages that link to "Item:Q2468777"

The following pages link to TTT plots: a perl program to create time-to-target plots (Q2468777):

Displaying 50 items.

• A biased random-key genetic algorithm to maximize the number of accepted lightpaths in WDM optical networks (Q312488) (← links)
• MILP formulations and an iterated local search algorithm with tabu thresholding for the order batching problem (Q319040) (← 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 hybrid Lagrangean heuristic with GRASP and path-relinking for set \(k\)-covering (Q336718) (← links)
• A hybrid data mining GRASP with path-relinking (Q336726) (← links)
• Power optimization in ad hoc wireless network topology control with biconnectivity requirements (Q336735) (← links)
• GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem (Q336743) (← links)
• A Pareto-metaheuristic for a bi-objective winner determination problem in a combinatorial reverse auction (Q336792) (← links)
• GRASP for the uncapacitated \(r\)-allocation \(p\)-hub median problem (Q336883) (← links)
• An iterated sample construction with path relinking method: application to switch allocation in electrical distribution networks (Q339534) (← links)
• A nonmonotone GRASP (Q340011) (← links)
• Hybrid method with CS and BRKGA applied to the minimization of tool switches problem (Q342275) (← links)
• A variable fixing heuristic with local branching for the fixed charge uncapacitated network design problem with user-optimal flow (Q342561) (← links)
• A general VNS heuristic for the traveling salesman problem with time windows (Q429659) (← 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)
• ILS heuristics for the single-machine scheduling problem with sequence-dependent family setup times to minimize total tardiness (Q670296) (← 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)
• A biased random-key genetic algorithm for routing and wavelength assignment under a sliding scheduled traffic model (Q785640) (← links)
• Tabu search and GRASP for the capacitated clustering problem (Q887182) (← links)
• GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem (Q1044091) (← links)
• Heuristic search to the capacitated clustering problem (Q1622798) (← links)
• Heuristics for the constrained incremental graph drawing problem (Q1634310) (← links)
• Making a state-of-the-art heuristic faster with data mining (Q1639223) (← links)
• Intelligent-guided adaptive search for the maximum covering location problem (Q1652063) (← links)
• A biased random-key genetic algorithm for the maximum quasi-clique problem (Q1653365) (← links)
• Evaluating balancing on social networks through the efficient solution of correlation clustering problems (Q1688940) (← links)
• Effective metaheuristic algorithms for the minimum differential dispersion problem (Q1751715) (← links)
• Variable neighborhood descent with iterated local search for routing and wavelength assignment (Q1761137) (← links)
• A diversified tabu search approach for the open-pit mine production scheduling problem with metal uncertainty (Q1926975) (← links)
• A mesh adaptive basin hopping method for the design of circular antenna arrays (Q1935264) (← links)
• \texttt{tttplots-compare}: a Perl program to compare time-to-target plots or general runtime distributions of randomized algorithms (Q2018872) (← links)
• Solving the integrated multi-period scheduling routing problem for cleaning debris in the aftermath of disasters (Q2106726) (← links)
• Reinforcement learning based tabu search for the minimum load coloring problem (Q2147014) (← links)
• An improved configuration checking-based algorithm for the unicost set covering problem (Q2239985) (← links)
• An extended goal programming model for the multiobjective integrated lot-sizing and cutting stock problem (Q2242390) (← links)
• Path relinking for unconstrained binary quadratic programming (Q2253377) (← links)
• Hybrid algorithms for placement of virtual machines across geo-separated data centers (Q2331587) (← 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)
• A tabu search for time-dependent multi-zone multi-trip vehicle routing problem with time windows (Q2356205) (← links)
• Heuristic methods to consecutive block minimization (Q2664289) (← links)
• MineReduce: an approach based on data mining for problem size reduction (Q2664324) (← links)
• Hybrid genetic search for the CVRP: open-source implementation and SWAP* neighborhood (Q2669771) (← links)
• GRASP with strategic oscillation for the \(\alpha \)-neighbor \(p\)-center problem (Q2673563) (← links)
• Hybrid data mining heuristics for the heterogeneous fleet vehicle routing problem (Q4611469) (← links)
• Extending time‐to‐target plots to multiple instances (Q4624885) (← links)