CAPACITATED TWO-STAGE TIME MINIMIZATION TRANSPORTATION PROBLEM (Q3052717): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Algorithms for the minimax transportation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On lexicographic optimal solutions in transportation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5852661 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated transportation problem with bounds on rim conditions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The bottleneck transportation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Analysis of the Capacitated Transportation Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the bottleneck generalized assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalent weights for lexicographic multi-objective programs: Characterizations and computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two level hierarchical time minimizing transportation problem / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1142/s021759591000279x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1969518543 / rank
 
Normal rank

Latest revision as of 09:32, 30 July 2024

scientific article
Language Label Description Also known as
English
CAPACITATED TWO-STAGE TIME MINIMIZATION TRANSPORTATION PROBLEM
scientific article

    Statements

    CAPACITATED TWO-STAGE TIME MINIMIZATION TRANSPORTATION PROBLEM (English)
    0 references
    0 references
    0 references
    0 references
    1 November 2010
    0 references
    time transportation problem
    0 references
    combinatorial optimization
    0 references
    non-convex programming
    0 references
    bottleneck linear programming
    0 references
    capacitated transportation problem
    0 references

    Identifiers

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