The pure fixed charge transportation problem (Q3960466): 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.1002/nav.3800260408 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1903816159 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-cost transportation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Exact Solution of the Fixed-Charge Transportation Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch Search Algorithm for the Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The fixed charge problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Group-Theoretic Structure in the Fixed-Charge Transportation Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Branch-and-Bound Algorithm for the Fixed-Charge Transportation Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximative algorithm for the fixed-charges transportation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—A Vertex Ranking Procedure for Solving the Linear Fixed-Charge Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Fixed Charge Problem by Ranking the Extreme Points / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for the generalized assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The fixed charge problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Direct Descent Binary Knapsack Algorithm / rank
 
Normal rank

Revision as of 16:09, 13 June 2024

scientific article
Language Label Description Also known as
English
The pure fixed charge transportation problem
scientific article

    Statements

    The pure fixed charge transportation problem (English)
    0 references
    0 references
    0 references
    1979
    0 references
    pure fixed charge transportation problem
    0 references
    only fixed costs
    0 references
    direct search procedure
    0 references
    LIFO decision rule
    0 references
    0-1 knapsack problems
    0 references
    computational results
    0 references
    optimal allocation of supply
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references