Journal: INFORMS Journal On Computing

Found 560 papers in total
A linear programming approach to discriminant analysis with a reserved-judgment region
A linear programming approach to discriminant analysis with a reserved-judgment region
2003,
A linear-programming model is proposed for deriving discriminant rules that allow...
Efficient and anonymous web-usage mining for web personalization
Efficient and anonymous web-usage mining for web personalization
2003,
The World Wide Web (WWW) is the largest distributed information space and has grown to...
On the existence and significance of data preprocessing biases in web-usage mining
On the existence and significance of data preprocessing biases in web-usage mining
2003,
The literature on web-usage mining is replete with data preprocessing techniques,...
Web business intelligence: Mining the web for actionable knowledge
Web business intelligence: Mining the web for actionable knowledge
2003,
It is estimated that over seven billion static pages exist in the Web today, and...
A genetic algorithm-based approach for building accurate decision trees
A genetic algorithm-based approach for building accurate decision trees
2003,
In dealing with a very large data set, it might be impractical to construct a decision...
Optimal integer solutions to industrial cutting-stock problems: Part 2, benchmark results
Optimal integer solutions to industrial cutting-stock problems: Part 2, benchmark results
2003,
In this paper we present a state-of-the-art version of the branch-and-price procedure...
Constraint and integer programming in OPL (Optimization Programming Language)
Constraint and integer programming in OPL (Optimization Programming Language)
2002,
In recent years, it has been increasingly recognized that constraint and integer...
The role of integer programming techniques in constraint programming's global constraints
The role of integer programming techniques in constraint programming's global constraints
2002,
Efforts aimed at combining operations research and constraint programming have become...
Addendum to ‘Presolve analysis of linear programs prior to applying an interior point method’
Addendum to ‘Presolve analysis of linear programs prior to applying an interior point method’
2001,
In this note we point out that the assumptions of Propositions 1 and 2 in Gondzio...
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...
The semismooth algorithm for large scale complementarity problems
The semismooth algorithm for large scale complementarity problems
2001,
Complementarity solvers are continually being challenged by modelers demanding...
The path restoration version of the spare capaciity allocation problem with modularity restrictions: models, algorithms, and an empirical analysis
The path restoration version of the spare capaciity allocation problem with modularity restrictions: models, algorithms, and an empirical analysis
2001,
This investigation presents a strategy to construct a compact mathematical model of...
Capacitated network design with uncertain demand
Capacitated network design with uncertain demand
2002,
We consider a capacity-expansion problem arising in the design of telecommunication...
Linear time dynamic-programming algorithms for new classes of restricted travelling salesman problems: a computational study
Linear time dynamic-programming algorithms for new classes of restricted travelling salesman problems: a computational study
2001,
Consider the following restricted (symmetric or asymmetric) traveling-salesman problem...
The online travelling salesman problem against fair adversaries
The online travelling salesman problem against fair adversaries
2001,
In the online traveling salesman problem, requests for visits to cities (points in a...
A hybrid exact algorithm for the Travelling Salesman Problem with Time Windows
A hybrid exact algorithm for the Travelling Salesman Problem with Time Windows
2002,
The Traveling Salesman Problem with Time Windows (TSPTW) is the problem of finding 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 telecommunications systems and have...
Phantom harmonic gradient estimators for nonpreemptive priority queueing systems
Phantom harmonic gradient estimators for nonpreemptive priority queueing systems
2001,
This paper presents a new gradient estimator for the steady-state expected sojourn...
Symbolic computation of moments in priority queues
Symbolic computation of moments in priority queues
2002,
Analytical tools such as Laplace–Stieltjes transforms and z-transforms are...
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...
Convergence properties of the batch means method for simulation output analysis
Convergence properties of the batch means method for simulation output analysis
2001,
We examine key convergence properties of the steady-state simulation analysis method...
Ranking and selection for steady-state simulation: Procedures and perspectives
Ranking and selection for steady-state simulation: Procedures and perspectives
2002,
We present and evaluate three ranking-and-selection procedures for use in steady-state...
Optimization for simulation: Theory vs. Practice
Optimization for simulation: Theory vs. Practice
2002,
Probably one of the most successful interfaces between operations research and...
Papers per page: