Applying mod-k-cuts for solving linear ordering problems
From MaRDI portal
Publication:839896
DOI10.1007/S11750-009-0096-1zbMATH Open1170.90469OpenAlexW2026724541MaRDI QIDQ839896FDOQ839896
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
Recommendations
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Cites Work
- New Facets of the Linear Ordering Polytope
- Embedding \(\{0, \frac{1}{2}\}\)-cuts in a branch-and-cut framework: a computational study
- \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts
- The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization
- Facets of the linear ordering polytope
- A Cutting Plane Algorithm for the Linear Ordering Problem
- Title not available (Why is that?)
- More facets from fences for linear ordering and acyclic subgraph polytopes
- 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
- Determining the automorphism group of the linear ordering polytope
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
Uses Software
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)
