On speed scaling via integer programming
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1306870 (Why is no real title available?)
- scientific article; zbMATH DE number 544186 (Why is no real title available?)
- scientific article; zbMATH DE number 2079319 (Why is no real title available?)
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- A nonlinear knapsack problem
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs
- Algorithms for dynamic speed scaling
- An Outer-Inner Approximation for Separable Mixed-Integer Nonlinear Programs
- An algorithmic framework for convex mixed integer nonlinear programs
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Deadline scheduling and power management for speed bounded processors
- Energy-efficient algorithms for flow time minimization
- Heuristic algorithms for the general nonlinear separable knapsack problem
- Lower and Upper Bounds for the Allocation Problem and Other Nonlinear Optimization Problems
- Mixed-integer nonlinear programs featuring ``on/off constraints
- Perspective reformulation and applications
- Perspective reformulations of mixed integer nonlinear programs with indicator variables
- Scheduling heterogeneous processors isn't as easy as you think
- Solving mixed integer nonlinear programs by outer approximation
- Speed scaling for stretch plus energy
- Speed scaling with an arbitrary power function
- The Nonlinear Resource Allocation Problem
- The nonlinear knapsack problem - algorithms and applications
Cited in
(2)
This page was built for publication: On speed scaling via integer programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1785426)