An iterative dynamic programming approach for the temporal knapsack problem

Published 2020 View Full Article

  1. Home
  2. Publications
  3. Publication Search
  4. Publication Details
Title
An iterative dynamic programming approach for the temporal knapsack problem
Authors
Keywords
Temporal knapsack, Exact algorithm, Lagrangian relaxation, Successive sublimation dynamic programming method
Journal
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volume -, Issue -, Pages -
Publisher
Elsevier BV
Online
2020-12-25
DOI
10.1016/j.ejor.2020.12.036
References
View 5 related references

Ask authors/readers for more resources

Protocol

Community support

Reagent

Community support

Reprint

Contact the author

Become a Peeref-certified reviewer

The Peeref Institute provides free reviewer training that teaches the core competencies of the academic peer review process.

Get Started

Ask a Question. Answer a Question.

Quickly pose questions to the entire community. Debate answers and get clarity on the most important issues facing researchers.

Get Started
Webinars Posters Questions Hubs Funding Journals Articles Connect Collections Reviewers About Us FAQs Mobile App Privacy Policy Terms of Use
© Peeref 2019-2024. All rights reserved.