Buffered Resource Constraint: Algorithms and Complexity

DOI10.1007/978-3-319-07046-9_23zbMath1407.68447OpenAlexW2280361850MaRDI QIDQ5418740

Toby Walsh, Claude-Guy Quimper, Marc-André Ménard, Emmanuel Hebrard, Christian Bessiere

Publication date: 27 May 2014

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

Full work available at URL: https://doi.org/10.1007/978-3-319-07046-9_23

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Constraint programming for planning test campaigns of communications satellites

This page was built for publication: Buffered Resource Constraint: Algorithms and Complexity