Journal: INFORMS Journal On Computing

Found 560 papers in total
Toward a taxonomy of parallel tabu search heuristics
Toward a taxonomy of parallel tabu search heuristics
1997,
In this paper we present a classification of parallel tabu search metaheuristics...
Numerical inversion of Laplace transforms of probability distributions
Numerical inversion of Laplace transforms of probability distributions
1995,
We present a simple algorithm for numerically inverting Laplace transforms. The...
A reactive tabu search metaheuristic for the vehicle routing problem with time windows
A reactive tabu search metaheuristic for the vehicle routing problem with time windows
1997,
This article develops a reactive tabu search metaheuristic for the vehicle routing and...
Parallel algorithms for stochastic dynamic programming with continuous state and control variables
Parallel algorithms for stochastic dynamic programming with continuous state and control variables
1995,
We compare two partitioning methods for solving a multi-dimensional optimal control...
A branch and bound algorithm for integer quadratic knapsack problems
A branch and bound algorithm for integer quadratic knapsack problems
1995,
We present a branch and bound algorithm for solving separable convex quadratic...
A column generation approach for graph coloring
A column generation approach for graph coloring
1996,
We present a method for solving the independent set formulation of the graph coloring...
A branch-and-bound approach using polyhedral resuls for a clustering problem
A branch-and-bound approach using polyhedral resuls for a clustering problem
1997,
This article describes a variation of the branch and bound method for solving a...
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...
Expressing special structures in an algebraic modeling language for mathematical programming
Expressing special structures in an algebraic modeling language for mathematical programming
1995,
A knowledge of the presence of certain special structures can be advantageous in both...
A study of the augmented system and column-splitting approaches for solving two-stage stochastic linear programs by interior-point methods
A study of the augmented system and column-splitting approaches for solving two-stage stochastic linear programs by interior-point methods
1995,
Linear programs that arise in two-stage stochastic programming offer a particularly...
An implementation of LPFORM
An implementation of LPFORM
1996,
This paper describes a Microsoft Windows-based system, LP-FORM, that uses a graphical...
Presolve analysis of linear programs prior to applying an interior point method
Presolve analysis of linear programs prior to applying an interior point method
1997,
Several issues concerning an analysis of large and sparse linear programming problems...
Quad-trees and linear lists for identifying nondominated criterion vectors
Quad-trees and linear lists for identifying nondominated criterion vectors
1996,
In this paper we address the problem of identifying all nondominated criterion vectors...
Analyzing the pooling problem
Analyzing the pooling problem
1995,
The pooling problem is a non-convex mathematical program that arises in blending...
Preprocessing in stochastic programming: The case of capacitated networks
Preprocessing in stochastic programming: The case of capacitated networks
1995,
We investigate different preprocessing procedures for stochastic linear programs whose...
Stopping criteria for finite length genetic algorithms
Stopping criteria for finite length genetic algorithms
1996,
Considerable empirical results have been reported on the computational performance of...
Perturbation: An efficient technique for the solution of very large instances of the Euclidean TSP
Perturbation: An efficient technique for the solution of very large instances of the Euclidean TSP
1996,
In this paper we introduce a technique for developing efficient iterated local search...
A fast composite heuristic for the symmetric traveling salesman problem
A fast composite heuristic for the symmetric traveling salesman problem
1996,
This article describes a new composite heuristic for the symmetric Traveling Salesman...
Computation of derivatives by means of the power-series algorithm
Computation of derivatives by means of the power-series algorithm
1996,
The power-series algorithm (PSA) is a flexible tool for computing performance measures...
A comparison of alternative approaches for numerical solutions of GI/PH/1 queues
A comparison of alternative approaches for numerical solutions of GI/PH/1 queues
1996,
This paper compares alternative approaches for computing the R matrix of Neuts in...
Bad lattice structures for vectors of nonsuccessive values produced by some linear recurrences
Bad lattice structures for vectors of nonsuccessive values produced by some linear recurrences
1997,
Usually, the t -dimensional spectral test for linear congruential generators examines...
Efficient computation of probabilities of events described by order statistics and applications to queue inference
Efficient computation of probabilities of events described by order statistics and applications to queue inference
1995,
This paper derives recursive algorithms for efficiently computing event probabilities...
Inventory management in catalog sales companies
Inventory management in catalog sales companies
1996,
One of the main features of the catalog sales industry is the ability to influence...
Ghost image processing for minimum covariance determinants
Ghost image processing for minimum covariance determinants
1995,
In this paper we describe a ghost image processing application to the problem of...
Papers per page: