Journal: INFORMS Journal On Computing

Found 560 papers in total
An evolutionary approach to group decision making
An evolutionary approach to group decision making
2002,
We propose modeling Group Support System (GSS) search tasks with Genetic Algorithms....
A MINSAT approach for learning in logic domains
A MINSAT approach for learning in logic domains
2002,
This paper describes a method for learning logic relationships that correctly classify...
Linear time dynamic-programming algorithms for new classes of retricted traveling salesman problems: A computational study
Linear time dynamic-programming algorithms for new classes of retricted traveling salesman problems: A computational study
2001,
Consider the following restricted (symmetric or asymmetric) traveling-salesman problem...
The online traveling salesman problem against fair adversaries
The online traveling salesman problem against fair adversaries
2001,
In the online traveling saleman problem, requests for visits to cities (points in a...
Modeling and analysis of discrete-time multiserver queues with batch arrivals: GIx/Geom/m
Modeling and analysis of discrete-time multiserver queues with batch arrivals: GIx/Geom/m
2001,
Multiserver queues are often encountered in telecommunication systems and have special...
Properties of batched quadratic-form variance parameter estimators for simulations
Properties of batched quadratic-form variance parameter estimators for simulations
2001,
We examine the practice of batching of certain quadratic-form estimators for the...
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...
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...
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...
A parallel, linear programming-based heuristic for large-scale set partitioning problems
A parallel, linear programming-based heuristic for large-scale set partitioning problems
2001,
We describe a parallel, linear programming and implication-based heuristic for solving...
Fast heuristics for the maximum feasible subsystem problem
Fast heuristics for the maximum feasible subsystem problem
2001,
Given an infeasible set of linear constraints, finding the maximum cardinality...
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...
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...
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...
Representations of the all_different predicate of constraint satisfaction in integer programming
Representations of the all_different predicate of constraint satisfaction in integer programming
2001,
The use of predicates to state constraints in Constraint Satisfaction is explained....
The path restoration version of the spare capacity allocation problem with modularity restrictions: Models, algorithms, and an empirical analysis
The path restoration version of the spare capacity allocation problem with modularity restrictions: Models, algorithms, and an empirical analysis
2001,
This investigation presents a strategy to construct a compact mathematical model of...
Approximation of point sets by 1-corner polygonal chains
Approximation of point sets by 1-corner polygonal chains
2000,
In this paper we consider some problems that belong to the interplay between the field...
A revised simplex search procedure for stochastic simulation response surface optimization
A revised simplex search procedure for stochastic simulation response surface optimization
2000,
We develop a variant of the Nelder–Mead (NM) simplex search procedure for...
Complexity of memory-efficient Kronecker operations with applications to the solution of Markov models
Complexity of memory-efficient Kronecker operations with applications to the solution of Markov models
2000,
We present new algorithms for the solution of large structured Markov models whose...
Enhanced model representations for an intra-ring synchronous optical network design problem allowing demand splitting
Enhanced model representations for an intra-ring synchronous optical network design problem allowing demand splitting
2000,
In this paper, we consider a network design problem arising in the context of...
A simplex-based tabu search method for capacitated network design
A simplex-based tabu search method for capacitated network design
2000,
The fixed charge capacitated multicommodity network design problem is a well-known...
Reactive GRASP: An application to a matrix decomposition problem in TDMA traffic assignment
Reactive GRASP: An application to a matrix decomposition problem in TDMA traffic assignment
2000,
A greedy randomized adaptive search procedure (GRASP) is a metaheuristic for...
Papers per page: