We show that deciding whether a convex function is self-concordant is in general an intractable problem.

Evolutionary algorithms are sophisticated hill-climbers. In this paper, we discuss the ability of this class of local search algorithms to provide useful and eecient heuristics to solve NP-hard problems. Our discussion is illustrated on experiments aiming at solving the job-shop-scheduling problem. We focus on the components of the EA, pointing out the importance of the objective function as we...

University of Florida Technical Report 91-29 Abstract Graphs with delays associated with their edges are often used to model communication and signal flow networks. Network performance can be improved by upgrading the network vertices. Such an improvement reduces the edge delays and comes at a cost. We study different formulations of this network performance improvement problem and show that th...