A simple greedy algorithm for a class of shuttle transportation problems

DOI10.1007/S11590-009-0126-9zbMATH Open1176.90063OpenAlexW2013517061MaRDI QIDQ732773FDOQ732773

Authors: Chuanqing Xu, Yu-Jun Zheng, Jinyun Xue 

Publication date: 15 October 2009

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-009-0126-9

Recommendations

• A greedy algorithm for solving ordinary transportation problem with capacity constraints
• scientific article; zbMATH DE number 3904297
• On Transportation Problems with Upper Bounds on Leading Rectangles
• A Simple Algorithm for Solving Small, Fixed-Charge Transportation Problems
• Greedy solutions of selection and ordering problems

zbMATH Keywords

combinatorial optimizationgreedy algorithmshuttle transportation problems

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Transportation, logistics and supply chain management (90B06)

Cites Work

• Introduction to algorithms
• Stochastic vehicle routing
• Title not available (Why is that?)
• Matroids and the greedy algorithm
• Notes on the theory of dynamic programming. Transportation models
• Algorithms. Design techniques and analysis
• The tridiagonal transportation problem

Cited In (6)

• A greedy algorithm for solving ordinary transportation problem with capacity constraints
• A problem reduction based approach to discrete optimization algorithm design
• Title not available (Why is that?)
• Greedy solutions of selection and ordering problems
• Algorithm design through the optimization of reuse-based generation
• On Transportation Problems with Upper Bounds on Leading Rectangles

This page was built for publication: A simple greedy algorithm for a class of shuttle transportation problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q732773)