Heuristic allocation based on a dynamic programming state-space representation (Q1602778): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Knapsack / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Manpower allocation using genetic annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Auxiliary tool allocation in flexible manufacturing systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Welfarism and rationalizability in allocation problems with indivisibilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized best-first search strategies and the optimality of A* / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal control of a divergent multi-echelon inventory system / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid dynamic programming/branch-and-bound algorithm for the multiple- choice knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic programming with convexity, concavity and sparsity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Search Algorithms for Discrete Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE MULTIPLE-CHOICE KNAPSACK PROBLEM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Consistency in house allocation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945108 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-space best-first search / rank
 
Normal rank
Property / cites work
 
Property / cites work: New trends in exact algorithms for the \(0-1\) knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3929076 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A military reserve manpower planning model / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of greedy algorithms for the generalized assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4843187 / rank
 
Normal rank

Latest revision as of 11:08, 4 June 2024

scientific article
Language Label Description Also known as
English
Heuristic allocation based on a dynamic programming state-space representation
scientific article

    Statements

    Heuristic allocation based on a dynamic programming state-space representation (English)
    0 references
    24 June 2002
    0 references
    The paper deals with the classical allocation problem. The problem is restated as a finite-horizon discrete deterministic dynamic problem, and a heuristic search algorithm for solving it is proposed.
    0 references
    0 references
    0 references
    0 references
    0 references
    allocation problem
    0 references
    dynamic programming
    0 references
    0 references