Sciweavers

4843 search results - page 197 / 969
» The Shortcut Problem - Complexity and Approximation
Sort
View
132
Voted
AMC
2006
115views more  AMC 2006»
15 years 3 months ago
A memetic algorithm for a vehicle routing problem with backhauls
This paper considers an extension of a vehicle routing problem with backhauls (VRPB). In this problem, a set of costumers are divided in two subsets consisting of linehaul and bac...
Reza Tavakkoli-Moghaddam, A. R. Saremi, M. S. Ziae...
88
Voted
FGCS
2006
57views more  FGCS 2006»
15 years 3 months ago
On a solvability of contact problems with visco-plastic friction in the thermo-visco-plastic Bingham rheology
This paper deals with the solvability of contact problems with a local visco-plastic friction in the thermo-visco-plastic Bingham rheology. The generalized case of bodies of arbit...
Jirí Nedoma
118
Voted
TRANSCI
2002
106views more  TRANSCI 2002»
15 years 3 months ago
The Stochastic Inventory Routing Problem with Direct Deliveries
Vendor managed inventory replenishment is a business practice in which vendors monitor their customers' inventories, and decide when and how much inventory should be replenis...
Anton J. Kleywegt, Vijay S. Nori, Martin W. P. Sav...
SIAMNUM
2010
96views more  SIAMNUM 2010»
14 years 10 months ago
On the Strong Convergence of Gradients in Stabilized Degenerate Convex Minimization Problems
Infimizing sequences in nonconvex variational problems typically exhibit enforced finer and finer oscillations called microstructures such that the infimal energy is not attained. ...
Wolfgang Boiger, Carsten Carstensen
162
Voted
FSTTCS
2001
Springer
15 years 8 months ago
The Directed Minimum-Degree Spanning Tree Problem
Consider a directed graph G = (V, E) with n vertices and a root vertex r ∈ V . The DMDST problem for G is one of constructing a spanning tree rooted at r, whose maximal degree is...
Radha Krishnan, Balaji Raghavachari