| Publication | Date of Publication | Type |
|---|
| Implied integrality in mixed-integer optimization | 2025-12-22 | Paper |
Improved linear programming relaxations for flow shop problems with makespan minimization
Computers & Operations Research | 2025-06-05 | Paper |
Algorithmic solutions for maximizing shareable costs
Networks | 2025-01-08 | Paper |
Short paper -- The binary linearization complexity of pseudo-Boolean functions
OJMO. Open Journal of Mathematical Optimization | 2024-11-05 | Paper |
Simple odd \(\beta \)-cycle inequalities for binary polynomial optimization
Mathematical Programming. Series A. Series B | 2024-08-20 | Paper |
Recognizing Series-Parallel Matrices in Linear Time
INFORMS Journal on Computing | 2024-03-22 | Paper |
Exact price of anarchy for weighted congestion games with two players
Lecture Notes in Computer Science | 2023-08-03 | Paper |
A polyhedral study for the cubic formulation of the unconstrained traveling tournament problem
Discrete Optimization | 2023-02-16 | Paper |
Persistency of linear programming relaxations for the stable set problem
Integer Programming and Combinatorial Optimization | 2022-10-14 | Paper |
Simple odd \(\beta \)-cycle inequalities for binary polynomial optimization
(available as arXiv preprint) | 2022-08-16 | Paper |
Persistency of linear programming relaxations for the stable set problem
Mathematical Programming. Series A. Series B | 2022-03-22 | Paper |
Face dimensions of general-purpose cutting planes for mixed-integer linear programs
(available as arXiv preprint) | 2021-12-21 | Paper |
The graphical traveling salesperson problem has no integer programming formulation in the original space
Operations Research Letters | 2021-12-13 | Paper |
The Graphical Traveling Salesperson Problem has no Integer Programming Formulation in the Original Space
(available as arXiv preprint) | 2021-06-18 | Paper |
A Polyhedral Study for the Cubic Formulation of the Unconstrained Traveling Tournament Problem
(available as arXiv preprint) | 2020-11-18 | Paper |
Extended formulations for radial cones
Operations Research Letters | 2020-02-10 | Paper |
Parity polytopes and binarization
Discrete Applied Mathematics | 2019-12-30 | Paper |
| Integrality of Linearizations of Polynomials over Binary Variables using Additional Monomials | 2019-11-15 | Paper |
Complete Description of Matching Polytopes with One Linearized Quadratic Term for Bipartite Graphs
SIAM Journal on Discrete Mathematics | 2019-08-29 | Paper |
| The Almost-Disjoint 2-Path Decomposition Problem | 2019-07-10 | Paper |
On a cardinality-constrained transportation problem with market choice
Operations Research Letters | 2018-10-01 | Paper |
Subgraph polytopes and independence polytopes of count matroids
Operations Research Letters | 2018-09-28 | Paper |
Minimizing average project team size given multi-skilled workers with heterogeneous skill levels
Computers & Operations Research | 2018-07-12 | Paper |
| A Note on Matchings Constructed during Edmonds' Weighted Perfect Matching Algorithm | 2017-03-28 | Paper |
Extended formulations for independence polytopes of regular matroids
Graphs and Combinatorics | 2016-11-29 | Paper |
Simple extensions of polytopes
Mathematical Programming. Series A. Series B | 2015-12-09 | Paper |
On a multi-project staffing problem with heterogeneously skilled workers
Operations Research Proceedings | 2015-03-03 | Paper |
Sparsity of lift-and-project cutting planes
Operations Research Proceedings | 2015-02-12 | Paper |
Simple extensions of polytopes
Lecture Notes in Computer Science | 2014-06-02 | Paper |
Implementation of a unimodularity test
Mathematical Programming Computation | 2013-04-12 | Paper |
A heuristic approach to project staffing
Electronic Notes in Discrete Mathematics | 2012-05-13 | Paper |
Optimal subgraphs in geometric scale-free random graphs
(available as arXiv preprint) | N/A | Paper |
