Pages that link to "Item:Q429522"

The following pages link to A benchmark library and a comparison of heuristic methods for the linear ordering problem (Q429522):

Displaying 16 items.

• ASlib: a benchmark library for algorithm selection (Q286390) (← links)
• Revised GRASP with path-relinking for the linear ordering problem (Q411258) (← links)
• The linear ordering problem. Exact and heuristic methods in combinatorial optimization. (Q612873) (← links)
• An assignment problem and its application in education domain: a review and potential path (Q721078) (← links)
• The linear ordering problem with clusters: a new partial ranking (Q828738) (← links)
• A semidefinite optimization approach to the target visitation problem (Q895779) (← links)
• The linear ordering problem: instances, search space analysis and algorithms (Q1774626) (← links)
• A new heuristic algorithm solving the linear ordering problem (Q1816404) (← links)
• Ranking with Hamiltonian dynamics (Q2077638) (← links)
• Block-insertion-based algorithms for the linear ordering problem (Q2289935) (← links)
• The linear ordering problem revisited (Q2629715) (← links)
• An optimization model for the student-to-project supervisor assignment problem-the case of an engineering department (Q2688892) (← links)
• Efficient local search algorithms for the linear ordering problem (Q3002554) (← links)
• A Cutting Plane Algorithm for the Linear Ordering Problem (Q3217947) (← links)
• Rankability and linear ordering problem: probabilistic insight and algorithms (Q6047898) (← links)
• A linear ordering problem with weighted rank (Q6117320) (← links)