| Publication | Date of Publication | Type |
|---|
Semidefinite programming bounds and a branch-and-bound algorithm for the chordless cycle problem
Discrete Applied Mathematics | 2026-02-24 | Paper |
Formulations and algorithms for the simple cycle problem
Computational Optimization and Applications | 2026-01-19 | Paper |
Mixed integer programming and quadratic programming formulations for the interval count problem
Procedia Computer Science | 2025-12-11 | Paper |
| Compact and non-compact formulations for the dominated coloring problem | 2025-11-03 | Paper |
| Minimum concurrency for assembling computer music | 2025-10-30 | Paper |
Stable set reformulations for the degree preserving spanning tree problem
European Journal of Operational Research | 2025-05-16 | Paper |
Conceptual clique sampling frameworks to design solution algorithms for the edge clique cover problem
RAIRO. Operations Research | 2025-02-21 | Paper |
| Quadratically constrained reformulation, strong semidefinite programming bounds, and algorithms for the chordless cycle problem | 2025-02-07 | Paper |
Graphs whose vertices of degree at least 2 lie in a triangle
RAIRO. Operations Research | 2025-01-20 | Paper |
Optimizing concurrency under Scheduling by Edge Reversal
Networks | 2023-12-11 | Paper |
Extended formulations for perfect domination problems and their algorithmic implications
European Journal of Operational Research | 2023-07-11 | Paper |
Modelling and solving the perfect edge domination problem
Optimization Letters | 2020-04-27 | Paper |
| A strong symmetric formulation for the min-degree constrained minimum spanning tree problem | 2016-10-18 | Paper |
| The tree-star problem: a formulation and a branch-and-cut algorithm | 2016-10-18 | Paper |
Optimality cuts and a branch-and-cut algorithm for the k-rooted mini-max spanning forest problem
European Journal of Operational Research | 2016-10-06 | Paper |
Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem
Computational Optimization and Applications | 2016-04-04 | Paper |
Lagrangian heuristics for the quadratic knapsack problem
Computational Optimization and Applications | 2016-03-07 | Paper |
Erratum to: ``Characterizing acyclic graphs by labeling edges''
Discrete Applied Mathematics | 2015-04-28 | Paper |
Benders decomposition, branch-and-cut, and hybrid algorithms for the minimum connected dominating set problem
INFORMS Journal on Computing | 2015-01-26 | Paper |
Characterizing acyclic graphs by labeling edges
Discrete Applied Mathematics | 2014-05-05 | Paper |
Polyhedral results and a branch-and-cut algorithm for the \(k\)-cardinality tree problem
Mathematical Programming. Series A. Series B | 2014-02-03 | Paper |
Mathematical models for optimizing production chain planning in salmon farming
International Transactions in Operational Research | 2013-11-14 | Paper |
A new formulation for spanning trees
Electronic Notes in Discrete Mathematics | 2013-07-23 | Paper |
A new Lagrangian based branch and bound algorithm for the 0-1 knapsack problem
Electronic Notes in Discrete Mathematics | 2012-05-13 | Paper |
| Relax-and-cut as a preprocessor and warm starter to branch-and-cut | 2012-01-26 | Paper |
Reformulations and solution algorithms for the maximum leaf spanning tree problem
Computational Management Science | 2010-09-20 | Paper |
A hybrid heuristic for the diameter constrained minimum spanning tree problem
Journal of Global Optimization | 2010-03-15 | Paper |
A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs
Discrete Applied Mathematics | 2009-06-23 | Paper |
A new formulation for the traveling deliveryman problem
Discrete Applied Mathematics | 2009-03-04 | Paper |
A relax-and-cut algorithm for the set partitioning problem
Computers & Operations Research | 2007-11-30 | Paper |
| scientific article; zbMATH DE number 5173819 (Why is no real title available?) | 2007-07-23 | Paper |
Lower and upper bounds for the degree-constrained minimum spanning tree problem
Networks | 2007-07-20 | Paper |
| scientific article; zbMATH DE number 5158530 (Why is no real title available?) | 2007-05-29 | Paper |
Using Lagrangian dual information to generate degree constrained spanning trees
Discrete Applied Mathematics | 2006-04-28 | Paper |
Non delayed relax-and-cut algorithms
Annals of Operations Research | 2006-03-07 | Paper |
Strong lower bounds for the prize collecting Steiner problem in graphs
Discrete Applied Mathematics | 2004-08-06 | Paper |
Stronger K-tree relaxations for the vehicle routing problem
European Journal of Operational Research | 2004-08-06 | Paper |
Optimal rectangular partitions
Networks | 2003-03-10 | Paper |
| Maximum flow problems under special nonnegative lower bounds on arc flows | 2001-10-24 | Paper |
| Generating lower bounds for the prize collecting Steiner problem in graphs | 2001-10-24 | Paper |
| scientific article; zbMATH DE number 1064585 (Why is no real title available?) | 2000-04-25 | Paper |
| A branch and cut algorithm for the Steiner problem in graphs | 1998-03-05 | Paper |
Scheduling examinations to reduce second-order conflicts
Computers & Operations Research | 1993-01-16 | Paper |
Time‐dependent traveling salesman problem–the deliveryman case
Networks | 1992-06-25 | Paper |
Graphs whose vertices of degree at least 2 lie in a triangle
(available as arXiv preprint) | N/A | Paper |
