The following pages link to INFORMS Journal on Computing (Q74741):
Displaying 50 items.
- A Branch-and-Price Algorithm for Solving the Hamiltonian <i>p</i>-Median Problem (Q2960363) (← links)
- Computing Near-Optimal Stable Cost Allocations for Cooperative Games by Lagrangian Relaxation (Q2960364) (← links)
- An Exact Algorithm for the Two-Dimensional Stage-Unrestricted Guillotine Cutting/Packing Decision Problem (Q2960365) (← links)
- Optimal Learning in Linear Regression with Combinatorial Feature Selection (Q2960366) (← links)
- Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming (Q2960367) (← links)
- A Branch-and-Bound Algorithm for the Close-Enough Traveling Salesman Problem (Q2960368) (← links)
- Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems (Q2960369) (← links)
- An Adaptive Flex-Deluge Approach to University Exam Timetabling (Q2960370) (← links)
- Optimizing the Layout of Proportional Symbol Maps: Polyhedra and Computation (Q2962548) (← links)
- A Tree-Based Contrast Set-Mining Approach to Detecting Group Differences (Q2962550) (← links)
- On the Practical Strength of Two-Row Tableau Cuts (Q2962551) (← links)
- Cost-Sensitive Decision Tree Induction with Label-Dependent Late Constraints (Q2962553) (← links)
- Optimization Bounds from Binary Decision Diagrams (Q2962554) (← links)
- Constructing Discrete Unbounded Distributions with Gaussian-Copula Dependence and Given Rank Correlation (Q2962555) (← links)
- An Approximation Algorithm for the Continuous <i>k</i>-Medians Problem in a Convex Polygon (Q2962556) (← links)
- Resource-Constrained Assignment Problems with Shared Resource Consumption and Flexible Demand (Q2962557) (← links)
- Constrained Min-Cut Replication for <i>K</i>-Way Hypergraph Partitioning (Q2962559) (← links)
- The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows (Q2962560) (← links)
- On Chubanov's Method for Linear Programming (Q2962562) (← links)
- Optimization-Based Approaches for Maximizing Aggregate Recommendation Diversity (Q2962564) (← links)
- Penalty-Based Algorithms for the Stochastic Obstacle Scene Problem (Q2962565) (← links)
- Conditional Value-at-Risk Approximation to Value-at-Risk Constrained Programs: A Remedy via Monte Carlo (Q2962566) (← links)
- New Formulations for Choice Network Revenue Management (Q2962567) (← links)
- Survivability in Hierarchical Telecommunications Networks Under Dual Homing (Q2967611) (← links)
- An Efficient Semidefinite Programming Relaxation for the Graph Partition Problem (Q2967612) (← links)
- An Outer-Inner Approximation for Separable Mixed-Integer Nonlinear Programs (Q2967613) (← links)
- Algorithms for Time-Varying Networks of Many-Server Fluid Queues (Q2967614) (← links)
- Quantifying Input Uncertainty via Simulation Confidence Intervals (Q2967615) (← links)
- An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem (Q2967616) (← links)
- Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems (Q2967617) (← links)
- On the Approximate Linear Programming Approach for Network Revenue Management Problems (Q2967618) (← links)
- Dynamic Container Deployment: Two-Stage Robust Model, Complexity, and Computational Results (Q2967619) (← links)
- Online Sequential Optimization with Biased Gradients: Theory and Applications to Censored Demand (Q2967620) (← links)
- Mathematical Programming Formulations and Algorithms for Discrete <i>k</i>-Median Clustering of Time-Series Data (Q2967621) (← links)
- A Dynamic Programming Heuristic for the Quadratic Knapsack Problem (Q2967622) (← links)
- The Weighted Set Covering Game: A Vaccine Pricing Model for Pediatric Immunization (Q2967623) (← links)
- Dynamic Sampling Allocation and Design Selection (Q3186646) (← links)
- Cutting Plane Algorithm for Convex Generalized Disjunctive Programs (Q3186647) (← links)
- Importance Sampling for Option Greeks with Discontinuous Payoffs (Q3186649) (← links)
- Providing Consistent Opinions from Online Reviews: A Heuristic Stepwise Optimization Approach (Q3186652) (← links)
- Developing Effective Service Policies for Multiclass Queues with Abandonment: Asymptotic Optimality and Approximate Policy Improvement (Q3186654) (← links)
- Service Provisioning Problem in Cloud and Multi-Cloud Systems (Q3186656) (← links)
- A Commonsense Knowledge-Enabled Textual Analysis Approach for Financial Market Surveillance (Q3186659) (← links)
- The Minimum Spanning <i>k</i>-Core Problem with Bounded CVaR Under Probabilistic Edge Failures (Q3186660) (← links)
- Approximation of the Quadratic Knapsack Problem (Q3186661) (← links)
- Bilevel Knapsack with Interdiction Constraints (Q3186662) (← links)
- Branch-and-Price for Personalized Multiactivity Tour Scheduling (Q3186663) (← links)
- Sequential Bounding Methods for Two-Stage Stochastic Programs (Q3186665) (← links)
- The Minimum Expected Penalty Relocation Problem for the Computation of Compliance Tables for Ambulance Vehicles (Q3186666) (← links)
- Robust Quadratic Programming with Mixed-Integer Uncertainty (Q3386756) (← links)
