Keyword: sets

Found 278 papers in total
The binested inequalities for the Symmetric Travelling Salesman Polytope
The binested inequalities for the Symmetric Travelling Salesman Polytope
1992,
This paper defines a family of valid inequalities for the Symmetric Travelling...
Structured partitioning problems
Structured partitioning problems
1991,
In many important combinatorial optimization problems, such as bin packing, allocating...
Design of regular intercity driver routes for the LTL motor carrier industry
Design of regular intercity driver routes for the LTL motor carrier industry
1992,
The load plan of a LTL motor carrier determines the services it operates and the...
Maximizing set function formulation of two scheduling problems
Maximizing set function formulation of two scheduling problems
1992,
In this note two problems are considered: (1)Scheduling n jobs non-preemptively on a...
The minimum common-cycle algorithm for cyclic scheduling of two material handling hoists with time window constraints
The minimum common-cycle algorithm for cyclic scheduling of two material handling hoists with time window constraints
1991,
The problem of cyclic scheduling of two hoists is defined as follows. There are...
Numerical solutions of Minmaxmin problems
Numerical solutions of Minmaxmin problems
1988,
Minmaxmin problems with coupled variables and discontinuous functions are reducible...
Solution of the problem of optimal partitioning including allocation of the centres of gravity of the subsets
Solution of the problem of optimal partitioning including allocation of the centres of gravity of the subsets
1989,
A method is proposed for solving the multiproduct problem of optimal partitioning of a...
An interior point algorithm to solve computationally difficult set covering problems
An interior point algorithm to solve computationally difficult set covering problems
1991,
The authors present an interior point approach to the zero-one integer programming...
Dual methods and hybrid algorithms for set partitioning problems
Dual methods and hybrid algorithms for set partitioning problems
1990,
In this paper the authors study the behaviour of some dual methods in the design of...
The growth of information systems technology in the public sector of developing nations
The growth of information systems technology in the public sector of developing nations
1991,
Information systems technology in the public sectors of developing nations is in the...
Covering-location models for emergency situations that require multiple response units
Covering-location models for emergency situations that require multiple response units
1990,
In this paper the authors propose a new criterion for coverage which is suitable for...
A class of polynomially soluable set-covering problems
A class of polynomially soluable set-covering problems
1988,
A clutter L is a collection of m subsets of a ground set E ( L )={ x 1 ,..., x n }...
An O(nlogn) algorithm for the all-nearest-neighbors problem
An O(nlogn) algorithm for the all-nearest-neighbors problem
1989,
Given a set V of n points in k -dimensional space, and an L q -metric (Minkowski...
STABULUS: A technique for finding stable sets in large graphs with tabu search
STABULUS: A technique for finding stable sets in large graphs with tabu search
1989,
Numerical experiments with tabu search have been carried out for constructing...
Papers per page: