Journal: INFORMS Journal on Computing

Found 247 papers in total
An Exact Algorithm for the Two-Dimensional Stage-Unrestricted Guillotine Cutting/Packing Decision Problem
An Exact Algorithm for the Two-Dimensional Stage-Unrestricted Guillotine Cutting/Packing Decision Problem
2016,
We propose a new exact algorithm for the two‐dimensional...
Optimal Learning in Linear Regression with Combinatorial Feature Selection
Optimal Learning in Linear Regression with Combinatorial Feature Selection
2016,
We present a new framework for sequential information collection in applications where...
Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming
Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming
2016,
We propose a framework to model general guillotine restrictions in...
A Branch-and-Bound Algorithm for the Close-Enough Traveling Salesman Problem
A Branch-and-Bound Algorithm for the Close-Enough Traveling Salesman Problem
2016,
This paper addresses the close‐enough traveling salesman problem. In this...
An Adaptive Flex-Deluge Approach to University Exam Timetabling
An Adaptive Flex-Deluge Approach to University Exam Timetabling
2016,
This paper presents a new methodology for university exam timetabling problems, which...
Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems
Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems
2016,
Despite the significant attention they have drawn, big‐bucket lot‐sizing...
Sampling the Functional Kolmogorov Forward Equations for Nonstationary Queueing Networks
Sampling the Functional Kolmogorov Forward Equations for Nonstationary Queueing Networks
2017,
Nonstationary queueing networks are often difficult to approximate. Recent novel...
Dynamic Pricing for Network Revenue Management: A New Approach and Application in the Hotel Industry
Dynamic Pricing for Network Revenue Management: A New Approach and Application in the Hotel Industry
2017,
Dynamic pricing for network revenue management has received considerable attention in...
Solution of Monotone Complementarity and General Convex Programming Problems Using a Modified Potential Reduction Interior Point Method
Solution of Monotone Complementarity and General Convex Programming Problems Using a Modified Potential Reduction Interior Point Method
2017,
We present a homogeneous algorithm equipped with a modified potential function for the...
Robust Modified Policy Iteration
Robust Modified Policy Iteration
2013,
Robust dynamic programming (robust DP) mitigates the effects of ambiguity in...
A Time Predefined Variable Depth Search for Nurse Rostering
A Time Predefined Variable Depth Search for Nurse Rostering
2013,
This paper presents a variable depth search for the nurse rostering problem. The...
Separation and Extension of Cover Inequalities for Conic Quadratic Knapsack Constraints with Generalized Upper Bounds
Separation and Extension of Cover Inequalities for Conic Quadratic Knapsack Constraints with Generalized Upper Bounds
2013,
Motivated by addressing probabilistic 0–1 programs we study the conic quadratic...
I‐SMOOTH: Iteratively Smoothing Mean‐Constrained and Nonnegative Piecewise‐Constant Functions
I‐SMOOTH: Iteratively Smoothing Mean‐Constrained and Nonnegative Piecewise‐Constant Functions
2013,
Continuous nonnegative functions, such as Poisson rate functions, are sometimes...
Column Generation for the Minimum Hyperplanes Clustering Problem
Column Generation for the Minimum Hyperplanes Clustering Problem
2013,
Given n points in ℝ d and a maximum allowed tolerance ε > 0, the minimum...
Grammar‐Based Column Generation for Personalized Multi‐Activity Shift Scheduling
Grammar‐Based Column Generation for Personalized Multi‐Activity Shift Scheduling
2013,
We present a branch‐and‐price algorithm to solve personalized...
Combining Lift‐and‐Project and Reduce‐and‐Split
Combining Lift‐and‐Project and Reduce‐and‐Split
2013,
Split cuts constitute a class of cutting planes that has been successfully employed by...
Scenario Trees and Policy Selection for Multistage Stochastic Programming Using Machine Learning
Scenario Trees and Policy Selection for Multistage Stochastic Programming Using Machine Learning
2013,
In the context of multistage stochastic optimization problems, we propose a hybrid...
Self‐Organized Formation and Evolution of Peer‐to‐Peer Networks
Self‐Organized Formation and Evolution of Peer‐to‐Peer Networks
2013,
Peer‐to‐peer (P2P) networks are social networks for pooling network and...
Base Model Combination Algorithm for Resolving Tied Predictions for K‐Nearest Neighbor OVA Ensemble Models
Base Model Combination Algorithm for Resolving Tied Predictions for K‐Nearest Neighbor OVA Ensemble Models
2013,
Model aggregation is the process of constructing several base models that are then...
Optimal Sampling Laws for Stochastically Constrained Simulation Optimization on Finite Sets
Optimal Sampling Laws for Stochastically Constrained Simulation Optimization on Finite Sets
2013,
Consider the context of selecting an optimal system from among a finite set of...
Flexible Process Compliance with Semantic Constraints Using Mixed‐Integer Programming
Flexible Process Compliance with Semantic Constraints Using Mixed‐Integer Programming
2013,
An adaptive process management system (APMS) allows for flexible, dynamic, and even ad...
Uncommon Dantzig‐Wolfe Reformulation for the Temporal Knapsack Problem
Uncommon Dantzig‐Wolfe Reformulation for the Temporal Knapsack Problem
2013,
We study a natural generalization of the knapsack problem, in which each item exists...
Approximation Algorithms for Integrated Distribution Network Design Problems
Approximation Algorithms for Integrated Distribution Network Design Problems
2013,
In this paper, we study approximation algorithms for two supply chain network design...
Exact Algorithms for a Bandwidth Packing Problem with Queueing Delay Guarantees
Exact Algorithms for a Bandwidth Packing Problem with Queueing Delay Guarantees
2013,
The bandwidth packing problem (BWP) concerns the selection of calls from a given set...
Papers per page: