The following pages link to Alfredo Marín (Q170037):
Displayed 50 items.
- Exact and heuristic solutions for the minimum number of branch vertices spanning tree problem (Q319657) (← links)
- Capacitated \(p\)-center problem with failure foresight (Q319964) (← links)
- Looking for edge-equitable spanning trees (Q336753) (← links)
- When centers can fail: a close second opportunity (Q337641) (← links)
- Closest assignment constraints in discrete location problems (Q439609) (← links)
- A parallelized lagrangean relaxation approach for the discrete ordered median problem (Q512991) (← links)
- Lagrangean bounds for the optimum communication spanning tree problem (Q611003) (← links)
- Discrete location for bundled demand points (Q611011) (← links)
- The discrete facility location problem with balanced allocation of customers (Q631097) (← links)
- Uncapacitated Euclidean hub location: strengthened formulation, new facets and a relax-and-cut algorithm (Q811891) (← links)
- New formulations for the uncapacitated multiple allocation hub location problem (Q818098) (← links)
- Tight bounds from a path based formulation for the tree of hub location problem (Q833527) (← links)
- Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique (Q864018) (← links)
- Lower bounds for the two-stage uncapacitated facility location problem (Q864032) (← links)
- A comparison of formulations and solution methods for the minimum-envy location problem (Q1000990) (← links)
- A flexible model and efficient solution strategies for discrete location problems (Q1028444) (← links)
- The tree of hubs location problem (Q1039782) (← links)
- Applying Lagrangian relaxation to the resolution of two-stage location problems (Q1290141) (← links)
- The return plant location problem: Modelling and resolution (Q1291663) (← links)
- A branch-and-bound algorithm for the transportation problem with location of \(p\) transshipment points (Q1362973) (← links)
- On the convergence of the Weiszfeld algorithm (Q1396220) (← links)
- Upgrading nodes in tree-shaped hub location (Q1628119) (← links)
- Decomposition methods based on articulation vertices for degree-dependent spanning tree problems (Q1694405) (← links)
- The rank pricing problem: models and branch-and-cut algorithms (Q1722958) (← links)
- Reformulated acyclic partitioning for rail-rail containers transshipment (Q1735174) (← links)
- Multi-period stochastic covering location problems: modeling framework and solution approach (Q1754338) (← links)
- On the facets of the simple plant location packing polytope (Q1850113) (← links)
- New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem (Q1926700) (← links)
- The double-assignment plant location problem with co-location (Q2026959) (← links)
- Finding the root graph through minimum edge deletion (Q2028798) (← links)
- A fresh view on the discrete ordered median problem based on partial monotonicity (Q2189878) (← links)
- The rank pricing problem with ties (Q2239986) (← links)
- A new lifting theorem for vertex packing (Q2329651) (← links)
- An extended covering model for flexible discrete and equity location problems (Q2379187) (← links)
- Formulating and solving splittable capacitated multiple allocation hub location problems (Q2387295) (← links)
- Lexicographical order in integer programming (Q2405486) (← links)
- A strengthened formulation for the simple plant location problem with order (Q2643785) (← links)
- New facets for the two-stage uncapacitated facility location polytope (Q2655408) (← links)
- Mixed-integer formulations for the capacitated rank pricing problem with envy (Q2669780) (← links)
- Upgrading edges in the maximal covering location problem (Q2673553) (← links)
- Solving Large <i>p</i>-Median Problems with a Radius Formulation (Q2899146) (← links)
- (Q3416572) (← links)
- Facet Obtaining Procedures for Set Packing Problems (Q4443075) (← links)
- New facets for the set packing polytope (Q5929145) (← links)
- Extreme points of discrete location polyhedra (Q5945254) (← links)
- A Heuristic Procedure For Path Location With Multisource Demand (Q6039330) (← links)
- The \(p\)-median problem with upgrading of transportation costs and minimum travel time allocation (Q6047913) (← links)
- Dynamically second-preferred \(p\)-center problem (Q6106963) (← links)
- On clustering and interpreting with rules by means of mathematical optimization (Q6109555) (← links)
- A new formulation and branch-and-cut method for single-allocation hub location problems (Q6164619) (← links)