Capacity allocation problem with random demands for the rail container carrier (Q439359): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q264236
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Zi-You Gao / rank
 
Normal rank
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.ejor.2011.08.023 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2019643982 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Stochastic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Models and Algorithms for Container Allocation Problems on Trains in a Rapid Transshipment Shunting Yard / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multi-level search strategy for the 0-1 multidimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacity allocation to sales agents in a decentralized logistics network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5538306 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Greedy-Like Heuristics for the Multidimensional 0-1 Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Opportunities for OR in intermodal freight transport research: A review. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Approximation Schemes for Multidimensional Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Direct and Indirect Trains and Containers in an Intermodal Setting / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem / rank
 
Normal rank

Latest revision as of 14:12, 5 July 2024

scientific article
Language Label Description Also known as
English
Capacity allocation problem with random demands for the rail container carrier
scientific article

    Statements

    Capacity allocation problem with random demands for the rail container carrier (English)
    0 references
    0 references
    0 references
    0 references
    16 August 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    transportation
    0 references
    capacity allocation
    0 references
    rail container
    0 references
    stochastic integer programming
    0 references
    heuristic algorithm
    0 references
    0 references