| Publication | Date of Publication | Type |
|---|
| A computational study on integer programming formulations for hop-constrained survivable network design | 2025-01-06 | Paper |
| A solution algorithm for chance-constrained problems with integer second-stage recourse decisions | 2024-04-09 | Paper |
| Adjustable Robust Optimization with Discrete Uncertainty | 2024-03-26 | Paper |
| In search of dense subgraphs: How good is greedy peeling? | 2023-12-11 | Paper |
| Adjustable robust optimization with objective uncertainty | 2023-11-14 | Paper |
| The min-Knapsack problem with compactness constraints and applications in statistics | 2023-11-14 | Paper |
| Corrigendum to: ``Integer optimization with penalized fractional values: the knapsack case | 2023-07-04 | Paper |
| Models and algorithms for the weighted safe set problem | 2023-02-24 | Paper |
| Network Design with Service Requirements: Scaling-up the Size of Solvable Problems | 2022-12-01 | Paper |
| \(K\)-adaptability in stochastic optimization | 2022-11-14 | Paper |
| Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem | 2022-09-19 | Paper |
| Nonlinear chance-constrained problems with applications to hydro scheduling | 2022-03-22 | Paper |
| A branch-and-price algorithm for the minimum sum coloring problem | 2021-09-15 | Paper |
| Models and algorithms for optimising two-dimensional LEGO constructions | 2021-06-03 | Paper |
| On integer and bilevel formulations for the \(k\)-vertex cut problem | 2020-08-27 | Paper |
| A note on selective line-graphs and partition colorings | 2020-02-10 | Paper |
| The vertex \(k\)-cut problem | 2019-06-13 | Paper |
| Integer optimization with penalized fractional values: the knapsack case | 2018-12-06 | Paper |
| An exact algorithm for the partition coloring problem | 2018-07-12 | Paper |
| A branch‐and‐price algorithm for the (k,c)‐coloring problem | 2018-06-13 | Paper |
| Optimizing allocation in a warehouse network | 2018-04-11 | Paper |
| ILP models and column generation for the minimum sum coloring problem | 2018-04-11 | Paper |
| A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph | 2017-12-29 | Paper |
| Solving vertex coloring problems as maximum weight stable set problems | 2017-03-15 | Paper |
| Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming | 2017-02-08 | Paper |
| Models for the two-dimensional two-stage cutting stock problem with multiple stock size | 2016-11-10 | Paper |
| Solving the temporal knapsack problem via recursive Dantzig-Wolfe reformulation | 2016-03-01 | Paper |
| A metaheuristic framework for nonlinear capacitated covering problems | 2016-02-23 | Paper |
| Automatic Dantzig-Wolfe reformulation of mixed integer programs | 2015-02-09 | Paper |
| Exact weighted vertex coloring via branch-and-price | 2012-09-11 | Paper |
| A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size | 2012-08-16 | Paper |
| Algorithms for the bin packing problem with conflicts | 2012-07-28 | Paper |
| A metaheuristic approach for the vertex coloring problem | 2012-07-28 | Paper |
| An exact approach for the vertex coloring problem | 2012-06-20 | Paper |
| Partial Convexification of General MIPs by Dantzig-Wolfe Reformulation | 2011-06-24 | Paper |
| A survey on vertex coloring problems | 2011-05-23 | Paper |
| Efficient and fair routing for mesh networks | 2010-09-16 | Paper |
| Models and heuristic algorithms for a weighted vertex coloring problem | 2009-11-20 | Paper |
| The vertex coloring problem and its generalizations | 2009-06-22 | Paper |
| An evolutionary approach for bandwidth multicoloring problems | 2008-04-24 | Paper |
