The linear ordering problem. Exact and heuristic methods in combinatorial optimization.
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) Combinatorial optimization (90C27) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59)
The book is devoted to the linear ordering problem. The authors survey state-of-the-art optimization methods, approximation results and discuss open questions concerning the linear ordering problem. The reader is provided with the basic definitions and basic heuristic methods in optimization. The set of publicly available benchmark instances for conducting computational experiments is described. Separate chapters discuss meta-heuristics and branch-and-cut methods. The authors study the convex hull of feasible solutions of the linear ordering problem and present a special version of branch-and-cut algorithm based on polyhedral combinatorics. Computational experiments comparing different methods for the linear ordering problem are reported.
- 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
- Testing a mixture model of single-peaked preferences
- Testing probabilistic models of choice using column generation
- Extended formulations for order polytopes through network flows
- An integer programming approach to optimal basic block instruction scheduling for single-issue processors
- A new heuristic algorithm solving the linear ordering problem
- Tabu search tutorial. A graph drawing application
- 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
- Analysis of a generalized linear ordering problem via integer programming
- The rankability of weighted data from pairwise comparisons
- On the linear ordering problem and the rankability of data
- Regular random choice and the triangle inequalities
- 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
- Fairness and the set of optimal rankings for the linear ordering problem
- A linear ordering problem of sets
- Robust optimization for premarshalling with uncertain priority classes
- A correct response model in knowledge structure theory
- Block-insertion-based algorithms for the linear ordering problem
- A branch-and-cut algorithm for the target visitation problem
- Probabilistic transitivity in sports
- A branch-and-bound algorithm for the linear ordering problem with cumulative costs
- The linear ordering problem revisited
- Global solutions to folded concave penalized nonconvex learning
- Insertion based Lin-Kernighan heuristic for single row facility layout
- A benchmark library and a comparison of heuristic methods for the linear ordering problem
- The rankability of data
- Tight localizations of feedback sets
- An exact method for the minimum feedback arc set problem
- Randomized algorithms for lexicographic inference
- Unbiased one-dimensional university ranking -- application-based preference ordering
- An experimental comparison of algebraic crossover operators for permutation problems
- Rank aggregation in cyclic sequences
- A New Binary Programming Formulation and Social Choice Property for Kemeny Rank Aggregation
- Linear ordering based MIP formulations for the vertex separation or pathwidth problem
- Semidefinite relaxations for partitioning, assignment and ordering problems
- Developing a ranking problem library (RPLIB) from a data-oriented perspective
- Derivations of large classes of facet defining inequalities of the weak order polytope using ranking structures
- 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
- Binary programs for asymmetric betweenness problems and relations to the quadratic linear ordering problem
- Greedy randomized adaptive search procedures with path relinking. An analytical review of designs and implementations
- The stochastic 2-binary choice problem
- On integer linear programs for treewidth based on perfect elimination orderings (extended version)
- A supervised learning approach to rankability
- Randomized collective choices based on a fractional tournament
- Matrix rationalization via partial orders
- A matheuristic for solving the single row facility layout problem
- New semidefinite programming relaxations for the linear ordering and the traveling salesman problem
- Primary facets of order polytopes
- The linear ordering problem with clusters: a new partial ranking
- A review of distances for the Mallows and generalized Mallows estimation of distribution algorithms
- A semidefinite optimization approach to the target visitation problem
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)
