Keyword: combinatorial analysis

Found 435 papers in total
A bibliographical survey on some well-known non-standard knapsack problems
A bibliographical survey on some well-known non-standard knapsack problems
1998,
Knapsack problem and its generalizations have been intensively studied during the last...
Analysis of the greedy approach in problems of maximum k-coverage
Analysis of the greedy approach in problems of maximum k-coverage
1998,
In this paper, we consider a general covering problem in which k subsets are to be...
On the set covering polytope: Facets with coefficients in {0, 1, 2, 3}
On the set covering polytope: Facets with coefficients in {0, 1, 2, 3}
1998,
Balas and Ng characterized the class of valid inequalities for the set covering...
Combinatorial optimization models for production scheduling in automated manufacturing systems
Combinatorial optimization models for production scheduling in automated manufacturing systems
1997,
Production planning and scheduling models arising in automated manufacturing...
Multiflows and disjoint paths of minimum total cost
Multiflows and disjoint paths of minimum total cost
1997,
In this paper we discuss a number of recent and earlier results in the field of...
General local search methods
General local search methods
1996,
This paper is a tutorial introduction to three recent yet widely used general...
Geometric three-dimensional assignment problems
Geometric three-dimensional assignment problems
1996,
We investigate two geometric special cases of the three-dimensional assignment...
Optimizing simulated annealing schedules with genetic programming
Optimizing simulated annealing schedules with genetic programming
1996,
Combinatorial optimization problems are encountered in many areas of science and...
The use of dynamic programming in genetic algorithms for permutation problems
The use of dynamic programming in genetic algorithms for permutation problems
1996,
To deal with computationally hard problems, approximate algorithms are used to provide...
Massively parallel analog tabu search using neural networks applied to simple plant location problems
Massively parallel analog tabu search using neural networks applied to simple plant location problems
1996,
Neural networks and tabu search are two very significant techniques which have emerged...
Old Bachelor Acceptance: A new class of non-monotone threshold accepting methods
Old Bachelor Acceptance: A new class of non-monotone threshold accepting methods
1995,
Stochastic hill-climbing algorithms, particularly simulated annealing (SA) and...
Tabu thresholding: Improved search by nonmonotonic trajectories
Tabu thresholding: Improved search by nonmonotonic trajectories
1995,
There is an appeal to methods like simulated annealing and threshold acceptance that...
A heuristic algorithm for the equitable partitioning problem
A heuristic algorithm for the equitable partitioning problem
1997,
This paper describes a heuristic for the equitable partitioning problem, which...
A new knapsack solution approach by integer equivalent aggregation and consistency determination
A new knapsack solution approach by integer equivalent aggregation and consistency determination
1997,
We present a new and highly efficient algorithm for the integer knapsack problem based...
Extensions of coloring models for scheduling purposes
Extensions of coloring models for scheduling purposes
1996,
Some extensions and variations of basic chromatic scheduling models have been...
On the optimal spacing of currency denominations
On the optimal spacing of currency denominations
1996,
Existing theoretical evidence on optimal currency spacing is fragmentary and, to some...
A parallel genetic-neuro scheduler for job-shop scheduling problems
A parallel genetic-neuro scheduler for job-shop scheduling problems
1997,
Despite relentless efforts on developing new approaches, there are still large gaps...
Optimal partitioning which maximizes the sum of the weighted averages
Optimal partitioning which maximizes the sum of the weighted averages
1995,
We consider an optimal partitioning problem that occurs in the assignment of computer...
The generalized stable set problem for perfect bidirected graphs
The generalized stable set problem for perfect bidirected graphs
1997,
Bidirected graphs are a generalization of undirected graphs. For bidirected graphs, we...
Ratio combinatorial programs
Ratio combinatorial programs
1995,
We consider here a combinatorial optimization problem where the objective function is...
The use of combinatorics in key management
The use of combinatorics in key management
1996,
We consider the key management problem in a large network where communicating nodes...
Minimizing makespan in flowshops with pallet requirements: Computational complexity
Minimizing makespan in flowshops with pallet requirements: Computational complexity
1997,
We establish the computational complexity of the problem of minimizing makespan in a...
Complexity of the single vehicle scheduling problem on graphs
Complexity of the single vehicle scheduling problem on graphs
1997,
Let G = ( V , E ) be a graph. The travel times w ( u , v ) and w ( v , u ) are...
Selected combinatorial optimization problems arising in molecular biology
Selected combinatorial optimization problems arising in molecular biology
1996,
Throughout the last forty years molecular biology, whose aim is to study DNA...
Papers per page: