35 search results - page 4 / 7 » Decomposition and Dynamic Cut Generation in Integer Linear P... |
102
Voted
INFORMS
2000
15 years 28 days ago
2000
Time-indexed formulations for machine scheduling problems have received a great deal of attention; not only do the linear programming relaxations provide strong lower bounds, but ...
99
Voted
ISLPED
2003
ACM
15 years 6 months ago
2003
ACM
The power consumption of a sequential circuit can be reduced by decomposing it into subcircuits which can be turned off when inactive. Power can also be reduced by careful state e...
106
Voted
CPAIOR
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. In this paper we introduce a complex allocation and scheduling problem for variable voltage Multi-Processor System-on-Chip (MPSoC) platforms. We propose a methodology to ...
128
Voted
COR
2007
15 years 1 months ago
2007
We propose a hybrid method designed to solve a problem of dispatching and conflict free routing of automated guided vehicles (AGVs) in a flexible manufacturing system (FMS). Thi...
105
Voted
COR
2010
15 years 1 months ago
2010
In many real-life optimisation problems, there are multiple interacting components in a solution. For example, different components might specify assignments to different kinds of...