| Publication | Date of Publication | Type |
|---|
| Proportional fairness for combinatorial optimization | 2024-05-31 | Paper |
A branch-and-cut algorithm for the balanced traveling salesman problem
Journal of Combinatorial Optimization | 2024-03-04 | Paper |
Generalized nash fairness solutions for bi‐objective minimization problems
Networks | 2024-01-18 | Paper |
Nash balanced assignment problem
Lecture Notes in Computer Science | 2023-08-03 | Paper |
Linear size MIP formulation of max-cut: new properties, links with cycle inequalities and computational results
Optimization Letters | 2021-07-08 | Paper |
| Experimental data for "Localization of lattice dynamics in low-angle twisted bilayer graphene" | 2021-01-27 | Dataset |
On the star forest polytope for trees and cycles
RAIRO - Operations Research | 2020-02-07 | Paper |
Approximating the minimum tour cover of a digraph
Algorithms | 2019-03-26 | Paper |
Reduced-size formulations for metric and cut polyhedra in sparse graphs
Networks | 2018-06-13 | Paper |
Improved compact formulations for a wide class of graph partitioning problems in sparse graphs
Discrete Optimization | 2018-05-24 | Paper |
An efficient primal-dual algorithm for fair combinatorial optimization problems
(available as arXiv preprint) | 2018-02-26 | Paper |
Improved linearized models for graph partitioning problem under capacity constraints
Optimization Methods & Software | 2017-11-24 | Paper |
Stochastic graph partitioning: quadratic versus SOCP formulations
Optimization Letters | 2016-10-27 | Paper |
| Improved compact formulations for metric and cut polyhedra | 2016-10-18 | Paper |
| A procedure of facet composition for the Symmetric Traveling Salesman Polytope | 2016-07-01 | Paper |
Approximating the Minimum Tour Cover with a Compact Linear Program
Advanced Computational Methods for Knowledge Engineering | 2015-10-14 | Paper |
On the linear description of the Huffman trees polytope
Discrete Applied Mathematics | 2015-09-22 | Paper |
The maximum weight spanning star forest problem on cactus graphs
Discrete Mathematics, Algorithms and Applications | 2015-07-01 | Paper |
Kőnig's edge-colouring theorem for all graphs
Operations Research Letters | 2014-05-15 | Paper |
| Approximating the asymmetric profitable tour | 2013-11-08 | Paper |
| On the convex hull of Huffman trees | 2013-11-08 | Paper |
A primal-dual approximation algorithm for the asymmetric prize-collecting TSP
Journal of Combinatorial Optimization | 2013-03-25 | Paper |
On the exit distribution of partially reflected Brownian motion in planar domains
Potential Analysis | 2013-02-15 | Paper |
Approximating the asymmetric profitable tour
International Journal of Mathematics in Operational Research | 2012-11-16 | Paper |
On the solution of a graph partitioning problem under capacity constraints
Lecture Notes in Computer Science | 2012-11-02 | Paper |
Approximation algorithms for metric tree cover and generalized tour and tree covers
RAIRO - Operations Research | 2011-06-01 | Paper |
Approximation algorithms for metric tree cover and generalized tour and tree covers
RAIRO - Operations Research | 2011-06-01 | Paper |
Approximation algorithm for the minimum directed tree cover
Combinatorial Optimization and Applications | 2011-01-10 | Paper |
A primal-dual approximation algorithm for the asymmetric prize-collecting TSP
Combinatorial Optimization and Applications | 2011-01-08 | Paper |
An exact algorithm for solving the ring star problem
Optimization | 2010-04-21 | Paper |
A 2log2(n)-Approximation Algorithm for Directed Tour Cover
Combinatorial Optimization and Applications | 2009-07-07 | Paper |
| scientific article; zbMATH DE number 1953197 (Why is no real title available?) | 2003-07-25 | Paper |
On the Linear Description of the k-cycle Polytope
International Transactions in Operational Research | 2002-09-11 | Paper |
On the linear description of the 3-cycle polytope
European Journal of Operational Research | 2002-06-16 | Paper |
