The Traveling Salesman Problem with Pickup and Delivery (TSPPD) is defined on a graph containing pickup and delivery vertices between which there exists a one-toone relationship. ...
In this paper, we introduce an operation that creates families of facet-defining inequalities for highdimensional infinite group problems using facet-defining inequalities of l...
Abstract; Dedicated to Alan J. Hoffman Ball et al. propose a graph model for material compatibility constraints for products such as PCs made from components, where each componen...
Maren Martens, S. Thomas McCormick, Maurice Queyra...
The purpose of this study was to determine if displays that provide more grayscale levels (10bit vs. 8bit) can improve observer performance in breast cancer detection. The study wa...
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...