Geometric optimisation and approximation algorithms form a vibrant research area that intersects computational geometry, combinatorial optimisation and algorithm design. Researchers are dedicated to ...
The Tactical Fixed Interval Scheduling Problem (TFISP) is the problem of determining the minimum number of parallel nonidentical machines, such that a feasible schedule exists for a given set of jobs.
This is a preview. Log in through your library . Abstract In this paper we discuss the application of Lawson's algorithm for computing best linear Chebyshev approximations to complex-valued functions.
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback