Separating Maximally Violated Comb Inequalities in Planar Graphs (Q2757587)

From MaRDI portal
Revision as of 04:16, 16 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Separating Maximally Violated Comb Inequalities in Planar Graphs
scientific article

    Statements

    Separating Maximally Violated Comb Inequalities in Planar Graphs (English)
    0 references
    0 references
    0 references
    26 November 2001
    0 references
    traveling salesman problem
    0 references
    comb inequalities
    0 references
    separation algorithms
    0 references
    cutting planes
    0 references

    Identifiers