Journal: INFORMS Journal on Computing

Found 247 papers in total
A Simple but Usually Fast Branch‐and‐Bound Algorithm for the Capacitated Facility Location Problem
A Simple but Usually Fast Branch‐and‐Bound Algorithm for the Capacitated Facility Location Problem
2012,
This paper presents a simple branch‐and‐bound method based on Lagrangean...
Structural Search and Optimization in Social Networks
Structural Search and Optimization in Social Networks
2012,
The explosive growth in the variety and size of social networks has focused attention...
Finite‐Sample Performance of Absolute Precision Stopping Rules
Finite‐Sample Performance of Absolute Precision Stopping Rules
2012,
Absolute precision stopping rules are often used to determine the length of sequential...
Large‐Order Multiple Recursive Generators with Modulus 231 − 1
Large‐Order Multiple Recursive Generators with Modulus 231 − 1
2012,
The performance of a maximum‐period multiple recursive generator (MRG) depends...
A Mathematical Framework for Data Quality Management in Enterprise Systems
A Mathematical Framework for Data Quality Management in Enterprise Systems
2012,
This paper addresses the issue of data quality management in information systems...
SMART: A Stochastic Multiscale Model for the Analysis of Energy Resources, Technology, and Policy
SMART: A Stochastic Multiscale Model for the Analysis of Energy Resources, Technology, and Policy
2012,
We address the problem of modeling energy resource allocation, including dispatch,...
Core Routing on Dynamic Time‐Dependent Road Networks
Core Routing on Dynamic Time‐Dependent Road Networks
2012,
Route planning in large‐scale time‐dependent road networks is an...
A Level‐3 Reformulation‐Linearization Technique‐Based Bound for the Quadratic Assignment Problem
A Level‐3 Reformulation‐Linearization Technique‐Based Bound for the Quadratic Assignment Problem
2012,
We apply the level‐3 reformulation‐linearization technique (RLT3) to the...
Data‐Mining‐Driven Neighborhood Search
Data‐Mining‐Driven Neighborhood Search
2012,
Metaheuristic approaches based on the neighborhood search escape local optimality by...
An Optimal Constraint Programming Approach to the Open‐Shop Problem
An Optimal Constraint Programming Approach to the Open‐Shop Problem
2012,
This paper presents an optimal constraint programming approach for the...
Finding All Stable Pairs and Solutions to the Many‐to‐Many Stable Matching Problem
Finding All Stable Pairs and Solutions to the Many‐to‐Many Stable Matching Problem
2012,
The many‐to‐many stable matching problem (MM), defined in the context of...
An Exact Method for Balancing Efficiency and Equity in the Liver Allocation Hierarchy
An Exact Method for Balancing Efficiency and Equity in the Liver Allocation Hierarchy
2012,
We study the problem of (re)designing the regional network by which cadaveric livers...
The Balanced Minimum Evolution Problem
The Balanced Minimum Evolution Problem
2012,
Aphylogeny is an unrooted binary tree that represents the evolutionary relationships...
C‐NORTA: A Rejection Procedure for Sampling from the Tail of Bivariate NORTA Distributions
C‐NORTA: A Rejection Procedure for Sampling from the Tail of Bivariate NORTA Distributions
2012,
We propose C‐NORTA, an exact algorithm to generate random variates from the...
A Study of Quality and Accuracy Trade‐offs in Process Mining
A Study of Quality and Accuracy Trade‐offs in Process Mining
2012,
In recent years, many algorithms have been proposed to extract process models from...
An Improved Branch‐and‐Bound Method for Maximum Monomial Agreement
An Improved Branch‐and‐Bound Method for Maximum Monomial Agreement
2012,
The 𝒩𝒫‐hard maximum monomial agreement problem consists of finding a...
Enhancement of Sandwich Algorithms for Approximating Higher‐Dimensional Convex Pareto Sets
Enhancement of Sandwich Algorithms for Approximating Higher‐Dimensional Convex Pareto Sets
2011,
In many fields, we come across problems where we want to optimize several conflicting...
Optimal Testing of Digital Microfluidic Biochips
Optimal Testing of Digital Microfluidic Biochips
2011,
Digital microfluidic biochips (DMFBs) are rectangular arrays of electrodes, or cells,...
New Stabilization Procedures for the Cutting Stock Problem
New Stabilization Procedures for the Cutting Stock Problem
2011,
In this paper, we deal with a column generation‐based algorithm for the...
Solving Large p‐Median Problems with a Radius Formulation
Solving Large p‐Median Problems with a Radius Formulation
2011,
By means of a model based on a set covering formulation, it is shown how the p...
Optimization of Supply Chain Systems with Price Elasticity of Demand
Optimization of Supply Chain Systems with Price Elasticity of Demand
2011,
A centralized multiechelon, multiproduct supply chain network is presented in a...
An Improved Primal Simplex Algorithm for Degenerate Linear Programs
An Improved Primal Simplex Algorithm for Degenerate Linear Programs
2011,
Since its appearance in 1947, the primal simplex algorithm has been one of the most...
Experiments with Two‐Row Cuts from Degenerate Tableaux
Experiments with Two‐Row Cuts from Degenerate Tableaux
2011,
There has been a recent interest in cutting planes generated from two or more rows of...
A Method for Approximating Univariate Convex Functions Using Only Function Value Evaluations
A Method for Approximating Univariate Convex Functions Using Only Function Value Evaluations
2011,
In this paper, piecewise‐linear upper and lower bounds for univariate convex...
Papers per page: