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)

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

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)