Heuristic allocation based on a dynamic programming state-space representation

DOI10.1016/S0377-0427(01)00599-4zbMath1050.90018MaRDI QIDQ1602778

Andreea B. Dragut

Publication date: 24 June 2002

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

dynamic programmingallocation problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Dynamic programming (90C39) Discrete location and assignment (90B80)

Uses Software

• Knapsack

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear-space best-first search
• Dynamic programming with convexity, concavity and sparsity
• Auxiliary tool allocation in flexible manufacturing systems
• Welfarism and rationalizability in allocation problems with indivisibilities
• A military reserve manpower planning model
• Optimal control of a divergent multi-echelon inventory system
• New trends in exact algorithms for the \(0-1\) knapsack problem
• A class of greedy algorithms for the generalized assignment problem
• Consistency in house allocation problems
• Manpower allocation using genetic annealing
• A hybrid dynamic programming/branch-and-bound algorithm for the multiple- choice knapsack problem
• Generalized best-first search strategies and the optimality of A*
• THE MULTIPLE-CHOICE KNAPSACK PROBLEM
• Parallel Search Algorithms for Discrete Optimization Problems

This page was built for publication: Heuristic allocation based on a dynamic programming state-space representation