Applying mod-\(k\)-cuts for solving linear ordering problems

DOI10.1007/s11750-009-0096-1zbMath1170.90469OpenAlexW2026724541MaRDI QIDQ839896

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)

Related Items (4)

New results on the windy postman problem ⋮ Extended formulations for order polytopes through network flows ⋮ Rank aggregation in cyclic sequences ⋮ The Rankability of Data

Uses Software

• ABACUS
• CPLEX
• LOLIB

Cites Work

• Unnamed Item
• More facets from fences for linear ordering and acyclic subgraph polytopes
• \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts
• On the separation of maximally violated mod-\(k\) cuts
• A note on small linear-ordering polytopes
• Facets of the linear ordering polytope: a unification for the fence family through weighted graphs
• Embedding {0, ½}-Cuts in a Branch-and-Cut Framework: A Computational Study
• A Cutting Plane Algorithm for the Linear Ordering Problem
• Facets of the linear ordering polytope
• New Facets of the Linear Ordering Polytope
• The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization
• Determining the automorphism group of the linear ordering polytope

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