Journal: INFORMS Journal On Computing

Found 560 papers in total
Calculating the distribution of a linear combination of uniform order statistics
Calculating the distribution of a linear combination of uniform order statistics
2002,
The calculation of the distribution of a linear combination of order statistics from...
A flexible Java representation for uncertainty in online operations-research models
A flexible Java representation for uncertainty in online operations-research models
2001,
Online OR models have been the subject of increased attention in recent years with the...
Minimizing the average query complexity of learning monotone Boolean functions
Minimizing the average query complexity of learning monotone Boolean functions
2002,
This paper addresses the problem of completely reconstructing deterministic monotone...
Cascade graphs: Design, analysis and algorithms for relational joins
Cascade graphs: Design, analysis and algorithms for relational joins
2001,
The focus of this work is on join optimization in relational database systems. The...
A hybrid GRASP with perturbations for the Steiner problem in graphs
A hybrid GRASP with perturbations for the Steiner problem in graphs
2002,
We propose and describe a hybrid GRASP with weight perturbations and adaptive...
The bounded cycle-cover problem
The bounded cycle-cover problem
2001,
We consider the bounded cycle-cover problem, which is to find a minimum cost cycle...
On the design problem of multitechnology networks
On the design problem of multitechnology networks
2001,
In this article we propose a model for the topological design problem of...
Logic, optimization, and constraint programming
Logic, optimization, and constraint programming
2002,
Because of their complementary strengths, optimization and constraint programming can...
Extending an algebraic modeling language to support constraint programming
Extending an algebraic modeling language to support constraint programming
2002,
Although algebraic modeling languages are widely used in linear and nonlinear...
A dynamic programming based pruning method for decision trees
A dynamic programming based pruning method for decision trees
2001,
This paper concerns a decision-tree pruning method, a key issue in the development of...
Representatons of the all_different predicate of constraint satisfaction in integer programming
Representatons of the all_different predicate of constraint satisfaction in integer programming
2001,
The use of predicates to state constraints in Constraint Satisfaction is explained....
Sorting permutations by reversals through branch-and-price
Sorting permutations by reversals through branch-and-price
2001,
We describe an exact algorithm for the problem of sorting a permutation by the minimum...
Algorithms for hybrid MILP/CP models for a class of optimization problems
Algorithms for hybrid MILP/CP models for a class of optimization problems
2001,
The goal of this paper is to develop models and methods that use complementary...
Scheduling batches with sequential job processing for two-machine flow and open shops
Scheduling batches with sequential job processing for two-machine flow and open shops
2001,
In this paper, we study a problem of scheduling and batching on two machines in a...
Non-approximability results for scheduling problems with minsum criteria
Non-approximability results for scheduling problems with minsum criteria
2001,
We provide several non-approximability results for deterministic scheduling problems...
Combining column generation and Lagrangean relaxation to solve a single-machine common due date problem
Combining column generation and Lagrangean relaxation to solve a single-machine common due date problem
2002,
Column generation has proved to be an effective technique for solving the linear...
An iterated dynasearch algorithm for the single-machine totalweighted tardiness scheduling problem
An iterated dynasearch algorithm for the single-machine totalweighted tardiness scheduling problem
2002,
This paper introduces a new neighborhood search technique, called dynasearch, that...
Assembly-line scheduling with concurrent operations and parallel machines
Assembly-line scheduling with concurrent operations and parallel machines
2002,
This paper addresses the assembly-line scheduling problem with concurrent operations...
Contrasting stuctured and random permutation flow-shop scheduling problems: Search-space topology and algorithm performance
Contrasting stuctured and random permutation flow-shop scheduling problems: Search-space topology and algorithm performance
2002,
The use of random test problems to evaluate algorithm performance raises an important,...
Experimental comparison of approximation algorithms for scheduling unrelated parallel machines
Experimental comparison of approximation algorithms for scheduling unrelated parallel machines
2002,
This paper presents an empirical comparison of polynomial-time approximation...
Solution of a min–max vehicle routing problem
Solution of a min–max vehicle routing problem
2002,
We use a branch-and-cut search to solve the Whizzkids'96 vehicle routing problem,...
Fault-tolerant virtual path layout in Asynchronous Transfer Mode networks
Fault-tolerant virtual path layout in Asynchronous Transfer Mode networks
2001,
Asynchronous Transfer Mode (ATM) is a communications architecture for the provision of...
Minimax models for diverse routing
Minimax models for diverse routing
2002,
An important task in the management and administration of communication networks is...
Initialization for the Normal To Anything approach: Generation of random vectors with specified marginals and correlations
Initialization for the Normal To Anything approach: Generation of random vectors with specified marginals and correlations
2001,
We propose a specific method for generating n -dimensional random vectors with given...
Papers per page: