Pages that link to "Item:Q612873"

The following pages link to The linear ordering problem. Exact and heuristic methods in combinatorial optimization. (Q612873):

Displaying 45 items.

• Global solutions to folded concave penalized nonconvex learning (Q282459) (← links)
• Insertion based Lin-Kernighan heuristic for single row facility layout (Q339556) (← links)
• Rank aggregation in cyclic sequences (Q523159) (← links)
• New semidefinite programming relaxations for the linear ordering and the traveling salesman problem (Q729796) (← links)
• Primary facets of order polytopes (Q730181) (← links)
• The linear ordering problem with clusters: a new partial ranking (Q828738) (← links)
• A review of distances for the Mallows and generalized Mallows estimation of distribution algorithms (Q887179) (← links)
• A semidefinite optimization approach to the target visitation problem (Q895779) (← links)
• Testing a mixture model of single-peaked preferences (Q1642168) (← links)
• Testing probabilistic models of choice using column generation (Q1652625) (← links)
• Extended formulations for order polytopes through network flows (Q1736010) (← links)
• An integer programming approach to optimal basic block instruction scheduling for single-issue processors (Q1751173) (← links)
• Tabu search tutorial. A graph drawing application (Q1979170) (← links)
• Application of heuristic and metaheuristic algorithms in solving constrained Weber problem with feasible region bounded by arcs (Q1993202) (← links)
• Variable neighborhood algebraic differential evolution: an application to the linear ordering problem with cumulative costs (Q1999003) (← links)
• Analysis of a generalized linear ordering problem via integer programming (Q2009010) (← links)
• The rankability of weighted data from pairwise comparisons (Q2069943) (← links)
• On the linear ordering problem and the rankability of data (Q2072628) (← links)
• Regular random choice and the triangle inequalities (Q2087563) (← links)
• The target visitation arc routing problem (Q2121609) (← links)
• Automorphism groups and normal forms in Normaliz (Q2125270) (← links)
• Fairness and the set of optimal rankings for the linear ordering problem (Q2168622) (← links)
• A linear ordering problem of sets (Q2173116) (← links)
• Robust optimization for premarshalling with uncertain priority classes (Q2189929) (← links)
• A correct response model in knowledge structure theory (Q2244625) (← links)
• Block-insertion-based algorithms for the linear ordering problem (Q2289935) (← links)
• A branch-and-cut algorithm for the target visitation problem (Q2294072) (← links)
• Probabilistic transitivity in sports (Q2329722) (← links)
• The linear ordering problem revisited (Q2629715) (← links)
• The Rankability of Data (Q5025777) (← links)
• Tight Localizations of Feedback Sets (Q5102049) (← links)
• An Exact Method for the Minimum Feedback Arc Set Problem (Q5102057) (← links)
• Randomized Algorithms for Lexicographic Inference (Q5126607) (← links)
• Unbiased one-dimensional university ranking – application-based preference ordering (Q5137987) (← links)
• An Experimental Comparison of Algebraic Crossover Operators for Permutation Problems (Q5140142) (← links)
• A New Binary Programming Formulation and Social Choice Property for Kemeny Rank Aggregation (Q5868914) (← links)
• Linear ordering based MIP formulations for the vertex separation or pathwidth problem (Q5915912) (← links)
• Semidefinite relaxations for partitioning, assignment and ordering problems (Q5925162) (← links)
• Developing a ranking problem library (RPLIB) from a data-oriented perspective (Q6050403) (← links)
• Derivations of large classes of facet defining inequalities of the weak order polytope using ranking structures (Q6084673) (← links)
• Polytope volume in Normaliz (Q6116629) (← links)
• A linear ordering problem with weighted rank (Q6117320) (← links)
• Adjacencies on random ordering polytopes and flow polytopes (Q6134082) (← links)
• Solving the Kemeny ranking aggregation problem with quantum optimization algorithms (Q6139170) (← links)
• Binary programs for asymmetric betweenness problems and relations to the quadratic linear ordering problem (Q6491337) (← links)