We present a polynomial time approximation algorithm for unit time precedence constrained scheduling. Our algorithm guarantees schedules which are at most 2 - 7 3p+1 factor as lon...
Abstract— Evolutionary multi-objective optimization algorithms are commonly used to obtain a set of non-dominated solutions for over a decade. Recently, a lot of emphasis have be...
Karthik Sindhya, Ankur Sinha, Kalyanmoy Deb, Kaisa...
Processes that simulate natural phenomena have successfully been applied to a number of problems for which no simple mathematical solution is known or is practicable. Such meta-heu...
Shu-Chuan Chu, John F. Roddick, Che-Jen Su, Jeng-S...
We propose a general paradigm for computing optimal coordinate frame fields that may be exploited to visualize curves and surfaces. Parallel-transport framings, which work well fo...
Abstract We present a matrix-free line search algorithm for large-scale equality constrained optimization that allows for inexact step computations. For sufficiently convex problem...