Signature classes of transportation polytopes (Q689115): 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: Q4191851 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Hirsch Conjecture for Dual Transportation Polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Signature Methods for the Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A competitive (dual) simplex method for the assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4539991 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matchings in bipartite graphs via strong spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transportation polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient dual simplex algorithms for the assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse dual transportation polyhedra: Extreme points and signatures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths on Polyhedra. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: The <i>d</i>-Step Conjecture and Its Relatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transportation problems which can be solved by the use of hirsch-paths for the dual problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof of the maximal diameter conjecture for the transportation polyhedron / rank
 
Normal rank
Property / cites work
 
Property / cites work: A relaxation column signature method for assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monotonic diameter of the perfect matching and shortest path polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Monotonic Bounded Hirsch Conjecture is False for Dimension at Least 4 / rank
 
Normal rank

Latest revision as of 10:32, 22 May 2024

scientific article
Language Label Description Also known as
English
Signature classes of transportation polytopes
scientific article

    Statements

    Signature classes of transportation polytopes (English)
    0 references
    0 references
    0 references
    9 December 1993
    0 references
    polytope
    0 references
    strongly polynomial algorithm
    0 references
    signature algorithms
    0 references
    transportation problems
    0 references
    diameter of the dual polyhedron
    0 references
    monotonic Hirsch conjecture
    0 references

    Identifiers