784 search results - page 12 / 157 » Relaxing the Value Restriction |
FSS
2002
13 years 7 months ago
2002
It is usually supposed that tolerance levels are determined by the decision maker a priori in flexible linear programming (FLP) problems. In this paper we shall suppose that the d...
FOCS
2006
IEEE
14 years 1 months ago
2006
IEEE
We consider the minimum cost spanning tree problem under the restriction that all degrees must be at most a given value k. We show that we can efficiently find a spanning tree o...
HEURISTICS
2008
13 years 7 months ago
2008
In this article we investigate a new variant of Variable Neighborhood Search (VNS): Relaxation Guided Variable Neighborhood Search. It is based on the general VNS scheme and a new...
IPL
2007
13 years 7 months ago
2007
Abstract. The Semiring Constraint Satisfaction Problem (SCSP) framework is a popular approach for the representation of partial constraint satisfaction problems. In this framework ...
STOC
2010
ACM
14 years 18 days ago
2010
ACM
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...