Multi-stage Benders Decomposition for Optimizing Multicore Architectures

DOI10.1007/978-3-540-68155-7_6zbMath1142.68506OpenAlexW1502746131MaRDI QIDQ5387619

Michele Lombardi, Marco Mantovani, Martino Ruggiero, Luca Benini, Michela Milano

Publication date: 27 May 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/978-3-540-68155-7_6

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Mathematical problems of computer architecture (68M07)

Related Items (11)

Constraint programming and operations research ⋮ Logic-based benders decomposition with a partial assignment acceleration technique for avionics scheduling ⋮ Computational evaluation of cut-strengthening techniques in logic-based Benders' decomposition ⋮ Multi-stage Benders Decomposition for Optimizing Multicore Architectures ⋮ Logic-Based Benders Decomposition for Large-Scale Optimization ⋮ Recursive logic-based Benders' decomposition for multi-mode outpatient scheduling ⋮ Optimal resource allocation and scheduling for the CELL BE platform ⋮ Stochastic allocation and scheduling for conditional task graphs in multi-processor systems-on-chip ⋮ A robust disaster preparedness model for effective and fair disaster response ⋮ Using Logic-Based Benders Decomposition to Solve the Capacity- and Distance-Constrained Plant Location Problem ⋮ Strengthening of feasibility cuts in logic-based benders decomposition

Cites Work

• Logic-based Benders decomposition
• Detecting infeasibility and generating cuts for mixed integer programming using constraint programming
• Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems
• Integer Programming and Constraint Programming in Solving a Multimachine Assignment Scheduling Problem with Deadlines and Release Dates
• Allocation and Scheduling for MPSoCs via Decomposition and No-Good Generation
• Planning and Scheduling to Minimize Tardiness
• Integrating Benders Decomposition Within Constraint Programming
• Multi-stage Benders Decomposition for Optimizing Multicore Architectures
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Recent Advances in Constraints
• Principles and Practice of Constraint Programming – CP 2004

This page was built for publication: Multi-stage Benders Decomposition for Optimizing Multicore Architectures