The following pages link to INFORMS Journal on Computing (Q74741):
Displaying 50 items.
- Stochastic Decomposition for Two-Stage Stochastic Linear Programs with Random Cost Coefficients (Q4995055) (← links)
- Enumeration of the Nondominated Set of Multiobjective Discrete Optimization Problems (Q4995057) (← links)
- A Branch-and-Price Algorithm for Facility Location with General Facility Cost Functions (Q4995059) (← links)
- Polyhedral Results and Branch-and-Cut for the Resource Loading Problem (Q4995060) (← links)
- Optimization for <i>L</i><sub>1</sub>-Norm Error Fitting via Data Aggregation (Q4995061) (← links)
- Exploiting the Structure of Two-Stage Robust Optimization Models with Exponential Scenarios (Q4995062) (← links)
- Perspective Reformulations of Semicontinuous Quadratically Constrained Quadratic Programs (Q4995063) (← links)
- Complexity Results and Effective Algorithms for Worst-Case Linear Optimization Under Uncertainties (Q4995064) (← links)
- Computing Feasible Points of Bilevel Problems with a Penalty Alternating Direction Method (Q4995065) (← links)
- A Computational Approach to First Passage Problems of Reflected Hyperexponential Jump Diffusion Processes (Q4995066) (← links)
- Efficient Sampling Allocation Procedures for Optimal Quantile Selection (Q4995067) (← links)
- Calibration of Voting-Based Helpfulness Measurement for Online Reviews: An Iterative Bayesian Probability Approach (Q4995068) (← links)
- Sparse Convex Regression (Q4995070) (← links)
- A Review Selection Method for Finding an Informative Subset from Online Reviews (Q4995071) (← links)
- Integrating Individual and Aggregate Diversity in Top-<i>N</i> Recommendation (Q4995072) (← links)
- The Migratory Beekeeping Routing Problem: Model and an Exact Algorithm (Q4995073) (← links)
- Robust Optimization for Electricity Generation (Q4995074) (← links)
- Multistage Stochastic Power Generation Scheduling Co-Optimizing Energy and Ancillary Services (Q4995076) (← links)
- Worst-Case Expected Shortfall with Univariate and Bivariate Marginals (Q4995077) (← links)
- Piecewise Constant Decision Rules via Branch-and-Bound Based Scenario Detection for Integer Adjustable Robust Optimization (Q4995078) (← links)
- Decision Diagram Decomposition for Quadratically Constrained Binary Optimization (Q4995079) (← links)
- Conflict Analysis for MINLP (Q4995080) (← links)
- Modeling Single-Picker Routing Problems in Classical and Modern Warehouses (Q4995081) (← links)
- A Branch-and-Price-and-Cut Algorithm for the Cable-Routing Problem in Solar Power Plants (Q4995082) (← links)
- Vehicle Sequencing at Transshipment Terminals with Handover Relations (Q4995083) (← links)
- Addressing Orientation Symmetry in the Time Window Assignment Vehicle Routing Problem (Q4995084) (← links)
- Sparse Solutions by a Quadratically Constrained ℓq (0 <<i>q</i>< 1) Minimization Model (Q4995085) (← links)
- On the Solution of <i>ℓ</i><sub>0</sub>-Constrained Sparse Inverse Covariance Estimation Problems (Q4995086) (← links)
- A Mixed-Integer Fractional Optimization Approach to Best Subset Selection (Q4995087) (← links)
- Supervised <i>t</i>-Distributed Stochastic Neighbor Embedding for Data Visualization and Classification (Q4995088) (← links)
- Data-Driven Preference Learning Methods for Value-Driven Multiple Criteria Sorting with Interacting Criteria (Q4995089) (← links)
- Semidefinite Programming and Nash Equilibria in Bimatrix Games (Q4995090) (← links)
- A New Scatter Search Design for Multiobjective Combinatorial Optimization with an Application to Facility Location (Q4995091) (← links)
- A Learning-Based Matheuristic for Stochastic Multicommodity Network Design (Q4995093) (← links)
- Selecting the Best Alternative Based on Its Quantile (Q4995094) (← links)
- Reducing Simulation Input-Model Risk via Input Model Averaging (Q4995095) (← links)
- Lagrangian Duality for Robust Problems with Decomposable Functions: The Case of a Robust Inventory Problem (Q4995096) (← links)
- Conflict-Driven Heuristics for Mixed Integer Programming (Q4995097) (← links)
- Exact Multiple Sequence Alignment by Synchronized Decision Diagrams (Q4995098) (← links)
- Learning to Solve Large-Scale Security-Constrained Unit Commitment Problems (Q4995099) (← links)
- Scenario Grouping and Decomposition Algorithms for Chance-Constrained Programs (Q4995100) (← links)
- Breaking the<i>r</i><sub>max</sub>Barrier: Enhanced Approximation Algorithms for Partial Set Multicover Problem (Q4995101) (← links)
- Monge Properties, Optimal Greedy Policies, and Policy Improvement for the Dynamic Stochastic Transportation Problem (Q4995102) (← links)
- A Multistage Stochastic Programming Approach to the Optimal Surveillance and Control of the Emerald Ash Borer in Cities (Q4995106) (← links)
- Corrigendum to “A Bucket Indexed Formulation for Nonpreemptive Single Machine Scheduling Problems,” <i>INFORMS Journal on Computing</i> 28(1):14–30, 2016 (Q4995107) (← links)
- Note from the Editor (Q5057982) (← links)
- Finite Difference Gradient Approximation: To Randomize or Not? (Q5057983) (← links)
- Heterogeneous Multi-resource Allocation with Subset Demand Requests (Q5057984) (← links)
- Stochastic Cutting Planes for Data-Driven Optimization (Q5057985) (← links)
- Disjoint Bilinear Optimization: A Two-Stage Robust Optimization Perspective (Q5057987) (← links)
