Pages that link to "Item:Q1816404"
From MaRDI portal
The following pages link to A new heuristic algorithm solving the linear ordering problem (Q1816404):
Displaying 26 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)
- Experiments with Kemeny ranking: What works when? (Q449040) (← links)
- The linear ordering problem with clusters: a new partial ranking (Q828738) (← links)
- Applying mod-\(k\)-cuts for solving linear ordering problems (Q839896) (← links)
- An updated survey on the linear ordering problem for weighted or unweighted tournaments (Q970187) (← links)
- On approximability of linear ordering and related NP-optimization problems on graphs. (Q1427183) (← links)
- Descent with mutations applied to the linear ordering problem (Q1661893) (← links)
- Subproblem ordering heuristics for AND/OR best-first search (Q1745717) (← links)
- The linear ordering problem: instances, search space analysis and algorithms (Q1774626) (← links)
- A new heuristic algorithm solving the linear ordering problem (Q1816404) (← links)
- Workload balancing and loop layout in the design of a flexible manufacturing system (Q1840856) (← links)
- On the linear ordering problem and the rankability of data (Q2072628) (← links)
- Block-insertion-based algorithms for the linear ordering problem (Q2289935) (← links)
- A branch-and-bound algorithm for the linear ordering problem with cumulative costs (Q2426525) (← links)
- On VLSI interconnect optimization and linear ordering problem (Q2443401) (← links)
- The linear ordering problem with cumulative costs (Q2482806) (← links)
- Variable neighborhood search for the linear ordering problem (Q2496057) (← links)
- The linear ordering problem revisited (Q2629715) (← links)
- A survey on the linear ordering problem for weighted or unweighted tournaments (Q2644372) (← links)
- On the hardness of approximating some NP-optimization problems related to minimum linear ordering problem (Q2773025) (← links)
- New results of ant algorithms for the linear ordering problem (Q2893627) (← links)
- Efficient local search algorithms for the linear ordering problem (Q3002554) (← links)
- LAGRANGIAN RELAXATION AND PEGGING TEST FOR LINEAR ORDERING PROBLEMS(<Special Issue>SCOPE (Seminar on Computation and OPtimization for new Extensions)) (Q3144756) (← links)
- (Q3680598) (← links)
- SOLO: A Linear Ordering Approach to Path Analysis of Web Site Traffic (Q6102772) (← links)