The ellipsoid method and its consequences in combinatorial optimization (Q1168215): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5567717 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two problems in connexion with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matching and a polyhedron with 0,1-vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum branchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5675543 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroid Intersection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4149476 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching, Euler tours and the Chinese postman / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal Flow Through a Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3292914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the orientation of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3859792 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to make a digraph strongly connected / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5572841 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing rooted directed cuts in a weighted directed graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Khachiyan’s algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-Completeness of Edge-Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-Commodity Network Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-commodity cut-packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3050157 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normal hypergraphs and the perfect graph conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-Matchings and 2-covers of hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3934404 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Shannon capacity of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Minimax Theorem for Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximal independent sets of vertices in claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Relaxation Method for Linear Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicommodity flows in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Odd Minimum Cut-Sets and <i>b</i>-Matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The matroids with the max-flow min-cut property / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two-commodity cut theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence rate of the gradient descent method with dilatation of the space / rank
 
Normal rank

Latest revision as of 16:38, 13 June 2024

scientific article
Language Label Description Also known as
English
The ellipsoid method and its consequences in combinatorial optimization
scientific article

    Statements

    The ellipsoid method and its consequences in combinatorial optimization (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1981
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    submodular set function
    0 references
    Khachiyan's algorithm
    0 references
    NP hardness
    0 references
    polynomial algorithms
    0 references
    polynomial complexity
    0 references
    vertex packing in perfect graphs
    0 references
    matching
    0 references
    matroid intersection problems
    0 references
    optimum covering of directed cuts of a digraph
    0 references
    fractional chromatic number
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references