Separating from the dominant of the spanning tree polytope (Q1200792): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0167-6377(92)90045-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1969468986 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the spanning tree polyhedron / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal attack and reinforcement of a network / rank
 
Normal rank
Property / cites work
 
Property / cites work: New primal and dual matching heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5684698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blocking and anti-blocking pairs of polyhedra / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:05, 17 May 2024

scientific article
Language Label Description Also known as
English
Separating from the dominant of the spanning tree polytope
scientific article

    Statements

    Separating from the dominant of the spanning tree polytope (English)
    0 references
    0 references
    16 January 1993
    0 references
    0 references
    separation problem
    0 references
    partition inequalities
    0 references
    spanning tree polytope of a graph
    0 references
    most violated inequality
    0 references
    maximum flow problems
    0 references
    0 references