| Publication | Date of Publication | Type |
|---|
The \(p\)-median problem with upgrading of transportation costs and minimum travel time allocation
Computers & Operations Research | 2023-09-13 | Paper |
A new formulation and branch-and-cut method for single-allocation hub location problems
Computers & Operations Research | 2023-07-04 | Paper |
On clustering and interpreting with rules by means of mathematical optimization
Computers & Operations Research | 2023-07-04 | Paper |
Dynamically second-preferred \(p\)-center problem
European Journal of Operational Research | 2023-07-03 | Paper |
A Heuristic Procedure For Path Location With Multisource Demand
INFOR: Information Systems and Operational Research | 2023-05-05 | Paper |
Intra-facility equity in discrete and continuous $p$-facility location problems
| 2022-12-06 | Paper |
Upgrading edges in the maximal covering location problem
European Journal of Operational Research | 2022-06-10 | Paper |
Mixed-integer formulations for the capacitated rank pricing problem with envy
Computers & Operations Research | 2022-03-09 | Paper |
The rank pricing problem with ties
European Journal of Operational Research | 2021-11-05 | Paper |
The soft-margin Support Vector Machine with ordered weighted average
| 2021-07-14 | Paper |
Finding the root graph through minimum edge deletion
European Journal of Operational Research | 2021-06-03 | Paper |
The double-assignment plant location problem with co-location
Computers & Operations Research | 2021-05-21 | Paper |
A fresh view on the discrete ordered median problem based on partial monotonicity
European Journal of Operational Research | 2020-06-17 | Paper |
A new lifting theorem for vertex packing
Optimization Letters | 2019-10-18 | Paper |
Reformulated acyclic partitioning for rail-rail containers transshipment
European Journal of Operational Research | 2019-03-28 | Paper |
The rank pricing problem: models and branch-and-cut algorithms
Computers & Operations Research | 2019-02-19 | Paper |
Upgrading nodes in tree-shaped hub location
Computers & Operations Research | 2018-12-03 | Paper |
Multi-period stochastic covering location problems: modeling framework and solution approach
European Journal of Operational Research | 2018-05-30 | Paper |
Decomposition methods based on articulation vertices for degree-dependent spanning tree problems
Computational Optimization and Applications | 2018-02-01 | Paper |
Lexicographical order in integer programming
Vietnam Journal of Mathematics | 2017-09-25 | Paper |
A parallelized lagrangean relaxation approach for the discrete ordered median problem
Annals of Operations Research | 2017-03-03 | Paper |
Looking for edge-equitable spanning trees
Computers & Operations Research | 2016-11-10 | Paper |
When centers can fail: a close second opportunity
Computers & Operations Research | 2016-11-10 | Paper |
Exact and heuristic solutions for the minimum number of branch vertices spanning tree problem
European Journal of Operational Research | 2016-10-06 | Paper |
Capacitated \(p\)-center problem with failure foresight
European Journal of Operational Research | 2016-10-06 | Paper |
New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem
European Journal of Operational Research | 2012-12-29 | Paper |
Closest assignment constraints in discrete location problems
European Journal of Operational Research | 2012-08-16 | Paper |
Solving large \(p\)-median problems with a radius formulation
INFORMS Journal on Computing | 2012-07-28 | Paper |
The discrete facility location problem with balanced allocation of customers
European Journal of Operational Research | 2011-03-22 | Paper |
Lagrangean bounds for the optimum communication spanning tree problem
Top | 2010-12-13 | Paper |
Discrete location for bundled demand points
Top | 2010-12-13 | Paper |
An extended covering model for flexible discrete and equity location problems
Mathematical Methods of Operations Research | 2010-03-19 | Paper |
New facets for the two-stage uncapacitated facility location polytope
Computational Optimization and Applications | 2010-01-25 | Paper |
The tree of hubs location problem
European Journal of Operational Research | 2009-11-23 | Paper |
Tight bounds from a path based formulation for the tree of hub location problem
Computers & Operations Research | 2009-08-14 | Paper |
A flexible model and efficient solution strategies for discrete location problems
Discrete Applied Mathematics | 2009-06-30 | Paper |
A comparison of formulations and solution methods for the minimum-envy location problem
Computers & Operations Research | 2009-02-12 | Paper |
A strengthened formulation for the simple plant location problem with order
Operations Research Letters | 2007-08-27 | Paper |
Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique
European Journal of Operational Research | 2007-02-12 | Paper |
Lower bounds for the two-stage uncapacitated facility location problem
European Journal of Operational Research | 2007-02-12 | Paper |
A flexible model and efficient solution strategies for discrete location problems
| 2007-01-22 | Paper |
New formulations for the uncapacitated multiple allocation hub location problem
European Journal of Operational Research | 2006-03-24 | Paper |
Uncapacitated Euclidean hub location: strengthened formulation, new facets and a relax-and-cut algorithm
Journal of Global Optimization | 2006-01-23 | Paper |
Formulating and solving splittable capacitated multiple allocation hub location problems
Computers & Operations Research | 2005-09-02 | Paper |
Facet Obtaining Procedures for Set Packing Problems
SIAM Journal on Discrete Mathematics | 2004-01-08 | Paper |
On the facets of the simple plant location packing polytope
Discrete Applied Mathematics | 2002-12-02 | Paper |
On the convergence of the Weiszfeld algorithm
Mathematical Programming. Series A. Series B | 2002-01-01 | Paper |
Extreme points of discrete location polyhedra
Top | 2001-10-10 | Paper |
The return plant location problem: Modelling and resolution
European Journal of Operational Research | 2001-02-22 | Paper |
New facets for the set packing polytope
Operations Research Letters | 2000-01-01 | Paper |
Applying Lagrangian relaxation to the resolution of two-stage location problems
Annals of Operations Research | 1999-06-10 | Paper |
A branch-and-bound algorithm for the transportation problem with location of \(p\) transshipment points
Computers & Operations Research | 1997-08-07 | Paper |
Multi-period stochastic covering location problems: Modeling framework and solution approach
| N/A | Paper |
