Alfredo Marín - Citegraph

Author Info

Name	Affiliation	Papers
ALFREDO MARÍN	Departamento de Estadística e Investigación Operativa, Facultad de Matemáticas, Campus de Espinardo, Universidad de Murcia, Murcia, Spain	43
Collaborators	Citations	PageRank
62	453	32.98
Referers	Referees	References
518	491	440

Search Limit

100518

Publications (43 rows)

Collaborators (62 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Upgrading edges in the maximal covering location problem	0	0.34	2022
The soft-margin Support Vector Machine with ordered weighted average	0	0.34	2022
Finding the root graph through minimum edge deletion	0	0.34	2021
The rank pricing problem with ties	0	0.34	2021
The Double-Assignment Plant Location Problem With Co-Location	0	0.34	2021
Upgrading nodes in tree-shaped hub location.	0	0.34	2019
Reformulated acyclic partitioning for rail-rail containers transshipment.	0	0.34	2019
The rank pricing problem: Models and branch-and-cut algorithms.	0	0.34	2019
A new lifting theorem for vertex packing	1	0.37	2019
Adding incompatibilities to the Simple Plant Location Problem: Formulation, facets and computational experience.	0	0.34	2019
Towards unambiguous map labeling - Integer programming approach and heuristic algorithm.	2	0.37	2018
Multi-period stochastic covering location problems: Modeling framework and solution approach.	2	0.40	2018
Decomposition methods based on articulation vertices for degree-dependent spanning tree problems.	2	0.38	2017
Balancing the arrival times of users in a two-stage location problem	1	0.36	2016
A parallelized Lagrangean relaxation approach for the discrete ordered median problem	0	0.34	2016
Capacitated p-center problem with failure foresight.	4	0.42	2015
When centers can fail: A close second opportunity	2	0.39	2015
Exact and heuristic solutions for the Minimum Number of Branch Vertices Spanning Tree Problem.	5	0.48	2015
Looking for edge-equitable spanning trees	6	0.48	2014
Closest assignment constraints in discrete location problems.	19	0.85	2012
New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem.	10	0.57	2012
The discrete facility location problem with balanced allocation of customers	16	0.79	2011
Solving Large p-Median Problems with a Radius Formulation	34	2.28	2011
The Tree of Hubs Location Problem	39	1.29	2010
An extended covering model for flexible discrete and equity location problems	13	0.71	2010
Tight bounds from a path based formulation for the tree of hub location problem	25	0.89	2009
A branch-and-cut algorithm for the Winner Determination Problem	14	0.60	2009
New facets for the two-stage uncapacitated facility location polytope	10	0.51	2009
A flexible model and efficient solution strategies for discrete location problems	20	0.94	2009
A comparison of formulations and solution methods for the minimum-envy location problem	14	0.81	2009
New trends in locational analysis	0	0.34	2008
Lower bounds for the two-stage uncapacitated facility location problem	15	0.86	2007
Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique	24	1.41	2007
A strengthened formulation for the simple plant location problem with order	20	1.23	2007
New formulations for the uncapacitated multiple allocation hub location problem	39	1.88	2006
Uncapacitated Euclidean Hub Location: Strengthened Formulation, New Facets and a Relax-and-cut Algorithm	15	0.94	2005
Formulating and solving splittable capacitated multiple allocation hub location problems	22	1.03	2005
On the convergence of the Weiszfeld algorithm	11	3.03	2002
Facet Obtaining Procedures for Set Packing Problems	11	0.69	2002
On the facets of the simple plant location packing polytope	14	0.97	2002
New facets for the set packing polytope	15	1.08	2000
Applying Lagrangian relaxation to the resolution of two‐stage location problems	21	1.43	1999
A branch-and-bound algorithm for the transportation problem with location of p transshipment points	7	0.82	1997