The linear ordering problem. Exact and heuristic methods in combinatorial optimization.
DOI10.1007/978-3-642-16729-4zbMATH Open1213.90005OpenAlexW2489850449MaRDI QIDQ612873FDOQ612873
Authors: Rafael Martí, Gerhard Reinelt 
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
Recommendations
- Exact and heuristic methods in combinatorial optimization. A study on the linear ordering and the maximum diversity problem
- A benchmark library and a comparison of heuristic methods for the linear ordering problem
- Applying mod-\(k\)-cuts for solving linear ordering problems
- A Cutting Plane Algorithm for the Linear Ordering Problem
- scientific article; zbMATH DE number 3902051
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)
Cited In (50)
- A review of distances for the Mallows and generalized Mallows estimation of distribution algorithms
- Polytope volume in Normaliz
- Tight localizations of feedback sets
- Solving the Kemeny ranking aggregation problem with quantum optimization algorithms
- Probabilistic transitivity in sports
- The linear ordering problem with clusters: a new partial ranking
- Application of heuristic and metaheuristic algorithms in solving constrained Weber problem with feasible region bounded by arcs
- Variable neighborhood algebraic differential evolution: an application to the linear ordering problem with cumulative costs
- Semidefinite relaxations for partitioning, assignment and ordering problems
- Extended formulations for order polytopes through network flows
- Global solutions to folded concave penalized nonconvex learning
- Analysis of a generalized linear ordering problem via integer programming
- The target visitation arc routing problem
- Exact and heuristic methods in combinatorial optimization. A study on the linear ordering and the maximum diversity problem
- Automorphism groups and normal forms in Normaliz
- A benchmark library and a comparison of heuristic methods for the linear ordering problem
- A New Binary Programming Formulation and Social Choice Property for Kemeny Rank Aggregation
- An integer programming approach to optimal basic block instruction scheduling for single-issue processors
- Developing a ranking problem library (RPLIB) from a data-oriented perspective
- Rank aggregation in cyclic sequences
- On the linear ordering problem and the rankability of data
- A linear ordering problem of sets
- New semidefinite programming relaxations for the linear ordering and the traveling salesman problem
- Primary facets of order polytopes
- Testing a mixture model of single-peaked preferences
- Robust optimization for premarshalling with uncertain priority classes
- A new heuristic algorithm solving the linear ordering problem
- A semidefinite optimization approach to the target visitation problem
- Insertion based Lin-Kernighan heuristic for single row facility layout
- On integer linear programs for treewidth based on perfect elimination orderings
- Testing probabilistic models of choice using column generation
- An experimental comparison of algebraic crossover operators for permutation problems
- Linear ordering based MIP formulations for the vertex separation or pathwidth problem
- An exact method for the minimum feedback arc set problem
- Fairness and the set of optimal rankings for the linear ordering problem
- The rankability of weighted data from pairwise comparisons
- Binary programs for asymmetric betweenness problems and relations to the quadratic linear ordering problem
- Unbiased one-dimensional university ranking -- application-based preference ordering
- Block-insertion-based algorithms for the linear ordering problem
- A branch-and-cut algorithm for the target visitation problem
- The linear ordering problem revisited
- A correct response model in knowledge structure theory
- The rankability of data
- A linear ordering problem with weighted rank
- Derivations of large classes of facet defining inequalities of the weak order polytope using ranking structures
- Regular random choice and the triangle inequalities
- Randomized algorithms for lexicographic inference
- Tabu search tutorial. A graph drawing application
- A branch-and-bound algorithm for the linear ordering problem with cumulative costs
- Adjacencies on random ordering polytopes and flow polytopes
Uses Software
This page was built for publication: The linear ordering problem. Exact and heuristic methods in combinatorial optimization.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q612873)
