The following pages link to INFORMS Journal on Computing (Q74741):
Displaying 50 items.
- On Solving the Quadratic Shortest Path Problem (Q3386757) (← links)
- Mitigating Information Asymmetry in Liver Allocation (Q3386759) (← links)
- The Mothership and Drone Routing Problem (Q3386760) (← links)
- An MDD-Based Lagrangian Approach to the Multicommodity Pickup-and-Delivery TSP (Q3386761) (← links)
- Solving the Nearly Symmetric All-Pairs Shortest-Path Problem (Q3386762) (← links)
- Least-Cost Influence Maximization on Social Networks (Q3386763) (← links)
- Understanding the Impact of Individual Users’ Rating Characteristics on the Predictive Accuracy of Recommender Systems (Q3386765) (← links)
- Scalable, Adaptable, and Fast Estimation of Transient Downtime in Virtual Infrastructures Using Convex Decomposition and Sample Path Randomization (Q3386767) (← links)
- Successive Quadratic Upper-Bounding for Discrete Mean-Risk Minimization and Network Interdiction (Q3386769) (← links)
- Online Risk Monitoring Using Offline Simulation (Q3386770) (← links)
- Estimating the Probability that a Function Observed with Noise Is Convex (Q3386772) (← links)
- Relative Robust and Adaptive Optimization (Q3386774) (← links)
- A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems (Q3386775) (← links)
- Mathematical Models and Search Algorithms for the Capacitated <i>p</i>-Center Problem (Q3386776) (← links)
- Multiobjective Integer Programming: Synergistic Parallel Approaches (Q3386777) (← links)
- Presolve Reductions in Mixed Integer Programming (Q3386778) (← links)
- Piecewise Linear Function Fitting via Mixed-Integer Linear Programming (Q3386779) (← links)
- On the Derivation of Continuous Piecewise Linear Approximating Functions (Q3386781) (← links)
- Branch and Price for Chance-Constrained Bin Packing (Q3386782) (← links)
- Domination Measure: A New Metric for Solving Multiobjective Optimization (Q3386783) (← links)
- A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem (Q3386785) (← links)
- MILP Models for Complex System Reliability Redundancy Allocation with Mixed Components (Q3386786) (← links)
- Distributionally Robust Design for Redundancy Allocation (Q3386788) (← links)
- Optimization-based Mechanisms for the Course Allocation Problem (Q3386789) (← links)
- Robust Optimization of a Broad Class of Heterogeneous Vehicle Routing Problems Under Demand Uncertainty (Q3386790) (← links)
- Convex Relaxations for Quadratic On/Off Constraints and Applications to Optimal Transmission Switching (Q3386791) (← links)
- Transient-State Natural Gas Transmission in Gunbarrel Pipeline Networks (Q3386792) (← links)
- Learning to Correlate Accounts Across Online Social Networks: An Embedding-Based Approach (Q3386793) (← links)
- Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms (Q3386794) (← links)
- A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem (Q3386795) (← links)
- An Ellipsoidal Bounding Scheme for the Quasi-Clique Number of a Graph (Q3386796) (← links)
- Differentially Private Distributed Learning (Q3386798) (← links)
- Differentially Private and Budget-Limited Bandit Learning over Matroids (Q3386800) (← links)
- Optimization-Driven Scenario Grouping (Q3386802) (← links)
- When Lift-and-Project Cuts Are Different (Q3386803) (← links)
- Assortment Optimization Under the Multinomial Logit Model with Sequential Offerings (Q3386805) (← links)
- Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times (Q3458742) (← links)
- Automatic Minimal-Height Table Layout (Q3458745) (← links)
- Optimal Policies for Security Patch Management (Q3458747) (← links)
- Online Checkpointing with Improved Worst-Case Guarantees (Q3458748) (← links)
- Achieving Rapid Recovery in an Overload Control for Large-Scale Service Systems (Q3458749) (← links)
- Robust Network Design with Uncertain Outsourcing Cost (Q3458750) (← links)
- Optimal Hour-Ahead Bidding in the Real-Time Electricity Market with Battery Storage Using Approximate Dynamic Programming (Q3458751) (← links)
- Optimization of Industrial-Scale Assemble-to-Order Systems (Q3458752) (← links)
- Learning Context-Sensitive Domain Ontologies from Folksonomies: A Cognitively Motivated Method (Q3458753) (← links)
- Simulation-Based Approximate Policy Iteration with Generalized Logistic Functions (Q3458754) (← links)
- Multivariate Mixtures of Normal Distributions: Properties, Random Vector Generation, Fitting, and as Models of Market Daily Changes (Q3466767) (← links)
- The Generalized Regenerator Location Problem (Q3466768) (← links)
- Dynamic Programming Driven Memetic Search for the Steiner Tree Problem with Revenues, Budget, and Hop Constraints (Q3466769) (← links)
- Computing in Operations Research Using Julia (Q3466770) (← links)
