The following pages link to Journal of Heuristics (Q89111):
Displaying 50 items.
- Sample size estimation for power and accuracy in the experimental comparison of algorithms (Q89113) (← links)
- Using resource scarceness characteristics to solve the multi-mode resource-constrained project scheduling problem (Q415556) (← links)
- A tabu search algorithm for the covering design problem (Q415558) (← links)
- Hybridized evolutionary local search algorithm for the team orienteering problem with time windows (Q415560) (← links)
- A comparative study of crossover in differential evolution (Q415564) (← links)
- Matching based very large-scale neighborhoods for parallel machine scheduling (Q415566) (← links)
- The robust binomial approach to chance-constrained optimization problems with application to stochastic partitioning of large process networks (Q518934) (← links)
- Fitness landscape analysis for the no-wait flow-shop scheduling problem (Q519086) (← links)
- The balanced academic curriculum problem revisited (Q519088) (← links)
- A mathematical model and a metaheuristic approach for a memory allocation problem (Q519090) (← links)
- A facility neighborhood search heuristic for capacitated facility location with single-source constraints and flexible demand (Q519091) (← links)
- On dominance-based multiobjective local search: design, implementation and experimental analysis on scheduling and traveling salesman problems (Q519093) (← links)
- Bounding, filtering and diversification in CP-based local branching (Q519096) (← links)
- Experimental analysis of heuristics for the bottleneck traveling salesman problem (Q519098) (← links)
- Fast local search for the maximum independent set problem (Q519101) (← links)
- Bee colony optimization for scheduling independent tasks to identical processors (Q519106) (← links)
- A distributed social choice protocol for combinatorial domains (Q524881) (← links)
- Proximity search for 0--1 mixed-integer convex programming (Q524882) (← links)
- Shift-and-propagate (Q524884) (← links)
- A hybrid genetic algorithm with solution archive for the discrete \((r|p)\)-centroid problem (Q524886) (← links)
- Hybrid evolutionary algorithm for the b-chromatic number (Q525060) (← links)
- A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems (Q525062) (← links)
- Exploiting subproblem optimization in SAT-based maxsat algorithms (Q525063) (← links)
- Comparative analysis of three metaheuristics for short-term open pit block sequencing (Q525065) (← links)
- Iterated local search with Trellis-neighborhood for the partial Latin square extension problem (Q525111) (← links)
- Partitioning (hierarchically clustered) complex networks via size-constrained graph clustering (Q525113) (← links)
- A reactive GRASP with path relinking for capacitated clustering (Q535394) (← links)
- Adaptive memory in multistart heuristics for multicommodity network design (Q535395) (← links)
- Local search heuristics for the multidimensional assignment problem (Q544814) (← links)
- A composite algorithm for multiprocessor scheduling (Q544815) (← links)
- Quantum-inspired evolutionary algorithms: a survey and empirical study (Q544816) (← links)
- Telecommunications network case study: selecting a data network architecture (Q556701) (← links)
- ATM routing algorithms for multimedia traffic in private ATM networks (Q556702) (← links)
- Fast, efficient equipment placement heuristics for broadband switched or internet router net\-works (Q556704) (← links)
- Virtual path design in service-specific ATM networks (Q556707) (← links)
- Design of stacked self-healing rings using a genetic algorithm (Q556709) (← links)
- A zoom-in approach to design SDH mesh restorable networks (Q556712) (← links)
- Heuristics for distribution network design in telecommunication (Q556715) (← links)
- LP-based heuristic algorithms for interconnecting token rings via source routing bridges (Q556719) (← links)
- Detecting and preventing routing problems in the planning process of CCSS\#7 networks (Q556723) (← links)
- Special issue: Hyper-heuristics in search and optimization. Some papers based on the presentations at the first workshop, Dortmund, Germany, September 13, 2008. (Q604336) (← links)
- A scatter search based hyper-heuristic for sequencing a mixed-model assembly line (Q604932) (← links)
- Generating meta-heuristic optimization code using ADATE (Q604934) (← links)
- A new dispatching rule based genetic algorithm for the multi-objective job shop problem (Q604936) (← links)
- Coalition-based metaheuristic: a self-adaptive metaheuristic using reinforcement learning and mimetism (Q604940) (← links)
- A cooperative hyper-heuristic search framework (Q604941) (← links)
- Autonomous operator management for evolutionary algorithms (Q604944) (← links)
- DVRP: a hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristic (Q604947) (← links)
- A heuristic method for non-homogeneous redundancy optimization of series-parallel multi-state systems (Q623310) (← links)
- Restricted dynamic programming based neighborhoods for the hop-constrained minimum spanning tree problem (Q623311) (← links)
