Journal: INFORMS Journal On Computing

Found 560 papers in total
Selecting scheduling heuristics using neural networks
Selecting scheduling heuristics using neural networks
2000,
This paper discusses the application of neural networks to select the best heuristic...
Data mining by decomposition: Adaptive search for hypothesis generation
Data mining by decomposition: Adaptive search for hypothesis generation
1999,
Data mining methods search large databases for interesting patterns that may lead to...
A study of composite or hybrid classifiers for knowledge discovery
A study of composite or hybrid classifiers for knowledge discovery
1999,
There are several well-known techniques for knowledge discovery such as neural...
Optimizing expert systems: Heuristics for efficiently generating low-cost information acquisition strategies
Optimizing expert systems: Heuristics for efficiently generating low-cost information acquisition strategies
1999,
We study the sequential information acquisition problem for rule-based expert systems...
Semantics-based transaction processing for real-time databases: The case of automated stock trading
Semantics-based transaction processing for real-time databases: The case of automated stock trading
1999,
In the future, automated stock trading (AST) databases will need to support execution...
Packet routing in telecommunication networks with path and flow restrictions
Packet routing in telecommunication networks with path and flow restrictions
1999,
We address packet-switched telecommunication networks, including ATM, SMDS, and X.25...
An efficient decomposition algorithm to optimize spare capacity in a telecommunications network
An efficient decomposition algorithm to optimize spare capacity in a telecommunications network
1999,
This article presents a new model for the spare capacity allocation problem in a...
Exact solution of the quadratic knapsack problem
Exact solution of the quadratic knapsack problem
1999,
The Quadratic Knapsack Problem (QKP) calls for maximizing a quadratic objective...
Computing minimum-weight perfect matchings
Computing minimum-weight perfect matchings
1999,
We make several observations on the implementation of Edmonds' blossom algorithm for...
Improved constructive multistart strategies for the quadratic assignment problem using adaptive memory
Improved constructive multistart strategies for the quadratic assignment problem using adaptive memory
1999,
Multistart constructive approaches operate by applying a local search procedure to...
A computational study of search strategies for mixed integer programming
A computational study of search strategies for mixed integer programming
1999,
The branch-and-bound procedure for solving mixed integer programming (MIP) problems...
A class of hard small 0–1 programs
A class of hard small 0–1 programs
1999,
In this article, we consider a class of 0–1 programs that, although innocent...
An approximation scheme for minimizing agreeably weighted variance on a single machine
An approximation scheme for minimizing agreeably weighted variance on a single machine
1999,
We consider the problem of minimizing the weighted variance of job completion times on...
Matrix sensitivity analysis from an interior solution of a linear program
Matrix sensitivity analysis from an interior solution of a linear program
1999,
This article considers the effect of changing matrix coefficients in a linear program...
Mathematical programming for data mining: Formulations and challenges
Mathematical programming for data mining: Formulations and challenges
1999,
This article is intended to serve as an overview of a rapidly emerging research and...
A set-partitioning-based heuristic for the vehicle routing problem
A set-partitioning-based heuristic for the vehicle routing problem
1999,
We develop a generic tabu search heuristic for solving the well-known vehicle routing...
Parallel complexity of additive location problems
Parallel complexity of additive location problems
1999,
Parallel NC-algorithms for a general class of multifacility location problems on a...
Direct marketing performance modeling using genetic algorithms
Direct marketing performance modeling using genetic algorithms
1999,
Data analysts in direct marketing seek models to identify the most promising...
Feature selection for financial credit-risk evaluation decisions
Feature selection for financial credit-risk evaluation decisions
1999,
Credit-risk evaluation decisions are important for the financial institutions involved...
Lifted cover inequalities for 0–1 integer programs: Complexity
Lifted cover inequalities for 0–1 integer programs: Complexity
1999,
We investigate several complexity issues related to branch-and-cut algorithms for...
Solving parallel machine scheduling problems by column generation
Solving parallel machine scheduling problems by column generation
1999,
We consider a class of problems of scheduling n jobs on m identical, uniform, or...
Analysis of stochastic assembly with general independent distributed assembly time
Analysis of stochastic assembly with general independent distributed assembly time
1999,
In this article, we study an assembly system that supplies an end-product inventory....
The World Wide Web: Opportunities for operations research and management science
The World Wide Web: Opportunities for operations research and management science
1998,
The World Wide Web has already affected OR/MS work in a significant way, and holds...
Localizer: A modeling language for local search
Localizer: A modeling language for local search
1999,
Local search is a traditional technique to solve combinatorial search problems and has...
Papers per page: