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