This is a preview. Log in through your library . Abstract A Remes-type algorithm based on linear programming is presented for computing linear best Chebyshev approximations to multivariate functions.
The travelling salesman problem (TSP) remains one of the most challenging NP‐hard problems in combinatorial optimisation, with significant implications for logistics, network design and route planning ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results