A hybrid dynamic programming for solving fixed cost transportation with discounted mechanism
From MaRDI portal
Publication:1659226
DOI10.1155/2016/8518921OpenAlexW2286204851WikidataQ59129532 ScholiaQ59129532MaRDI QIDQ1659226
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
Numerical mathematical programming methods (65K05) Transportation, logistics and supply chain management (90B06) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Combinatorial optimization (90C27) Dynamic programming (90C39)
Cites Work
- Unnamed Item
- 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
- A dynamic programming algorithm for the knapsack problem with setup
- Internet shopping with price sensitive discounts
- The bottleneck transportation problem with auxiliary resources
- Sourcing strategies in supply risk management: an approximate dynamic programming approach
- A branch and search algorithm for a class of nonlinear knapsack problems
- Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming
- The transportation problem with exclusionary side constraints
- The imbedded state approach to reducing dimensionality in dynamic programs of higher dimensions
- Development of a hybrid dynamic programming approach for solving discrete nonlinear Knapsack problems
- An alternative solution algorithm for certain transportation problems
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Surrogate Constraint Duality in Mathematical Programming
- The fixed charge problem
- The Generalized Penalty-Function/Surrogate Model
This page was built for publication: A hybrid dynamic programming for solving fixed cost transportation with discounted mechanism
