The following pages link to PERL (Q13965):
Displayed 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 novel method for multivariate data modelling: Piecewise Generalized EMPR (Q395279) (← links)
- Regular languages with variables on graphs (Q418127) (← links)
- Translating regular expression matching into transducers (Q420836) (← links)
- A general VNS heuristic for the traveling salesman problem with time windows (Q429659) (← links)
- Multivariate data modelling through piecewise generalized HDMR method (Q445422) (← links)
- Finding multiple roots of a box-constrained system of nonlinear equations with a biased random-key genetic algorithm (Q486399) (← links)
- Divisorial cohomology vanishing on toric varieties (Q532784) (← links)
- Adaptive memory in multistart heuristics for multicommodity network design (Q535395) (← links)
- The program LOPT for least-squares optimization of energy levels (Q537026) (← links)
- A matrix based indexing HDMR method for multivariate data modelling (Q537983) (← links)
- Working with meta-data from C/C++ code in R: the RGCCTranslationUnit package (Q549628) (← links)
- A factorized high dimensional model representation on the nodes of a finite hyperprismatic regular grid (Q556126) (← links)
- ILS heuristics for the single-machine scheduling problem with sequence-dependent family setup times to minimize total tardiness (Q670296) (← links)
- A biased random-key genetic algorithm for the Steiner triple covering problem (Q691474) (← 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)
- Architectural modifications to deployed software (Q703582) (← 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)
- Searching for shortest single axioms for groups of exponent \(6\) (Q861707) (← links)
- Automatic formulation of stochastic programs via an algebraic modeling language (Q871689) (← links)
- Tabu search and GRASP for the capacitated clustering problem (Q887182) (← links)
- Tabu search versus GRASP for the maximum diversity problem (Q926570) (← links)
- A heuristic procedure for solving the dynamic probabilistic project expediting problem (Q948658) (← links)
- Succinctness of regular expressions with interleaving, intersection and counting (Q982670) (← links)
- Proving a manifold to be hyperbolic once it has been approximated to be so (Q1007202) (← links)
- Bound analysis in univariately truncated generalized high dimensional model representation for random-data partitioning: Interval GHDMR (Q1015929) (← links)
- Reading beside the lines: Using indentation to rank revisions by complexity (Q1021465) (← links)
- On the language equivalence of NE star-patterns (Q1041796) (← links)
- GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem (Q1044091) (← links)
- Combining Maple and Form to decide on integrability questions (Q1125200) (← links)
- Functional-logic integration via minimal reciprocal extensions (Q1275622) (← links)
- Cut and paste (Q1307691) (← links)
- Object-oriented programming in control system design: A survey (Q1333435) (← links)
- The LASY preprocessor and its application to general multidimensional codes (Q1383058) (← links)