| A Branch-and-Bound Approach to the Traveling Salesman Problem with a Drone |
15 |
| Continuous Variable Neighborhood Search (C-VNS) for Solving Systems of Nonlinear Equations |
11 |
| A Unified Decomposition Matheuristic for Assembly, Production, and Inventory Routing |
10 |
| Solving Highly Detailed Gas Transport MINLPs: Block Separability and Penalty Alternating Direction Methods |
8 |
| The Ramping Polytope and Cut Generation for the Unit Commitment Problem |
7 |
| The Meet-in-the-Middle Principle for Cutting and Packing Problems |
7 |
| Exact Algorithms for Distributionally beta-Robust Machine Scheduling with Uncertain Processing Times |
7 |
| Benchmarking a Scalable Approximate Dynamic Programming Algorithm for Stochastic Control of Grid-Level Energy Storage |
7 |
| Modelling Human Decision Behaviour with Preference Learning |
6 |
| Primal Heuristics for Branch and Price: The Assets of Diving Methods |
6 |
| Stochastic Network Design for Planning Scheduled Transportation Services: The Value of Deterministic Solutions |
5 |
| Integrated Scheduling of Production and Two-Stage Delivery of Make-to-Order Products: Offline and Online Algorithms |
5 |
| Chance-Constrained Surgery Planning Under Conditions of Limited and Ambiguous Data |
4 |
| Interdiction Games and Monotonicity, with Application to Knapsack Problems |
4 |
| A Joint Vehicle Routing and Speed Optimization Problem |
4 |
| Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation |
4 |
| A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems |
4 |
| Analytics Branching and Selection for the Capacitated Multi-Item Lot Sizing Problem with Nonidentical Machines |
3 |
| Quadratic Combinatorial Optimization Using Separable Underestimators |
3 |
| The Vehicle Routing Problem with Floating Targets: Formulation and Solution Approaches |
3 |
| Physician Staffing for Emergency Departments with Time-Varying Demand |
3 |
| Target Cuts from Relaxed Decision Diagrams |
3 |
| Dynamic Compressor Optimization in Natural Gas Pipeline Systems |
3 |
| A Data-Driven Model of an Appointment-Generated Arrival Process at an Outpatient Clinic |
3 |
| Adaptive Partition-Based Level Decomposition Methods for Solving Two-Stage Stochastic Programs with Fixed Recourse |
2 |
| Incremental Upper Bound for the Maximum Clique Problem |
2 |
| An Approximation Algorithm for Capacity Allocation Over a Single Flight Leg with Fare-Locking |
2 |
| Two-Dimensional Phase Unwrapping via Balanced Spanning Forests |
2 |
| A Rare-Event Simulation Algorithm for Periodic Single-Server Queues |
2 |
| Disjunctive Programming for Multiobjective Discrete Optimisation |
2 |
| Surrogate Optimization of Computationally Expensive Black-Box Problems with Hidden Constraints |
2 |
| Identification of Essential Proteins Using Induced Stars in Protein-Protein Interaction Networks |
2 |
| Group Maintenance: A Restless Bandits Approach |
2 |
| A Branch-and-Price Algorithm for Parallel Machine Scheduling Using ZDDS and Generic Branching |
2 |
| A New Exact Algorithm to Optimize a Linear Function over the Set of Efficient Solutions for Biobjective Mixed Integer Linear Programs |
2 |
| Computing Minimum k-Connected m-Fold Dominating Set in General Graphs |
2 |
| Optimal Design of the Seasonal Influenza Vaccine with Manufacturing Autonomy |
2 |
| What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO |
1 |
| Lateness Minimization in Pairwise Connectivity Restoration Problems |
1 |
| An Extended Mixed-Integer Programming Formulation and Dynamic Cut Generation Approach for the Stochastic Lot-Sizing Problem |
1 |
| Portfolio Optimization with Nonparametric Value at Risk: A Block Coordinate Descent Method |
1 |
| T-Closeness Slicing: A New Privacy-Preserving Approach for Transactional Data Publishing |
1 |
| Partially Adaptive Stochastic Optimization for Electric Power Generation Expansion Planning |
1 |
| An Open-Source Desktop Application for Generating Arc-Routing Benchmark Instances |
1 |
| Randomized Decomposition Solver with the Quadratic Assignment Problem as a Case Study |
1 |
| Breaking the O(ln n) Barrier: An F hanced Approximation Algorithm for Fault-Tolerant Minimum Weight connected Dominating Set |
1 |
| Branch-and-Bound for Bi-objective Integer Programming |
1 |
| An Efficient Morris Method-Based Framework for Simulation Factor Screening |
1 |
| Vehicle Routing with Space- and Time-Correlated Stochastic Travel Times: Evaluating the Objective Function |
1 |
| Learning to Rank in Entity Relationship Graphs |
1 |
