Keyword: sets

Found 278 papers in total
A note on the existence of optimal policies in total reward dynamic programs with compact action sets
A note on the existence of optimal policies in total reward dynamic programs with compact action sets
2000,
This work deals with Markov decision processes (MDPs) with expected total rewards,...
Simplex-like trajectories on quasi-polyhedral sets
Simplex-like trajectories on quasi-polyhedral sets
2001,
This paper presents a unified treatment of two new simplex-like methods for linear...
An application of soft sets in a decision making problem
An application of soft sets in a decision making problem
2002,
In this paper, we apply the theory of soft sets to solve a decision making problem...
On Barvinok's algorithm for counting lattice points in fixed dimension
On Barvinok's algorithm for counting lattice points in fixed dimension
1997,
We describe a simplification of a recent polynomial-time algorithm of A.I. Barvinok...
Stability in the discretization of a parametric semi-infinite convex inequality system
Stability in the discretization of a parametric semi-infinite convex inequality system
2002,
In this paper, we consider a parametric family of convex inequality systems in the...
A subgame property of stable equilibria
A subgame property of stable equilibria
1996,
Stable sets project onto stable sets of subgames in the following sense: stable sets...
Dominating sets for rectilinear center location problems with polyhedral barriers
Dominating sets for rectilinear center location problems with polyhedral barriers
2002,
In planner location problems with barriers one considers regions which are forbidden...
Local convergence of the proximal point algorithm and multiplier methods without monotonicity
Local convergence of the proximal point algorithm and multiplier methods without monotonicity
2002,
This paper studies the convergence of the classical proximal point algorithm without...
Characterization of Pareto dominance
Characterization of Pareto dominance
2003,
The Pareto dominance relation is shown to be the unique nontrivial partial order on...
Experimental analysis of heuristic algorithms for the dominating set problem
Experimental analysis of heuristic algorithms for the dominating set problem
2002,
We say a vertex upsilon in a graph G covers a vertex omega if upsilon = omega or if...
The 2-center problem with obstacles
The 2-center problem with obstacles
2002,
Given a set S of n points in the plane and a set 0 of pairwise disjoint simple...
Polychromatic sets and its application in simulating complex objects and systems
Polychromatic sets and its application in simulating complex objects and systems
2003,
In recent years, polychromatic sets have emerged as a promising approach for...
Stable multi-sets
Stable multi-sets
2002,
In this paper we introduce a generalization of stable sets: stable multi-sets. A...
Pruning by isomorphism in branch-and-cut
Pruning by isomorphism in branch-and-cut
2002,
The paper presents a branch-and-cut for solving (0, 1) integer linear programs having...
Accurate estimation of expected coverage: Revisited
Accurate estimation of expected coverage: Revisited
2003,
As noted in several studies, the accurate estimation of expected coverage is an...
On clique-transversals and clique-independent sets
On clique-transversals and clique-independent sets
2002,
A clique-transversal of a graph G is a subset of vertices intersecting all the cliques...
Equivalent classes of two-dimensional identical rectangle packing problem
Equivalent classes of two-dimensional identical rectangle packing problem
2001,
Packing rectangular cartons into rectangular containers is an important task in...
A parallel genetic algorithm to solve the set-covering problem
A parallel genetic algorithm to solve the set-covering problem
2002,
This work presents a parallel genetic algorithm (PGA) model to solve the set-covering...
A concurrent processing framework for the set partitioning problem
A concurrent processing framework for the set partitioning problem
2002,
A scheme for domain decomposition of the set partitioning problem is presented....
Detecting infeasibility and fixing variables in 0–1 linear programming problems
Detecting infeasibility and fixing variables in 0–1 linear programming problems
2002,
In this paper we present a procedure for obtaining lower bounds on a linear function...
Application of rough set to optimization of decision trees
Application of rough set to optimization of decision trees
2001,
Decision trees are a useful tool for data mining, but the design of the optimal...
A branch-and-cut algorithm for the maximum cardinality stable set problem
A branch-and-cut algorithm for the maximum cardinality stable set problem
2001,
We propose a branch-and-cut algorithm for the Maximum Cardinality Stable Set problem....
Priority queues and multisets
Priority queues and multisets
1995,
A priority queue, a container data structure equipped with the operations insert and...
Solving nonconvex planar location problems by finite dominating sets
Solving nonconvex planar location problems by finite dominating sets
2000,
It is well-known that some of the classical location problems with polyhedral gauges...
Papers per page: