Pages that link to "Item:Q1850839"
From MaRDI portal
The following pages link to An experimental evaluation of a scatter search for the linear ordering problem (Q1850839):
Displaying 31 items.
- Revised GRASP with path-relinking for the linear ordering problem (Q411258) (← links)
- A benchmark library and a comparison of heuristic methods for the linear ordering problem (Q429522) (← links)
- Adaptive memory programming for matrix bandwidth minimization (Q541991) (← links)
- The linear ordering problem with clusters: a new partial ranking (Q828738) (← links)
- Scatter search for the 0-1 multidimensional knapsack problem (Q928688) (← links)
- An updated survey on the linear ordering problem for weighted or unweighted tournaments (Q970187) (← links)
- Cyber swarm algorithms - improving particle swarm optimization using adaptive memory strategies (Q1037659) (← links)
- Intensification and diversification with elite tabu search solutions for the linear ordering problem (Q1302560) (← links)
- Scatter search for the stochastic travel-time vehicle routing problem with simultaneous pick-ups and deliveries (Q1761164) (← links)
- The linear ordering problem: instances, search space analysis and algorithms (Q1774626) (← links)
- Block-insertion-based algorithms for the linear ordering problem (Q2289935) (← links)
- A solution procedure for the discrete time, cost and quality tradeoff problem using electromagnetic scatter search (Q2383848) (← links)
- Solving two location models with few facilities by using a hybrid heuristic: a real health resources case (Q2387294) (← links)
- On VLSI interconnect optimization and linear ordering problem (Q2443401) (← links)
- A scatter search approach for the minimum sum-of-squares clustering problem (Q2485180) (← links)
- Minimizing labor requirements in a periodic vehicle loading problem (Q2490369) (← links)
- Variable neighborhood search for the linear ordering problem (Q2496057) (← links)
- Scatter search --- wellsprings and challenges (Q2570140) (← links)
- Principles of scatter search (Q2570141) (← links)
- Scatter search in software testing, comparison and collaboration with estimation of distribution algorithms (Q2570144) (← links)
- Solving feature subset selection problem by a parallel scatter search (Q2570148) (← links)
- Scatter search for project scheduling with resource availability cost (Q2570160) (← links)
- Experimental testing of advanced scatter search designs for global optimization of multimodal functions (Q2583180) (← links)
- The linear ordering problem revisited (Q2629715) (← links)
- A survey on the linear ordering problem for weighted or unweighted tournaments (Q2644372) (← links)
- Hybrid heuristics for the maximum diversity problem (Q2655404) (← links)
- Efficient local search algorithms for the linear ordering problem (Q3002554) (← links)
- A scatter search approach to sequence-dependent setup times job shop scheduling (Q3055324) (← links)
- Randomized Algorithms for Lexicographic Inference (Q5126607) (← links)
- Initialization of metaheuristics: comprehensive review, critical analysis, and research directions (Q6056893) (← links)
- SOLO: A Linear Ordering Approach to Path Analysis of Web Site Traffic (Q6102772) (← links)
