Journal: INFORMS Journal On Computing

Found 560 papers in total
An exact solution approach based on shortest-paths for p-hub median problems
An exact solution approach based on shortest-paths for p-hub median problems
1998,
The problem of locating hub facilities arises in the design of transportation and...
Feature selection via mathematical programming
Feature selection via mathematical programming
1998,
The problem of discriminating between two finite point sets in n -dimensional feature...
Online scheduling with Lookahead: Multipass assembly lines
Online scheduling with Lookahead: Multipass assembly lines
1998,
This article describes our use of competitive analysis and the on-line model of...
Local search heuristics for the single machine total weighted tardiness scheduling problem
Local search heuristics for the single machine total weighted tardiness scheduling problem
1998,
This paper presents several local search heuristics for the problem of scheduling a...
An approximate analysis of a UNIX macro process scheduler
An approximate analysis of a UNIX macro process scheduler
1998,
A UNIX macro process scheduler, referred to as the Fair Share Scheduler (FSS), is a...
A relationship between CNF and DNF systems derivable from examples
A relationship between CNF and DNF systems derivable from examples
1995,
In learning from examples, the main goal is to use a collection of positive examples...
Adding value to induced decision trees for time-sensitive data
Adding value to induced decision trees for time-sensitive data
1997,
Rule induction serves as an alternative knowledge acquisition method in the...
A graph theory-based approach for partitioning knowledge bases
A graph theory-based approach for partitioning knowledge bases
1995,
The growing interest in using structured methodologies for design and development is a...
Computing gradients in large-scale optimization using automatic differentiation
Computing gradients in large-scale optimization using automatic differentiation
1997,
The accurate and efficient computation of gradients for partially separable functions...
An efficient algorithm for a class of two-resource allocation problems
An efficient algorithm for a class of two-resource allocation problems
1998,
We propose an efficient algorithm for the two-resource allocation problem defined on a...
A tabu-search heuristic for the dynamic plant layout problem
A tabu-search heuristic for the dynamic plant layout problem
1997,
We consider the dynamic plant layout problem (DPLP) in which the layout of a facility...
Vector quantization for arbitrary distance function estimation
Vector quantization for arbitrary distance function estimation
1997,
In this article we apply the concepts of vector quantization for the evaluation of...
A staged primal–dual algorithm for perfect b-matching with edge capacities
A staged primal–dual algorithm for perfect b-matching with edge capacities
1995,
We describe an algorithm for finding a minimum cost perfect b-matching in a weighted...
Interval graph problems on reconfigurable meshes
Interval graph problems on reconfigurable meshes
1995,
A graph G is an interval graph if there is a one–one correspondence between its...
Performance issues for the iterative solution of Markov decision processes on parallel computers
Performance issues for the iterative solution of Markov decision processes on parallel computers
1995,
This paper analyses the implementation of an iterative solution method for Markov...
A parallel implementation of the Grassman–Taksar–Heyman algorithm
A parallel implementation of the Grassman–Taksar–Heyman algorithm
1997,
The Grassman–Taksar–Heyman algorithm is a direct algorithm for computing...
A finite capacity queue with nonrenewal input and exponential dynamic group services
A finite capacity queue with nonrenewal input and exponential dynamic group services
1997,
In this article we consider a finite capacity queuing model in which jobs (or...
Distributed state space generation of discrete-state stochastic models
Distributed state space generation of discrete-state stochastic models
1998,
High-level formalisms such as stochastic Petri nets can be used to model complex...
A cutting plane algorithm for multicommodity survivable network design problems
A cutting plane algorithm for multicommodity survivable network design problems
1998,
We present a cutting plane algorithm for solving the following telecommunications...
A virtual clustering approach for routing problems in telecommunication networks
A virtual clustering approach for routing problems in telecommunication networks
1998,
We propose an adaptable routing scheme for telecommunication networks based on the...
Solving multicommodity flow problems with a primal embedded network simplex algorithm
Solving multicommodity flow problems with a primal embedded network simplex algorithm
1997,
This article describes the authors' experience solving large multicommodity flow...
Interconnecting LANs and a FDDI backbone using transparent bridges: A model and solution algorithms
Interconnecting LANs and a FDDI backbone using transparent bridges: A model and solution algorithms
1998,
In this article, we construct a mathematical model to design the topology of a network...
A dual ascent procedure with valid inequalities for designing hierarchical network topologies
A dual ascent procedure with valid inequalities for designing hierarchical network topologies
1998,
Topological design of communication networks has been well examined in the literature....
Probabilistic scaling for the numerical inversion of nonprobability transforms
Probabilistic scaling for the numerical inversion of nonprobability transforms
1997,
It is known that probability density functions and probability mass functions usually...
Papers per page: