| Publication | Date of Publication | Type |
|---|
| Nash fairness solutions for balanced TSP | 2025-10-31 | Paper |
A project and lift approach for a 2-commodity flow relocation model in a time expanded network
Discrete Applied Mathematics | 2024-08-09 | Paper |
| 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 |
Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods
International Transactions in Operational Research | 2023-11-21 | Paper |
Nash balanced assignment problem
Lecture Notes in Computer Science | 2023-08-03 | Paper |
Branch-and-cut for a 2-commodity flow relocation model with time constraints
Lecture Notes in Computer Science | 2023-08-03 | Paper |
Monitoring a Fleet of Autonomous Vehicles Through A* Like Algorithms and Reinforcement Learning
Recent Advances in Computational Optimization | 2023-08-01 | Paper |
Complexity, algorithmic, and computational aspects of a dial-a-ride type problem
European Journal of Operational Research | 2023-07-11 | Paper |
On some algorithmic aspects of hypergraphic matroids
Discrete Mathematics | 2022-11-23 | Paper |
The complexity of the unit stop number problem and its implications to other related problems
Theoretical Computer Science | 2022-05-10 | Paper |
Network disconnection games: a game theoretic approach to checkpoint evaluation in networks
Discrete Applied Mathematics | 2022-01-05 | Paper |
| On the \(p\)-median polytope and the directed odd cycle inequalities | 2021-02-04 | Paper |
Network strength games: the core and the nucleolus
Mathematical Programming. Series A. Series B | 2020-02-20 | Paper |
On the star forest polytope for trees and cycles
RAIRO - Operations Research | 2020-02-07 | Paper |
An algorithm to compute the nucleolus of shortest path games
Algorithmica | 2019-06-27 | Paper |
Faster algorithms for security games on matroids
Algorithmica | 2019-03-11 | Paper |
Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem
Mathematical Programming. Series A. Series B | 2018-10-26 | Paper |
On a connection between facility location and perfect graphs
Operations Research Letters | 2018-09-28 | Paper |
On the \(p\)-median polytope and the odd directed cycle inequalities: oriented graphs
Networks | 2018-09-04 | Paper |
| The stop number minimization problem: complexity and polyhedral analysis | 2018-08-17 | Paper |
On the \(p\)-median polytope and the directed odd cycle inequalities: triangle-free oriented graphs
Discrete Optimization | 2018-05-24 | Paper |
| Bounds on directed star arboricity in some digraph classes | 2018-04-09 | Paper |
| On the nucleolus of shortest path games | 2018-02-13 | Paper |
On the location and \(p\)-median polytopes
Research Trends in Combinatorial Optimization | 2017-04-07 | Paper |
Sparsest-cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem
Integer Programming and Combinatorial Optimization | 2016-08-10 | Paper |
Maximum weighted induced bipartite subgraphs and acyclic subgraphs of planar cubic graphs
SIAM Journal on Discrete Mathematics | 2016-06-23 | Paper |
Stackelberg bipartite vertex cover and the preflow algorithm
Algorithmica | 2016-04-06 | Paper |
A note on many-to-many matchings and stable allocations
Discrete Applied Mathematics | 2016-02-12 | Paper |
The dominating set polytope via facility location
Lecture Notes in Computer Science | 2015-10-16 | Paper |
Maximum weighted induced bipartite subgraphs and acyclic subgraphs of planar cubic graphs
Integer Programming and Combinatorial Optimization | 2014-06-02 | Paper |
A polyhedral study of a two level facility location model
RAIRO - Operations Research | 2014-05-26 | Paper |
Hardness and algorithms for variants of line graphs of directed graphs
Algorithms and Computation | 2014-01-14 | Paper |
| On a class of intersection graphs | 2013-06-11 | Paper |
On the linear relaxation of the \(p\)-median problem
Discrete Optimization | 2012-06-20 | Paper |
On the \(p\)-median polytope of fork-free graphs
Electronic Notes in Discrete Mathematics | 2012-05-13 | Paper |
| Partition inequalities: separation, extensions, and network design | 2012-01-26 | Paper |
On the \(p\)-median polytope and the intersection property: polyhedra and algorithms
SIAM Journal on Discrete Mathematics | 2011-10-27 | Paper |
On the integrality of some facility location polytopes
SIAM Journal on Discrete Mathematics | 2010-06-01 | Paper |
A linear programming approach to increasing the weight of all minimum spanning trees
Networks | 2008-12-17 | Paper |
On the \(p\)-median polytope of \(Y\)-free graphs
Discrete Optimization | 2008-10-29 | Paper |
Characterizations of the optimal stable allocation mechanism
Operations Research Letters | 2008-01-21 | Paper |
| scientific article; zbMATH DE number 5158491 (Why is no real title available?) | 2007-05-29 | Paper |
The node-edge weighted 2-edge connected subgraph problem: linear relaxation, facets and separation
Discrete Optimization | 2006-10-10 | Paper |
Erratum: The Stable Allocation (or Ordinal Transportation) Problem
Mathematics of Operations Research | 2005-11-11 | Paper |
The Stable Allocation (or Ordinal Transportation) Problem
Mathematics of Operations Research | 2005-11-11 | Paper |
Student admissions and faculty recruitment
Theoretical Computer Science | 2004-11-12 | Paper |
The Steiner Traveling Salesman Polytope and Related Polyhedra
SIAM Journal on Optimization | 2003-01-05 | Paper |
On the dominant of the Steiner 2-edge connected subgraph polytope
Discrete Applied Mathematics | 2002-02-17 | Paper |
Separation of partition inequalities
Mathematics of Operations Research | 2001-11-26 | Paper |
The stable admissions polytope
Mathematical Programming. Series A. Series B | 2000-11-09 | Paper |
Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry)
Discrete Applied Mathematics | 2000-10-30 | Paper |
Steiner 2-Edge Connected Subgraph Polytopes on Series-Parallel Graphs
SIAM Journal on Discrete Mathematics | 1998-02-09 | Paper |
