The following pages link to Stephen J. Maher (Q320747):
Displaying 15 items.
- The unrooted set covering connected subgraph problem differentiating between HIV envelope sequences (Q320748) (← links)
- Recoverable robust single day aircraft maintenance routing problem (Q337121) (← links)
- A novel passenger recovery approach for the integrated airline recovery problem (Q337498) (← links)
- The daily tail assignment problem under operational uncertainty using look-ahead maintenance constraints (Q1681502) (← links)
- SCIP-Jack -- a solver for STP and variants with parallelization extensions (Q1699618) (← links)
- Avoiding redundant columns by adding classical Benders cuts to column generation subproblems (Q2019426) (← links)
- Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework (Q2029367) (← links)
- A data-driven, variable-speed model for the train timetable rescheduling problem (Q2146975) (← links)
- Generating hard instances for robust combinatorial optimization (Q2272296) (← links)
- Price-and-verify: a new algorithm for recursive circle packing using Dantzig-Wolfe decomposition (Q2288982) (← links)
- PySCIPOpt: Mathematical Programming in Python with the SCIP Optimization Suite (Q2819234) (← links)
- Reduction techniques for the prize collecting Steiner tree problem and the maximum-weight connected subgraph problem (Q3120785) (← links)
- (Q4580149) (← links)
- Computational evaluation of cut-strengthening techniques in logic-based Benders' decomposition (Q6081826) (← links)
- Integer programming column generation: accelerating branch-and-price using a novel pricing scheme for finding high-quality solutions in set covering, packing, and partitioning problems (Q6095737) (← links)
