| Publication | Date of Publication | Type |
|---|
On the periodic service scheduling problem with non-uniform demands
Computers & Operations Research | 2026-02-10 | Paper |
Hub location with congestion and time-sensitive demand
European Journal of Operational Research | 2024-07-02 | Paper |
Hub Location with Protection Under Interhub Link Failures
INFORMS Journal on Computing | 2024-03-22 | Paper |
Connected graph partitioning with aggregated and non‐aggregated gap objective functions
Networks | 2024-01-18 | Paper |
Reactive Grasp And Tabu Search Based Heuristics For The Single Source Capacitated Plant Location Problem
INFOR: Information Systems and Operational Research | 2023-04-21 | Paper |
| A bilevel approach for compensation and routing decisions in last-mile delivery | 2023-04-18 | Paper |
| On the (k,l)-anonymity of networks via their k-metric antidimension | 2023-04-03 | Paper |
Heuristic Solutions to the Facility Location Problem with General Bernoulli Demands
INFORMS Journal on Computing | 2020-11-09 | Paper |
On the fuzzy maximal covering location problem
European Journal of Operational Research | 2020-01-23 | Paper |
The Steiner traveling salesman problem and its extensions
European Journal of Operational Research | 2019-06-26 | Paper |
Location routing problems on trees
Discrete Applied Mathematics | 2019-03-28 | Paper |
New algorithmic framework for conditional value at risk: application to stochastic fixed-charge transportation
European Journal of Operational Research | 2019-03-28 | Paper |
Solving the optimum communication spanning tree problem
European Journal of Operational Research | 2018-10-30 | Paper |
Exact solution of hub network design problems with profits
European Journal of Operational Research | 2018-05-30 | Paper |
Ordered weighted average optimization in multiobjective spanning tree problem
European Journal of Operational Research | 2018-05-29 | Paper |
A branch-and-price algorithm for the aperiodic multi-period service scheduling problem
European Journal of Operational Research | 2018-02-06 | Paper |
The generalized arc routing problem
Top | 2018-01-05 | Paper |
Minimum spanning trees with neighborhoods: mathematical programming formulations and solution methods
European Journal of Operational Research | 2017-12-06 | Paper |
Multi-depot rural postman problems
Top | 2017-10-12 | Paper |
On the collaboration uncapacitated arc routing problem
Computers & Operations Research | 2016-11-17 | Paper |
Fix-and-relax-coordination for a multi-period location-allocation problem under uncertainty
Computers & Operations Research | 2016-11-10 | Paper |
The dynamic multiperiod vehicle routing problem with probabilistic information
Computers & Operations Research | 2016-11-10 | Paper |
A biased random-key genetic algorithm for the capacitated minimum spanning tree problem
Computers & Operations Research | 2016-11-10 | Paper |
| Minimum Spanning trees with Neighborhoods | 2016-11-09 | Paper |
Scheduling policies for multi-period services
European Journal of Operational Research | 2016-10-07 | Paper |
A novel model for arc territory design: promoting Eulerian districts
International Transactions in Operational Research | 2016-06-09 | Paper |
Hub location as the minimization of a supermodular set function
Operations Research | 2014-12-22 | Paper |
Ordered weighted average combinatorial optimization: formulations and their properties
Discrete Applied Mathematics | 2014-05-06 | Paper |
On discrete optimization with ordering
Annals of Operations Research | 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
European Journal of Operational Research | 2012-12-29 | Paper |
Multiperiod location-routing with decoupled time scales
European Journal of Operational Research | 2012-08-16 | Paper |
Branch and price for large-scale capacitated hub location problems with single assignment
INFORMS Journal on Computing | 2012-07-28 | Paper |
GEVA: geometric variability-based approaches for identifying patterns in data
Computational Statistics | 2011-04-06 | Paper |
A computational comparison of several models for the exact solution of the capacity and distance constrained plant location problem
Computers & Operations Research | 2011-03-25 | Paper |
A computational comparison of several formulations for the multi-period incremental service facility location problem
Top | 2010-12-13 | Paper |
The single period coverage facility location problem: Lagrangean heuristic and column generation approaches
Top | 2010-12-13 | Paper |
Lagrangean bounds for the optimum communication spanning tree problem
Top | 2010-12-13 | Paper |
A novel maximum dispersion territory design model arising in the implementation of the WEEE-directive
The Journal of the Operational Research Society | 2010-10-14 | Paper |
Lagrangean duals and exact solution to the capacitated \(p\)-center problem
European Journal of Operational Research | 2009-12-10 | Paper |
Solving the prize-collecting rural postman problem
European Journal of Operational Research | 2009-12-07 | Paper |
The tree of hubs location problem
European Journal of Operational Research | 2009-11-23 | Paper |
Tight bounds from a path based formulation for the tree of hub location problem
Computers & Operations Research | 2009-08-14 | Paper |
On the Undirected Rural Postman Problem: Tight Bounds Based on a New Formulation
Operations Research | 2009-07-05 | Paper |
Lagrangean relaxation for the capacitated hub location problem with single assignment
OR Spectrum | 2009-06-30 | Paper |
The multi-period incremental service facility location problem
Computers & Operations Research | 2008-12-17 | Paper |
A reactive GRASP for a commercial territory design problem with multiple balancing requirements
Computers & Operations Research | 2008-11-20 | Paper |
The capacity and distance constrained plant location problem
Computers & Operations Research | 2008-11-07 | Paper |
Solving an urban waste collection problem using ants heuristics
Computers & Operations Research | 2008-03-11 | Paper |
| Clapper: a clustering algorithm based on path-distances for experimental replicates | 2008-01-18 | Paper |
The \(k\)-centrum shortest path problem
Top | 2007-08-08 | Paper |
Heuristic and lower bound for a stochastic location-routing problem
European Journal of Operational Research | 2007-02-12 | Paper |
Privatized rural postman problems
Computers & Operations Research | 2006-06-30 | Paper |
Exact solutions to a class of stochastic generalized assignment problems
European Journal of Operational Research | 2006-06-30 | Paper |
Filtering policies in loss queueing network location problems
Annals of Operations Research | 2006-03-09 | Paper |
Hybrid scatter search and path relinking for the capacitated \(p\)-median problem
European Journal of Operational Research | 2005-10-26 | Paper |
GRASP for seam drawing in mosaicking of aerial photographic maps
Journal of Heuristics | 2005-10-13 | Paper |
| scientific article; zbMATH DE number 2144390 (Why is no real title available?) | 2005-03-14 | Paper |
A Branch-and-Price algorithm for the Single Source Capacitated Plant Location Problem
The Journal of the Operational Research Society | 2005-03-14 | Paper |
Even cycles and perfect matching problems with side constraints
Journal of Combinatorial Optimization | 2004-11-22 | Paper |
A compact model and tight bounds for a combined location-routing problem
Computers & Operations Research | 2004-11-19 | Paper |
Multiobjective solution of the uncapacitated plant location problem
European Journal of Operational Research | 2003-04-10 | Paper |
The stochastic generalised assignment problem with Bernoulli demands
Top | 2002-04-11 | Paper |
Mosaicking of aerial photographic maps via seams defined by bottleneck shortest paths
Operations Research | 2002-03-18 | Paper |
A tabu search heuristic for the generalized assignment problem
European Journal of Operational Research | 2002-03-12 | Paper |
Partial cover and complete cover inequalities
Operations Research Letters | 1995-11-23 | Paper |
Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem
European Journal of Operational Research | 1991-01-01 | Paper |
Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing
OR Spektrum | 1990-01-01 | Paper |
Hub location with congestion and time-sensitive demand
(available as arXiv preprint) | N/A | Paper |
