A strongly polynomial algorithm for a new class of linear inequalities<sup>1</sup> (Q4836755): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Frank Werner / rank
Normal rank
 
Property / author
 
Property / author: Frank Werner / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q57634012 / rank
 
Normal rank
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.1080/02331939508844062 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2023559632 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a Genuinely Polynomial Algorithm for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Programming in Linear Time When the Dimension Is Fixed / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strongly polynomial minimum cost circulation algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3137900 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:00, 23 May 2024

scientific article; zbMATH DE number 766364
Language Label Description Also known as
English
A strongly polynomial algorithm for a new class of linear inequalities<sup>1</sup>
scientific article; zbMATH DE number 766364

    Statements

    A strongly polynomial algorithm for a new class of linear inequalities<sup>1</sup> (English)
    0 references
    0 references
    0 references
    0 references
    21 June 1995
    0 references
    strongly polynomial algorithms
    0 references
    linear programming problems
    0 references
    perfect systems of linear inequalities
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references