Journal: INFORMS Journal On Computing

Found 560 papers in total
Neural networks for combinatorial optimization: A review of more than a decade of research
Neural networks for combinatorial optimization: A review of more than a decade of research
1999,
It has been over a decade since neural networks were first applied to solve...
Information theory and the finite-time behavior of the simulated annealing algorithm: Experimental results
Information theory and the finite-time behavior of the simulated annealing algorithm: Experimental results
1999,
This article presents an empirical approach that demonstrates a theoretical connection...
GRASP and path relinking for 2-layer straight line crossing minimization
GRASP and path relinking for 2-layer straight line crossing minimization
1999,
In this article, we develop a greedy randomized adaptive search procedure for the...
Improvement procedures for the undirected rural postman problem
Improvement procedures for the undirected rural postman problem
1999,
This article describes new construction and postoptimization heuristics for the...
Analyzing infeasible mixed-integer and integer linear programs
Analyzing infeasible mixed-integer and integer linear programs
1999,
Algorithms and computer-based tools for analyzing infeasible linear and nonlinear...
On exploiting problem structure in a basis identification procedure for linear programming
On exploiting problem structure in a basis identification procedure for linear programming
1999,
During the last decade, interior-point methods have become an efficient alternative to...
Distribution estimation using Laplace transforms
Distribution estimation using Laplace transforms
1998,
We propose two related methods for deriving probability distribution estimates using...
A branch and bound algorithm for the stability number of a sparse graph
A branch and bound algorithm for the stability number of a sparse graph
1998,
We present a branch and bound algorithm for finding a maximum stable set in a graph....
Lifted cover inequalities for 0–1 integer programs: Computation
Lifted cover inequalities for 0–1 integer programs: Computation
1998,
We investigate the algorithmic and implementation issues related to the effective and...
An efficient algorithm for solving an air traffic management model of the US National Airspace System
An efficient algorithm for solving an air traffic management model of the US National Airspace System
1998,
Growth in traffic and changes in traffic patterns have caused an increase in the...
Partitioning the attribute set for a probabilistic reasoning system
Partitioning the attribute set for a probabilistic reasoning system
1998,
The ability of a computerized system to model the reasoning process of humans has...
On the performance of heuristics on finite and infinite fractal instances of the Euclidean Traveling Salesman Problem
On the performance of heuristics on finite and infinite fractal instances of the Euclidean Traveling Salesman Problem
1998,
We show how, by a constructive process, we can generate arbitrarily large instances of...
Solving the orienteering problem through branch-and-cut
Solving the orienteering problem through branch-and-cut
1998,
In the Orienteering Problem (OP), we are given an undirected graph with edge weights...
Approximating shortest paths in large-scale networks with an application to intelligent transportation systems
Approximating shortest paths in large-scale networks with an application to intelligent transportation systems
1998,
We propose a hierarchical algorithm for approximating shortest paths between all pairs...
Using variable redefinition for computing lower bounds for minimum spanning and Steiner trees with hop constraints
Using variable redefinition for computing lower bounds for minimum spanning and Steiner trees with hop constraints
1998,
We use variable redefinition to strengthen a multicommodity flow (MCF) model for...
Connections between integer linear programming and constraint logic programming – An overview and introduction to the cluster of articles
Connections between integer linear programming and constraint logic programming – An overview and introduction to the cluster of articles
1998,
The fields of integer linear programming and constraint logic programming have...
Integer linear programming and constraint programming approaches to a template design problem
Integer linear programming and constraint programming approaches to a template design problem
1998,
We describe a design problem arising in the color printing industry and discuss a...
Properties of some combinatorial optimization problems and their effect on the performance of integer programming and constraint logic programming
Properties of some combinatorial optimization problems and their effect on the performance of integer programming and constraint logic programming
1998,
The comparative performance of Integer Programming (IP) and Constraint Logic...
Branch and infer: A unifying framework for integer and finite domain constraint programming
Branch and infer: A unifying framework for integer and finite domain constraint programming
1998,
We introduce branch and infer, a unifying framework for integer linear programming and...
An incremental branch-and-bound method for the satisfiability problem
An incremental branch-and-bound method for the satisfiability problem
1998,
The satisfiability problem is to check whether a set of clauses in propositional logic...
Variance reduction and objective function evaluation in stochastic linear programs
Variance reduction and objective function evaluation in stochastic linear programs
1998,
Planning under uncertainty requires the explicit representation of uncertain...
Strategies for creating advanced bases for large-scale linear programming problems
Strategies for creating advanced bases for large-scale linear programming problems
1998,
The performance of the revised sparse simplex method, or its variants, for the...
An algorithm for identifying the frame of a pointed finite conical hull
An algorithm for identifying the frame of a pointed finite conical hull
1998,
We present an algorithm for identifying the extreme rays of the conical hull of a...
Interval protection of confidential information in a database
Interval protection of confidential information in a database
1998,
We deal with the question of how to maintain security of confidential information in a...
Papers per page: