Applying mod-k-cuts for solving linear ordering problems

DOI10.1007/S11750-009-0096-1MaRDI QIDQ839896zbMATH OpenOpenAlexFDO

Authors Gerhard Reinelt, Marcus Oswald, Hanna Seitz

Publication date 3 September 2009

Published in Top (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11750-009-0096-1

zbMATH Keywords

branch-and-cutlinear ordering problemmod-\(k\) cuts

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Recommendations

• A Cutting Plane Algorithm for the Linear Ordering Problem
• scientific article; zbMATH DE number 3902051
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• scientific article; zbMATH DE number 1489805
• A new heuristic algorithm solving the linear ordering problem

Cites work

• scientific article; zbMATH DE number 3902051 (Why is no real title available?)
• A Cutting Plane Algorithm for the Linear Ordering Problem
• A note on small linear-ordering polytopes
• Determining the automorphism group of the linear ordering polytope
• Embedding \(\{0, \frac{1}{2}\}\)-cuts in a branch-and-cut framework: a computational study
• Facets of the linear ordering polytope
• Facets of the linear ordering polytope: a unification for the fence family through weighted graphs
• More facets from fences for linear ordering and acyclic subgraph polytopes
• New Facets of the Linear Ordering Polytope
• On the separation of maximally violated mod-\(k\) cuts
• The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization
• \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts

Cited in

(7)

• Extended formulations for order polytopes through network flows
• Analysis of a generalized linear ordering problem via integer programming
• The linear ordering problem. Exact and heuristic methods in combinatorial optimization.
• Rank aggregation in cyclic sequences
• A Cutting Plane Algorithm for the Linear Ordering Problem
• The rankability of data
• New results on the windy postman problem

Describes a project that uses

Uses Software

• LOLIB
• CPLEX
• ABACUS

This page was built for publication: Applying mod-\(k\)-cuts for solving linear ordering problems

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