Sciweavers

108 search results - page 14 / 22
» mor 2006
Sort
View
MOR
2006
92views more  MOR 2006»
13 years 9 months ago
Polynomial-Time Separation of a Superclass of Simple Comb Inequalities
The comb inequalities are a well-known class of facet-inducing inequalities for the Traveling Salesman Problem, defined in terms of certain vertex sets called the handle and the t...
Lisa Fleischer, Adam N. Letchford, Andrea Lodi
MOR
2000
162views more  MOR 2000»
13 years 9 months ago
Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems
Given a network and a set of connection requests on it, we consider the maximum edge-disjoint paths and related generalizations and routing problems that arise in assigning paths f...
Alok Baveja, Aravind Srinivasan
MOR
2000
90views more  MOR 2000»
13 years 9 months ago
A PTAS for Minimizing the Total Weighted Completion Time on Identical Parallel Machines
We consider the problem of scheduling a set of n jobs on m identical parallel machines so as to minimize the weighted sum of job completion times. This problem is NP-hard in the s...
Martin Skutella, Gerhard J. Woeginger
MOR
2002
60views more  MOR 2002»
13 years 9 months ago
Properties of the Log-Barrier Function on Degenerate Nonlinear Programs
We examine the sequence of local minimizers of the log-barrier function for a nonlinear program near a solution at which second-order sufficient conditions and the Mangasarian-From...
Stephen J. Wright, Dominique Orban
MOR
2007
140views more  MOR 2007»
13 years 9 months ago
Adaptive Control Variates for Finite-Horizon Simulation
Adaptive Monte Carlo methods are simulation efficiency improvement techniques designed to adaptively tune simulation estimators. Most of the work on adaptive Monte Carlo methods h...
Sujin Kim, Shane G. Henderson