Journal: INFORMS Journal On Computing

Found 560 papers in total
An ant colony system hybridized with a new local search for the sequential ordering problem
An ant colony system hybridized with a new local search for the sequential ordering problem
2000,
We present a new local optimizer called SOP-3-exchange for the sequential ordering...
Solving graph bisection problems with semidefinite programming
Solving graph bisection problems with semidefinite programming
2000,
An exact solution method for the graph bisection problem is presented. We describe a...
Market split and basis reduction: Towards a solution of the Cornuejols–Dawande instances
Market split and basis reduction: Towards a solution of the Cornuejols–Dawande instances
2000,
Cornuejols and Dawande proposed a set of 0–1 linear programming instances that...
Practical piecewise-linear approximation for monotropic optimization
Practical piecewise-linear approximation for monotropic optimization
2000,
Piece-wise linear programs are routinely used in applications to approximate nonlinear...
Internet-type queues with power-tailed interarrival times and computational methods for their analysis
Internet-type queues with power-tailed interarrival times and computational methods for their analysis
2000,
Internet traffic flows have often been characterized as having power-tailed...
General open and closed queueing networks with blocking: A unified framework for approximation
General open and closed queueing networks with blocking: A unified framework for approximation
2000,
In this paper, we develop a unified framework for approximating open and closed...
Multiple-machine lower bounds for shop-scheduling problems
Multiple-machine lower bounds for shop-scheduling problems
2000,
In order to compute lower bounds for shop scheduling problems, a lot of attention has...
Optimal integer solutions to industrial cutting stock problems
Optimal integer solutions to industrial cutting stock problems
1999,
The ‘textbook’ treatment of the cutting stock problem, using a method...
Statistical analysis of computational tests of algorithms and heuristics
Statistical analysis of computational tests of algorithms and heuristics
2000,
Statistical analysis is a powerful tool to apply when evaluating the performance of...
Parallelizing the dual simplex method
Parallelizing the dual simplex method
2000,
We study the parallelization of the steepest-edge version of the dual simplex...
Handling sensor data in rapidly changing environments to support soft real-time requirements
Handling sensor data in rapidly changing environments to support soft real-time requirements
2000,
Databases have been mandated as the chosen platform to develop automated control...
A bundle type dual-ascent approach to linear multicommodity min-cost flow problems
A bundle type dual-ascent approach to linear multicommodity min-cost flow problems
1999,
We present a Cost Decomposition approach for the linear Multicommodity Min-Cost Flow...
Minmax regret median location on a network under uncertainty
Minmax regret median location on a network under uncertainty
2000,
We consider the 1-median problem on a network with uncertain weights of nodes....
Algorithms for path-based placement of inspection stations on networks
Algorithms for path-based placement of inspection stations on networks
2000,
Placement of inspection stations is a common task in transportation and communication...
Heuristic and metaheuristic approaches for a class of two-dimensional bin packing problems
Heuristic and metaheuristic approaches for a class of two-dimensional bin packing problems
1999,
Two-dimensional bin packing problems consist of allocating, without overlapping, a...
Computing Laplace transforms for numerical inversion via continued fractions
Computing Laplace transforms for numerical inversion via continued fractions
1999,
It is often possible to effectively calculate probability density functions (pdfs) and...
Exact and approximate nondeterministic tree-search procedures for the quadratic assignment problem
Exact and approximate nondeterministic tree-search procedures for the quadratic assignment problem
1999,
This article introduces two new techniques for solving the Quadratic Assignment...
A stochastic branch-and-bound approach to activity crashing in project management
A stochastic branch-and-bound approach to activity crashing in project management
2000,
Many applications such as project scheduling, workflow modeling, or business process...
When does a dynamic programming formulation guarantee the existence of a fully polynomial time approximation scheme?
When does a dynamic programming formulation guarantee the existence of a fully polynomial time approximation scheme?
2000,
We derive results of the following flavor: If a combinatorial optimization problem can...
A minimal algorithm for the bounded knapsack problem
A minimal algorithm for the bounded knapsack problem
2000,
The Bounded Knapsack Problem (BKP) is a generalization of the 0–1 Knapsack...
Progress in linear programming-based algorithms for integer programming: An exposition
Progress in linear programming-based algorithms for integer programming: An exposition
2000,
This paper is about modeling and solving mixed integer programming problems. In the...
Propagation of interval values in simple processing networks
Propagation of interval values in simple processing networks
1999,
Process network optimization problems are prevalent in the processing industries....
A fuzzy Hopfield–Tank traveling salesman problem model
A fuzzy Hopfield–Tank traveling salesman problem model
1999,
This article describes a Hopfield–Tank model of the Euclidean traveling salesman...
Time-indexed formulations for machine scheduling problems: Column generation
Time-indexed formulations for machine scheduling problems: Column generation
2000,
Time-indexed formulations for machine scheduling problems have received a great deal...
Papers per page: