Inmaculada Espejo

Orcid: 0000-0002-8905-7825

According to our database1, Inmaculada Espejo authored at least 15 papers between 2009 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Facility location problems on graphs with non-convex neighborhoods.
Comput. Oper. Res., November, 2023

The p-median problem with upgrading of transportation costs and minimum travel time allocation.
Comput. Oper. Res., November, 2023

A new formulation and branch-and-cut method for single-allocation hub location problems.
Comput. Oper. Res., July, 2023

2022
Minimum cost b-matching problems with neighborhoods.
Comput. Optim. Appl., 2022

2021
A comparative study of different formulations for the capacitated discrete ordered median problem.
Comput. Oper. Res., 2021

2020
Proceedings of the IX International Workshop on Locational Analysis and Related Problems.
CoRR, 2020

Proceedings of the VIII International Workshop on Locational Analysis and Related Problems.
CoRR, 2020

2015
Capacitated p-center problem with failure foresight.
Eur. J. Oper. Res., 2015

2013
Accelerating convergence in minisum location problem with ℓ<sub><i>p</i></sub>ℓp norms.
Comput. Oper. Res., 2013

2012
Closest assignment constraints in discrete location problems.
Eur. J. Oper. Res., 2012

Corrigendum to "Simultaneous location of a service facility and a rapid transit line" [Computers & Operations Research 38(2) (2011) 525-538].
Comput. Oper. Res., 2012

2011
Simultaneous location of a service facility and a rapid transit line.
Comput. Oper. Res., 2011

2010
On solving the planar k-centrum problem with Euclidean distances.
Eur. J. Oper. Res., 2010

2009
Convex ordered median problem with <i>l</i><sub>p</sub>-norms.
Comput. Oper. Res., 2009

A comparison of formulations and solution methods for the minimum-envy location problem.
Comput. Oper. Res., 2009


  Loading...