Keyword: sets

Found 278 papers in total
Development of a prototype for a geographical information system for addressing the problem of antennas location
Development of a prototype for a geographical information system for addressing the problem of antennas location
2006,
This work shows an approach to the antennas location problem, which is common in...
Resolution branch and bound and an application: the maximum weighted stable set problem
Resolution branch and bound and an application: the maximum weighted stable set problem
2007,
We propose a new resolution algorithm, called resolution branch and bound (RBB), where...
Using critical sets to solve the maximum independent set problem
Using critical sets to solve the maximum independent set problem
2007,
A method that utilizes the polynomially solvable critical independent set problem for...
A GRASP algorithm to solve the unicost set covering problem
A GRASP algorithm to solve the unicost set covering problem
2007,
The set covering problem (SCP) is a well-known combinatorial optimization problem....
Bound sets for biobjective combinatorial optimization problems
Bound sets for biobjective combinatorial optimization problems
2007,
In this paper we introduce the concept of bound sets for multiobjective discrete...
Reflections about pseudo-dual prices in combinatorial auctions
Reflections about pseudo-dual prices in combinatorial auctions
2007,
Combinatorial auctions permitting bids on bundles of items have been developed to...
Bechtold–Jacobs generalized model for shift scheduling with extraordinary overlap
Bechtold–Jacobs generalized model for shift scheduling with extraordinary overlap
2007,
In constructing working shifts, the classical Dantzig set covering model uses a great...
Variable neighbourhood search for colour image quantization
Variable neighbourhood search for colour image quantization
2007,
Colour image quantization is a data compression technique that reduces the total set...
On the closure of the feasible set in generalized semi-infinite programming
On the closure of the feasible set in generalized semi-infinite programming
2007,
In generalized semi-infinite programming the feasible set is known to be not closed in...
Locating multiple facilities in a planar competitive environment
Locating multiple facilities in a planar competitive environment
2007,
We investigate the location of one or more facilities anywhere in an area in which...
A computational study of a cutting plane algorithm for university course timetabling
A computational study of a cutting plane algorithm for university course timetabling
2005,
In this paper, we describe a case-study where a Branch-and-Cut algorithm yields the...
Customer-oriented catalog segmentation: Effective solution approaches
Customer-oriented catalog segmentation: Effective solution approaches
2006,
We consider in this paper the customer-oriented catalog segmentation problem that...
Decision making and card collecting
Decision making and card collecting
2005,
Collecting a set of different, yet similar, items is a popular hobby. The...
Dynamic aggregation of set-partitioning constraints in column generation
Dynamic aggregation of set-partitioning constraints in column generation
2005,
Column generation is often used to solve problems involving set-partitioning...
Modeling the problem of locating collection areas for urban waste management. An application to the metropolitan area of Barcelona
Modeling the problem of locating collection areas for urban waste management. An application to the metropolitan area of Barcelona
2006,
Reverse logistics problems arising in municipal waste management are both wide-ranging...
Aggregation of aggregating modes in multi-criteria decision making: Synthesis of Type 2 and Level 2 fuzzy sets
Aggregation of aggregating modes in multi-criteria decision making: Synthesis of Type 2 and Level 2 fuzzy sets
2007,
A new approach to MCDM in a fuzzy setting based on the aggregation of aggregating...
A classifying procedure for signalling turning points
A classifying procedure for signalling turning points
2004,
A Hidden Markov Model (HMM) is used to classify an out-of-sample observation vector...
Proximal proper efficiency in set-valued optimization
Proximal proper efficiency in set-valued optimization
2005,
In this paper, we introduce the concept of cone semilocal convex and cone semilocal...
IRIS: a DSS for multiple criteria sorting problems
IRIS: a DSS for multiple criteria sorting problems
2003,
This paper presents Interactive Robustness analysis and parameters' Inference for...
Optimal allocation of proposals to reviewers to facilitate effective ranking
Optimal allocation of proposals to reviewers to facilitate effective ranking
2005,
Peer review of research proposals and articles is an essential element in research and...
Improved approximation of the general soft-capacitated facility location problem
Improved approximation of the general soft-capacitated facility location problem
2007,
The soft-capacitated facility location problem, where each facility is composed of a...
A branch-and-price algorithm for the multi-source Weber problem
A branch-and-price algorithm for the multi-source Weber problem
2007,
We present a branch-and-price algorithm for the exact solution of the multi-source...
A new reformulation approach for the generalized partial covering problem
A new reformulation approach for the generalized partial covering problem
2006,
In this paper, we consider a situation in which a group of facilities must be...
An optimization approach for planning daily drayage operations
An optimization approach for planning daily drayage operations
2006,
Daily drayage operations involve moving loaded or empty equipment between customer...
Papers per page: