| Publication | Date of Publication | Type |
|---|
| An outer approximation algorithm for generating the Edgeworth-Pareto hull of multi-objective mixed-integer linear programming problems | 2024-10-09 | Paper |
| On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs | 2024-08-20 | Paper |
| Benders decomposition algorithms for minimizing the spread of harmful contagions in networks | 2024-07-08 | Paper |
| Exact solution approaches for the discrete α‐neighbor p‐center problem | 2024-01-18 | Paper |
| A note on computational aspects of the Steiner traveling salesman problem | 2023-11-16 | Paper |
| A matheuristic for tri-objective binary integer linear programming | 2023-11-15 | Paper |
| An exact method for binary fortification games | 2023-07-10 | Paper |
| Duplex encoding of staircase at-most-one constraints for the antibandwidth problem | 2022-12-21 | Paper |
| A Branch-and-Cut Algorithm for Submodular Interdiction Games | 2022-12-01 | Paper |
| An iterative exact algorithm for the weighted fair sequences problem | 2022-09-27 | Paper |
| A scaleable projection-based branch-and-cut algorithm for the \(p\)-center problem | 2022-06-10 | Paper |
| Exact and heuristic algorithms for the maximum weighted submatrix coverage problem | 2022-02-22 | Paper |
| A note on computational approaches for the antibandwidth problem | 2021-11-24 | Paper |
| Mixed-integer programming approaches for the time-constrained maximal covering routing problem | 2021-11-09 | Paper |
| A scaleable projection-based branch-and-cut algorithm for the $p$-center problem | 2021-08-16 | Paper |
| An iterative exact algorithm for the weighted fair sequences problem | 2021-08-06 | Paper |
| Large-scale influence maximization via maximal covering location | 2021-06-03 | Paper |
| The generalized reserve set covering problem with connectivity and buffer requirements | 2021-06-03 | Paper |
| Exact and heuristic algorithms for the weighted total domination problem | 2021-05-21 | Paper |
| An outer approximation algorithm for multi-objective mixed-integer linear and non-linear programming | 2021-03-30 | Paper |
| A branch-and-cut algorithm for submodular interdiction games | 2021-03-29 | Paper |
| A LP relaxation based matheuristic for multi-objective integer programming | 2021-02-06 | Paper |
| Interdiction Games and Monotonicity, with Application to Knapsack Problems | 2020-12-03 | Paper |
| A dual ascent-based branch-and-bound framework for the prize-collecting Steiner tree and related problems | 2020-11-09 | Paper |
| A branch-and-cut algorithm for the maximum covering cycle problem | 2020-01-20 | Paper |
| Mixed-integer programming approaches for the tree \(t^*\)-spanner problem | 2019-10-18 | Paper |
| Exact and heuristic algorithms for the weighted total domination problem | 2019-10-08 | Paper |
| A note on computational approaches for the antibandwidth problem | 2019-10-08 | Paper |
| An exact solution framework for the multiple gradual cover location problem | 2019-07-08 | Paper |
| Algorithmic expedients for the \(S\)-labeling problem | 2019-07-08 | Paper |
| On the use of intersection cuts for bilevel optimization | 2018-10-26 | Paper |
| An exact solution framework for the minimum cost dominating tree problem | 2018-10-23 | Paper |
| Lagrangian and branch-and-cut approaches for upgrading spanning tree problems | 2018-07-11 | Paper |
| A relax-and-cut framework for large-scale maximum weight connected subgraph problems | 2018-07-11 | Paper |
| A dynamic reformulation heuristic for generalized interdiction problems | 2018-05-30 | Paper |
| An algorithmic framework for the exact solution of tree-star problems | 2018-05-29 | Paper |
| Solving minimum-cost shared arborescence problems | 2018-05-25 | Paper |
| Decomposition methods for the two-stage stochastic Steiner tree problem | 2018-04-20 | Paper |
| A bi-objective network design approach for discovering functional modules linking Golgi apparatus fragmentation and neuronal death | 2018-02-26 | Paper |
| Thinning out Steiner trees: a node-based model for uniform edge costs | 2018-02-23 | Paper |
| A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints | 2018-02-01 | Paper |
| A new general-purpose algorithm for mixed-integer bilevel linear programs | 2018-01-11 | Paper |
| The connected facility location polytope | 2017-12-20 | Paper |
| An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem | 2017-12-06 | Paper |
| Gotta (efficiently) catch them all: Pokémon GO meets orienteering problems | 2017-11-23 | Paper |
| ILP heuristics and a new exact method for bi-objective 0/1 ILPs: application to fttx-network design | 2016-11-17 | Paper |
| Benders decomposition without separability: a computational study for capacitated facility location problems | 2016-10-07 | Paper |
| Intersection cuts for bilevel optimization | 2016-08-10 | Paper |
| ILP and CP formulations for the lazy bureaucrat problem | 2016-07-25 | Paper |
| Optimal upgrading schemes for effective shortest paths in networks | 2016-06-27 | Paper |
| On the Asymmetric Connected Facility Location Polytope | 2015-10-16 | Paper |
| A computational study of exact approaches for the bi-objective prize-collecting Steiner tree problem | 2015-09-11 | Paper |
