An iterative dynamic programming approach for the temporal knapsack problem
Copyright policy )An iterative dynamic programming approach for the temporal knapsack problem
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Combinatorial optimization, Lagrangian relaxation, Deterministic scheduling theory in operations research, Temporal knapsack, Exact algorithm, Successive Sublimation Dynamic Programming method, successive sublimation dynamic programming method, [MATH.MATH-OC] Mathematics [math]/Optimization and Control [math.OC], temporal knapsack, exact algorithm, Dynamic programming, Lagrangian Relaxation, Mixed integer programming
Combinatorial optimization, Lagrangian relaxation, Deterministic scheduling theory in operations research, Temporal knapsack, Exact algorithm, Successive Sublimation Dynamic Programming method, successive sublimation dynamic programming method, [MATH.MATH-OC] Mathematics [math]/Optimization and Control [math.OC], temporal knapsack, exact algorithm, Dynamic programming, Lagrangian Relaxation, Mixed integer programming
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).17 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Top 10%
Citations provided by BIP!Popularity provided by BIP!