A Cutting Plane Algorithm for the Linear Ordering Problem

Recommendations

scientific article; zbMATH DE number 3902051
scientific article; zbMATH DE number 1489805
A benchmark library and a comparison of heuristic methods for the linear ordering problem
scientific article; zbMATH DE number 3902393
Applying mod-\(k\)-cuts for solving linear ordering problems

Cited in

(only showing first 100 items - show all)

Robust Learning of Consumer Preferences
New Facets of the Linear Ordering Polytope
Strong formulations for mixed integer programming: A survey
A branch-and-bound algorithm for the linear ordering problem with cumulative costs
Voting schemes for which it can be difficult to tell who won the election
Classical cuts for mixed-integer programming and branch-and-cut
Strong Condorcet criterion for the linear ordering problem
A branch-and-cut algorithm for vehicle routing problems
A minimum violations ranking method
scientific article; zbMATH DE number 4116248 (Why is no real title available?)
Applying mod-\(k\)-cuts for solving linear ordering problems
The linear ordering problem with clusters: a new partial ranking
The linear ordering problem: instances, search space analysis and algorithms
Nonnormal deterministic equivalents and a transformation in stochastic mathematical programming
A polynomial-time solution to Papadimitriou and Steiglitz's ``traps
Linear time algorithms to solve the linear ordering problem for oriented tree based graphs
A combinatorial study of partial order polytopes
Tabu search for the dynamic bipartite drawing problem
A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments
The generalized assignment problem: Valid inequalities and facets
Models for concurrent product and process design
An inexact algorithm for the sequential ordering problem
New exact approaches to row layout problems
The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization
Analysis of a generalized linear ordering problem via integer programming
A benchmark library and a comparison of heuristic methods for the linear ordering problem
Exact and heuristic methods in combinatorial optimization. A study on the linear ordering and the maximum diversity problem
Computing minimal forecast horizons: an integer programming approach
Experiments in quadratic 0-1 programming
Algorithm of sequential analysis and sifting of variants for the linear ordering problem
Workload balancing and loop layout in the design of a flexible manufacturing system
On approximability of linear ordering and related NP-optimization problems on graphs.
The linear ordering problem. Exact and heuristic methods in combinatorial optimization.
Exact algorithms for the quadratic linear ordering problem
An integer programming approach to optimal basic block instruction scheduling for single-issue processors
Cutting-plane proofs in polynomial space
The reversing number of a digraph
Fixing variables and generating classical cutting planes when using an interior point branch and cut method to solve integer programming problems
Bayesian network learning via topological order
The longest run subsequence problem
Could we use a million cores to solve an integer program?
A tutorial on branch and cut algorithms for the maximum stable set problem
An exact algorithm for the edge coloring by total labeling problem
Ising formulations of some graph-theoretic problems in psychological research: models and methods
Lagrangian relaxation and pegging test for linear ordering problems
Developing a ranking problem library (RPLIB) from a data-oriented perspective
On the linear ordering problem and the rankability of data
Facets of the linear ordering polytope
New semidefinite programming relaxations for the linear ordering and the traveling salesman problem
Quadratic assignment problems on series-parallel digraphs
A branch-and-cut algorithm for a resource-constrained scheduling problem
Disentangling relationships in symptom networks using matrix permutation methods
A new heuristic algorithm solving the linear ordering problem
Solving real-world linear ordering problems using a primal-dual interior point cutting plane method
Maximum planar subgraphs and nice embeddings: Practical layout tools
Semidefinite relaxations of ordering problems
A cutting-plane approach to the edge-weighted maximal clique problem
Facets and lifting procedures for the set covering polytope
Dynamic bundle methods
An updated survey on the linear ordering problem for weighted or unweighted tournaments
\(\{ 0,\frac12\}\)-Chvátal-Gomory cuts
A cutting plane algorithm for a clustering problem
A note on small linear-ordering polytopes
Integer programming in psychology: a review and directions for future research
Valid inequalities and facets of the capacitated plant location problem
Revised GRASP with path-relinking for the linear ordering problem
An exact method for the minimum feedback arc set problem
Heuristic implementation of dynamic programming for matrix permutation problems in combinatorial data analysis
scientific article; zbMATH DE number 3902393 (Why is no real title available?)
Fairness and the set of optimal rankings for the linear ordering problem
Exact and matheuristic methods for the parallel machine scheduling and location problem with delivery time and due date
A polyhedral approach to sequence alignment problems
The PACE 2024 parameterized algorithms and computational experiments challenge: one-sided crossing minimization
PACE solver description: exact solution of the one-sided crossing minimization problem by the MPPEG team
PACE solver description: UzL exact solver for one-sided crossing minimization
Multiprocessor scheduling under precedence constraints: polyhedral results
Variable neighborhood search for the linear ordering problem
Block-insertion-based algorithms for the linear ordering problem
A production planning problem in FMS
A survey on the linear ordering problem for weighted or unweighted tournaments
The linear ordering problem revisited
scientific article; zbMATH DE number 3902051 (Why is no real title available?)
Computing in combinatorial optimization
Solving matching problems with linear programming
On the hardness of approximating some NP-optimization problems related to minimum linear ordering problem
On discrete optimization with ordering
On the acyclic subgraph polytope
Facets of the balanced (acyclic) induced subgraph polytope
The rankability of data
Two-edge connected spanning subgraphs and polyhedra
Random utility without regularity
Facets and algorithms for capacitated lot sizing
Combinatorial optimization and small polytopes
A linear ordering problem with weighted rank
The Boolean quadric polytope
A cutting plane algorithm for the windy postman problem
Optimal solutions for the double row layout problem
A branch and bound algorithm for the minimum storage-time sequencing problem
The linear ordering problem with cumulative costs
On the optimal modeling and evaluation of job shops with a total weighted tardiness objective: constraint programming vs. mixed integer programming

Describes a project that uses

Uses Software

LOLIB

This page was built for publication: A Cutting Plane Algorithm for the Linear Ordering Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3217947)