The linear ordering problem. Exact and heuristic methods in combinatorial optimization.
From MaRDI portal
Publication:612873
DOI10.1007/978-3-642-16729-4zbMath1213.90005OpenAlexW2489850449MaRDI QIDQ612873
Publication date: 16 December 2010
Published in: Applied Mathematical Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-16729-4
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
The target visitation arc routing problem, Automorphism groups and normal forms in Normaliz, Global solutions to folded concave penalized nonconvex learning, The linear ordering problem with clusters: a new partial ranking, The linear ordering problem revisited, Testing a mixture model of single-peaked preferences, Testing probabilistic models of choice using column generation, Insertion based Lin-Kernighan heuristic for single row facility layout, Fairness and the set of optimal rankings for the linear ordering problem, A linear ordering problem of sets, A review of distances for the Mallows and generalized Mallows estimation of distribution algorithms, Developing a ranking problem library (RPLIB) from a data-oriented perspective, Tight Localizations of Feedback Sets, An Exact Method for the Minimum Feedback Arc Set Problem, Robust optimization for premarshalling with uncertain priority classes, Derivations of large classes of facet defining inequalities of the weak order polytope using ranking structures, A semidefinite optimization approach to the target visitation problem, Polytope volume in Normaliz, A linear ordering problem with weighted rank, Adjacencies on random ordering polytopes and flow polytopes, Solving the Kemeny ranking aggregation problem with quantum optimization algorithms, On integer linear programs for treewidth based on perfect elimination orderings, Randomized Algorithms for Lexicographic Inference, Unbiased one-dimensional university ranking – application-based preference ordering, An Experimental Comparison of Algebraic Crossover Operators for Permutation Problems, Extended formulations for order polytopes through network flows, Tabu search tutorial. A graph drawing application, A correct response model in knowledge structure theory, An integer programming approach to optimal basic block instruction scheduling for single-issue processors, Application of heuristic and metaheuristic algorithms in solving constrained Weber problem with feasible region bounded by arcs, Rank aggregation in cyclic sequences, Variable neighborhood algebraic differential evolution: an application to the linear ordering problem with cumulative costs, Analysis of a generalized linear ordering problem via integer programming, Linear ordering based MIP formulations for the vertex separation or pathwidth problem, New semidefinite programming relaxations for the linear ordering and the traveling salesman problem, Primary facets of order polytopes, Block-insertion-based algorithms for the linear ordering problem, Semidefinite relaxations for partitioning, assignment and ordering problems, A branch-and-cut algorithm for the target visitation problem, The rankability of weighted data from pairwise comparisons, On the linear ordering problem and the rankability of data, Probabilistic transitivity in sports, Regular random choice and the triangle inequalities, A New Binary Programming Formulation and Social Choice Property for Kemeny Rank Aggregation, The Rankability of Data
Uses Software
