Capacity allocation problem with random demands for the rail container carrier
From MaRDI portal
Publication:439359
DOI10.1016/j.ejor.2011.08.023zbMath1244.90262OpenAlexW2019643982MaRDI QIDQ439359
Chengxuan Cao, Keping Li, Zi-You Gao
Publication date: 16 August 2012
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2011.08.023
Applications of mathematical programming (90C90) Integer programming (90C10) Stochastic programming (90C15) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (2)
Model and algorithm for container allocation problem with random freight demands in synchromodal transportation ⋮ Capacity Allocation and Pricing for Take-or-Pay Reservation Contracts
Cites Work
- Unnamed Item
- Unnamed Item
- A multi-level search strategy for the 0-1 multidimensional knapsack problem
- An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem
- Opportunities for OR in intermodal freight transport research: A review.
- A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem
- Models and Algorithms for Container Allocation Problems on Trains in a Rapid Transshipment Shunting Yard
- Scheduling Direct and Indirect Trains and Containers in an Intermodal Setting
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
- A Note on Approximation Schemes for Multidimensional Knapsack Problems
- New Greedy-Like Heuristics for the Multidimensional 0-1 Knapsack Problem
- A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems
- Introduction to Stochastic Programming
- Capacity allocation to sales agents in a decentralized logistics network
This page was built for publication: Capacity allocation problem with random demands for the rail container carrier
