Keyword: sets

Found 278 papers in total
A parallel, linear programming-based heuristic for large-scale set partitioning problems
A parallel, linear programming-based heuristic for large-scale set partitioning problems
2001,
We describe a parallel, linear programming and implication-based heuristic for solving...
Extended and strongly extended well-posedness of set-valued optimization problems
Extended and strongly extended well-posedness of set-valued optimization problems
2001,
In this paper, we deal with the extended well-posedness and strongly extended...
Solving an apparel trim placement problem using a maximum cover problem approach
Solving an apparel trim placement problem using a maximum cover problem approach
1999,
A trim placement problem from the apparel industry is presented and solved. The...
Small and pseudo-small sets for Markov chains
Small and pseudo-small sets for Markov chains
2001,
In this paper we examine the relationship between small sets and their generalisation,...
Maximum independent sets of circular-arc graphs: Simplified algorithm and proofs
Maximum independent sets of circular-arc graphs: Simplified algorithm and proofs
1996,
We present a simple optimal algorithm for the problem of finding maximum independent...
The complexity of irredundant sets parameterized by size
The complexity of irredundant sets parameterized by size
2000,
An irredundant set of vertices V′⊆V in a graph G=(V,E) has the property...
A generalized assignment problem with special ordered sets: A polyhedral approach
A generalized assignment problem with special ordered sets: A polyhedral approach
2000,
We study a generalized assignment problem that arises in production scheduling in...
Set packing relaxations of some integer programs
Set packing relaxations of some integer programs
2000,
This paper is about set packing relaxations of combinatorial optimization problems...
A set partitioning approach to the crew scheduling problem
A set partitioning approach to the crew scheduling problem
1999,
The crew scheduling problem (CSP) appears in many mass transport systems (e.g.,...
A heuristic method for the set covering problem
A heuristic method for the set covering problem
1999,
We present a Lagrangian-based heuristic for the well-known Set Covering Problem (SCP)....
Separating subdivision of bicycle wheel inequalities over cut polytopes
Separating subdivision of bicycle wheel inequalities over cut polytopes
1998,
In this paper, we give a separation algorithm for a class of valid inequalities for...
The complexity of cover inequality separation
The complexity of cover inequality separation
1998,
Crowder et al . conjectured that the separation problem for cover inequalities for...
The column-circular, subsets-selection problem: Complexity and solutions
The column-circular, subsets-selection problem: Complexity and solutions
2000,
In this paper we study the complexity of a new class of a problem that we call the...
Finding postal carrier walk paths in mixed graphs
Finding postal carrier walk paths in mixed graphs
1998,
The postman problem requires finding a lowest cost tour in a connected graph that...
A dynamic subgradient-based branch-and-bound procedure for set covering
A dynamic subgradient-based branch-and-bound procedure for set covering
1996,
We discuss a branch and bound algorithm for set covering, whose centrepiece is a new...
Rough approximation of a preference relation by dominance relations
Rough approximation of a preference relation by dominance relations
1999,
An original methodology for using rough sets to preference modeling in multi-criteria...
Partition polytopes over 1-dimensional points
Partition polytopes over 1-dimensional points
1999,
We consider partitions of a finite set whose elements are associated with a single...
Geometric problems in automated manufacturing
Geometric problems in automated manufacturing
1999,
In this paper, the following two classes of problems in automated inspection are...
On certain random polygons of large areas
On certain random polygons of large areas
1998,
Consider the tesselation of a plane into convex random polygons determined by a unit...
A generalization of König–Egervary graphs and heuristics for the maximum independent set problem with improved approximation ratios
A generalization of König–Egervary graphs and heuristics for the maximum independent set problem with improved approximation ratios
1997,
We first study a generalization of the König–Egervary graphs, the class of...
Simple Lagrangian heuristic for the set covering problem
Simple Lagrangian heuristic for the set covering problem
1997,
In this paper a simple Lagrangian heuristic is proposed for the set covering problem....
Rounding algorithms for covering problems
Rounding algorithms for covering problems
1998,
In the last 25 years approximation algorithms for discrete optimization problems have...
A generalization of the Hoffman–Lovász upper bound on the independence number of a regular graph
A generalization of the Hoffman–Lovász upper bound on the independence number of a regular graph
1998,
A family of quadratic programming problems whose optimal values are upper bounds on...
Generalized utility based on values of opportunity sets
Generalized utility based on values of opportunity sets
1998,
This paper is concerned with an axiomatic approach to the analysis and construction of...
Papers per page: