The nonconvex problem of minimum curvature is considered in detail and sufficient conditions for existence of solutions as well as characterizations are presented. The L ∞ minimization problem of ...

This paper presents three algorithms for solving linear programming problems in which some or all of the objective function coefficients are specified in terms of intervals. Which algorithm is ...

Integer linear programming can help find the answer to a variety of real-world problems. Now researchers have found a much faster way to do it. The traveling salesperson problem is one of the oldest ...