Journal: INFORMS Journal On Computing

Found 560 papers in total
Toward an experimental method for algorithm simulation
Toward an experimental method for algorithm simulation
1996,
This feature article surveys issues arising in the design, development, and execution...
Use of representative operation counts in computational testing of algorithms
Use of representative operation counts in computational testing of algorithms
1996,
In the mathematical programming literature, researchers have conducted a large number...
Hulls and efficient sets for the rectilinear norm
Hulls and efficient sets for the rectilinear norm
1995,
Given a set of points on the plane, we study the structure of their rectilinear hull....
Art gallery problems for convex nested polygons
Art gallery problems for convex nested polygons
1997,
In this article, we study a class of Art Gallery problems that are defined on a pair...
On the two-level uncapacitated facility location problem
On the two-level uncapacitated facility location problem
1996,
We study the two-level uncapacitated facility location (TUFL) problem. Given two types...
Bounds and approximations for overheads in the time to join parallel forks
Bounds and approximations for overheads in the time to join parallel forks
1995,
This paper studies the effects of overheads in massively parallel processing. The...
Data-parallel implementations of dense simplex methods on the Connection Machine CM-2
Data-parallel implementations of dense simplex methods on the Connection Machine CM-2
1995,
We describe three data-parallel implementations of the simplex method for dense linear...
How much communication does parallel branch and bound need?
How much communication does parallel branch and bound need?
1997,
Consider the classical branch and bound algorithm for mixed integer programming (MIP)....
An improved algorithm for the constrained bottleneck spanning tree problem
An improved algorithm for the constrained bottleneck spanning tree problem
1996,
We propose an algorithm to solve the bottleneck spanning tree problem with an...
Some experimental and theoretical results on test case generators for the maximum clique problem
Some experimental and theoretical results on test case generators for the maximum clique problem
1996,
We describe and analyze test case generators for the maximum clique problem (or...
A branch and cut algorithm for a Steiner tree-star problem
A branch and cut algorithm for a Steiner tree-star problem
1996,
This paper deals with a Steiner tree-star problem that is a special case of the degree...
The multi-tier tree problem
The multi-tier tree problem
1996,
This paper studies the multi-tier tree (MTT) problem, a generalization of the...
Scheduling n independent jobs on m uniform machines with both flowtime and makespan objectives: A parametric analysis
Scheduling n independent jobs on m uniform machines with both flowtime and makespan objectives: A parametric analysis
1995,
We consider the problem of scheduling n jobs without precedence constraints on m...
A comparison of constraint and mixed-integer programming solvers for batch sequencing with sequence-dependent setups
A comparison of constraint and mixed-integer programming solvers for batch sequencing with sequence-dependent setups
1995,
A batch sequencing model with sequence-dependent setup-times and -costs is used to...
Optimal scheduling of tasks on identical parallel processors
Optimal scheduling of tasks on identical parallel processors
1995,
We consider the classical problem of scheduling n tasks with given processing time on...
On the asymptotic optimality of multiprocessor scheduling heuristics for the makespan minimization problem
On the asymptotic optimality of multiprocessor scheduling heuristics for the makespan minimization problem
1995,
The asymptotic performance of heuristic algorithms for the multiprocessor scheduling...
Single machine scheduling to minimize total weighted late work
Single machine scheduling to minimize total weighted late work
1995,
In the problem of scheduling a single machine to minimize total weighted late work,...
Solving a class scheduling problem with a genetic algorithm
Solving a class scheduling problem with a genetic algorithm
1995,
In this paper, we study the one-machine scheduling problem of minimizing the total...
Problem and heuristic space search strategies for job shop scheduling
Problem and heuristic space search strategies for job shop scheduling
1995,
In an earlier paper we discussed ‘problem’ and ‘heuristic’...
Constraint propagation based scheduling of job shops
Constraint propagation based scheduling of job shops
1996,
This paper examines the minimum makespan problem for the job shop from an artificial...
Job shop scheduling by local search
Job shop scheduling by local search
1996,
We survey solution methods for the job shop scheduling problem with an emphasis on...
An O(n log n) algorithm for the two-machine flow shop problem with controllable machine speeds
An O(n log n) algorithm for the two-machine flow shop problem with controllable machine speeds
1996,
In this paper we consider the two-machine flow shop problem with varying machine...
A branch-and-bound algorithm for single-machine earliness–tardiness scheduling with idle time
A branch-and-bound algorithm for single-machine earliness–tardiness scheduling with idle time
1996,
We address the NP-hard single-machine problem of scheduling n independent jobs so as...
Scheduling periodic tasks
Scheduling periodic tasks
1996,
We consider the problem of nonpreemptively scheduling periodic tasks on a minimum...
Papers per page: