| Publication | Date of Publication | Type |
|---|
| Solving the set covering problem with conflicts on sets: a new parallel GRASP | 2024-07-08 | Paper |
| Corrigendum to: ``A new formulation and a branch-and-cut algorithm for the set orienteering problem | 2024-07-02 | Paper |
| A new formulation and a branch-and-cut algorithm for the set orienteering problem | 2024-04-16 | Paper |
| A genetic approach for the 2‐edge‐connected minimum branch vertices problem | 2024-01-18 | Paper |
| Quantifying outcome functions of linear programs: an approach based on interval-valued right-hand sides | 2024-01-08 | Paper |
| Grocery distribution plans in urban networks with street crossing penalties | 2023-12-11 | Paper |
| Shortest paths with exclusive-disjunction arc pairs conflicts | 2023-07-04 | Paper |
| An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading | 2023-05-09 | Paper |
| An iterative multiparametric approach for determining the location of AVI sensors for robust route flow estimation | 2022-03-09 | Paper |
| A reduction heuristic for the all-colors shortest path problem | 2021-07-27 | Paper |
| The generalized minimum branch vertices problem: properties and polyhedral analysis | 2021-06-15 | Paper |
| Minimum spanning tree with conflicting edge pairs: a branch-and-cut approach | 2021-05-05 | Paper |
| The knapsack problem with forfeits | 2021-02-04 | Paper |
| An Adaptive Heuristic Approach to Compute Upper and Lower Bounds for The Close-Enough Traveling Salesman Problem | 2021-02-01 | Paper |
| Contrasting the Spread of Misinformation in Online Social Networks | 2020-12-09 | Paper |
| Operations management in distribution networks within a smart city framework | 2019-09-25 | Paper |
| Exact approaches for the orderly colored longest path problem: performance comparison | 2018-12-03 | Paper |
| A two-level metaheuristic for the all colors shortest path problem | 2018-11-07 | Paper |
| The rainbow spanning forest problem | 2018-10-22 | Paper |
| A branch-and-cut algorithm for the minimum branch vertices spanning tree problem | 2018-07-11 | Paper |
| A novel discretization scheme for the close enough traveling salesman problem | 2018-07-11 | Paper |
| Carousel greedy: a generalized greedy algorithm with applications in optimization | 2018-07-11 | Paper |
| The set orienteering problem | 2018-05-30 | Paper |
| On the complexity of rainbow spanning forest problem | 2018-05-28 | Paper |
| The Rainbow Cycle Cover Problem | 2018-05-23 | Paper |
| Exact and heuristic approaches for the maximum lifetime problem in sensor networks with coverage and connectivity constraints | 2018-02-23 | Paper |
| Tactical Production and Lot Size Planning with Lifetime Constraints: A Comparison of Model Formulations | 2017-11-30 | Paper |
| An exact algorithm to extend lifetime through roles allocation in sensor networks with connectivity constraints | 2017-11-09 | Paper |
| Maximizing lifetime in wireless sensor networks with multiple sensor families | 2016-11-10 | Paper |
| Locating sensors to observe network arc flows: exact and heuristic approaches | 2016-11-10 | Paper |
| Vehicle-ID sensor location for route flow recognition: models and algorithms | 2016-10-06 | Paper |
| OMEGA one multi ethnic genetic approach | 2016-03-04 | Paper |
| Comparison of heuristics for the colourful travelling salesman problem | 2015-02-23 | Paper |
| Relations, models and a memetic approach for three degree-dependent spanning tree problems | 2015-02-18 | Paper |
| Lower and upper bounds for the spanning tree with minimum branch vertices | 2013-11-07 | Paper |
| A branch‐and‐bound algorithm for the double travelling salesman problem with two stacks | 2013-08-06 | Paper |
| Exact and heuristic methods to maximize network lifetime in wireless sensor networks with adjustable sensing ranges | 2012-12-29 | Paper |
| A Tabu Search Heuristic Based on k-Diamonds for the Weighted Feedback Vertex Set Problem | 2011-09-09 | Paper |
| Bounded-degree spanning tree problems: models and new algorithms | 2011-03-24 | Paper |
| A linear time algorithm for the minimum weighted feedback vertex set on diamonds | 2009-12-04 | Paper |
| The labeled maximum matching problem | 2009-02-12 | Paper |
| Efficient preflow push algorithms | 2008-02-22 | Paper |
| Heuristic approaches for the Minimum Labelling Hamiltonian Cycle Problem | 2007-05-29 | Paper |
| Minimum Weighted Feedback Vertex Set on Diamonds | 2007-05-29 | Paper |
| Shortest path auction algorithm without contractions using virtual source concept | 2003-12-04 | Paper |
| Graph collapsing in shortest path auction algorithms | 2001-12-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4527189 | 2001-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4945410 | 2000-06-07 | Paper |
| A multiplier adjustment technique for the capacitated concentrator location problem | 1999-07-27 | Paper |
| The auction technique for the sensor based navigation planning of an autonomous mobile robot | 1998-05-25 | Paper |
| A class of manpower scheduling problems | 1992-09-26 | Paper |
| Mean-variance approach to the management of cyclic deliveries | 1988-01-01 | Paper |
