Faster strongly polynomial algorithms for the unbalanced transportation problem and assignment problem with monge costs (Q2811304): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/net.21507 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2005598837 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Minimum Cost Matching and Transportation Using the Quadrangle Inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monge properties, discrete convexity and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perspectives of Monge properties in optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Factored Transportation Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two special cases of the assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Matching Algorithms for Points on a Polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Faster Strongly Polynomial Minimum Cost Flow Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A data structure for dynamic trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Instant transportation solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic trees in practice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple linear flow decomposition algorithms on trees, circles, and augmented trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Algorithms for Specially Structured Minimum Cost Flow Problems with Applications / rank
 
Normal rank

Latest revision as of 04:01, 12 July 2024

scientific article
Language Label Description Also known as
English
Faster strongly polynomial algorithms for the unbalanced transportation problem and assignment problem with monge costs
scientific article

    Statements

    Faster strongly polynomial algorithms for the unbalanced transportation problem and assignment problem with monge costs (English)
    0 references
    0 references
    0 references
    10 June 2016
    0 references
    0 references
    Monge matrix
    0 references
    transportation problem
    0 references
    assignment problem
    0 references
    networks flow algorithms
    0 references
    computational complexity
    0 references
    minimum cost flow problem
    0 references
    0 references