Journal: INFORMS Journal On Computing

Found 560 papers in total
Dynamic programming based approximation algorithms for sequence alignment with constraints
Dynamic programming based approximation algorithms for sequence alignment with constraints
2004,
Given two sequences X and Y , the classical dynamic programming solution to the local...
The fine structure of galls in phylogenetic networks
The fine structure of galls in phylogenetic networks
2004,
A phylogenetic network is a generalization of a phylogenetic tree, allowing properties...
The Pht/Pht/∞ queueing system: Part I – The single node
The Pht/Pht/∞ queueing system: Part I – The single node
2004,
We develop a numerically exact method for evaluating the time-dependent mean,...
The [Pht/Pht/∞]K queueing system: Part II – The multiclass network
The [Pht/Pht/∞]K queueing system: Part II – The multiclass network
2004,
We demonstrate a numerically exact method for evaluating the time-dependent mean,...
A two-moment approximation for the GI/G/c queue with finite capacity
A two-moment approximation for the GI/G/c queue with finite capacity
2005,
In this paper, we consider the steady-state queue length of the multiserver...
Using extra dual cuts to accelerate column generation
Using extra dual cuts to accelerate column generation
2005,
Column generation is often used to solve models with stronger linear-programming...
An automated multiresolution procedure for modeling complex arrival processes
An automated multiresolution procedure for modeling complex arrival processes
2006,
To automate the multiresolution procedure of Kuhl et al. for modeling and simulating...
Optimal processing policies for an e-commerce Web server
Optimal processing policies for an e-commerce Web server
2005,
The explosive growth in online shopping has provided online retailers impressive...
Execution conditions: A formalization of event cancellation in simulation graphs
Execution conditions: A formalization of event cancellation in simulation graphs
2003,
Simulation graph models provide a powerful and general modeling framework for...
The filtered nearest neighbor method for generating low-discrepancy sequences
The filtered nearest neighbor method for generating low-discrepancy sequences
2004,
We introduce the filtered nearest neighbor method for generating low-discrepancy...
Searching for good multiple recursive random number generators via a genetic algorithm
Searching for good multiple recursive random number generators via a genetic algorithm
2004,
In designing ideal multiple recursive random number (RN) generators (MRGs), the best...
State-of-the-art review – A user's guide to the brave new world of designing simulation experiments
State-of-the-art review – A user's guide to the brave new world of designing simulation experiments
2005,
Many simulation practitioners can get more from their analyses by using the...
An analysis of the alias method for discrete random-variate generation
An analysis of the alias method for discrete random-variate generation
2005,
This paper introduces and studies an optimization problem related to the alias method...
Designing communication networks to decompose network control problems
Designing communication networks to decompose network control problems
2005,
The pressure from today's economic and energy markets demands further distribution of...
Combinatorial auctions: a survey
Combinatorial auctions: a survey
2003,
Many auctions involve the sale of a variety of distinct assets. Examples are airport...
A new formulation and resolution method for the p-Center Problem
A new formulation and resolution method for the p-Center Problem
2004,
The p -center problem consists of choosing p facilities among a set of M possible...
Multiple sequence alignment as a facility-location problem
Multiple sequence alignment as a facility-location problem
2004,
A connection is made between certain multiple-sequence alignment problems and...
The minmax relative regret median problem on networks
The minmax relative regret median problem on networks
2005,
We consider a version of the 1-median problem on a network with uncertain weights of...
A new mathematical-programming framework for facility-layout design
A new mathematical-programming framework for facility-layout design
2006,
We present a new framework for efficiently finding competitive solutions for the...
A new pricing scheme for airline crew scheduling
A new pricing scheme for airline crew scheduling
2004,
Solving LP relaxations of airline crew scheduling models is computationally...
Meta-heuristics for a class of demand-responsive transit systems
Meta-heuristics for a class of demand-responsive transit systems
2005,
The demand-adaptive systems studied in this paper attempt to offer demand-responsive...
Context-independent scatter and tabu search for permutation problems
Context-independent scatter and tabu search for permutation problems
2005,
In this paper, we develop a general-purpose heuristic for permutations problems. The...
A modeling layer for constraint-programming libraries
A modeling layer for constraint-programming libraries
2005,
Mathematical-modeling and constraint-programming languages have orthogonal strengths...
Intelligent partitioning for feature selection
Intelligent partitioning for feature selection
2005,
This paper develops a new optimization-based feature-selection framework for knowledge...
Papers per page: