Pages that link to "Item:Q1302560"
From MaRDI portal
The following pages link to Intensification and diversification with elite tabu search solutions for the linear ordering problem (Q1302560):
Displayed 28 items.
- Ranking data with ordinal labels: optimality and pairwise aggregation (Q374178) (← links)
- 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)
- Heuristic implementation of dynamic programming for matrix permutation problems in combinatorial data analysis (Q477965) (← links)
- Adaptive memory in multistart heuristics for multicommodity network design (Q535395) (← links)
- Adaptive memory programming for matrix bandwidth minimization (Q541991) (← links)
- A unified framework for population-based metaheuristics (Q646652) (← links)
- An unconstrained quadratic binary programming approach to the vertex coloring problem (Q817187) (← links)
- Tabu search and GRASP for the maximum diversity problem (Q857362) (← links)
- A hybrid meta-heuristic for the batching problem in just-in-time flow shops (Q864936) (← links)
- A heterogeneous cellular processing algorithm for minimizing the power consumption in wireless communications systems (Q902099) (← links)
- Scatter search and genetic algorithms for MAX-SAT problems (Q928686) (← links)
- An updated survey on the linear ordering problem for weighted or unweighted tournaments (Q970187) (← 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)
- Workload balancing and loop layout in the design of a flexible manufacturing system (Q1840856) (← links)
- A memetic algorithm with dynamic population management for an integrated production-distribution problem (Q2378412) (← links)
- On VLSI interconnect optimization and linear ordering problem (Q2443401) (← links)
- \(\text{MA}\mid\text{PM}\): memetic algorithms with population management (Q2496020) (← links)
- Variable neighborhood search for the linear ordering problem (Q2496057) (← links)
- Principles of scatter search (Q2570141) (← links)
- Combining path relinking and genetic algorithms for the multiple-level warehouse layout problem (Q2570145) (← links)
- Tabu search directed by direct search methods for nonlinear global optimization (Q2572240) (← links)
- Comparing metaheuristic algorithms for SONET network design problems (Q2573001) (← links)
- The linear ordering problem revisited (Q2629715) (← links)
- A survey on the linear ordering problem for weighted or unweighted tournaments (Q2644372) (← links)
- Efficient local search algorithms for the linear ordering problem (Q3002554) (← links)
- A scatter search approach with dispatching rules for a joint decision of cell formation and parts scheduling in batches (Q3163273) (← links)