Linear support vector machines (SVM) are useful for classifying large-scale sparse data. Problems with sparse features are common in applications such as document classification a...
This paper presents a sparse approach of solving the onesided Procrustes problem with special orthogonal constraint. By leveraging a planar decomposition common to all rotation ma...
The strategic safety stock placement problem is a constrained separable concave minimization problem and so is solvable, in principle, as a sequence of mixed-integer programming p...
Thomas L. Magnanti, Zuo-Jun Max Shen, Jia Shu, Dav...
Abstract— In previous work, we established a linear programming framework to determine sensor location from measured link distances between neighboring nodes in a network. Beside...
This paper considers constraint propagation methods for continuous constraint satisfaction problems consisting of linear and quadratic constraints. All methods can be applied after...