Journal: INFORMS Journal on Computing

Found 247 papers in total
Multisourcing Supply Network Design: Two-Stage Chance-Constrained Model, Tractable Approximations, and Computational Results
Multisourcing Supply Network Design: Two-Stage Chance-Constrained Model, Tractable Approximations, and Computational Results
2017,
In this paper, we study a multisourcing supply network design problem, in which each...
Using a Conic Bundle Method to Accelerate Both Phases of a Quadratic Convex Reformulation
Using a Conic Bundle Method to Accelerate Both Phases of a Quadratic Convex Reformulation
2017,
We present algorithm MIQCR‐CB that is an advancement of MIQCR. MIQCR is a...
Parallel Nonstationary Direct Policy Search for Risk-Averse Stochastic Optimization
Parallel Nonstationary Direct Policy Search for Risk-Averse Stochastic Optimization
2017,
This paper presents an algorithmic strategy to nonstationary policy search for...
Globalized Robust Optimization for Nonlinear Uncertain Inequalities
Globalized Robust Optimization for Nonlinear Uncertain Inequalities
2017,
Robust optimization is a methodology that can be applied to problems that are affected...
Technical Note: The MAPt /Pht /8 Queueing System and Multiclass [MAPt /Pht /8] K Queueing Network
Technical Note: The MAPt /Pht /8 Queueing System and Multiclass [MAPt /Pht /8] K Queueing Network
2017,
In this paper we demonstrate how a key adjustment to known numerically exact methods...
Enumeration and Cartesian Product Decomposition of Alternate Optimal Fluxes in Cellular Metabolism
Enumeration and Cartesian Product Decomposition of Alternate Optimal Fluxes in Cellular Metabolism
2017,
We introduce a framework for finding and analyzing all optimal solutions to a...
Assessing the Quality of Convex Approximations for Two-Stage Totally Unimodular Integer Recourse Models
Assessing the Quality of Convex Approximations for Two-Stage Totally Unimodular Integer Recourse Models
2017,
We consider two types of convex approximations of two‐stage totally unimodular...
Integrated Production, Inventory and Delivery Problems: Complexity and Algorithms
Integrated Production, Inventory and Delivery Problems: Complexity and Algorithms
2017,
We consider several integrated production, inventory, and delivery problems that arise...
Linear Reformulation of Polynomial Discrete Programming for Fast Computation
Linear Reformulation of Polynomial Discrete Programming for Fast Computation
2017,
Polynomial discrete programming problems are commonly faced but hard to solve....
Constraint Aggregation in Column Generation Models for Resource-Constrained Covering Problems
Constraint Aggregation in Column Generation Models for Resource-Constrained Covering Problems
2017,
We propose an aggregation method to reduce the size of column generation (CG) models...
Efficient Computational Analysis of Stationary Probabilities for the Queueing System BMAP/G/1/N With or Without Vacation(s)
Efficient Computational Analysis of Stationary Probabilities for the Queueing System BMAP/G/1/N With or Without Vacation(s)
2017,
We consider a finite‐buffer single‐server queue with batch Markovian...
A Backward Sampling Framework for Interdiction Problems with Fortification
A Backward Sampling Framework for Interdiction Problems with Fortification
2017,
This paper examines a class of three‐stage sequential...
Planar Maximum Coverage Location Problem with Partial Coverage and Rectangular Demand and Service Zones
Planar Maximum Coverage Location Problem with Partial Coverage and Rectangular Demand and Service Zones
2017,
We study the planar maximum coverage location problem (MCLP) with rectilinear distance...
A Machine Learning-Based Approximation of Strong Branching
A Machine Learning-Based Approximation of Strong Branching
2017,
We present in this paper a new generic approach to variable branching in branch and...
Combining Column Generation and Lagrangean Relaxation to Solve a Single-Machine Common Due Date Problem
Combining Column Generation and Lagrangean Relaxation to Solve a Single-Machine Common Due Date Problem
2002,
Column generation has proved to be an effective technique for solving the linear...
Pricing Problems Under the Nested Logit Model with a Quality Consistency Constraint
Pricing Problems Under the Nested Logit Model with a Quality Consistency Constraint
2017,
We consider pricing problems when customers choose among the products according to the...
Strengthened Benders Cuts for Stochastic Integer Programs with Continuous Recourse
Strengthened Benders Cuts for Stochastic Integer Programs with Continuous Recourse
2017,
With stochastic integer programming as the motivating application, we investigate...
Combating Prerelease Piracy: Modeling the Effects of Antipiracy Measures in P2P Networks
Combating Prerelease Piracy: Modeling the Effects of Antipiracy Measures in P2P Networks
2017,
The short period right after the release of a song is typically associated with...
Convex Relaxations for Gas Expansion Planning
Convex Relaxations for Gas Expansion Planning
2016,
Expansion of natural gas networks is a critical process involving substantial capital...
Automated Multilateral Negotiation on Multiple Issues with Private Information
Automated Multilateral Negotiation on Multiple Issues with Private Information
2016,
In this paper, we propose and analyze a distributed negotiation strategy for a...
Efficient VaR and CVaR Measurement via Stochastic Kriging
Efficient VaR and CVaR Measurement via Stochastic Kriging
2016,
In this paper, stochastic kriging (SK) is considered as a metamodeling tool to capture...
The Surgical Patient Routing Problem: A Central Planner Approach
The Surgical Patient Routing Problem: A Central Planner Approach
2016,
Many patients face difficulties when accessing medical facilities, particularly in...
A Branch-and-Price Algorithm for Solving the Hamiltonian p-Median Problem
A Branch-and-Price Algorithm for Solving the Hamiltonian p-Median Problem
2016,
In the Hamiltonian p ‐median problem (HpMP), the target is to find p cycles...
Computing Near-Optimal Stable Cost Allocations for Cooperative Games by Lagrangian Relaxation
Computing Near-Optimal Stable Cost Allocations for Cooperative Games by Lagrangian Relaxation
2016,
For a cost‐sharing cooperative game with an empty core, we study the problem of...
Papers per page: