Journal: INFORMS Journal On Computing

Found 560 papers in total
Beam-ACO for Simple Assembly Line Balancing
2008,
Assembly line balancing problems are concerned with the optimization of manufacturing...
Estimating Cycle Time Percentile Curves for Manufacturing Systems via Simulation
2008,
Cycle time–throughput (CT–TH) percentile curves quantify the relationship...
Estimation-Based Local Search for Stochastic Combinatorial Optimization Using Delta Evaluations: A Case Study on the Probabilistic Traveling Salesman Problem
2008,
In recent years, much attention has been devoted to the development of metaheuristics...
A Noniterative Algorithm for the Linear-Quadratic Profit-Maximization Model for Smoothing Multiproduct Production
2008,
In multiproduct–production and workforce–smoothing problems, the objective...
An Algorithm for Computing Minimal % Coxian Representations
2008,
This paper presents an algorithm for computing minimal ordered Coxian representations...
Speeding Up Dynamic Shortest-Path Algorithms
2008,
Dynamic shortest–path algorithms update the shortest paths taking into account a...
Matchings in Node-Weighted Convex Bipartite Graphs
2008,
Matchings in convex bipartite graphs correspond to the problem of scheduling...
Algorithms for the Constrained Two-Staged Two-Dimensional Cutting Problem
2008,
This paper solves FC_2TDC, the two–staged fixed–orientation...
The K King Problem, an Abstract Model for Computing Aircraft Landing Trajectories: On Modeling a Dynamic Hybrid System with Constraints
2008,
Motivated by the problem of computing trajectories of a set of aircraft in their final...
A Tensor Sum Preconditioner for Stochastic Automata Networks
2008,
Stochastic automata networks (SANs) have gained great interest within the...
Solving the Capacitated Local Access Network Design Problem
2008,
We propose an exact solution method for a routing and capacity installation problem in...
A Faster Index Algorithm and a Computational Study for Bandits with Switching Costs
2008,
We address the intractable multi–armed bandit problem with switching costs, for...
A Unified Modeling and Solution Framework for Vehicle Routing and Local Search-Based Metaheuristics
2008,
This paper presents a new unified modeling and heuristic solution framework for...
Exploiting the Structural Properties of the Underlying Markov Decision Problem in the Q-Learning Algorithm
2008,
This paper shows how to exploit the structural properties of the underlying Markov...
A Metaheuristic Approach for the Vertex Coloring Problem
2008,
Given an undirected graph G = ( V , E ), the vertex coloring problem (VCP)...
Risk Minimization and Minimum Description for Linear Discriminant Functions
2008,
Statistical learning theory provides a formal criterion for learning a concept from...
A stochastic radial basis function method for the global optimization of expensive functions
2007,
We introduce a new framework for the global optimization of computationally expensive...
Improving web-catalog design for easy product search
2007,
Building intuitive web sites is important for online businesses as positive...
Monitoring an Information Source Under a Politeness Constraint
2008,
We describe scheduling algorithms for monitoring a single information source whose...
A shortest-paths heuristic for statistical data protection in positive tables
2007,
National statistical agencies (NSAs) routinely release large amounts of tabular...
The Integrated Production and Transportation Scheduling Problem for a Product with a Short Lifespan
2008,
The integrated production and transportation scheduling problem (PTSP) with capacity...
An evolutionary algorithm for polishing mixed integer programming solutions
2007,
Evolutionary algorithms adopt a natural–selection analogy, exploiting concepts...
Discovering Generalized Profile-Association Rules for the Targeted Advertising of New Products
2008,
We propose a data–mining approach for the targeted marketing of new products...
On the distributed Bellman–Ford algorithm and the looping problem
2007,
The classic Bellman–Ford algorithm for calculating shortest paths can be easily...
Papers per page: