Sciweavers

1984 search results - page 336 / 397
» The colourful feasibility problem
Sort
View
4OR
2010
137views more  4OR 2010»
13 years 10 months ago
Extended formulations in combinatorial optimization
This survey is concerned with the size of perfect formulations for combinatorial optimization problems. By "perfect formulation", we mean a system of linear inequalities...
Michele Conforti, Gérard Cornuéjols,...
BMCBI
2008
211views more  BMCBI 2008»
13 years 10 months ago
CPSP-tools - Exact and complete algorithms for high-throughput 3D lattice protein studies
Background: The principles of protein folding and evolution pose problems of very high inherent complexity. Often these problems are tackled using simplified protein models, e.g. ...
Martin Mann, Sebastian Will, Rolf Backofen
ANOR
2002
99views more  ANOR 2002»
13 years 9 months ago
An Inventory-Location Model: Formulation, Solution Algorithm and Computational Results
We introduce a distribution center (DC) location model that incorporates working inventory and safety stock inventory costs at the distribution centers. In addition, the model inco...
Mark S. Daskin, Collette R. Coullard, Zuo-Jun Max ...
CP
2010
Springer
13 years 8 months ago
An Integrated Business Rules and Constraints Approach to Data Centre Capacity Management
A recurring problem in data centres is that the constantly changing workload is not proportionally distributed over the available servers. Some resources may lay idle while others ...
Roman van der Krogt, Jacob Feldman, James Little, ...
INFOCOM
2011
IEEE
13 years 1 months ago
Secure and practical outsourcing of linear programming in cloud computing
—Cloud Computing has great potential of providing robust computational power to the society at reduced cost. It enables customers with limited computational resources to outsourc...
Cong Wang, Kui Ren, Jia Wang