Alfredo Marín

From MaRDI portal
Person:170037

Available identifiers

zbMath Open marin.alfredoMaRDI QIDQ170037

List of research outcomes

PublicationDate of PublicationType
The \(p\)-median problem with upgrading of transportation costs and minimum travel time allocation2023-09-13Paper
On clustering and interpreting with rules by means of mathematical optimization2023-07-04Paper
A new formulation and branch-and-cut method for single-allocation hub location problems2023-07-04Paper
Dynamically second-preferred \(p\)-center problem2023-07-03Paper
A Heuristic Procedure For Path Location With Multisource Demand2023-05-05Paper
Upgrading edges in the maximal covering location problem2022-06-10Paper
Mixed-integer formulations for the capacitated rank pricing problem with envy2022-03-09Paper
The rank pricing problem with ties2021-11-05Paper
Finding the root graph through minimum edge deletion2021-06-03Paper
The double-assignment plant location problem with co-location2021-05-21Paper
A fresh view on the discrete ordered median problem based on partial monotonicity2020-06-17Paper
A new lifting theorem for vertex packing2019-10-18Paper
Reformulated acyclic partitioning for rail-rail containers transshipment2019-03-28Paper
The rank pricing problem: models and branch-and-cut algorithms2019-02-19Paper
Upgrading nodes in tree-shaped hub location2018-12-03Paper
Multi-period stochastic covering location problems: modeling framework and solution approach2018-05-30Paper
Decomposition methods based on articulation vertices for degree-dependent spanning tree problems2018-02-01Paper
Lexicographical order in integer programming2017-09-25Paper
A parallelized lagrangean relaxation approach for the discrete ordered median problem2017-03-03Paper
Looking for edge-equitable spanning trees2016-11-10Paper
When centers can fail: a close second opportunity2016-11-10Paper
Exact and heuristic solutions for the minimum number of branch vertices spanning tree problem2016-10-06Paper
Capacitated \(p\)-center problem with failure foresight2016-10-06Paper
New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem2012-12-29Paper
Closest assignment constraints in discrete location problems2012-08-16Paper
Solving Large p-Median Problems with a Radius Formulation2012-07-28Paper
The discrete facility location problem with balanced allocation of customers2011-03-22Paper
Lagrangean bounds for the optimum communication spanning tree problem2010-12-13Paper
Discrete location for bundled demand points2010-12-13Paper
An extended covering model for flexible discrete and equity location problems2010-03-19Paper
New facets for the two-stage uncapacitated facility location polytope2010-01-25Paper
The tree of hubs location problem2009-11-23Paper
Tight bounds from a path based formulation for the tree of hub location problem2009-08-14Paper
A flexible model and efficient solution strategies for discrete location problems2009-06-30Paper
A comparison of formulations and solution methods for the minimum-envy location problem2009-02-12Paper
A strengthened formulation for the simple plant location problem with order2007-08-27Paper
Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique2007-02-12Paper
Lower bounds for the two-stage uncapacitated facility location problem2007-02-12Paper
https://portal.mardi4nfdi.de/entity/Q34165722007-01-22Paper
New formulations for the uncapacitated multiple allocation hub location problem2006-03-24Paper
Uncapacitated Euclidean hub location: strengthened formulation, new facets and a relax-and-cut algorithm2006-01-23Paper
Formulating and solving splittable capacitated multiple allocation hub location problems2005-09-02Paper
Facet Obtaining Procedures for Set Packing Problems2004-01-08Paper
On the facets of the simple plant location packing polytope2002-12-02Paper
On the convergence of the Weiszfeld algorithm2002-01-01Paper
Extreme points of discrete location polyhedra2001-10-10Paper
The return plant location problem: Modelling and resolution2001-02-22Paper
New facets for the set packing polytope2000-01-01Paper
Applying Lagrangian relaxation to the resolution of two-stage location problems1999-06-10Paper
A branch-and-bound algorithm for the transportation problem with location of \(p\) transshipment points1997-08-07Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Alfredo Marín