default search action
Alfredo Marín 0001
Person information
- affiliation: University of Murcia, Department of Statistics and Operations Research, Spain
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
- [j52]Víctor Blanco
, Alfredo Marín, Justo Puerto
Intra-facility equity in discrete and continuous p-facility location problems. Comput. Oper. Res. 162: 106487 (2024) - 2023
- [j51]Emilio Carrizosa, Kseniia Kurishchenko
On clustering and interpreting with rules by means of mathematical optimization. Comput. Oper. Res. 154: 106180 (2023) - [j50]Inmaculada Espejo, Alfredo Marín, Juan Manuel Muñoz-Ocaña
A new formulation and branch-and-cut method for single-allocation hub location problems. Comput. Oper. Res. 155: 106241 (2023) - [j49]Inmaculada Espejo, Alfredo Marín:
The p-median problem with upgrading of transportation costs and minimum travel time allocation. Comput. Oper. Res. 159: 106354 (2023) - [j48]Yolanda Hinojosa
Dynamically second-preferred p-center problem. Eur. J. Oper. Res. 307(1): 33-47 (2023) - 2022
- [j47]Concepción Domínguez
Mixed-integer formulations for the Capacitated Rank Pricing Problem with envy. Comput. Oper. Res. 140: 105664 (2022) - [j46]Marta Baldomero-Naranjo
Upgrading edges in the maximal covering location problem. Eur. J. Oper. Res. 303(1): 14-36 (2022) - [j45]Alfredo Marín, Luisa I. Martínez-Merino
The soft-margin Support Vector Machine with ordered weighted average. Knowl. Based Syst. 237: 107705 (2022) - 2021
- [j44]Alfredo Marín, Mercedes Pelegrín:
The double-assignment plant location problem with co-location. Comput. Oper. Res. 126: 105059 (2021) - [j43]Martine Labbé, Alfredo Marín, Mercedes Pelegrín:
Finding the root graph through minimum edge deletion. Eur. J. Oper. Res. 289(1): 59-74 (2021) - [j42]Concepción Domínguez
The rank pricing problem with ties. Eur. J. Oper. Res. 294(2): 492-506 (2021) - 2020
- [j41]Alfredo Marín, Diego Ponce
A fresh view on the Discrete Ordered Median Problem based on partial monotonicity. Eur. J. Oper. Res. 286(3): 839-848 (2020) - [j40]Emilio Carrizosa
Spotting Key Members in Networks: Clustering-Embedded Eigenvector Centrality. IEEE Syst. J. 14(3): 3916-3925 (2020) - 2019
- [j39]Víctor Blanco
Upgrading nodes in tree-shaped hub location. Comput. Oper. Res. 102: 75-90 (2019) - [j38]Alfredo Marín, Mercedes Pelegrín-García:
Adding incompatibilities to the Simple Plant Location Problem: Formulation, facets and computational experience. Comput. Oper. Res. 104: 174-190 (2019) - [j37]Herminia I. Calvete
The rank pricing problem: Models and branch-and-cut algorithms. Comput. Oper. Res. 105: 12-31 (2019) - [j36]Maria Albareda-Sambola
Reformulated acyclic partitioning for rail-rail containers transshipment. Eur. J. Oper. Res. 277(1): 153-165 (2019) - [j35]Mercedes Landete
Locating switches. Expert Syst. Appl. 136: 338-352 (2019) - [j34]Alfredo Marín, Mercedes Pelegrín:
A new lifting theorem for vertex packing. Optim. Lett. 13(6): 1299-1312 (2019) - 2018
- [j33]Alfredo Marín
Multi-period stochastic covering location problems: Modeling framework and solution approach. Eur. J. Oper. Res. 268(2): 432-449 (2018) - [j32]Alfredo Marín
Towards unambiguous map labeling - Integer programming approach and heuristic algorithm. Expert Syst. Appl. 98: 221-241 (2018) - 2017
- [j31]Mercedes Landete
Decomposition methods based on articulation vertices for degree-dependent spanning tree problems. Comput. Optim. Appl. 68(3): 749-773 (2017) - 2016
- [j30]Juana López Redondo
A parallelized Lagrangean relaxation approach for the discrete ordered median problem. Ann. Oper. Res. 246(1-2): 253-272 (2016) - [j29]Maria Barbati
Balancing the arrival times of users in a two-stage location problem. Ann. Oper. Res. 246(1-2): 273-288 (2016) - 2015
- [j28]Maria Albareda-Sambola
When centers can fail: A close second opportunity. Comput. Oper. Res. 62: 145-156 (2015) - [j27]Alfredo Marín
Exact and heuristic solutions for the Minimum Number of Branch Vertices Spanning Tree Problem. Eur. J. Oper. Res. 245(3): 680-689 (2015) - [j26]Inmaculada Espejo
Capacitated p-center problem with failure foresight. Eur. J. Oper. Res. 247(1): 229-244 (2015) - 2014
- [j25]Mercedes Landete
Looking for edge-equitable spanning trees. Comput. Oper. Res. 41: 44-52 (2014) - 2012
- [j24]Inmaculada Espejo
Closest assignment constraints in discrete location problems. Eur. J. Oper. Res. 219(1): 49-58 (2012) - [j23]Sergio García
New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem. Eur. J. Oper. Res. 220(1): 48-57 (2012) - 2011
- [j22]Alfredo Marín
The discrete facility location problem with balanced allocation of customers. Eur. J. Oper. Res. 210(1): 27-38 (2011) - [j21]Sergio García
Solving Large p-Median Problems with a Radius Formulation. INFORMS J. Comput. 23(4): 546-556 (2011) - 2010
- [j20]Iván A. Contreras
The Tree of Hubs Location Problem. Eur. J. Oper. Res. 202(2): 390-400 (2010) - [j19]Alfredo Marín
An extended covering model for flexible discrete and equity location problems. Math. Methods Oper. Res. 71(1): 125-163 (2010) - 2009
- [j18]Mercedes Landete
New facets for the two-stage uncapacitated facility location polytope. Comput. Optim. Appl. 44(3): 487-519 (2009) - [j17]Inmaculada Espejo
A comparison of formulations and solution methods for the minimum-envy location problem. Comput. Oper. Res. 36(6): 1966-1981 (2009) - [j16]Iván A. Contreras
Tight bounds from a path based formulation for the tree of hub location problem. Comput. Oper. Res. 36(12): 3117-3127 (2009) - [j15]Alfredo Marín
A flexible model and efficient solution strategies for discrete location problems. Discret. Appl. Math. 157(5): 1128-1145 (2009) - [j14]Laureano F. Escudero
A branch-and-cut algorithm for the Winner Determination Problem. Decis. Support Syst. 46(3): 649-659 (2009) - 2008
- [j13]S. Arifusalem, Stefano Benati
New trends in locational analysis. Comput. Oper. Res. 35(3): 649-650 (2008) - 2007
- [j12]Lázaro Cánovas, Sergio García
Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique. Eur. J. Oper. Res. 179(3): 990-1007 (2007) - [j11]Alfredo Marín
Lower bounds for the two-stage uncapacitated facility location problem. Eur. J. Oper. Res. 179(3): 1126-1142 (2007) - [j10]Lázaro Cánovas, Sergio García
A strengthened formulation for the simple plant location problem with order. Oper. Res. Lett. 35(2): 141-150 (2007) - 2006
- [j9]Alfredo Marín
New formulations for the uncapacitated multiple allocation hub location problem. Eur. J. Oper. Res. 172(1): 274-292 (2006) - 2005
- [j8]Alfredo Marín
Formulating and solving splittable capacitated multiple allocation hub location problems. Comput. Oper. Res. 32: 3093-3109 (2005) - [j7]Alfredo Marín
Uncapacitated Euclidean Hub Location: Strengthened Formulation, New Facets and a Relax-and-cut Algorithm. J. Glob. Optim. 33(3): 393-422 (2005) - 2002
- [j6]Lázaro Cánovas, Mercedes Landete
On the facets of the simple plant location packing polytope. Discret. Appl. Math. 124(1-3): 27-53 (2002) - [j5]Lázaro Cánovas, Roberto Cañavate, Alfredo Marín
On the convergence of the Weiszfeld algorithm. Math. Program. 93(2): 327-330 (2002) - [j4]Lázaro Cánovas, Mercedes Landete
Facet Obtaining Procedures for Set Packing Problems. SIAM J. Discret. Math. 16(1): 127-155 (2002) - 2000
- [j3]Lázaro Cánovas, Mercedes Landete
New facets for the set packing polytope. Oper. Res. Lett. 27(4): 153-161 (2000) - 1999
- [j2]Alfredo Marín, Blas Pelegrín:
Applying Lagrangian relaxation to the resolution of two-stage location problems. Ann. Oper. Res. 86: 179-198 (1999) - 1997
- [j1]Alfredo Marín
A branch-and-bound algorithm for the transportation problem with location of p transshipment points. Comput. Oper. Res. 24(7): 659-678 (1997)
Conference and Workshop Papers
- 2005
- [c1]Alfredo Marín, Stefan Nickel, Justo Puerto, Sebastian Velten:
A Flexible Model and Efficient Solution Strategies for Discrete Location Problems. OR 2005: 349-354
Informal and Other Publications
- 2018
- [i1]Víctor Blanco, Alfredo Marín:
Upgrading nodes in tree-shaped hub location. CoRR abs/1802.05252 (2018)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-30 20:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: