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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1287/moor.24.1.130 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2006851287 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1287/MOOR.24.1.130 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:43, 19 December 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