Sciweavers

603 search results - page 43 / 121
» A General Approximation Technique for Constrained Forest Pro...
Sort
View
EOR
2010
88views more  EOR 2010»
15 years 1 months ago
Mathematical programming approaches for generating p-efficient points
Abstract: Probabilistically constrained problems, in which the random variables are finitely distributed, are nonconvex in general and hard to solve. The p-efficiency concept has b...
Miguel A. Lejeune, Nilay Noyan
IANDC
2007
123views more  IANDC 2007»
15 years 1 months ago
Hardness of fully dense problems
In the past decade, there has been a stream of work in designing approximation schemes for dense instances of NP-Hard problems. These include the work of Arora, Karger and Karpins...
Nir Ailon, Noga Alon
FGCS
2006
57views more  FGCS 2006»
15 years 1 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
IPCO
2008
114views Optimization» more  IPCO 2008»
15 years 2 months ago
The Stochastic Machine Replenishment Problem
We study the stochastic machine replenishment problem, which is a canonical special case of closed multiclass queuing systems in Markov decision theory. The problem models the sche...
Kamesh Munagala, Peng Shi
ESA
2007
Springer
122views Algorithms» more  ESA 2007»
15 years 5 months ago
A Practical Efficient Fptas for the 0-1 Multi-objective Knapsack Problem
Abstract. In the present work, we are interested in the practical behavior of a new fptas to solve the approximation version of the 0-1 multiobjective knapsack problem. Nevertheles...
Cristina Bazgan, Hadrien Hugot, Daniel Vanderpoote...