Keyword: sets

Found 278 papers in total
The stable set problem and the thinness of a graph
The stable set problem and the thinness of a graph
2007,
We introduce a poly-time algorithm for the maximum weighted stable set problem, when a...
Experimental analysis of approximation algorithms for the vertex cover and set covering problems
Experimental analysis of approximation algorithms for the vertex cover and set covering problems
2006,
Several approximation algorithms with proven performance guarantees have been proposed...
On the effectiveness of incorporating randomness and memory into a multi-start metaheuristic with application to the Set Covering Problem
On the effectiveness of incorporating randomness and memory into a multi-start metaheuristic with application to the Set Covering Problem
2006,
The construction of good starting solutions for multi-start local search heuristics is...
A constraint programming approach to cutset problems
A constraint programming approach to cutset problems
2006,
We consider the problem of finding a cutset in a directed graph G=(V,E) , i.e., a set...
On metric generators of graphs
On metric generators of graphs
2004,
We study generators of metric spaces – sets of points with the property that...
An approach to location models involving sets as existing facilities
An approach to location models involving sets as existing facilities
2003,
In this paper, we deal with single facility location problems in a general normed...
Heuristic and optimal solutions for set-covering problems in conservation biology
Heuristic and optimal solutions for set-covering problems in conservation biology
2003,
Area-selection methods have recently gained prominence in conservation biology. A...
Integrated chance constraints: Reduced forms and an algorithm
Integrated chance constraints: Reduced forms and an algorithm
2006,
We consider integrated chance constraints (ICCs), which provide quantitative...
Heuristics for a bidding problem
Heuristics for a bidding problem
2006,
In this paper, we study a bidding problem which can be modeled as a set packing...
Extension of rough set methodology for probabilistic decision analysis from preferential multiple attribute decision tables
Extension of rough set methodology for probabilistic decision analysis from preferential multiple attribute decision tables
2005,
Based on substitution of the indiscernibility relation by a dominance relation and a...
Tree decompositions of graphs: Saving memory in dynamic programming
Tree decompositions of graphs: Saving memory in dynamic programming
2006,
We propose a simple and effective heuristic to save memory in dynamic programming on...
Sensitivity analysis in linear optimization: Invariant support set intervals
Sensitivity analysis in linear optimization: Invariant support set intervals
2006,
Sensitivity analysis is one of the most interesting and preoccupying areas in...
A set-covering-based heuristic approach for bin-packing problems
A set-covering-based heuristic approach for bin-packing problems
2006,
Several combinatorial optimization problems can be formulated as large set-covering...
An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
2006,
This paper discusses methods for generating or approximating the Pareto set of...
Matrix computation for rule extraction in inconsistent decision tables
Matrix computation for rule extraction in inconsistent decision tables
2005,
Rule extraction from decision tables is one of the most important tasks in rough set...
A branch-and-price approach for the maximum weight independent set problem
A branch-and-price approach for the maximum weight independent set problem
2005,
The maximum weight-independent set problem (MWISP) is one of the most well-known and...
Semiconvergence in distribution of random closed sets with application to random optimization problems
Semiconvergence in distribution of random closed sets with application to random optimization problems
2006,
The paper considers upper semicontinuous behavior in distribution of sequences of...
Knowledge acquisition in incomplete information systems: A rough set approach
Knowledge acquisition in incomplete information systems: A rough set approach
2006,
This paper deals with knowledge acquisition in incomplete information systems using...
Algorithms for solving the conditional covering problem on paths
Algorithms for solving the conditional covering problem on paths
2005,
Consider the conditional covering problem on an undirected graph, where each node...
Solving feature subset selection problem by a parallel scatter search
Solving feature subset selection problem by a parallel scatter search
2006,
The aim of this paper is to develop a Parallel Scatter Search metaheuristic for...
Scatter search for the vehicle routing problem with time windows
Scatter search for the vehicle routing problem with time windows
2006,
In this paper we use a scatter search framework to solve the vehicle routing problem...
Data dependent worst case bounds for weighted set packing
Data dependent worst case bounds for weighted set packing
2005,
We develop data dependent worst case bounds for three simple greedy algorithms for the...
Hybridization of GRASP metaheuristic with data mining techniques
Hybridization of GRASP metaheuristic with data mining techniques
2006,
In this work, we propose a hybridization of GRASP metaheuristic that incorporates a...
A constraint programming approach to extract the maximum number of non-overlapping test forms
A constraint programming approach to extract the maximum number of non-overlapping test forms
2006,
This paper introduces a novel approach for extracting the maximum number of...
Papers per page: