The following pages link to INFORMS Journal on Computing (Q74741):
Displaying 31 items.
- Machine Learning Approaches for Early DRG Classification and Resource Allocation (Q2802250) (← links)
- Using GPU Computing for Solving the Two-Dimensional Guillotine Cutting Problem (Q2830956) (← links)
- Feature Article: Optimization for simulation: Theory vs. Practice (Q2884533) (← links)
- Guided Local Search for the Three-Dimensional Bin-Packing Problem (Q2884559) (← links)
- Palindromes in SARS and Other Coronaviruses (Q2890434) (← links)
- Warm-Start Routines for Solving Augmented Weighted Tchebycheff Network Programs in Multiple-Objective Network Programming (Q2892259) (← links)
- Solution of Large Quadratic Knapsack Problems Through Aggressive Reduction (Q2892339) (← links)
- Computing with Domino-Parity Inequalities for the Traveling Salesman Problem (TSP) (Q2892348) (← links)
- Denser Packings Obtained in <i>O</i>(<i>n</i> log log <i>n</i>) Time (Q2892352) (← links)
- Least-Squares Support Vector Machine Approach to Viral Replication Origin Prediction (Q2899079) (← links)
- Decorous Lower Bounds for Minimum Linear Arrangement (Q2899100) (← links)
- Operating Room Pooling and Parallel Surgery Processing Under Uncertainty (Q2899116) (← links)
- Minimax Regret Single-Facility Ordered Median Location Problems on Networks (Q2901048) (← links)
- Efficient Computation of Sparse Hessians Using Coloring and Automatic Differentiation (Q2901061) (← links)
- Complexity and Approximation Results for the Balance Optimization Subset Selection Model for Causal Inference in Observational Studies (Q2940541) (← links)
- The Recoverable Robust Two-Level Network Design Problem (Q2942678) (← links)
- A Computational Study of Exact Approaches for the Bi-Objective Prize-Collecting Steiner Tree Problem (Q2942688) (← links)
- Automated Multilateral Negotiation on Multiple Issues with Private Information (Q2960357) (← links)
- A Dynamic Programming Heuristic for the Quadratic Knapsack Problem (Q2967622) (← links)
- Sequential Bounding Methods for Two-Stage Stochastic Programs (Q3186665) (← links)
- Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem (Q3466782) (← links)
- A Column Generation Approach for Graph Coloring (Q4367049) (← links)
- A Minimal Algorithm for the Bounded Knapsack Problem (Q4427321) (← links)
- A Stochastic Branch-and-Bound Approach to Activity Crashing in Project Management (Q4427326) (← links)
- An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem (Q4427334) (← links)
- A Rare-Event Simulation Algorithm for Periodic Single-Server Queues (Q5131711) (← links)
- A Data-Driven Model of an Appointment-Generated Arrival Process at an Outpatient Clinic (Q5131719) (← links)
- An Extended Mixed-Integer Programming Formulation and Dynamic Cut Generation Approach for the Stochastic Lot-Sizing Problem (Q5136076) (← links)
- What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO (Q5136083) (← links)
- Planning for Overtime: The Value of Shift Extensions in Physician Scheduling (Q5139629) (← links)
- Bi-objective Branch-and-Cut Algorithms Based on LP Relaxation and Bound Sets (Q5139632) (← links)
