Antonio M. Rodríguez-Chía

Networks, June, 2024

Improved heuristics for solving large-scale Scanning Transmission Electron Microscopy image segmentation using the ordered median problem.

[BibT_eX]

[DOI]

Comput. Oper. Res., March, 2024

Multi-product maximal covering second-level facility location problem.

[BibT_eX]

[DOI]

Comput. Ind. Eng., 2024

The Covering Tour Problem with Arc Upgrades.

[BibT_eX]

[DOI]

Maurizio Boccia

Andrea Mancuso

Adriano Masone

Claudio Sterle

Proceedings of the Decision Sciences, 2024

2023

Using the ℓ1-norm for Image-based tomographic reconstruction.

[BibT_eX]

[DOI]

José J. Calvino

Elena Fernández

Miguel López-Haro

Expert Syst. Appl., December, 2023

Facility location problems on graphs with non-convex neighborhoods.

[BibT_eX]

[DOI]

Raúl Páez

Comput. Oper. Res., November, 2023

The profit-oriented hub line location problem with elastic demand.

[BibT_eX]

[DOI]

Brenda Cobeña

Ivan Contreras

Comput. Oper. Res., November, 2023

A new formulation and branch-and-cut method for single-allocation hub location problems.

[BibT_eX]

[DOI]

Comput. Oper. Res., July, 2023

2022

The soft-margin Support Vector Machine with ordered weighted average.

[BibT_eX]

[DOI]

Knowl. Based Syst., 2022

The hub location and pricing problem.

[BibT_eX]

[DOI]

Günes Erdogan

Maria Battarra

Eur. J. Oper. Res., 2022

Segmentation of scanning-transmission electron microscopy images using the ordered median problem.

[BibT_eX]

[DOI]

José J. Calvino

Miguel López-Haro

Eur. J. Oper. Res., 2022

A branch-and-price procedure for clustering data that are graph connected.

[BibT_eX]

[DOI]

Stefano Benati

Diego Ponce

Eur. J. Oper. Res., 2022

Upgrading edges in the maximal covering location problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2022

Minimum cost b-matching problems with neighborhoods.

[BibT_eX]

[DOI]

Rafael Paz

Comput. Optim. Appl., 2022

2021

A robust SVM-based approach with feature selection and outliers detection for classification problems.

[BibT_eX]

[DOI]

Expert Syst. Appl., 2021

A comparative study of different formulations for the capacitated discrete ordered median problem.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2021

Minmax regret maximal covering location problems with edge demands.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2021

2020

On lp-Support Vector Machines and Multidimensional Kernels.

[BibT_eX]

[DOI]

Víctor Blanco

J. Mach. Learn. Res., 2020

On pricing-based equilibrium for network expansion planning. A multi-period bilevel approach under uncertainty.

[BibT_eX]

[DOI]

Laureano F. Escudero

Juan F. Monge

Eur. J. Oper. Res., 2020

Tightening big Ms in integer programming formulations for support vector machines with ramp loss.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2020

Proceedings of the IX International Workshop on Locational Analysis and Related Problems.

[BibT_eX]

[DOI]

Inmaculada Espejo-Miranda

CoRR, 2020

Proceedings of the VIII International Workshop on Locational Analysis and Related Problems.

[BibT_eX]

[DOI]

Inmaculada Espejo-Miranda

Diego Ruiz-Hernández

CoRR, 2020

Proceedings of the VI International Workshop on Locational Analysis and Related Problems.

[BibT_eX]

[DOI]

CoRR, 2020

2019

Reformulated acyclic partitioning for rail-rail containers transshipment.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2019

Mixed integer linear programming for feature selection in support vector machine.

[BibT_eX]

[DOI]

Martine Labbé

Discret. Appl. Math., 2019

The stratified p-center problem.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2019

2018

Multi-period stochastic covering location problems: Modeling framework and solution approach.

[BibT_eX]

[DOI]

Francisco Saldanha-da-Gama

Eur. J. Oper. Res., 2018

2017

Revisiting k-sum optimization.

[BibT_eX]

[DOI]

Math. Program., 2017

The probabilistic p-center problem: Planning service for potential customers.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2017

Clustering data that are graph connected.

[BibT_eX]

[DOI]

Stefano Benati

Eur. J. Oper. Res., 2017

Lagrangian relaxation for SVM feature selection.

[BibT_eX]

[DOI]

Manlio Gaudioso

Enrico Gorgone

Martine Labbé

Comput. Oper. Res., 2017

2016

Exact and heuristic algorithms for the Hamiltonian p-median problem.

[BibT_eX]

[DOI]

Günes Erdogan

Gilbert Laporte

Eur. J. Oper. Res., 2016

2015

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

[BibT_eX]

[DOI]

Networks, 2015

Capacitated p-center problem with failure foresight.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2015

Ordered Median Hub Location Problems with Capacity Constraints.

[BibT_eX]

[DOI]

A. B. Ramos

M. C. Sanchez-Gil

CoRR, 2015

2014

The multicriteria p-facility median location problem on networks.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2014

An overview of ORP3-OR for young researchers and practitioners.

[BibT_eX]

[DOI]

Maria Cruz López de los Mozos Martin

Ann. Oper. Res., 2014

2013

Robust mean absolute deviation problems on networks with linear vertex weights.

[BibT_eX]

[DOI]

Networks, 2013

On the global convergence of a generalized iterative procedure for the minisum location problem with ℓ p distances for p > 2.

[BibT_eX]

[DOI]

C. Valero-Franco

Math. Program., 2013

A branch-and-cut algorithm for the maximum benefit Chinese postman problem.

[BibT_eX]

[DOI]

Angel Corberán

Isaac Plana

José M. Sanchis

Math. Program., 2013

A specialized branch & bound & cut for Single-Allocation Ordered Median Hub Location problems.

[BibT_eX]

[DOI]

A. B. Ramos

Discret. Appl. Math., 2013

Accelerating convergence in minisum location problem with ℓpℓp norms.

[BibT_eX]

[DOI]

C. Valero-Franco

Comput. Oper. Res., 2013

Alternative formulations for the Set Packing Problem and their application to the Winner Determination Problem.

[BibT_eX]

[DOI]

Mercedes Landete

Juan Francisco Monge

Ann. Oper. Res., 2013

On discrete optimization with ordering.

[BibT_eX]

[DOI]

Elena Fernández

Ann. Oper. Res., 2013

2012

Closest assignment constraints in discrete location problems.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2012

Corrigendum to "Simultaneous location of a service facility and a rapid transit line" [Computers & Operations Research 38(2) (2011) 525-538].

[BibT_eX]

[DOI]

Comput. Oper. Res., 2012

2011

On the structure of the solution set for the single facility location problem with average distances.

[BibT_eX]

[DOI]

Math. Program., 2011

Stochastic set packing problem.

[BibT_eX]

[DOI]

Laureano F. Escudero

Mercedes Landete

Eur. J. Oper. Res., 2011

Single-allocation ordered median hub location problems.

[BibT_eX]

[DOI]

A. B. Ramos

Comput. Oper. Res., 2011

Simultaneous location of a service facility and a rapid transit line.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2011

2010

On solving the planar k-centrum problem with Euclidean distances.

[BibT_eX]

[DOI]

Zvi Drezner

Eur. J. Oper. Res., 2010

Distribution systems design with role dependent objectives.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2010

On the Planar Piecewise Quadratic 1-Center Problem.

[BibT_eX]

[DOI]

Algorithmica, 2010

2009

Minimax Regret Single-Facility Ordered Median Location Problems on Networks.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2009

Convex ordered median problem with lp-norms.

[BibT_eX]

[DOI]

C. Valero

Comput. Oper. Res., 2009

A comparison of formulations and solution methods for the minimum-envy location problem.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2009

2008

Quasiconvex constrained multicriteria continuous location problems: Structure of nondominated solution sets.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2008

2007

New Results on Minimax Regret Single Facility Ordered Median Location Problems on Networks.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2007

2006

The bi-criteria doubly weighted center-median path problem on a tree.

[BibT_eX]

[DOI]

Dionisio Pérez-Brito

Networks, 2006

New models for locating a moving service facility.

[BibT_eX]

[DOI]

Math. Methods Oper. Res., 2006

2005

On the exponential cardinality of FDS for the ordered p-median problem.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2005

Conditional location of path and tree shaped facilities on trees.

[BibT_eX]

[DOI]

Juan A. Mesa

J. Algorithms, 2005

2003

An Approach to Location Models Involving Sets as Existing Facilities.

[BibT_eX]

[DOI]

Math. Oper. Res., 2003

2002

A multicriteria competitive Markov decision process.

[BibT_eX]

[DOI]

Francisco R. Fernández

Math. Methods Oper. Res., 2002

Geometrical Description of the Weakly Efficient Solution Set for Multicriteria Location Problems.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2002

2000

A flexible approach to location problems.

[BibT_eX]

[DOI]

Francisco R. Fernández

Math. Methods Oper. Res., 2000

1999

Location of a moving service facility.

[BibT_eX]

[DOI]