Separating Maximally Violated Comb Inequalities in Planar Graphs (Q2757587): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / OpenAlex ID
 
Property / OpenAlex ID: W2006851287 / rank
 
Normal rank

Revision as of 20:46, 19 March 2024

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