Capacitated two-stage time minimization transportation problem with restricted flow
From MaRDI portal
Publication:5269360
DOI10.1051/RO/2016033zbMATH Open1365.90217OpenAlexW2346416847MaRDI QIDQ5269360FDOQ5269360
Prabhjot Kaur, Vanita Verma, Kalpana Dahiya
Publication date: 15 June 2017
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1051/ro/2016033
combinatorial optimizationnon-convex programmingcapacitated transportation problemtime transportation problemflow constraint
Cited In (4)
- Bi-objective capacitated transportation problem with bounds over distributions and requirement capacities
- Branch-and-cut for a 2-commodity flow relocation model with time constraints
- A feasible flow-based iterative algorithm for the two-level hierarchical time minimization transportation problem
- Extension of particle swarm optimization algorithm for solving two-level time minimization transportation problem
Recommendations
- Capacitated two-stage time minimization transportation problem π π
- An iterative solution technique for capacitated two-stage time minimization transportation problem π π
- Title not available (Why is that?) π π
- A solution technique for capacitated two-level hierarchical time minimization transportation problem π π
- Capacitated transportation problem with bounds on rim conditions π π
- Bottleneck capacitated transportation problem with bounds on rim conditions π π
- A multi-stage algorithm for a capacitated vehicle routing problem with time constraints π π
- Title not available (Why is that?) π π
This page was built for publication: Capacitated two-stage time minimization transportation problem with restricted flow
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5269360)