Keyword: sets

Found 278 papers in total
On the exponential cardinality of FDS for the ordered p-median problem
On the exponential cardinality of FDS for the ordered p-median problem
2005,
We study finite dominating sets (FDS) for the ordered median problem. This kind of...
Bargaining sets and the core in permutation games
Bargaining sets and the core in permutation games
2003,
Permutation games are totally balanced transferable utility cooperative games that...
Strong duality for generalized convex optimization problems
Strong duality for generalized convex optimization problems
2005,
In this paper, strong duality for nearly-convex optimization problems is established....
Delaunay partitions in Rn applied to non-convex programs and vertex/facet enumeration problems
Delaunay partitions in Rn applied to non-convex programs and vertex/facet enumeration problems
2005,
Using a pair of theorems linking Delaunay partitions and linear programming, we...
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....
Using set covering with item sampling to analyze the infeasibility of linear programming test assembly models
Using set covering with item sampling to analyze the infeasibility of linear programming test assembly models
2004,
This article shows how set covering with item sampling (SCIS) methods can be used in...
Spherical dissimilarity indices and normed multidimensional scaling
Spherical dissimilarity indices and normed multidimensional scaling
1999,
Our concern here, is the characterization of dissimilarity indexes defined over finite...
The power of priority algorithms for facility location and set cover
The power of priority algorithms for facility location and set cover
2004,
We apply and extend the priority algorithm framework introduced by Borodin, Nielsen,...
Demand point aggregation for planar covering location models
Demand point aggregation for planar covering location models
2005,
The covering location problem seeks the minimum number of facilities such that each...
Locating stops along bus or railway lines – A bicriteria problem
Locating stops along bus or railway lines – A bicriteria problem
2005,
In this paper we consider the location of stops along the edges of an already existing...
A set covering formulation for agile capacity planning within supply chains
A set covering formulation for agile capacity planning within supply chains
2005,
Capacity planning and equipment selection within modern production facilities is the...
Strategyproof cost-sharing mechanisms for set cover and facility location games
Strategyproof cost-sharing mechanisms for set cover and facility location games
2005,
Strategyproof cost-sharing mechanisms, lying in the core, that recover 1/ a fraction...
Strongly polynomial-time approximation for a class of bicriteria problems
Strongly polynomial-time approximation for a class of bicriteria problems
2004,
Consider the following problem: given a ground set and two minimization objectives of...
Method of data envelopment analysis based on the theory of partially ordered sets
Method of data envelopment analysis based on the theory of partially ordered sets
2003,
In this paper, a characterization of effective units is given, and a necessary and...
On non-rank facets of the stable set polytope of claw-free graphs and circulant graphs
On non-rank facets of the stable set polytope of claw-free graphs and circulant graphs
2004,
We deal with non-rank facets of the stable set polytope of claw-free graphs. We extend...
TSpack: A unified tabu search code for multi-dimensional bin packing problems
TSpack: A unified tabu search code for multi-dimensional bin packing problems
2004,
We present a computer code that implements a general Tabu Search technique for the...
Facets of the independent set polytope
Facets of the independent set polytope
2003,
Theoretical results pertaining to the independent set polytope P ISP...
Approximation algorithms for the test cover problem
Approximation algorithms for the test cover problem
2003,
In the test cover problem a set of m items is given together with a collection of...
Enumerating maximal independent sets with applications to graph colouring
Enumerating maximal independent sets with applications to graph colouring
2004,
We give tight upper bounds on the number of maximal independent sets of size k (and at...
A three-phase approach to solving the bidline problem
A three-phase approach to solving the bidline problem
2004,
This paper describes a three-phase approach to solving the bidline generation problem...
Two algorithms for the multi-Weber problem
Two algorithms for the multi-Weber problem
2003,
This paper develops two methods for finding building-blocks for solving Rosing's...
Quantitative comparison of approximate solution sets for bi-criteria optimization problems
Quantitative comparison of approximate solution sets for bi-criteria optimization problems
2003,
We present the Integrated Preference Functional (IPF) for comparing the quality of...
Characterizations of convex and quasiconvex set-valued maps
Characterizations of convex and quasiconvex set-valued maps
2003,
The aim of this paper is to characterize in terms of classical convexity and...
Fast approximation algorithms for fractional packing and covering problems
Fast approximation algorithms for fractional packing and covering problems
1995,
This paper presents fast algorithms that find approximate solutions for a general...
Papers per page: