Country: United States

Found 17049 papers in total
Probabilistic diversification and intensification in local search for vehicle routing
Probabilistic diversification and intensification in local search for vehicle routing
1995,
This article presents a probabilistic technique to diversify, intensify, and...
Automatic Yellow-Pages pagination and layout
Automatic Yellow-Pages pagination and layout
1996,
The compact and harmonious layout of ads and text is a fundamental and costly step in...
A heuristic methodology for sizing a large-scale system of constrained, reusable resources
A heuristic methodology for sizing a large-scale system of constrained, reusable resources
1996,
This paper proposes a methodology for sizing certain large-scale systems of reusable,...
Graph partitioning and continuous quadratic programming
Graph partitioning and continuous quadratic programming
1999,
A continuous quadratic programming formulation is given for min-cut graph partitioning...
A new generation of vehicle routing research: Robust algorithms, addressing uncertainty
A new generation of vehicle routing research: Robust algorithms, addressing uncertainty
1996,
In recent years new insights and algorithms have been obtained for the classical,...
A tabu search heuristic for the vehicle routing problem with stochastic demands and customers
A tabu search heuristic for the vehicle routing problem with stochastic demands and customers
1996,
This paper considers a version of the stochastic vehicle routing problem where...
Probabilistic analyses and practical algorithms for the vehicle routing problem with time windows
Probabilistic analyses and practical algorithms for the vehicle routing problem with time windows
1996,
In the Vehicle Routing Problem with Time Windows, a set of customers are served by a...
Approximating capacitated routing and delivery problems
Approximating capacitated routing and delivery problems
1999,
We provide approximation algorithms for some capacitated vehicle routing and delivery...
A 3/2-approximation algorithm for the mixed postman problem
A 3/2-approximation algorithm for the mixed postman problem
1999,
The mixed postman problem, a generalization of the Chinese postman problem, is that of...
The compactness of interval routing
The compactness of interval routing
1999,
The compactness of a graph measures the space complexity of its shortest path routing...
A hierarchical strategy for solving traveling salesman problems using elastic nets
A hierarchical strategy for solving traveling salesman problems using elastic nets
1995,
In this article, we focus on implementing the elastic net method to solve the...
Evolutionary programming for mix design
Evolutionary programming for mix design
1997,
An evolution method for the solution of a mix design problem is proposed. It is an...
Finding a best traveling salesman 4-opt move in the same time as a best 2-opt move
Finding a best traveling salesman 4-opt move in the same time as a best 2-opt move
1996,
A special class of 4-opt moves plays a key role in several leading heuristics for the...
A tabu search heuristic using genetic diversification for the clustered traveling salesman problem
A tabu search heuristic using genetic diversification for the clustered traveling salesman problem
1996,
The clustered traveling salesman problem is an extension of the classical traveling...
A quantitative approach to cork oak forest management
A quantitative approach to cork oak forest management
1997,
Mathematical programming is one quantitative technique that can be used for strategic...
Optimization of sire selection based on maximization of guaranteed income and risk associated with sire merit
Optimization of sire selection based on maximization of guaranteed income and risk associated with sire merit
1998,
A method based on discounted income and risk assesment was developed to aid in the...
New results on the old k-opt algorithm for the traveling salesman problem
New results on the old k-opt algorithm for the traveling salesman problem
1999,
Local search with k -change neighborhoods is perhaps the oldest and most widely used...
The service facility startup and capacity model and its application to the National Cranberry case
The service facility startup and capacity model and its application to the National Cranberry case
1996,
This paper provides formal modeling for and analytical aid to the startup and capacity...
The distribution and abundance of populations limited at multiple spatial scales
The distribution and abundance of populations limited at multiple spatial scales
1999,
1. We use mathematical programming to explore long-term equilibrium population...
A criterion for the occurrence or non-occurrence of a traffic collapse at a bottleneck
A criterion for the occurrence or non-occurrence of a traffic collapse at a bottleneck
1998,
For a bottleneck controlled by traffic lights with a stochastic volume of traffic a...
DNA sequencing with positive and negative errors
DNA sequencing with positive and negative errors
1999,
The problem addressed in this paper is concerned with DNA sequencing by hybridization....
A concept of optimal control at a bottleneck with symmetric volume of traffic
A concept of optimal control at a bottleneck with symmetric volume of traffic
1998,
An analysis of the optimal control of traffic lights at a bottleneck with symmetric...
A dynamic programming algorithm for RNA structure prediction including pseudoknots
A dynamic programming algorithm for RNA structure prediction including pseudoknots
1999,
We describe a dynamic programming algorithm for predicting optimal RNA secondary...
On the relationship between queue lengths at a random instant and at a departure in the stationary queue with BMAP arrivals
On the relationship between queue lengths at a random instant and at a departure in the stationary queue with BMAP arrivals
1998,
This paper considers the queue length distributions at a random point in time and at a...
Papers per page: