Journal: INFORMS Journal On Computing

Found 560 papers in total
A new genetic algorithm for the quadratic assignment problem
A new genetic algorithm for the quadratic assignment problem
2003,
In this paper we propose several variants of a new genetic algorithm for the solution...
Exploiting tabu search memory in constrained problems
Exploiting tabu search memory in constrained problems
2004,
This paper puts forth a general method to optimize constrained problems effectively...
The use of eigenvalues for finding equilibrium probabilities of certain Markovian two-dimensional queueing problems
The use of eigenvalues for finding equilibrium probabilities of certain Markovian two-dimensional queueing problems
2003,
A number of papers have appeared recently using eigenvalues for solving steady-state...
A hybrid genetic/optimization algorithm for finite-horizon, partially observed Markov decision processes
A hybrid genetic/optimization algorithm for finite-horizon, partially observed Markov decision processes
2004,
The partially observed Markov decision process (POMDP) is a generalization of a Markov...
Testing the nearest Kronecker product preconditioner on Markov chains and stochastic automata networks
Testing the nearest Kronecker product preconditioner on Markov chains and stochastic automata networks
2004,
This paper is the experimental follow-up to a study by Langville and Stewart, where...
Searching for multiple words in a Markov sequence
Searching for multiple words in a Markov sequence
2004,
The theory of the discrete-time Markovian arrival process (DMAP) can be applied to...
Simultaneous generalized hill-climbing algorithms for addressing sets of discrete optimization problems
Simultaneous generalized hill-climbing algorithms for addressing sets of discrete optimization problems
2005,
This paper introduces simultaneous generalized hill-climbing (SGHC) algorithms as a...
Heuristic search for the generalized minimum spanning tree problem
Heuristic search for the generalized minimum spanning tree problem
2005,
The generalized minimum spanning tree (GMST) problem occurs in telecommunications...
Symmetric and asymmetric parallelization of a cost-decomposition algorithm for multicommodity flow problems
Symmetric and asymmetric parallelization of a cost-decomposition algorithm for multicommodity flow problems
2003,
We study the coarse-grained parallelization of an efficient bundle-based...
Warm-start routines for solving augmented weighted Tchebycheff network programs in multiple-objective network programming
Warm-start routines for solving augmented weighted Tchebycheff network programs in multiple-objective network programming
2005,
Three warm-start routines are developed to find initial basic feasible solutions for...
Dynamic-programming approximations for stochastic time-staged integer multicommodity-flow problems
Dynamic-programming approximations for stochastic time-staged integer multicommodity-flow problems
2006,
In this paper, we consider a stochastic and time-dependent version of the min-cost...
A computational study of cost reoptimization for min-cost flow problems
A computational study of cost reoptimization for min-cost flow problems
2006,
In the last two decades, a number of algorithms for the linear single-commodity...
Steiner trees and 3-D macromolecular conformation
Steiner trees and 3-D macromolecular conformation
2004,
One of the key issues in biochemistry and molecular modelling is the determination of...
On the generality of event-graph models
On the generality of event-graph models
2005,
Event graphs model the dynamics of a discrete-event simulation model. This paper...
Numerical solutions of renewal-type integral equations
Numerical solutions of renewal-type integral equations
2005,
The integral equation of renewal type has many applications in applied probability....
The distribution of order statistics for discrete random variables with applications to bootstrapping
The distribution of order statistics for discrete random variables with applications to bootstrapping
2006,
An algorithm for computing the PDF of order statistics drawn from discrete parent...
Solving the generalized assignment problem: An optimizing and heuristic approach
Solving the generalized assignment problem: An optimizing and heuristic approach
2003,
The classical generalized assignment problem (GAP) may be stated as finding a...
GRASP with path relinking for three-index assignment
GRASP with path relinking for three-index assignment
2005,
This paper proposes and tests variants of GRASP (greedy randomized adaptive search...
An exact approach to the Strip-Packing problem
An exact approach to the Strip-Packing problem
2003,
We consider the problem of orthogonally packing a given set of rectangular items into...
Early estimates of the size of branch-and-bound trees
Early estimates of the size of branch-and-bound trees
2006,
This paper intends to show that the time needed to solve mixed-integer-programming...
K-cuts: A variation of Gomory mixed integer cuts from the LP tableau
K-cuts: A variation of Gomory mixed integer cuts from the LP tableau
2003,
For an integer program, a k -cut is a cutting plane generated by the Gomory mixed...
Generating cutting planes for mixed integer programming problems in a parallel computing environment
Generating cutting planes for mixed integer programming problems in a parallel computing environment
2004,
A parallel implementation of a disjunctive cutting-plane algorithm in a distributed...
On bridging the gap between stochastic integer programming and MIP solver technologies
On bridging the gap between stochastic integer programming and MIP solver technologies
2004,
Stochastic integer programs (SIPs) represent a very difficult class of optimization...
A local-search-based heuristic for the demand-constrained multidimensional knapsack problem
A local-search-based heuristic for the demand-constrained multidimensional knapsack problem
2005,
We consider an extension of the 0–1 multidimensional knapsack problem in which...
Papers per page: