Keyword: heuristics

Found 5460 papers in total
Using rules to specify classification strategies in the credit card industry
Using rules to specify classification strategies in the credit card industry
1999,
Classifying accounts is a critical part of efficiently servicing credit cards. The use...
GRASP for seam drawing in mosaicking of aerial photographic maps
GRASP for seam drawing in mosaicking of aerial photographic maps
1999,
Commercial aerial photographic maps are often so large that it is necessary to produce...
On the selection of hub airports for an airline hub-and-spoke system
On the selection of hub airports for an airline hub-and-spoke system
1999,
We consider the 1-stop multiple allocation p -hub median problem. We formulate the...
Heuristic guided simulator for the operational planning of the transport of sugar cane
Heuristic guided simulator for the operational planning of the transport of sugar cane
1999,
This paper presents a computational tool for the operational planning of the...
Artificial neural networks in bankruptcy prediction: General framework and cross-validation analysis
Artificial neural networks in bankruptcy prediction: General framework and cross-validation analysis
1999,
In this paper, we present a general framework for understanding the role of artificial...
Fiber-to-object assignment heuristics
Fiber-to-object assignment heuristics
1999,
Fiber-to-Object Assignment Problem comes from Astronomy. This geometrical and...
Graph coloring with adaptive evolutionary algorithms
Graph coloring with adaptive evolutionary algorithms
1998,
This paper presents the results of an experimental investigation on solving graph...
A stochastic heuristic for visualising graph clusters in a bi-dimensional space prior to partitioning
A stochastic heuristic for visualising graph clusters in a bi-dimensional space prior to partitioning
1999,
This paper presents a new stochastic heuristic to reveal some structures inherent in...
On censored Markov chains, best augmentations and aggregation/disaggregation procedures
On censored Markov chains, best augmentations and aggregation/disaggregation procedures
1999,
Consider the stationary distribution of a Markov chain censored to a subset of the...
Best second order bounds for two-terminal network reliability with dependent edge failures
Best second order bounds for two-terminal network reliability with dependent edge failures
1999,
Given a network modeled by a probabilistic graph G = ( V , E ) with bounds on...
Routing and capacity assignment in backbone communication networks under time varying traffic conditions
Routing and capacity assignment in backbone communication networks under time varying traffic conditions
1999,
This paper studies the problem of assigning capacities to links in a backbone...
On design of a survivable network architecture for dynamic routing: Optimal solution strategy and an efficient heuristic
On design of a survivable network architecture for dynamic routing: Optimal solution strategy and an efficient heuristic
1999,
We investigate network planning and design under volatile conditions of link failures...
The Steiner tree problem in graphs: Worst case examples for insertion heuristics
The Steiner tree problem in graphs: Worst case examples for insertion heuristics
1999,
Given a graph G with positive edge costs and a subset R of required vertices, the...
Solving a nonlinear non-convex trim loss problem with a genetic hybrid algorithm
Solving a nonlinear non-convex trim loss problem with a genetic hybrid algorithm
1999,
In the present paper, we invoke a newly developed genetic hybrid algorithm (GHA) to...
Information availability vs. solution space size in a knowledge acquisition problem
Information availability vs. solution space size in a knowledge acquisition problem
1999,
Several authors have studied a special form of a combinatorial game called the...
Spectral partitioning with multiple eigenvectors
Spectral partitioning with multiple eigenvectors
1999,
The graph partitioning problem is to divide the vertices of a graph into disjoint...
Path optimization for graph partitioning problems
Path optimization for graph partitioning problems
1999,
This paper presents a new heuristic for graph partitioning called Path Optimization...
A fast and simple Steiner routing heuristic
A fast and simple Steiner routing heuristic
1999,
This paper presents a simple yet efficient heuristic for rectilinear Steiner routing....
Class Steiner trees and VLSI-design
Class Steiner trees and VLSI-design
1999,
We consider a generalized version of the Steiner problem in graphs, motivated by the...
On a 2-dimensional equipartition problem
On a 2-dimensional equipartition problem
1999,
The present paper deals with the following problem, which arises in a variety of...
Heuristic methods for T-colouring with sets
Heuristic methods for T-colouring with sets
1998,
We are interested in heuristics for the set T-coloring problem, in order to solve a...
Transistor chaining in static CMOS functional cells of arbitrary planar topology
Transistor chaining in static CMOS functional cells of arbitrary planar topology
1999,
A technique for chaining the transistors in the layouts of static complementary metal...
A fast method for generalized starting temperature determination in homogeneous two-stage simulated annealing systems
A fast method for generalized starting temperature determination in homogeneous two-stage simulated annealing systems
1999,
We propose a method for determining the starting temperature in two-stage simulated...
Using the generalized assignment problem in scheduling the ROSAT space telescope
Using the generalized assignment problem in scheduling the ROSAT space telescope
1999,
ROSAT is a satellite borne X-ray observatory. Mission planning consists of scheduling...
Papers per page: