The Temporal Knapsack Problem and Its Solution

DOI10.1007/11493853_5MaRDI QIDQ5450920zbMATH OpenOpenAlexFDO

Authors Mark Bartlett, Alan M. Frisch, Youssef Hamadi, S. Armagan Tarim, Chris Unsworth, Ian Miguel

Publication date 17 March 2008

Published in Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11493853_5

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27)

Recommendations

• An iterative dynamic programming approach for the temporal knapsack problem
• An algorithm for solving a class of knapsack problems and its generalization
• Solving the temporal knapsack problem via recursive Dantzig-Wolfe reformulation
• scientific article; zbMATH DE number 1302173
• Algorithms for some hard knapsack problems

Cited in

(21)

• A PTAS for the time-invariant incremental knapsack problem
• An iterative dynamic programming approach for the temporal knapsack problem
• Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups
• A branch-and-price algorithm for the temporal bin packing problem
• Stabilized column generation for the temporal knapsack problem using dual-optimal inequalities
• Compact integer linear programming formulations for the temporal bin packing problem with fire-ups
• Improved algorithms for scheduling unsplittable flows on paths
• Experiments with the ``Oregon Trail knapsack problem
• Optimal interval scheduling with a resource constraint
• Modeling recreational systems using optimization techniques and information technologies
• Consistency cuts for Dantzig-Wolfe reformulations
• scientific article; zbMATH DE number 7278054 (Why is no real title available?)
• Solving the temporal knapsack problem via recursive Dantzig-Wolfe reformulation
• Resource allocation with time intervals
• A combinatorial flow-based formulation for temporal bin packing problems
• Worst-case analysis of heuristic approaches for the temporal bin packing problem with fire-ups
• Integer optimization models and algorithms for the multi-period non-shareable resource allocation problem
• Mathematical models based on decision hypergraphs for designing a storage cabinet
• Balancing individual and collective strategies: a new approach in metaheuristic optimization
• Generic machine-learning-augmented beam search for resource-constrained shortest path reformulations of combinatorial optimization problems
• Symmetry breaking constraints for value symmetries in constraint satisfaction

This page was built for publication: The Temporal Knapsack Problem and Its Solution

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5450920)