The following pages link to INFORMS Journal on Computing (Q74741):
Displaying 50 items.
- Stochastic Planning and Scheduling with Logic-Based Benders Decomposition (Q5057988) (← links)
- Fine-Grained Job Salary Benchmarking with a Nonparametric Dirichlet Process–Based Latent Factor Model (Q5057992) (← links)
- ExpertRNA: A New Framework for RNA Secondary Structure Prediction (Q5057995) (← links)
- Features Selection as a Nash-Bargaining Solution: Applications in Online Advertising and Information Systems (Q5057996) (← links)
- Exactly Solving Hard Permutation Flowshop Scheduling Problems on Peta-Scale GPU-Accelerated Supercomputers (Q5057997) (← links)
- An Iterated Dual Substitution Approach for Binary Integer Programming Problems Under the Min-Max Regret Criterion (Q5057998) (← links)
- Play Like the Pros? Solving the Game of Darts as a Dynamic Zero-Sum Game (Q5057999) (← links)
- Improving Variable Orderings of Approximate Decision Diagrams Using Reinforcement Learning (Q5058000) (← links)
- Network Design with Service Requirements: Scaling-up the Size of Solvable Problems (Q5058001) (← links)
- Optimal Frameworks for Detecting Anomalies in Sensor-Intensive Heterogeneous Networks (Q5058002) (← links)
- FrankWolfe.jl: A High-Performance and Flexible Toolbox for Frank–Wolfe Algorithms and Conditional Gradients (Q5058004) (← links)
- Convexification of Queueing Formulas by Mixed-Integer Second-Order Cone Programming: An Application to a Discrete Location Problem with Congestion (Q5058005) (← links)
- A Branch-and-Cut Algorithm for Submodular Interdiction Games (Q5058006) (← links)
- A Catalog of Formulations for the Network Pricing Problem (Q5058007) (← links)
- Constant Approximation for the Lifetime Scheduling Problem of <i>p</i>-Percent Coverage (Q5058008) (← links)
- Solving Natural Conic Formulations with Hypatia.jl (Q5058009) (← links)
- Stochastic RWA and Lightpath Rerouting in WDM Networks (Q5058011) (← links)
- Decomposition and Adaptive Sampling for Data-Driven Inverse Linear Optimization (Q5058012) (← links)
- Projective Cutting-Planes for Robust Linear Programming and Cutting Stock Problems (Q5058013) (← links)
- A Software Package and Data Set for the Personal Protective Equipment Matching Problem During COVID-19 (Q5058016) (← links)
- <i>L</i><sub>0</sub>-Regularized Learning for High-Dimensional Additive Hazards Regression (Q5058017) (← links)
- Robust Stochastic Facility Location: Sensitivity Analysis and Exact Solution (Q5058018) (← links)
- A Closest Benders Cut Selection Scheme for Accelerating the Benders Decomposition Algorithm (Q5058020) (← links)
- Managing Product Transitions: A Bilevel Programming Approach (Q5058022) (← links)
- A Simulation Optimization Approach for the Appointment Scheduling Problem with Decision-Dependent Uncertainties (Q5058024) (← links)
- Note from the Editor (Q5060770) (← links)
- Computational and Theoretical Challenges for Computing the Minimum Rank of a Graph (Q5060771) (← links)
- ROC++: Robust Optimization in C++ (Q5060773) (← links)
- A Stochastic Approximation Method for Simulation-Based Quantile Optimization (Q5060775) (← links)
- bsnsing: A Decision Tree Induction Method Based on Recursive Optimal Boolean Rule Composition (Q5060776) (← links)
- Solving Large-Scale Fixed-Budget Ranking and Selection Problems (Q5060777) (← links)
- Setting Reserve Prices in Second-Price Auctions with Unobserved Bids (Q5060778) (← links)
- An Alternating Method for Cardinality-Constrained Optimization: A Computational Study for the Best Subset Selection and Sparse Portfolio Problems (Q5060779) (← links)
- Solving Stochastic Optimization with Expectation Constraints Efficiently by a Stochastic Augmented Lagrangian-Type Algorithm (Q5060780) (← links)
- Bifidelity Surrogate Modelling: Showcasing the Need for New Test Instances (Q5060781) (← links)
- A Computational Framework for Solving Nonlinear Binary Optimization Problems in Robust Causal Inference (Q5060782) (← links)
- Optimization Strategies for Resource-Constrained Project Scheduling Problems in Underground Mining (Q5060783) (← links)
- Parallel Machine Scheduling Under Uncertainty: Models and Exact Algorithms (Q5060784) (← links)
- Finding Feasible Systems for Subjective Constraints Using Recycled Observations (Q5060786) (← links)
- Toward Efficient Ensemble Learning with Structure Constraints: Convergent Algorithms and Applications (Q5060788) (← links)
- A Penalty Branch-and-Bound Method for Mixed Binary Linear Complementarity Problems (Q5060789) (← links)
- A Branch-and-Price Algorithm for the Multiple Knapsack Problem (Q5060791) (← links)
- Stochastic Dual Dynamic Programming for Multiechelon Lot Sizing with Component Substitution (Q5060792) (← links)
- Augmenting Markov Cohort Analysis to Compute (Co)Variances: Implications for Strength of Cost-Effectiveness (Q5060793) (← links)
- On Fault-Tolerant Low-Diameter Clusters in Graphs (Q5060794) (← links)
- An Algorithm for Maximizing a Convex Function Based on Its Minimum (Q5060795) (← links)
- Robust Team Orienteering Problem with Decreasing Profits (Q5060796) (← links)
- Integrated Backup Rolling Stock Allocation and Timetable Rescheduling with Uncertain Time-Variant Passenger Demand Under Disruptive Events (Q5060797) (← links)
- Disjunctive Rule Lists (Q5060799) (← links)
- Robust Adaptive Submodular Maximization (Q5060800) (← links)
