Pages that link to "Item:Q537984"

The following pages link to International Journal of Metaheuristics (Q537984):

Displaying 24 items.

• Efficient evaluations for solving large 0-1 unconstrained quadratic optimisation problems (Q537985) (← links)
• Heuristics for the bandwidth colouring problem (Q537987) (← links)
• Genetic algorithms with different representation schemes for complex hybrid flexible flow line problems (Q537990) (← links)
• A tabu search with vocabulary building approach for the vehicle routing problem with Split demands (Q537992) (← links)
• New upper bounds for the multi-depot capacitated arc routing problem (Q537994) (← links)
• Fast two-flip move evaluations for binary unconstrained quadratic optimisation problems (Q537995) (← links)
• CODEQ: an effective metaheuristic for continuous global optimisation (Q537996) (← links)
• An evolutionary programming algorithm for finding constrained optimal disjoint paths for multihop communication networks (Q538000) (← links)
• Integrated heuristics for scheduling multiple order jobs in a complex job shop (Q538004) (← links)
• Research note: the point of diminishing returns in heuristic search (Q2256907) (← links)
• Polynomial unconstrained binary optimisation -- part 1 (Q2256908) (← links)
• A particle swarm optimisation for fuzzy dynamic facility layout problem (Q2256910) (← links)
• Differential evolution for a constrained combinatorial optimisation problem (Q2256911) (← links)
• Polynomial unconstrained binary optimisation -- part 2 (Q2256912) (← links)
• DOE-based parameter tuning for local branching algorithm (Q2256913) (← links)
• A simulated annealing-based heuristic for the single allocation maximal covering hub location problem (Q2256914) (← links)
• Robust solutions for the software project scheduling problem: a preliminary analysis (Q2256915) (← links)
• An ant-colony approach for the design of optimal chunk scheduling policies in live peer-to-peer networks (Q2256916) (← links)
• Comparison of heuristics for the colourful travelling salesman problem (Q2256917) (← links)
• First-level tabu search approach for solving the multiple-choice multidimensional knapsack problem (Q2256919) (← links)
• Solution attractor of local search in travelling salesman problem: concept, construction and application (Q2256921) (← links)
• Assessment of modern metaheuristic algorithms -- HS, ABC and FA -- in shape and size optimisation of structures with different types of constraints (Q2256924) (← links)
• Using GRASP for designing a layered network: a real IP/MPLS over DWDM application case (Q2256925) (← links)
• A genetic algorithm for multi-objective optimisation in workflow scheduling with hard constraints (Q2256930) (← links)