Request Username
Can't sign in? Forgot your username?
Enter your email address below and we will send you your username
Note from the Editor
Research Articles
Computational and Theoretical Challenges for Computing the Minimum Rank of a Graph
Pages:2868–2872
Published Online:August 24, 2022
A Stochastic Approximation Method for Simulation-Based Quantile Optimization
Pages:2889–2907
Published Online:July 22, 2022
bsnsing: A Decision Tree Induction Method Based on Recursive Optimal Boolean Rule Composition
Pages:2908–2929
Published Online:July 27, 2022
Solving Large-Scale Fixed-Budget Ranking and Selection Problems
Pages:2930–2949
Published Online:July 28, 2022
Setting Reserve Prices in Second-Price Auctions with Unobserved Bids
Pages:2950–2967
Published Online:July 29, 2022
An Alternating Method for Cardinality-Constrained Optimization: A Computational Study for the Best Subset Selection and Sparse Portfolio Problems
Pages:2968–2988
Published Online:August 8, 2022
Solving Stochastic Optimization with Expectation Constraints Efficiently by a Stochastic Augmented Lagrangian-Type Algorithm
Pages:2989–3006
Published Online:August 8, 2022
Bifidelity Surrogate Modelling: Showcasing the Need for New Test Instances
Pages:3007–3022
Published Online:August 9, 2022
A Computational Framework for Solving Nonlinear Binary Optimization Problems in Robust Causal Inference
Pages:3023–3041
Published Online:August 10, 2022
Optimization Strategies for Resource-Constrained Project Scheduling Problems in Underground Mining
Pages:3042–3058
Published Online:August 12, 2022
Parallel Machine Scheduling Under Uncertainty: Models and Exact Algorithms
Pages:3059–3079
Published Online:August 17, 2022
Finding Feasible Systems for Subjective Constraints Using Recycled Observations
Pages:3080–3095
Published Online:August 18, 2022
Toward Efficient Ensemble Learning with Structure Constraints: Convergent Algorithms and Applications
Pages:3096–3116
Published Online:August 19, 2022
A Penalty Branch-and-Bound Method for Mixed Binary Linear Complementarity Problems
Pages:3117–3133
Published Online:August 23, 2022
A Branch-and-Price Algorithm for the Multiple Knapsack Problem
Pages:3134–3150
Published Online:August 23, 2022
Stochastic Dual Dynamic Programming for Multiechelon Lot Sizing with Component Substitution
Pages:3151–3169
Published Online:September 6, 2022
Augmenting Markov Cohort Analysis to Compute (Co)Variances: Implications for Strength of Cost-Effectiveness
Pages:3170–3180
Published Online:September 13, 2022
An Algorithm for Maximizing a Convex Function Based on Its Minimum
Pages:3200–3214
Published Online:September 20, 2022
Robust Team Orienteering Problem with Decreasing Profits
Pages:3215–3233
Published Online:September 20, 2022
Integrated Backup Rolling Stock Allocation and Timetable Rescheduling with Uncertain Time-Variant Passenger Demand Under Disruptive Events
Pages:3234–3258
Published Online:September 21, 2022
Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time Windows
Pages:3292–3308
Published Online:September 29, 2022
A Polyhedral Study on Fuel-Constrained Unit Commitment
Pages:3309–3324
Published Online:September 30, 2022
Stability Representations of Many-to-One Matching Problems: An Integer Optimization Approach
Pages:3325–3343
Published Online:September 30, 2022
