The global routing problem is becoming more and more important in the design of today's integrated circuits. A small chip may contain up to millions of components and wires. Although global routing can be formulated as an integer linear programming problem, it is hard to solve directly using currently available solvers. We discuss a relaxation of the problem to a linear programming (LP) formula...

Cloud computing is basically an internet based computing, whereby shared configurable resources are provided to cloud service consumers as services on demand. As an increasing growth of cloud computing, many enterprises provide different cloud services to cloud service consumers. From cloud service consumer's perspective, it is difficult to choose an appropriate cloud service that satisfies the...

The proper ratio decision of sintering burden is a significant section for both of decreasing sintering costs and increasing quality of iron. At present most company in China take the Fixed-ratio method and linear programming (LP) model to calculate the proper ratio for sintering. The former is the performance appraisal method for production cost management of iron. The latter is to use maths m...

In a previous work we developed a convex infinite dimensional linear programming (LP) approach to approximating the region of attraction (ROA) of polynomial dynamical systems subject to compact basic semialgebraic state constraints. Finite dimensional relaxations to the infinite-dimensional LP lead to a truncated moment problem in the primal and a polynomial sum-of-squares problem in the dual. ...

We have developed a new algorithm based on the mathematical theory of linear programming (LP) and implemented it in our program RAPTOR. Our new approach provides an elegant formulation of the protein-threading problem, overcomes the intractability problem of protein threading, in practice, and allows us to use existing powerful linear programming software to obtain optimal protein threading sol...

Coarse grain parallelism inherent in the solution of Linear Programming LP problems with block angular constraint matrices has been exploited in recent research works However these approaches su er from unscalability and load imbalance since they exploit only the exist ing block angular structure of the LP constraint matrix In this paper we consider decomposing LP constraint matrices to obtain ...

We review the recent progress in the design of e cient algorithms for various problems in geometric optimization. The emphasis in this survey is on the techniques used to attack these problems, such as parametric searching, geometric alternatives to parametric searching, prune-and-search techniques for linear programming and related problems, and LP-type problems and their e cient solution.

Clarkson’s algorithm is a two-staged randomized algorithm for solving linear programs. This algorithm has been simplified and adapted to fit the framework of LP-type problems. In this framework we can tackle a number of non-linear problems such as computing the smallest enclosing ball of a set of points in R. In 2006, it has been shown that the algorithm in its original form works for violator ...

This paper addresses a class of problems under interval data uncertainty, composed min-max regret generalisations classical 0-1 optimisation with costs. These are called robust-hard when their counterparts already NP-hard. The state-of-the-art exact algorithms for in general work by solving corresponding mixed integer linear programming formulation Benders’ decomposition fashion. Each the possi...