Sciweavers

100 search results - page 11 / 20
» mp 2010
Sort
View
MP
2010
145views more  MP 2010»
14 years 8 months ago
The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm
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. ...
Irina Dumitrescu, Stefan Ropke, Jean-Franço...
MP
2010
103views more  MP 2010»
14 years 8 months ago
Relations between facets of low- and high-dimensional group problems
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...
Santanu S. Dey, Jean-Philippe P. Richard
MP
2010
99views more  MP 2010»
14 years 8 months ago
Separation, dimension, and facet algorithms for node flow polyhedra
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...
MAMMO
2010
Springer
14 years 11 months ago
Three Digital Mammography Display Configurations: Observer Performance in a Pilot ROC Study
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...
László K. Tabár, Alfredo S. N...
MP
2010
135views more  MP 2010»
14 years 8 months ago
An inexact Newton method for nonconvex equality constrained optimization
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...
Richard H. Byrd, Frank E. Curtis, Jorge Nocedal