| Publication | Date of Publication | Type |
|---|
A branch, bound and remember algorithm for maximizing the production rate in the simple assembly line balancing problem
Computers & Operations Research | 2024-07-08 | Paper |
A note on computational aspects of the Steiner traveling salesman problem
International Transactions in Operational Research | 2023-11-16 | Paper |
Analysis of the simple assembly line balancing problem complexity
Computers & Operations Research | 2023-09-13 | Paper |
The generalized reserve set covering problem with connectivity and buffer requirements
European Journal of Operational Research | 2021-06-03 | Paper |
Exact and heuristic algorithms for the weighted total domination problem
Computers & Operations Research | 2021-05-21 | Paper |
Multicriteria saliency detection: a (exact) robust network design approach
Annals of Operations Research | 2020-05-11 | Paper |
A branch-and-cut algorithm for the maximum covering cycle problem
Annals of Operations Research | 2020-01-20 | Paper |
Mixed-integer programming approaches for the tree \(t^*\)-spanner problem
Optimization Letters | 2019-10-18 | Paper |
Exact and heuristic algorithms for the weighted total domination problem
(available as arXiv preprint) | 2019-10-08 | Paper |
An exact solution framework for the multiple gradual cover location problem
Computers & Operations Research | 2019-07-08 | Paper |
On the complexity of assembly line balancing problems
Computers & Operations Research | 2019-07-08 | Paper |
An exact solution framework for the minimum cost dominating tree problem
Optimization Letters | 2018-10-23 | Paper |
Lagrangian and branch-and-cut approaches for upgrading spanning tree problems
Computers & Operations Research | 2018-07-11 | Paper |
Designing and constructing networks under uncertainty in the construction stage: definition and exact algorithmic approach
Computers & Operations Research | 2018-07-11 | Paper |
A relax-and-cut framework for large-scale maximum weight connected subgraph problems
Computers & Operations Research | 2018-07-11 | Paper |
Solving minimum-cost shared arborescence problems
European Journal of Operational Research | 2018-05-25 | Paper |
A multicriteria optimization model for sustainable forest management under climate change uncertainty: an application in Portugal
European Journal of Operational Research | 2018-04-23 | Paper |
A bi-objective network design approach for discovering functional modules linking Golgi apparatus fragmentation and neuronal death
Annals of Operations Research | 2018-02-26 | Paper |
Gotta (efficiently) catch them all: Pokémon GO meets orienteering problems
European Journal of Operational Research | 2017-11-23 | Paper |
On exact solutions for the minmax regret spanning tree problem
Computers & Operations Research | 2016-11-10 | Paper |
Optimal upgrading schemes for effective shortest paths in networks
Integration of AI and OR Techniques in Constraint Programming | 2016-06-27 | Paper |
Single-commodity robust network design problem: complexity, instances and heuristic solutions
European Journal of Operational Research | 2016-06-23 | Paper |
Vulnerability Assessment of Spatial Networks: Models and Solutions
Lecture Notes in Computer Science | 2015-10-16 | Paper |
The recoverable robust two-level network design problem
INFORMS Journal on Computing | 2015-09-11 | Paper |
Exact approaches for solving robust prize-collecting Steiner tree problems
European Journal of Operational Research | 2015-07-28 | Paper |
The Maximum Weight Connected Subgraph Problem
Facets of Combinatorial Optimization | 2015-07-22 | Paper |
Risk models for the prize collecting Steiner tree problems with interval data
Acta Mathematicae Applicatae Sinica. English Series | 2014-08-29 | Paper |
A note on the Bertsimas \& Sim algorithm for robust combinatorial optimization problems
4OR | 2014-03-24 | Paper |
The rooted maximum node-weight connected subgraph problem
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems | 2013-06-04 | Paper |
Minmax regret combinatorial optimization problems: an algorithmic perspective
RAIRO - Operations Research | 2013-04-29 | Paper |
Models and algorithms for robust network design with several traffic scenarios
Lecture Notes in Computer Science | 2012-11-02 | Paper |
On a Class of Interval Data Minmax Regret CO Problems
Operations Research Proceedings | 2011-04-07 | Paper |
Deterministic risk control for cost-effective network connections
Theoretical Computer Science | 2011-01-28 | Paper |
Efficient algorithms for the prize collecting Steiner tree problems with interval data
Algorithmic Aspects in Information and Management | 2010-07-20 | Paper |
