Keyword: sets

Found 278 papers in total
Rough set theory and its applications to decision aid
Rough set theory and its applications to decision aid
1995,
The aim of this paper is to make a short overview of recent developments of the rough...
An algorithm for solving the multi-dimensional rectangle cover problem and satisfiability problem
An algorithm for solving the multi-dimensional rectangle cover problem and satisfiability problem
1997,
We consider the problem of asking whether a given d-dimensional rectangle R o is...
The design of a 0–1 integer optimizer and its application in the Carmen system
The design of a 0–1 integer optimizer and its application in the Carmen system
1995,
We describe the design of an optimizer for 0–1 integer programming aimed at...
Quality and manufacturing cost: A case study in the chemical industry
Quality and manufacturing cost: A case study in the chemical industry
1996,
This paper presents a case study where the optimization of a chemical mixture was...
Resolution and the integrality of satisfiability problems
Resolution and the integrality of satisfiability problems
1996,
A satisfiability problem can be regarded as a nondisjoint union of set covering...
A 2-person game on a polyhedral set of connected strategies
A 2-person game on a polyhedral set of connected strategies
1997,
A 2-person zero-sum game with the payoff function being a sum of two linear functions...
A framework for adaptive sorting
A framework for adaptive sorting
1995,
A sorting algorithm is adaptive if it sorts sequences that are close to sorted faster...
A relation between the approximated versions of minimum set covering, minimum vertex covering and maximum independent set
A relation between the approximated versions of minimum set covering, minimum vertex covering and maximum independent set
1994,
Let be a universal constant denoting the approximation ratio of a hypothetical...
On locally optimal independent sets and vertex covers
On locally optimal independent sets and vertex covers
1996,
In this paper, the authors introudce a new notion of local optimality and demonstrate...
A polynomial approximation scheme for the subset sum problem
A polynomial approximation scheme for the subset sum problem
1995,
The subset sum problem is defined as: given a set of n+1 positive integers, a 1...
Some democratic secret sharing schemes
Some democratic secret sharing schemes
1995,
The paper considers the problem of constructing secret sharing schemes without the...
Optimal separable partitioning in the plane
Optimal separable partitioning in the plane
1995,
Sets of points are called a separable if their convex hulls are disjoint. The authors...
Line transects, covariance functions and set convergence
Line transects, covariance functions and set convergence
1995,
The authors define the ‘linear scan transform’ G of a set in ℝ’...
The intermodal trailer assignment problem
The intermodal trailer assignment problem
1995,
The problem of optimally assigning highway trailers to railcar hitches in intermodal...
A note on the improvement of the maximum independent sets approximation ratio
A note on the improvement of the maximum independent sets approximation ratio
1995,
The paper presents an O(n 3 ’. 5 ) approximation algorithm for the maximum...
On a construction of digital convex (2s+1)-gons of minimum diameter
On a construction of digital convex (2s+1)-gons of minimum diameter
1995,
In this paper an algorithm is described for an exact construction of digital convex (2...
Lower spacial representation of zoomed structural modeling by nonmetric MDS
Lower spacial representation of zoomed structural modeling by nonmetric MDS
1994,
A method is proposed for making lower spacial representations of system structures by...
The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems
The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems
1994,
The authors present a new and conceptually simple approach for finding exact solutions...
Note: On the set-union knapsack problem
Note: On the set-union knapsack problem
1994,
The authors consider a generalization of the 0-1 knapsack problem called the set-union...
A matching-based approach for solving a delivery/pick-up vehicle routing problem with time constraints
A matching-based approach for solving a delivery/pick-up vehicle routing problem with time constraints
1992,
In this paper the authors deal with the following special vehicle routing problem with...
A fast real-time algorithm for constructing convex hulls in higher dimensions
A fast real-time algorithm for constructing convex hulls in higher dimensions
1992,
This paper gives a simple description that a convex polytope of d- dimension is...
A mathematical programming problem with a convex irregular feasible set
A mathematical programming problem with a convex irregular feasible set
1990,
An exact and an approximate method for reducing a mathematical programming problem...
An accelerated algorithm for the set partitioning problem
An accelerated algorithm for the set partitioning problem
1990,
This paper presents an algorithm based on the work of Campello, adding as its main...
Solution of set-covering and set-partitioning problems using assignment relaxations
Solution of set-covering and set-partitioning problems using assignment relaxations
1992,
Graph theoretic relaxations are used to design tree search algorithms for set-covering...
Papers per page: