The following pages link to INFORMS Journal on Computing (Q74741):
Displayed 50 items.
- A Splicing Approach to Best Subset of Groups Selection (Q74742) (← links)
- A Heuristic for Nonlinear Global Optimization (Q120012) (← links)
- A Criterion Space Search Algorithm for Biobjective Mixed Integer Programming: The Triangle Splitting Method (Q2802241) (← links)
- Growth Projections and Assortment Planning of Commodity Products Across Multiple Stores: A Data Mining and Optimization Approach (Q2802243) (← links)
- A 3/2-Approximation Algorithm for the Multiple TSP with a Fixed Number of Depots (Q2802244) (← links)
- Linear Programming and the Control of Diffusion Processes (Q2802245) (← links)
- Exact and Heuristic Algorithms for Capacitated Vehicle Routing Problems with Quadratic Costs Structure (Q2802246) (← links)
- Roundoff-Error-Free Algorithms for Solving Linear Systems via Cholesky and LU Factorizations (Q2802247) (← links)
- Achieving Domain Consistency and Counting Solutions for Dispersion Constraints (Q2802248) (← links)
- Cloud Computing in Space (Q2802249) (← links)
- Machine Learning Approaches for Early DRG Classification and Resource Allocation (Q2802250) (← links)
- A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method (Q2802251) (← links)
- A Progressive Hedging Approach for Surgery Planning Under Uncertainty (Q2802252) (← links)
- Improved Primal Simplex: A More General Theoretical Framework and an Extended Experimental Analysis (Q2802253) (← links)
- Optimization of Radiation Therapy Fractionation Schedules in the Presence of Tumor Repopulation (Q2802256) (← links)
- Modeling with Metaconstraints and Semantic Typing of Variables (Q2806860) (← links)
- A Bucket Indexed Formulation for Nonpreemptive Single Machine Scheduling Problems (Q2806861) (← links)
- Exploiting Binary Floating-Point Representations for Constraint Propagation (Q2806863) (← links)
- Discrete Optimization with Decision Diagrams (Q2806864) (← links)
- Solving the Pricing Problem in a Branch-and-Price Algorithm for Graph Coloring Using Zero-Suppressed Binary Decision Diagrams (Q2806865) (← links)
- Decomposition Methods for the Parallel Machine Scheduling Problem with Setups (Q2806866) (← links)
- An AO<sup>*</sup> Based Exact Algorithm for the Canadian Traveler Problem (Q2806869) (← links)
- Multilevel Optimization Modeling for Risk-Averse Stochastic Programming (Q2806871) (← links)
- Application of Submodular Optimization to Single Machine Scheduling with Controllable Processing Times Subject to Release Dates and Deadlines (Q2806872) (← links)
- Robust Critical Node Selection by Benders Decomposition (Q2806873) (← links)
- Dual Inequalities for Stabilized Column Generation Revisited (Q2806874) (← links)
- Automating Bivariate Transformations (Q2815424) (← links)
- Transient Queueing Analysis (Q2815426) (← links)
- Efficient and Reliable Computation of Birth-Death Process Performance Measures (Q2815427) (← links)
- An Algorithm for Fitting Heavy-Tailed Distributions via Generalized Hyperexponentials (Q2815428) (← links)
- An Asymptotic Test of Optimality Conditions in Multiresponse Simulation Optimization (Q2815429) (← links)
- Constraint-Based Local Search for Inventory Control Under Stochastic Demand and Lead Time (Q2815430) (← links)
- Exact Solution of Graph Coloring Problems via Constraint Programming and Column Generation (Q2815431) (← links)
- A Hybrid Heuristic for an Inventory Routing Problem (Q2815432) (← links)
- Shilling Attack Detection—A New Approach for a Trustworthy Recommender System (Q2815433) (← links)
- A Time Bucket Formulation for the Traveling Salesman Problem with Time Windows (Q2815434) (← links)
- Computing Near-Optimal Policies in Generalized Joint Replenishment (Q2815435) (← links)
- Computational Testing of a Separation Procedure for the Knapsack Set with a Single Continuous Variable (Q2815436) (← links)
- Disjunctive Decomposition for Two-Stage Stochastic Mixed-Binary Programs with Generalized Upper Bound Constraints (Q2815438) (← links)
- Core Routing on Dynamic Time-Dependent Road Networks (Q2815439) (← links)
- A Level-3 Reformulation-Linearization Technique-Based Bound for the Quadratic Assignment Problem (Q2815440) (← links)
- Data-Mining-Driven Neighborhood Search (Q2815441) (← links)
- An Optimal Constraint Programming Approach to the Open-Shop Problem (Q2815442) (← links)
- Finding All Stable Pairs and Solutions to the Many-to-Many Stable Matching Problem (Q2815443) (← links)
- An Exact Method for Balancing Efficiency and Equity in the Liver Allocation Hierarchy (Q2815444) (← links)
- The Balanced Minimum Evolution Problem (Q2815445) (← links)
- C-NORTA: A Rejection Procedure for Sampling from the Tail of Bivariate NORTA Distributions (Q2815446) (← links)
- A Study of Quality and Accuracy Trade-offs in Process Mining (Q2815447) (← links)
- An Improved Branch-and-Bound Method for Maximum Monomial Agreement (Q2815448) (← links)
- A Hybrid Tabu Search and Constraint Programming Algorithm for the Dynamic Dial-a-Ride Problem (Q2815449) (← links)