Sciweavers

706 search results - page 59 / 142
» An Integer Linear Programming Approach to Database Design
Sort
View
IPCO
2008
221views Optimization» more  IPCO 2008»
15 years 18 days ago
A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...
Michael Armbruster, Marzena Fügenschuh, Chris...
DATE
2009
IEEE
149views Hardware» more  DATE 2009»
15 years 6 months ago
An ILP formulation for task mapping and scheduling on multi-core architectures
Multi-core architectures are increasingly being adopted in the design of emerging complex embedded systems. Key issues of designing such systems are on-chip interconnects, memory a...
Ying Yi, Wei Han, Xin Zhao, Ahmet T. Erdogan, Tugh...
EVOW
2007
Springer
15 years 5 months ago
A Hybrid Method for Solving Large-Scale Supply Chain Problems
Abstract. The strategic supply chain design problem which allows capacity shifts and budget limitations can be formulated as a linear program. Since facilities are allowed to be op...
Steffen Wolf, Peter Merz
ISLPED
2003
ACM
96views Hardware» more  ISLPED 2003»
15 years 4 months ago
Effective graph theoretic techniques for the generalized low power binding problem
This paper proposes two very fast graph theoretic heuristics for the low power binding problem given fixed number of resources and multiple architectures for the resources. First...
Azadeh Davoodi, Ankur Srivastava
PATAT
2004
Springer
150views Education» more  PATAT 2004»
15 years 4 months ago
Logistics Service Network Design for Time-Critical Delivery
Abstract. Service network design is critical to the profitability of express shipment carriers. In this paper, we consider the problem of designing the integrated service network ...
Cynthia Barnhart, Su Shen