Journal: INFORMS Journal on Computing

Found 247 papers in total
The Cunningham‐Geelen Method in Practice: Branch‐Decompositions and Integer Programming
The Cunningham‐Geelen Method in Practice: Branch‐Decompositions and Integer Programming
2013,
In 2007, W. H. Cunningham and J. Geelen describe an algorithm for solving max { c T x...
Exact Approaches to Multilevel Vertical Orderings
Exact Approaches to Multilevel Vertical Orderings
2013,
We present a semidefinite programming (SDP) approach for the problem of ordering...
Efficient Risk Hedging by Dynamic Forward Pricing: A Study in Cloud Computing
Efficient Risk Hedging by Dynamic Forward Pricing: A Study in Cloud Computing
2013,
Commodities such as cloud resources (storage, computing, bandwidth) are often sold to...
A Logarithmic Method for Reducing Binary Variables and Inequality Constraints in Solving Task Assignment Problems
A Logarithmic Method for Reducing Binary Variables and Inequality Constraints in Solving Task Assignment Problems
2013,
This paper studies the classical task assignment problem (TAP) in which M unbreakable...
Zigzag Search for Continuous Multiobjective Optimization
Zigzag Search for Continuous Multiobjective Optimization
2013,
A new method is proposed using a gradient‐based zigzag search approach for...
Safe Approximations of Ambiguous Chance Constraints Using Historical Data
Safe Approximations of Ambiguous Chance Constraints Using Historical Data
2013,
This paper proposes a new way to construct uncertainty sets for robust optimization....
Stochastic Operating Room Scheduling for High‐Volume Specialties Under Block Booking
Stochastic Operating Room Scheduling for High‐Volume Specialties Under Block Booking
2013,
Scheduling elective procedures in an operating suite is a formidable task because of...
Backdoor Branching
Backdoor Branching
2013,
We present an exact mixed‐integer programming (MIP) solution scheme where a...
Construction of Risk‐Averse Enhanced Index Funds
Construction of Risk‐Averse Enhanced Index Funds
2013,
We propose a partial replication strategy to construct risk‐averse enhanced...
An Efficient Approach for Solving Reliable Facility Location Models
An Efficient Approach for Solving Reliable Facility Location Models
2013,
We consider reliable facility location models in which facilities are subject to...
Dividing a Territory Among Several Facilities
Dividing a Territory Among Several Facilities
2013,
We consider the problem of dividing a geographic region into subregions so as to...
Efficient Transient Analysis of Markovian Models Using a Block Reduction Approach
Efficient Transient Analysis of Markovian Models Using a Block Reduction Approach
2013,
One of the most widely used techniques to obtain transient measures is the...
Fitting the Pht/Mt/s/c Time‐Dependent Departure Process for Use in Tandem Queueing Networks
Fitting the Pht/Mt/s/c Time‐Dependent Departure Process for Use in Tandem Queueing Networks
2013,
This paper considers time‐dependent Ph t / M t / s / c queueing nodes and small...
A New General‐Purpose Method for the Computation of the Interval Availability Distribution
A New General‐Purpose Method for the Computation of the Interval Availability Distribution
2013,
We develop a new randomization‐based general‐purpose method for the...
Positive‐versus‐Negative Classification for Model Aggregation in Predictive Data Mining
Positive‐versus‐Negative Classification for Model Aggregation in Predictive Data Mining
2013,
The process of constructing several base models that are then combined into a single...
Approximating the Split Closure
Approximating the Split Closure
2013,
The split closure has been proved in practice to be a very tight approximation of the...
An Exact Algorithm for the Multitrip Vehicle Routing Problem
An Exact Algorithm for the Multitrip Vehicle Routing Problem
2013,
The multitrip vehicle routing problem (MTVRP) is a variant of the capacitated vehicle...
A New Local Search Algorithm for Binary Optimization
A New Local Search Algorithm for Binary Optimization
2013,
We develop a new local search algorithm for binary optimization problems, whose...
On Maximum Speedup Ratio of Restart Algorithm Portfolios
On Maximum Speedup Ratio of Restart Algorithm Portfolios
2013,
We discuss two possible parallel strategies for randomized restart algorithms. Given a...
Stochastic Trust‐Region Response‐Surface Method (STRONG)–A New Response‐Surface Framework for Simulation Optimization
Stochastic Trust‐Region Response‐Surface Method (STRONG)–A New Response‐Surface Framework for Simulation Optimization
2013,
Response surface methodology (RSM) is a widely used method for simulation...
Bin Packing with Conflicts: A Generic Branch‐and‐Price Algorithm
Bin Packing with Conflicts: A Generic Branch‐and‐Price Algorithm
2013,
The bin packing problem with conflicts consists of packing items in a minimum number...
Layered Graph Approaches to the Hop Constrained Connected Facility Location Problem
Layered Graph Approaches to the Hop Constrained Connected Facility Location Problem
2013,
Given a set of customers, a set of potential facility locations, and some...
Valid Linear Programming Bounds for Exact Mixed‐Integer Programming
Valid Linear Programming Bounds for Exact Mixed‐Integer Programming
2013,
Fast computation of valid linear programming (LP) bounds serves as an important...
Critically Loaded Time‐Varying Multiserver Queues: Computational Challenges and Approximations
Critically Loaded Time‐Varying Multiserver Queues: Computational Challenges and Approximations
2013,
In this paper, we consider time‐varying multiserver queues with abandonment and...
Papers per page: