Justo Puerto

Orcid: 0000-0003-4079-8419

Affiliations:
  • University of Seville, Spain


According to our database1, Justo Puerto authored at least 176 papers between 1993 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
An extended model of coordination of an all-terrain vehicle and a multivisit drone.
Int. Trans. Oper. Res., March, 2024

A Mathematical Programming Approach to Sparse Canonical Correlation Analysis.
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

Intra-facility equity in discrete and continuous p-facility location problems.
Comput. Oper. Res., February, 2024

Unitary Owen points in cooperative lot-sizing models with backlogging.
CoRR, 2024

2023
Connected graph partitioning with aggregated and non-aggregated gap objective functions.
Networks, December, 2023

Multiclass optimal classification trees with SVM-splits.
Mach. Learn., December, 2023

Facility location problems on graphs with non-convex neighborhoods.
Comput. Oper. Res., November, 2023

A multiple-drone arc routing and mothership coordination problem.
Comput. Oper. Res., November, 2023

Dynamically second-preferred p-center problem.
Eur. J. Oper. Res., May, 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
The soft-margin Support Vector Machine with ordered weighted average.
Knowl. Based Syst., 2022

On hub location problems in geographically flexible networks.
Int. Trans. Oper. Res., 2022

Two-phase strategies for the bi-objective minimum spanning tree problem.
Int. Trans. Oper. Res., 2022

Routing for unmanned aerial vehicles: Touring dimensional sets.
Eur. J. Oper. Res., 2022

Segmentation of scanning-transmission electron microscopy images using the ordered median problem.
Eur. J. Oper. Res., 2022

A branch-and-price procedure for clustering data that are graph connected.
Eur. J. Oper. Res., 2022

A Mathematical Programming Approach to Optimal Classification Forests.
CoRR, 2022

A combinatorial optimization approach to scenario filtering in portfolio selection.
Comput. Oper. Res., 2022

Minimum cost b-matching problems with neighborhoods.
Comput. Optim. Appl., 2022

A mathematical programming approach to SVM-based classification with label noise.
Comput. Ind. Eng., 2022

Correction to: Robust optimal classification trees under noisy labels.
Adv. Data Anal. Classif., 2022

Robust optimal classification trees under noisy labels.
Adv. Data Anal. Classif., 2022

2021
Computational comparisons of different formulations for the Stackelberg minimum spanning tree game.
Int. Trans. Oper. Res., 2021

Covering problems with polyellipsoids: A location analysis perspective.
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

Network Flow based approaches for the Pipelines Routing Problem in Naval Design.
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

On the multisource hyperplanes location problem to fitting set of points.
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
On lp-Support Vector Machines and Multidimensional Kernels.
J. Mach. Learn. Res., 2020

An exact completely positive programming formulation for the discrete ordered median problem: an extended version.
J. Glob. Optim., 2020

A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem.
INFORMS J. Comput., 2020

A fresh view on the Discrete Ordered Median Problem based on partial monotonicity.
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

Quid Pro Quo allocations in Production-Inventory games.
CoRR, 2020

Clustering and portfolio selection problems: A unified framework.
Comput. Oper. Res., 2020

Optimal arrangements of hyperplanes for SVM-based multiclass classification.
Adv. Data Anal. Classif., 2020

2019
On Location-Allocation Problems for Dimensional Facilities.
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

A stochastic approach to approximate values in cooperative games.
Eur. J. Oper. Res., 2019

A heuristic procedure for computing the nucleolus.
Comput. Oper. Res., 2019

New models for the location of <i>controversial</i> facilities: A bilevel programming approach.
Comput. Oper. Res., 2019

2018
On-Line Timetable Rescheduling in a Transit Line.
Transp. Sci., 2018

The geometry of optimal partitions in location problems.
Optim. Lett., 2018

Mixed integer linear programming and heuristic methods for feature selection in clustering.
J. Oper. Res. Soc., 2018

A minmax regret version of the time-dependent shortest path problem.
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

Uniform and most uniform partitions of trees.
Discret. Optim., 2018

Mathematical programming formulations for the efficient solution of the <i>k</i>-sum approval voting problem.
Comput. Oper. Res., 2018

Locating hyperplanes to fitting set of points: A general framework.
Comput. Oper. Res., 2018

2017
Rank aggregation in cyclic sequences.
Optim. Lett., 2017

Revisiting k-sum optimization.
Math. Program., 2017

Continuous location under the effect of 'refraction'.
Math. Program., 2017

Ordered Weighted Average optimization in Multiobjective Spanning Tree Problem.
Eur. J. Oper. Res., 2017

Minimum Spanning Trees with neighborhoods: Mathematical programming formulations and solution methods.
Eur. J. Oper. Res., 2017

Clustering data that are graph connected.
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

Continuous multifacility ordered median location problems.
Eur. J. Oper. Res., 2016

Algorithms for uniform centered partitions of trees.
Electron. Notes Discret. Math., 2016

2015
Several 2-facility location problems on networks with equity objectives.
Networks, 2015

Short rational generating functions for solving some families of fuzzy integer programming problems.
Fuzzy Sets Syst., 2015

The reliable p-median problem with at-facility service.
Eur. J. Oper. Res., 2015

Ordered Median Hub Location Problems with Capacity Constraints.
CoRR, 2015

Modelling and planning public cultural schedules for efficient use of resources.
Comput. Oper. Res., 2015

When centers can fail: A close second opportunity.
Comput. Oper. Res., 2015

An improved test set approach to nonlinear integer problems with applications to engineering design.
Comput. Optim. Appl., 2015

2014
A Semidefinite Programming approach for solving Multiobjective Linear Programming.
J. Glob. Optim., 2014

A modified variable neighborhood search for the discrete ordered median problem.
Eur. J. Oper. Res., 2014

The multicriteria p-facility median location problem on networks.
Eur. J. Oper. Res., 2014

Reliability problems in multiple path-shaped facility location on networks.
Discret. Optim., 2014

Unreliable point facility location problems on networks.
Discret. Appl. Math., 2014

Ordered weighted average combinatorial optimization: Formulations and their properties.
Discret. Appl. Math., 2014

On two solution concepts in a class of multicriteria games.
CoRR, 2014

Revisiting several problems and algorithms in continuous location with \(\ell _\tau \) norms.
Comput. Optim. Appl., 2014

An overview of ORP<sup>3</sup>-OR for young researchers and practitioners.
Ann. Oper. Res., 2014

2013
Robust mean absolute deviation problems on networks with linear vertex weights.
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

Finding the nucleolus of any n-person cooperative game by a single linear program.
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

On discrete optimization with ordering.
Ann. Oper. Res., 2013

2012
An Application of Integer Programming to the Decomposition of Numerical Semigroups.
SIAM J. Discret. Math., 2012

A new complexity result on multiobjective linear integer programming using short rational generating functions.
Optim. Lett., 2012

Avoiding unfairness of Owen allocations in linear production processes.
Eur. J. Oper. Res., 2012

Cooperative location games based on the minimum diameter spanning Steiner subgraph problem.
Discret. Appl. Math., 2012

Range minimization problems in path-facility location on trees.
Discret. Appl. Math., 2012

The minimum cost shortest-path tree game.
Ann. Oper. Res., 2012

2011
Minimax regret path location on trees.
Networks, 2011

On the structure of the solution set for the single facility location problem with average distances.
Math. Program., 2011

Some algebraic methods for solving multiobjective polynomial integer programs.
J. Symb. Comput., 2011

Counting numerical Semigroups with Short Generating Functions.
Int. J. Algebra Comput., 2011

Pareto-optimal security strategies in matrix games with fuzzy payoffs.
Fuzzy Sets Syst., 2011

A cooperative location game based on the 1-center location problem.
Eur. J. Oper. Res., 2011

An algebraic approach to integer portfolio problems.
Eur. J. Oper. Res., 2011

A Semidefinite Programming approach for minimizing ordered weighted averages of rational functions
CoRR, 2011

Single-allocation ordered median hub location problems.
Comput. Oper. Res., 2011

Optimizing ordered median functions with applications to single facility location.
Proceedings of the Operations Research Proceedings 2011, Selected Papers of the International Conference on Operations Research (OR 2011), August 30, 2011

2010
Distribution systems design with role dependent objectives.
Eur. J. Oper. Res., 2010

On the Planar Piecewise Quadratic 1-Center Problem.
Algorithmica, 2010

Some new cooperative coverage facility location games.
Proceedings of the Behavioral and Quantitative Game Theory, 2010

Avoiding unfairness of Owen solutions in linear production games.
Proceedings of the Behavioral and Quantitative Game Theory, 2010

2009
Partial Gröbner Bases for Multiobjective Integer Linear Optimization.
SIAM J. Discret. Math., 2009

The continuous and discrete path-variance problems on trees.
Networks, 2009

Opportune moment strategies for a cost spanning tree game.
Math. Methods Oper. Res., 2009

Minimax Regret Single-Facility Ordered Median Location Problems on Networks.
INFORMS J. Comput., 2009

Production-inventory games: A new class of totally balanced combinatorial optimization games.
Games Econ. Behav., 2009

Modeling cooperation on a class of distribution problems.
Eur. J. Oper. Res., 2009

The use of relative priorities in optimizing the performance of a queueing system.
Eur. J. Oper. Res., 2009

Extensive facility location problems on networks with equity measures.
Discret. Appl. Math., 2009

A flexible model and efficient solution strategies for discrete location problems.
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

The multi-period incremental service facility location problem.
Comput. Oper. Res., 2009

Location Theory - A Unified Approach.
Springer, ISBN: 978-3-540-24321-2, 2009

2008
Polynomial algorithms for partitioning a tree into single-center subtrees to minimize flat service costs.
Networks, 2008

Production-inventory games and PMAS-games: Characterizations of the Owen point.
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

Dynamic realization games in newsvendor inventory centralization.
Int. J. Game Theory, 2008

Cooperation in Markovian queueing models.
Eur. J. Oper. Res., 2008

Center location problems on tree graphs with subtree-shaped customers.
Discret. Appl. Math., 2008

Quasiconvex constrained multicriteria continuous location problems: Structure of nondominated solution sets.
Comput. Oper. Res., 2008

A generalized model of equality measures in network location problems.
Comput. Oper. Res., 2008

Dynamic supply chain design with inventory.
Comput. Oper. Res., 2008

Partially ordered cooperative games: extended core and Shapley value.
Ann. Oper. Res., 2008

2007
Dynamic programming analysis of the TV game "Who wants to be a millionaire?".
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
The bi-criteria doubly weighted center-median path problem on a tree.
Networks, 2006

New models for locating a moving service facility.
Math. Methods Oper. Res., 2006

Exact procedures for solving the discrete ordered median problem.
Comput. Oper. Res., 2006

2005
On the exponential cardinality of FDS for the ordered <i>p</i>-median problem.
Oper. Res. Lett., 2005

Locating tree-shaped facilities using the ordered median objective.
Math. Program., 2005

Conditional location of path and tree shaped facilities on trees.
J. Algorithms, 2005

Filtering Policies in Loss Queuing Network Location Problems.
Ann. Oper. Res., 2005

Competition and Cooperation in Non-Centralized Linear Production Games.
Ann. Oper. Res., 2005

2004
The multiscenario lot size problem with concave costs.
Eur. J. Oper. Res., 2004

Multi-criteria minimum cost spanning tree games.
Eur. J. Oper. Res., 2004

Set-valued TU-games.
Eur. J. Oper. Res., 2004

2003
Multifacility ordered median problems on networks: A further analysis.
Networks, 2003

An Approach to Location Models Involving Sets as Existing Facilities.
Math. Oper. Res., 2003

Book Reviews.
Math. Methods Oper. Res., 2003

Single facility location problems with unbounded unit balls.
Math. Methods Oper. Res., 2003

Multiobjective solution of the uncapacitated plant location problem.
Eur. J. Oper. Res., 2003

Improved algorithms for several network location problems with equality measures.
Discret. Appl. Math., 2003

2002
Algorithmic results for ordered median problems.
Oper. Res. Lett., 2002

A multicriteria competitive Markov decision process.
Math. Methods Oper. Res., 2002

Bicriteria trade-off analysis in a two-echelon inventory/distribution system.
J. Oper. Res. Soc., 2002

Cores of Stochastic Cooperative Games with Stochastic Orders.
IGTR, 2002

Sequential incorporation of imprecise information in multiple criteria decision processes.
Eur. J. Oper. Res., 2002

The centdian subtree on tree networks.
Discret. Appl. Math., 2002

Geometrical Description of the Weakly Efficient Solution Set for Multicriteria Location Problems.
Ann. Oper. Res., 2002

Optimal Positioning of a Mobile Service Unit on a Line.
Ann. Oper. Res., 2002

On the Allocation of Excesses of Resources in Linear Production Problems.
Proceedings of the Operations Research Proceedings 2002, 2002

2001
On the core of a class of location games.
Math. Methods Oper. Res., 2001

2000
A flexible approach to location problems.
Math. Methods Oper. Res., 2000

A multiperiod two-echelon multicommodity capacitated plant location problem.
Eur. J. Oper. Res., 2000

1999
A unified approach to network location problems.
Networks, 1999

Location of a moving service facility.
Math. Methods Oper. Res., 1999

1998
Location and shape of a rectangular facility in Real<sup>n</sup> Convexity properties.
Math. Program., 1998

A Note on the Optimal Positioning of Service Units.
Oper. Res., 1998

Two-person non-zero-sum gamesas multicriteria goal games.
Ann. Oper. Res., 1998

1997
Simpson Points in Planar Problems with Locational Constraints. The Polyhedral-Gauge Case.
Math. Oper. Res., 1997

Simpson Points in Planar Problems with Locational Constraints. The Round-Norm Case.
Math. Oper. Res., 1997

1995
Planar point-objective location problems with nonconvex constraints: A geometrical construction.
J. Glob. Optim., 1995

1993
Efficiency in Euclidean constrained location problems.
Oper. Res. Lett., 1993


  Loading...