Complexity, algorithms and applications of the integer network flow with fractional supplies problem (Q2060603): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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/j.orl.2021.06.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3168519844 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4395423 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / 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: Using Mixed Integer Programming for Matching in an Observational Study of Kidney Failure After Surgery / rank
 
Normal rank

Latest revision as of 12:22, 27 July 2024

scientific article
Language Label Description Also known as
English
Complexity, algorithms and applications of the integer network flow with fractional supplies problem
scientific article

    Statements

    Complexity, algorithms and applications of the integer network flow with fractional supplies problem (English)
    0 references
    0 references
    0 references
    0 references
    13 December 2021
    0 references
    0 references
    network flow
    0 references
    proportional imbalance
    0 references
    bounded total imbalance
    0 references
    fractional supplies
    0 references
    0 references