The Temporal Knapsack Problem and Its Solution

DOI10.1007/11493853_5zbMath1133.68425MaRDI QIDQ5450920

Youssef Hamadi, Mark Bartlett, S. Armagan Tarim, Alan M. Frisch, 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

90C27: Combinatorial optimization

68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)

Related Items

Unnamed Item, Consistency Cuts for Dantzig-Wolfe Reformulations, A combinatorial flow-based formulation for temporal bin packing problems, Optimal interval scheduling with a resource constraint, Modeling recreational systems using optimization techniques and information technologies, Resource allocation with time intervals, Symmetry breaking constraints for value symmetries in constraint satisfaction, 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