| Publication | Date of Publication | Type |
|---|
| Hub Location with Protection Under Interhub Link Failures | 2024-03-22 | Paper |
| Connected graph partitioning with aggregated and non‐aggregated gap objective functions | 2024-01-18 | Paper |
| Reactive Grasp And Tabu Search Based Heuristics For The Single Source Capacitated Plant Location Problem | 2023-04-21 | Paper |
| Heuristic Solutions to the Facility Location Problem with General Bernoulli Demands | 2020-11-09 | Paper |
| On the fuzzy maximal covering location problem | 2020-01-23 | Paper |
| The Steiner traveling salesman problem and its extensions | 2019-06-26 | Paper |
| New algorithmic framework for conditional value at risk: application to stochastic fixed-charge transportation | 2019-03-28 | Paper |
| Location routing problems on trees | 2019-03-28 | Paper |
| Solving the optimum communication spanning tree problem | 2018-10-30 | Paper |
| Exact solution of hub network design problems with profits | 2018-05-30 | Paper |
| Ordered weighted average optimization in multiobjective spanning tree problem | 2018-05-29 | Paper |
| A branch-and-price algorithm for the aperiodic multi-period service scheduling problem | 2018-02-06 | Paper |
| The generalized arc routing problem | 2018-01-05 | Paper |
| Minimum spanning trees with neighborhoods: mathematical programming formulations and solution methods | 2017-12-06 | Paper |
| Multi-depot rural postman problems | 2017-10-12 | Paper |
| Fix-and-relax-coordination for a multi-period location-allocation problem under uncertainty | 2016-11-10 | Paper |
| The dynamic multiperiod vehicle routing problem with probabilistic information | 2016-11-10 | Paper |
| A biased random-key genetic algorithm for the capacitated minimum spanning tree problem | 2016-11-10 | Paper |
| Minimum Spanning trees with Neighborhoods | 2016-11-09 | Paper |
| Scheduling policies for multi-period services | 2016-10-07 | Paper |
| A novel model for arc territory design: promoting Eulerian districts | 2016-06-09 | Paper |
| Hub Location as the Minimization of a Supermodular Set Function | 2014-12-22 | Paper |
| Ordered weighted average combinatorial optimization: formulations and their properties | 2014-05-06 | Paper |
| On discrete optimization with ordering | 2013-09-16 | Paper |
| A modeling framework for Ordered Weighted Average Combinatorial Optimization | 2013-06-06 | Paper |
| General network design: a unified view of combined location and network design problems | 2012-12-29 | Paper |
| Multiperiod location-routing with decoupled time scales | 2012-08-16 | Paper |
| Branch and Price for Large-Scale Capacitated Hub Location Problems with Single Assignment | 2012-07-28 | Paper |
| GEVA: geometric variability-based approaches for identifying patterns in data | 2011-04-06 | Paper |
| A computational comparison of several models for the exact solution of the capacity and distance constrained plant location problem | 2011-03-25 | Paper |
| The single period coverage facility location problem: Lagrangean heuristic and column generation approaches | 2010-12-13 | Paper |
| A computational comparison of several formulations for the multi-period incremental service facility location problem | 2010-12-13 | Paper |
| Lagrangean bounds for the optimum communication spanning tree problem | 2010-12-13 | Paper |
| A novel maximum dispersion territory design model arising in the implementation of the WEEE-directive | 2010-10-14 | Paper |
| Lagrangean duals and exact solution to the capacitated \(p\)-center problem | 2009-12-10 | Paper |
| Solving the prize-collecting rural postman problem | 2009-12-07 | Paper |
| The tree of hubs location problem | 2009-11-23 | Paper |
| Tight bounds from a path based formulation for the tree of hub location problem | 2009-08-14 | Paper |
| On the Undirected Rural Postman Problem: Tight Bounds Based on a New Formulation | 2009-07-05 | Paper |
| Lagrangean relaxation for the capacitated hub location problem with single assignment | 2009-06-30 | Paper |
| The multi-period incremental service facility location problem | 2008-12-17 | Paper |
| A reactive GRASP for a commercial territory design problem with multiple balancing requirements | 2008-11-20 | Paper |
| The capacity and distance constrained plant location problem | 2008-11-07 | Paper |
| Solving an urban waste collection problem using ants heuristics | 2008-03-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5437344 | 2008-01-18 | Paper |
| The \(k\)-centrum shortest path problem | 2007-08-08 | Paper |
| Heuristic and lower bound for a stochastic location-routing problem | 2007-02-12 | Paper |
| Privatized rural postman problems | 2006-06-30 | Paper |
| Exact solutions to a class of stochastic generalized assignment problems | 2006-06-30 | Paper |
| Filtering policies in loss queueing network location problems | 2006-03-09 | Paper |
| Hybrid scatter search and path relinking for the capacitated \(p\)-median problem | 2005-10-26 | Paper |
| GRASP for seam drawing in mosaicking of aerial photographic maps | 2005-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4656643 | 2005-03-14 | Paper |
| A Branch-and-Price algorithm for the Single Source Capacitated Plant Location Problem | 2005-03-14 | Paper |
| Even cycles and perfect matching problems with side constraints | 2004-11-22 | Paper |
| A compact model and tight bounds for a combined location-routing problem | 2004-11-19 | Paper |
| Multiobjective solution of the uncapacitated plant location problem | 2003-04-10 | Paper |
| The stochastic generalised assignment problem with Bernoulli demands | 2002-04-11 | Paper |
| Mosaicking of Aerial Photographic Maps Via Seams Defined by Bottleneck Shortest Paths | 2002-03-18 | Paper |
| A tabu search heuristic for the generalized assignment problem | 2002-03-12 | Paper |
| Partial cover and complete cover inequalities | 1995-11-23 | Paper |
| Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem | 1991-01-01 | Paper |
| Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing | 1990-01-01 | Paper |
