Keyword: approximation

Found 80 papers in total
On robust online scheduling algorithms
On robust online scheduling algorithms
2011,
While standard parallel machine scheduling is concerned with good assignments of jobs...
Anisotropic e‐optimal model reduction for linear discrete time‐invariant system
Anisotropic e‐optimal model reduction for linear discrete time‐invariant system
2010,
We consider an ϵ ‐optimal model reduction problem for a linear discrete...
Infinite split scheduling: a new lower bound of total weighted completion time on parallel machines with job release dates and unavailability periods
Infinite split scheduling: a new lower bound of total weighted completion time on parallel machines with job release dates and unavailability periods
2010,
This paper addresses an identical parallel machine scheduling problem with job release...
An overview on polynomial approximation of NP-hard problems
An overview on polynomial approximation of NP-hard problems
2009,
The fact that polynomial time algorithm is very unlikely to be devised for an optimal...
An algorithm for approximating piecewise linear concave functions from sample gradients
An algorithm for approximating piecewise linear concave functions from sample gradients
2003,
An effective algorithm for solving stochastic resource allocation problems is to build...
Converting an area to discrete points in location analysis
Converting an area to discrete points in location analysis
1997,
Data that are given as a continuous function in an area are usually difficult to...
Keep it Simple
Keep it Simple
1998,
A number of examples are given where OR problems can be approached by simple...
On the minimax approximation in the class of the univariate piecewise constant functions
On the minimax approximation in the class of the univariate piecewise constant functions
1992,
The paper is concerned with the best approximation of a piecewise constant univariate...
Papers per page: