The following pages link to Scatter Search (Q17431):
Displaying 50 items.
- Solving the vehicle routing problem with adaptive memory programming methodology (Q1772865) (← links)
- About extracting dynamic information of unknown complex systems by neural networks (Q1791118) (← links)
- An evolutionary heuristic for quadratic 0-1 programming (Q1809845) (← links)
- Scatter search. Methodology and implementation in C. With CD-ROM. (Q1869927) (← links)
- Multilayer neural networks: an experimental evaluation of on-line training methods (Q1881654) (← links)
- Coupling ant colony systems with strong local searches (Q1926808) (← links)
- Design and analysis of hybrid metaheuristics for the reliability \(p\)-median problem (Q1926910) (← links)
- The single row facility layout problem: state of the art (Q1947218) (← links)
- On the performance of scatter search for post-enrolment course timetabling problems (Q2015784) (← links)
- A parallel evolutionary multiple-try Metropolis Markov chain Monte Carlo algorithm for sampling spatial partitions (Q2029093) (← links)
- On convergence of scatter search and star paths with directional rounding for 0--1 mixed integer programs (Q2064299) (← links)
- A novel hybrid multi-objective algorithm to solve the generalized cubic cell formation problem (Q2108168) (← links)
- Scatter search for the minimum leaf spanning tree problem (Q2147145) (← links)
- Quantum bridge analytics. II: QUBO-plus, network optimization and combinatorial chaining for asset exchange (Q2159525) (← links)
- Robust min-max regret covering problems (Q2162527) (← links)
- An improved method of particle swarm optimization for path planning of mobile robot (Q2199917) (← links)
- Hybrid matheuristics to solve the integrated lot sizing and scheduling problem on parallel machines with sequence-dependent and non-triangular setup (Q2239950) (← links)
- A hybrid adaptive iterated local search with diversification control to the capacitated vehicle routing problem (Q2240058) (← links)
- City-courier routing and scheduling problems (Q2253369) (← links)
- Path relinking for unconstrained binary quadratic programming (Q2253377) (← links)
- Flow shop scheduling with heterogeneous workers (Q2254003) (← links)
- Industrial aspects and literature survey: Combined inventory management and routing (Q2270436) (← links)
- A hybrid metaheuristic for the prize-collecting single machine scheduling problem with sequence-dependent setup times (Q2270448) (← links)
- A simulation-optimization approach for integrated sourcing and inventory decisions (Q2270451) (← links)
- Hybrid biobjective evolutionary algorithms for the design of a hospital waste management network (Q2271121) (← links)
- Enriched metaheuristics for the resource constrained unrelated parallel machine scheduling problem (Q2273695) (← links)
- Adaptive memory artificial bee colony algorithm for Green vehicle routing with cross-docking (Q2293789) (← links)
- A new bi-objective fuzzy portfolio selection model and its solution through evolutionary algorithms (Q2318256) (← links)
- Bilayer local search enhanced particle swarm optimization for the capacitated vehicle routing problem (Q2331412) (← links)
- Hybrid algorithms for placement of virtual machines across geo-separated data centers (Q2331587) (← links)
- A set covering approach for multi-depot train driver scheduling (Q2343986) (← links)
- A greedy randomized adaptive search procedure with path relinking for the shortest superstring problem (Q2344005) (← links)
- A matheuristic for the truck and trailer routing problem (Q2355939) (← links)
- A hybrid metaheuristic method for the maximum diversity problem (Q2356110) (← links)
- Schedule generation scheme for solving multi-mode resource availability cost problem by modified particle swarm optimization (Q2356121) (← links)
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis (Q2356202) (← links)
- A project portfolio selection problem in a group decision-making context (Q2358859) (← links)
- Minimizing total tardiness in parallel machine scheduling with setup times: an adaptive memory-based GRASP approach (Q2370333) (← links)
- Problems of discrete optimization: challenges and main approaches to solve them (Q2371716) (← links)
- Finding local optima of high-dimensional functions using direct search methods (Q2378372) (← links)
- Genetic algorithms for a supply management problem: MIP-recombination vs greedy decoder (Q2378418) (← links)
- A cooperative parallel tabu search algorithm for the quadratic assignment problem (Q2378423) (← links)
- A solution procedure for the discrete time, cost and quality tradeoff problem using electromagnetic scatter search (Q2383848) (← links)
- Local search-based hybrid algorithms for finding Golomb rulers (Q2385176) (← links)
- Solving two location models with few facilities by using a hybrid heuristic: a real health resources case (Q2387294) (← links)
- New heuristic algorithms for the windy rural postman problem (Q2387296) (← links)
- A quasi-multistart framework for global optimization of expensive functions using response surface models (Q2393073) (← links)
- Scatter search for minimizing weighted tardiness in a single machine scheduling with setups (Q2403268) (← links)
- Heuristics for urban road network design: lane layout and signal settings (Q2433540) (← links)
- Memetic self-adaptive evolution strategies applied to the maximum diversity problem (Q2448149) (← links)
