INFORMS Journal on Computing articles from January 1999

INFORMS Journal on Computing archives from January 1999

LOCALIZER: a modeling language for local search.
January 1, 1999... Local search is a traditional technique to solve combinatorial search problems and has raised much interest in recent years. The design and implementation of local search algorithms is not an easy task in general and may require considerable...

Neural networks for combinatorial optimization: a review of more than a decade of research.
January 1, 1999... It has been over a decade since neural networks were first applied to solve combinatorial optimization problems. During this period, enthusiasm has been erratic as new approaches are developed and (sometimes years later) their limitations are...

Information theory and the finite-time behavior of the simulated annealing algorithm: experimental results.
January 1, 1999... This article presents an empirical approach that demonstrates a theoretical connection between (information theoretic) entropy measures and the finite-time performance of the simulated annealing algorithm. The methodology developed leads to...

GRASP and path relinking for 2-layer straight line crossing minimization.
January 1, 1999... In this article, we develop a greedy randomized adaptive search procedure (GRASP) for the problem of minimizing straight line crossings in a 2-layer graph. The procedure is fast and is particularly appealing when dealing with low-density...

Improvement procedures for the undirected rural postman problem.
January 1, 1999... This article describes new construction and postoptimization heuristics for the Undirected Rural Postman Problem. Extensive computational tests indicate that some combinations of these heuristics consistently produce optimal or high-quality...

Analyzing infeasible mixed-integer and integer linear programs.
January 1, 1999... Algorithms and computer-based tools for analyzing infeasible linear and nonlinear programs have been developed in recent years, but few such tools exist for infeasible mixed-integer or integer linear programs. One approach that has proven...

Solving parallel machine scheduling problems by column generation.
January 1, 1999... We consider a class of problems of scheduling n jobs on m identical, uniform, or unrelated parallel machines with an objective of minimizing an additive criterion. We propose a decomposition approach for solving these problems exactly. The...

On exploiting problem structure in a basis identification procedure for linear programming.
January 1, 1999... During the last decade, interior-point methods have become an efficient alternative to the simplex algorithm for solution of large-scale linear programming (LP) problems. However, in many practical applications of LP, interior-point methods...

Analysis of stochastic assembly with GI-distributed assembly time.
January 1, 1999... In this article, we study an assembly system that supplies an end-product inventory. We allow assembly operation times to be general, independent (GI) distributed and analyze the system as a Markov renewal process, deriving a closed-form...

Lifted cover inequalities for 0-1 integer programs: complexity.
January 1, 1999... We investigate several complexity issues related to branch-and-cut algorithms for 0-1 integer programming based on lifted-cover inequalities (LCIs). We show that given a fractional point, determining a violated LCI over all minimal covers is...