Justo Puerto
Orcid: 0000-0003-4079-8419Affiliations:
- University of Seville, Spain
According to our database1,
Justo Puerto
authored at least 189 papers
between 1993 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
-
on id.loc.gov
-
on d-nb.info
On csauthors.net:
Bibliography
2024
Int. Trans. Oper. Res., September, 2024
Ann. Oper. Res., September, 2024
Int. Trans. Oper. Res., March, 2024
Expert Syst. Appl., March, 2024
Improved heuristics for solving large-scale Scanning Transmission Electron Microscopy image segmentation using the ordered median problem.
Comput. Oper. Res., March, 2024
Comput. Oper. Res., February, 2024
Mixed-integer linear programming formulations and column generation algorithms for the Minimum Normalized Cuts problem on networks.
Eur. J. Oper. Res., 2024
Eur. J. Oper. Res., 2024
CoRR, 2024
Comput. Ind. Eng., 2024
2023
Connected graph partitioning with aggregated and non-aggregated gap objective functions.
Networks, December, 2023
Mach. Learn., December, 2023
Dataset, December, 2023
Dataset, December, 2023
Comput. Oper. Res., November, 2023
Comput. Oper. Res., November, 2023
Dataset, October, 2023
A branch-and-price approach for the continuous multifacility monotone ordered median problem.
Eur. J. Oper. Res., 2023
Allocating the surplus induced by cooperation in distribution chains with multiple suppliers and retailers.
CoRR, 2023
2022
Knowl. Based Syst., 2022
Int. Trans. Oper. Res., 2022
Int. Trans. Oper. Res., 2022
Eur. J. Oper. Res., 2022
Segmentation of scanning-transmission electron microscopy images using the ordered median problem.
Eur. J. Oper. Res., 2022
Eur. J. Oper. Res., 2022
An extended version of the Ordered Median Tree Location Problem including appendices and detailed computational results.
CoRR, 2022
Comput. Oper. Res., 2022
Comput. Ind. Eng., 2022
Adv. Data Anal. Classif., 2022
Adv. Data Anal. Classif., 2022
2021
Computational comparisons of different formulations for the Stackelberg minimum spanning tree game.
Int. Trans. Oper. Res., 2021
Eur. J. Oper. Res., 2021
A local analysis to determine all optimal solutions of p-k-max location problems on networks.
Discret. Appl. Math., 2021
Locating a discrete subtree of minimum variance on trees: New strategies to tackle a very hard problem.
Discret. Appl. Math., 2021
CoRR, 2021
Cooperation in lot-sizing problems with heterogeneous costs: the effect of consolidated periods.
CoRR, 2021
A comparative study of different formulations for the capacitated discrete ordered median problem.
Comput. Oper. Res., 2021
Comput. Oper. Res., 2021
Coordinating drones with mothership vehicles: The mothership and drone routing problem with graphs.
Comput. Oper. Res., 2021
Enforcing fair cooperation in production-inventory settings with heterogeneous agents.
Ann. Oper. Res., 2021
2020
J. Mach. Learn. Res., 2020
An exact completely positive programming formulation for the discrete ordered median problem: an extended version.
J. Glob. Optim., 2020
INFORMS J. Comput., 2020
Eur. J. Oper. Res., 2020
Portfolio problems with two levels decision-makers: Optimal portfolio selection with pricing decisions on transaction costs.
Eur. J. Oper. Res., 2020
A Mathematical Programming approach to Binary Supervised Classification with Label Noise.
CoRR, 2020
Proceedings of the X International Workshop on Locational Analysis and Related Problems.
CoRR, 2020
Comput. Oper. Res., 2020
Adv. Data Anal. Classif., 2020
2019
J. Optim. Theory Appl., 2019
Exact algorithms for handling outliers in center location problems on networks using <i>k</i>-max functions.
Eur. J. Oper. Res., 2019
New algorithmic framework for conditional value at risk: Application to stochastic fixed-charge transportation.
Eur. J. Oper. Res., 2019
Eur. J. Oper. Res., 2019
New models for the location of <i>controversial</i> facilities: A bilevel programming approach.
Comput. Oper. Res., 2019
2018
Mixed integer linear programming and heuristic methods for feature selection in clustering.
J. Oper. Res. Soc., 2018
Eur. J. Oper. Res., 2018
A discretization result for some optimization problems in framework spaces with polyhedral obstacles and the Manhattan metric.
Electron. Notes Discret. Math., 2018
Mathematical programming formulations for the efficient solution of the <i>k</i>-sum approval voting problem.
Comput. Oper. Res., 2018
Comput. Oper. Res., 2018
2017
Eur. J. Oper. Res., 2017
Minimum Spanning Trees with neighborhoods: Mathematical programming formulations and solution methods.
Eur. J. Oper. Res., 2017
Mathematical Programming formulations for the efficient solution of the $k$-sum approval voting problem.
CoRR, 2017
A comparative study of formulations and solution methods for the discrete ordered p-median problem.
Comput. Oper. Res., 2017
2016
Partitioning a graph into connected components with fixed centers and optimizing cost-based objective functions or equipartition criteria.
Networks, 2016
Electron. Notes Discret. Math., 2016
2015
Networks, 2015
Short rational generating functions for solving some families of fuzzy integer programming problems.
Fuzzy Sets Syst., 2015
Comput. Oper. Res., 2015
An improved test set approach to nonlinear integer problems with applications to engineering design.
Comput. Optim. Appl., 2015
2014
J. Glob. Optim., 2014
Eur. J. Oper. Res., 2014
Eur. J. Oper. Res., 2014
Discret. Optim., 2014
Ordered weighted average combinatorial optimization: Formulations and their properties.
Discret. Appl. Math., 2014
Revisiting several problems and algorithms in continuous location with \(\ell _\tau \) norms.
Comput. Optim. Appl., 2014
Ann. Oper. Res., 2014
2013
Networks, 2013
Revisiting a game theoretic framework for the robust railway network design against intentional attacks.
Eur. J. Oper. Res., 2013
A specialized branch & bound & cut for Single-Allocation Ordered Median Hub Location problems.
Discret. Appl. Math., 2013
Comput. Oper. Res., 2013
Exact cost minimization of a series-parallel reliable system with multiple component choices using an algebraic method.
Comput. Oper. Res., 2013
Minimizing ordered weighted averaging of rational functions with applications to continuous location.
Comput. Oper. Res., 2013
2012
SIAM J. Discret. Math., 2012
A new complexity result on multiobjective linear integer programming using short rational generating functions.
Optim. Lett., 2012
Eur. J. Oper. Res., 2012
Cooperative location games based on the minimum diameter spanning Steiner subgraph problem.
Discret. Appl. Math., 2012
Discret. Appl. Math., 2012
2011
On the structure of the solution set for the single facility location problem with average distances.
Math. Program., 2011
J. Symb. Comput., 2011
Int. J. Algebra Comput., 2011
Fuzzy Sets Syst., 2011
Eur. J. Oper. Res., 2011
A Semidefinite Programming approach for minimizing ordered weighted averages of rational functions
CoRR, 2011
Proceedings of the Operations Research Proceedings 2011, Selected Papers of the International Conference on Operations Research (OR 2011), August 30, 2011
2010
Proceedings of the Behavioral and Quantitative Game Theory, 2010
Proceedings of the Behavioral and Quantitative Game Theory, 2010
2009
SIAM J. Discret. Math., 2009
Math. Methods Oper. Res., 2009
INFORMS J. Comput., 2009
Production-inventory games: A new class of totally balanced combinatorial optimization games.
Games Econ. Behav., 2009
Eur. J. Oper. Res., 2009
Discret. Appl. Math., 2009
Discret. Appl. Math., 2009
Selected papers presented at the tenth International Symposium on Locational Decisions (ISOLDE X).
Comput. Oper. Res., 2009
A comparison of formulations and solution methods for the minimum-envy location problem.
Comput. Oper. Res., 2009
Comput. Oper. Res., 2009
2008
Polynomial algorithms for partitioning a tree into single-center subtrees to minimize flat service costs.
Networks, 2008
Math. Soc. Sci., 2008
The path player game - A network game from the point of view of the network providers.
Math. Methods Oper. Res., 2008
Int. J. Game Theory, 2008
Discret. Appl. Math., 2008
Quasiconvex constrained multicriteria continuous location problems: Structure of nondominated solution sets.
Comput. Oper. Res., 2008
Comput. Oper. Res., 2008
Ann. Oper. Res., 2008
2007
Eur. J. Oper. Res., 2007
A New Formulation of the Capacitated Discrete Ordered Median Problems with 0, 1-Assignment.
Proceedings of the Operations Research, 2007
New Results on Minimax Regret Single Facility Ordered Median Location Problems on Networks.
Proceedings of the Algorithms, 2007
2006
Comput. Oper. Res., 2006
2005
Oper. Res. Lett., 2005
Math. Program., 2005
J. Algorithms, 2005
Ann. Oper. Res., 2005
2004
2003
Networks, 2003
Math. Oper. Res., 2003
Math. Methods Oper. Res., 2003
Eur. J. Oper. Res., 2003
Discret. Appl. Math., 2003
2002
J. Oper. Res. Soc., 2002
Sequential incorporation of imprecise information in multiple criteria decision processes.
Eur. J. Oper. Res., 2002
Geometrical Description of the Weakly Efficient Solution Set for Multicriteria Location Problems.
Ann. Oper. Res., 2002
Proceedings of the Operations Research Proceedings 2002, 2002
2001
2000
Eur. J. Oper. Res., 2000
1999
1998
Location and shape of a rectangular facility in Real<sup>n</sup> Convexity properties.
Math. Program., 1998
1997
Simpson Points in Planar Problems with Locational Constraints. The Polyhedral-Gauge Case.
Math. Oper. Res., 1997
Math. Oper. Res., 1997
1995
Planar point-objective location problems with nonconvex constraints: A geometrical construction.
J. Glob. Optim., 1995
1993