Sciweavers

12519 search results - page 305 / 2504
» Approximation Problems Categories
Sort
View
TRANSCI
2002
106views more  TRANSCI 2002»
15 years 6 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»
15 years 1 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
FSTTCS
2001
Springer
15 years 11 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
CIAC
2006
Springer
111views Algorithms» more  CIAC 2006»
15 years 10 months ago
Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments
Complementing recent progress on classical complexity and polynomial-time approximability of feedback set problems in (bipartite) tournaments, we extend and partially improve fixed...
Michael Dom, Jiong Guo, Falk Hüffner, Rolf Ni...
EVOW
2008
Springer
15 years 8 months ago
Metaheuristics for the Bi-objective Ring Star Problem
The bi-objective ring star problem aims to locate a cycle through a subset of nodes of a graph while optimizing two types of cost. The first criterion is to minimize a ring cost, r...
Arnaud Liefooghe, Laetitia Jourdan, Matthieu Basse...