Keyword: heuristics

Found 5460 papers in total
A tiling and routing heuristic for the screening of cytological samples
A tiling and routing heuristic for the screening of cytological samples
1998,
In the screening of cytological samples, a slide is examined using a microscope. Since...
Search strategies for the feeder bus network design problem
Search strategies for the feeder bus network design problem
1998,
This paper reports on computing solutions for a specific problem arising in public...
A hybrid inexact-stochastic water management model
A hybrid inexact-stochastic water management model
1998,
An inexact-stochastic water management model is proposed and applied to a case study...
A tabu search approach to the constraint satisfaction problem as a general problem solver
A tabu search approach to the constraint satisfaction problem as a general problem solver
1998,
Many combinatorial problems, including a variety of combinatorial optimization...
Solution of large weighted equicut problems
Solution of large weighted equicut problems
1998,
Given a weighted undirected graph, the equicut problem consists of finding a partition...
A tabu search algorithm for the bipartite drawing problem
A tabu search algorithm for the bipartite drawing problem
1998,
Graphs are used to represent reality in several areas of knowledge. This has generated...
Improving heuristics for the frequency assignment problem
Improving heuristics for the frequency assignment problem
1998,
Lower bounds for the frequency assignment problem can be found from maximal cliques...
Using global search heuristics for the capacity vehicle routing problem
Using global search heuristics for the capacity vehicle routing problem
1998,
In this work, a frame is posed which allows us to define global search heuristics in...
Improved solutions for the traveling purchaser problem
Improved solutions for the traveling purchaser problem
1998,
The traveling purchaser problem (TPP) is an interesting generalization of the...
A heuristic algorithm based on Monte Carlo methods for the rural postman problem
A heuristic algorithm based on Monte Carlo methods for the rural postman problem
1998,
The Rural Postman Problem (RPP) consists of finding a minimum cost traversal of a...
Genetic algorithms for vehicle dispatching
Genetic algorithms for vehicle dispatching
1997,
Decisions regarding the dispatch of transportation vehicles for servicing customer...
New bounds for optimum traffic assignment in satellite communication
New bounds for optimum traffic assignment in satellite communication
1998,
In this paper we assume that a satellite has l receiving and transmitting antennas,...
A robust simulated annealing based examination timetabling system
A robust simulated annealing based examination timetabling system
1998,
The examination scheduling problem varies in detail from institution to institution....
Delivering complex decision rules to top level managers through decision support systems: A case study in army housing management
Delivering complex decision rules to top level managers through decision support systems: A case study in army housing management
1998,
Mathematical or heuristic programming can be used to solve a particular allocation...
Algorithms for effective transfer of ballast for an oil installation
Algorithms for effective transfer of ballast for an oil installation
1998,
The problem considered is to transfer ballast (water) between ballast tanks in an...
Crew scheduling of light rail transit in Hong Kong: From modeling to implementation
Crew scheduling of light rail transit in Hong Kong: From modeling to implementation
1998,
This work concerns the problem of crew scheduling for the Hong Kong Light Rail Transit...
Covering a graph with cycles
Covering a graph with cycles
1998,
This article describes a lower bounding procedure and heuristics for the Cycle Cover...
On the robust shortest path problem
On the robust shortest path problem
1998,
The shortest path (SP) problem in a network with nonnegative arc lengths can be solved...
A hybrid approach to resolving a differentiable integer program
A hybrid approach to resolving a differentiable integer program
1998,
This paper proposes an algorithm to solve differentiable integer programming problems....
Hybrid heuristic algorithms for set covering
Hybrid heuristic algorithms for set covering
1998,
Minimal set covering (MSC) is a known NP-hard problem. It is the model of many...
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...
Partitioning mathematical programs for parallel solution
Partitioning mathematical programs for parallel solution
1998,
This paper describes heuristics for partitioning a general M × N matrix into...
Adaptive memory tabu search for binary quadratic programs
Adaptive memory tabu search for binary quadratic programs
1998,
Recent studies have demonstrated the effectiveness of applying adaptive memory tabu...
On the performance of heuristics on finite and infinite fractal instances of the Euclidean Traveling Salesman Problem
On the performance of heuristics on finite and infinite fractal instances of the Euclidean Traveling Salesman Problem
1998,
We show how, by a constructive process, we can generate arbitrarily large instances of...
Papers per page: