Journal: INFORMS Journal on Computing

Found 247 papers in total
Combination of Nonlinear and Linear Optimization of Transient Gas Networks
Combination of Nonlinear and Linear Optimization of Transient Gas Networks
2011,
In this paper, we study the problem of technical transient gas network optimization,...
A New Evolutionary Algorithm for a Class of Nonlinear Bilevel Programming Problems and Its Global Convergence
A New Evolutionary Algorithm for a Class of Nonlinear Bilevel Programming Problems and Its Global Convergence
2011,
When the leader's objective function of a nonlinear bilevel programming problem is...
A Clock‐and‐Offer Auction Market for Grid Resources When Bidders Face Stochastic Computational Needs
A Clock‐and‐Offer Auction Market for Grid Resources When Bidders Face Stochastic Computational Needs
2011,
Although significant technical advances have been made in the commercial deployment of...
A Randomized Exhaustive Propositionalization Approach for Molecule Classification
A Randomized Exhaustive Propositionalization Approach for Molecule Classification
2011,
Drug discovery is the process of designing compounds that have desirable properties,...
The Knowledge‐Gradient Algorithm for Sequencing Experiments in Drug Discovery
The Knowledge‐Gradient Algorithm for Sequencing Experiments in Drug Discovery
2011,
We present a new technique for adaptively choosing the sequence of molecular compounds...
A Cluster‐Based Context‐Tree Model for Multivariate Data Streams with Applications to Anomaly Detection
A Cluster‐Based Context‐Tree Model for Multivariate Data Streams with Applications to Anomaly Detection
2011,
Many applications, such as telecommunication and commercial video broadcasting...
A Linearly Convergent Linear‐Time First‐Order Algorithm for Support Vector Classification with a Core Set Result
A Linearly Convergent Linear‐Time First‐Order Algorithm for Support Vector Classification with a Core Set Result
2011,
We present a simple first‐order approximation algorithm for the support vector...
Predicting the Solution Time of Branch‐and‐Bound Algorithms for Mixed‐Integer Programs
Predicting the Solution Time of Branch‐and‐Bound Algorithms for Mixed‐Integer Programs
2011,
The most widely used progress measure for branch‐and‐bound (B&B)...
A Branch‐and‐Price Algorithm for the Bin Packing Problem with Conflicts
A Branch‐and‐Price Algorithm for the Bin Packing Problem with Conflicts
2011,
We provide a branch‐and‐price algorithm for the bin packing problem with...
Lifted Tableaux Inequalities for 0–1 Mixed‐Integer Programs: A Computational Study
Lifted Tableaux Inequalities for 0–1 Mixed‐Integer Programs: A Computational Study
2011,
We describe families of inequalities for 0–1 mixed‐integer programming...
Minimal Equivalent Binary Knapsack Inequalities
Minimal Equivalent Binary Knapsack Inequalities
2011,
It is known that a knapsack inequality can be reduced to one having the same solutions...
Efficient Optimization of Reliable Two‐Node Connected Networks: A Biobjective Approach
Efficient Optimization of Reliable Two‐Node Connected Networks: A Biobjective Approach
2011,
This paper presents a biobjective genetic algorithm (GA) to design reliable...
Color‐Coding Algorithms to the Balanced Path Problem: Computational Issues
Color‐Coding Algorithms to the Balanced Path Problem: Computational Issues
2011,
Given a weighted directed network G , we consider the problem of computing k balanced...
Preprocessing Stochastic Shortest‐Path Problems with Application to PERT Activity Networks
Preprocessing Stochastic Shortest‐Path Problems with Application to PERT Activity Networks
2011,
We present an algorithm for preprocessing a class of stochastic shortest‐path...
The Reliable Facility Location Problem: Formulations, Heuristics, and Approximation Algorithms
The Reliable Facility Location Problem: Formulations, Heuristics, and Approximation Algorithms
2011,
We study a reliable facility location problem wherein some facilities are subject to...
An Efficient Global Approach for Posynomial Geometric Programming Problems
An Efficient Global Approach for Posynomial Geometric Programming Problems
2011,
Aposynomial geometric programming problem is composed of a posynomial being minimized...
Sequential Grid Computing: Models and Computational Experiments
Sequential Grid Computing: Models and Computational Experiments
2011,
Through recent technical advances, multiple resources can be connected to provide a...
Decision Support and Optimization in Shutdown and Turnaround Scheduling
Decision Support and Optimization in Shutdown and Turnaround Scheduling
2011,
Large‐scale maintenance in industrial plants requires the entire shutdown of...
Resource Allocation via Message Passing
Resource Allocation via Message Passing
2011,
We propose a message‐passing paradigm for resource allocation problems. This...
Operating Room Pooling and Parallel Surgery Processing Under Uncertainty
Operating Room Pooling and Parallel Surgery Processing Under Uncertainty
2011,
Operating room (OR) scheduling is an important operational problem for most hospitals....
An Automated and Data‐Driven Bidding Strategy for Online Auctions
An Automated and Data‐Driven Bidding Strategy for Online Auctions
2011,
The flexibility of time and location as well as the availability of an abundance of...
Computing a Classic Index for Finite‐Horizon Bandits
Computing a Classic Index for Finite‐Horizon Bandits
2011,
This paper considers the efficient exact computation of the counterpart of the Gittins...
An Efficient and Numerically Stable Method for Computing Bounds for the Interval Availability Distribution
An Efficient and Numerically Stable Method for Computing Bounds for the Interval Availability Distribution
2011,
This paper is concerned with the computation of the interval availability (proportion...
An Algorithm for Data Envelopment Analysis
An Algorithm for Data Envelopment Analysis
2011,
The standard approach to process a data envelopment analysis (DEA) data set, and the...
Papers per page: