Pages that link to "Item:Q1774626"
From MaRDI portal
The following pages link to The linear ordering problem: instances, search space analysis and algorithms (Q1774626):
Displayed 16 items.
- Comparing Two Samples Through Stochastic Dominance: A Graphical Approach (Q107069) (← links)
- Generating new test instances by evolving in instance space (Q342041) (← 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)
- A review of distances for the Mallows and generalized Mallows estimation of distribution algorithms (Q887179) (← links)
- An updated survey on the linear ordering problem for weighted or unweighted tournaments (Q970187) (← links)
- Fairness and the set of optimal rankings for the linear ordering problem (Q2168622) (← links)
- Block-insertion-based algorithms for the linear ordering problem (Q2289935) (← links)
- A heuristic framework on a common generalization of the vehicle routing problem and the linear ordering problem (Q2358180) (← 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)
- Metaheuristics for Score-and-Search Bayesian Network Structure Learning (Q3305120) (← links)
- Randomized Algorithms for Lexicographic Inference (Q5126607) (← links)
- An Experimental Comparison of Algebraic Crossover Operators for Permutation Problems (Q5140142) (← links)
- A linear ordering problem with weighted rank (Q6117320) (← links)