A hybrid dynamic programming for solving fixed cost transportation with discounted mechanism
DOI10.1155/2016/8518921OpenAlexW2286204851WikidataQ59129532 ScholiaQ59129532MaRDI QIDQ1659226FDOQ1659226
Authors: Farhad Ghassemi-Tari 
Publication date: 15 August 2018
Published in: Journal of Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2016/8518921
Recommendations
- scientific article; zbMATH DE number 6897337
- Dynamic multi-period transportation model for vehicle composition with transshipment points
- Optimal fleet composition via dynamic programming and golden section search
- Algorithms for solving the single-sink fixed-charge transportation problem
- scientific article; zbMATH DE number 2154249
Numerical mathematical programming methods (65K05) Combinatorial optimization (90C27) Dynamic programming (90C39) Transportation, logistics and supply chain management (90B06) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Cites Work
- Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- The fixed charge problem
- The transportation problem with exclusionary side constraints
- Surrogate Constraint Duality in Mathematical Programming
- Internet shopping with price sensitive discounts
- A column-and-cut generation algorithm for planning of Canadian armed forces tactical logistics distribution
- An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems
- Sourcing strategies in supply risk management: an approximate dynamic programming approach
- The bottleneck transportation problem with auxiliary resources
- A dynamic programming algorithm for the knapsack problem with setup
- The Generalized Penalty-Function/Surrogate Model
- A branch and search algorithm for a class of nonlinear knapsack problems
- Development of a hybrid dynamic programming approach for solving discrete nonlinear Knapsack problems
- Title not available (Why is that?)
- The imbedded state approach to reducing dimensionality in dynamic programs of higher dimensions
- An alternative solution algorithm for certain transportation problems
This page was built for publication: A hybrid dynamic programming for solving fixed cost transportation with discounted mechanism
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1659226)
