A faster polynomial algorithm for the unbalanced Hitchcock transportation problem (Q1003485): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.orl.2008.01.011 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.orl.2008.01.011 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2089134982 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Time Algorithm for a $2 \times n$ Transportation Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Algorithms for Bipartite Network Flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Large Zero-One Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time bounds for selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(n) algorithm for the multiple-choice knapsack linear program / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5514188 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Minimum-Cost Circulations by Successive Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for the bottleneck transportation problem with a fixed number of sources / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selecting the <i>K</i>th Element in $X + Y$ and $X_1 + X_2 + \cdots + X_m $ / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strongly polynomial algorithm for the transportation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Theory and algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time algorithms for some separable quadratic programming 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: Efficient Algorithms for the Hitchcock Transportation Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4360320 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric quadrisection in linear time, with application to VLSI placement / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(n) algorithm for the linear multiple choice knapsack problem and related problems / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.ORL.2008.01.011 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:22, 10 December 2024

scientific article
Language Label Description Also known as
English
A faster polynomial algorithm for the unbalanced Hitchcock transportation problem
scientific article

    Statements

    A faster polynomial algorithm for the unbalanced Hitchcock transportation problem (English)
    0 references
    0 references
    4 March 2009
    0 references
    Hitchcock transportation problem
    0 references
    minimum cost flow problem
    0 references

    Identifiers