Imagen de Portada

Upgrading edges in the maximal covering location problem

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Baldomero-Naranjo, Marta, Kalcsics, Jörg, Marín, Alfredo, Rodríguez-Chía, Antonio M.
Formato:	Preprint
Publicado:	2024
Materias:	Optimization and Control
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Minmax regret maximal covering location problems with edge demands
por: Baldomero-Naranjo, Marta, et al.
Publicado: (2024)

Edge downgrades in the maximal covering location problem
por: Baldomero-Naranjo, Marta, et al.
Publicado: (2025)

On the complexity of the upgrading version of the maximal covering location problem
por: Baldomero-Naranjo, Marta, et al.
Publicado: (2024)

Multi-product maximal covering second-level facility location problem
por: Baldomero-Naranjo, Marta, et al.
Publicado: (2024)

Multi-period stochastic covering location problems: Modeling framework and solution approach
por: Marín, Alfredo, et al.
Publicado: (2024)

A robust SVM-based approach with feature selection and outliers detection for classification problems
por: Baldomero-Naranjo, Marta, et al.
Publicado: (2024)

Tightening big Ms in integer programming formulations for support vector machines with ramp loss
por: Baldomero-Naranjo, Marta, et al.
Publicado: (2024)

Presolving and cutting planes for the generalized maximal covering location problem
por: Lv, Wei, et al.
Publicado: (2024)

The profit-oriented hub line location problem with elastic demand
por: Cobeña, Brenda, et al.
Publicado: (2024)

On a geometric graph-covering problem related to optimal safety-landing-site location
por: D'Ambrosio, Claudia, et al.
Publicado: (2025)

Hub location problems with asymmetric allocation
por: Espejo, I., et al.
Publicado: (2026)

An efficient branch-and-cut algorithm for the multiple probabilistic covering location problem
por: Wang, Yan-Ru, et al.
Publicado: (2025)

The probabilistic p-center problem: Planning service for potential customers
por: Martínez-Merino, Luisa I., et al.
Publicado: (2024)

Revisiting transportation problems under Monge costs with applications to location problems
por: Nickel, Stefan, et al.
Publicado: (2026)

When Should you Offer an Upgrade: Online Upgrading Mechanisms for Resource Allocation
por: Jaillet, Patrick, et al.
Publicado: (2024)

Proceedings of the XIII International Workshop on Locational Analysis and Related Problems
por: Baldomero-Naranjo, Marta, et al.
Publicado: (2024)

Inverse single facility location problem in the plane with variable coordinates
por: Tour-Savadkoohi, Nazanin, et al.
Publicado: (2025)

The pickup and delivery problem with time windows and scheduling on the edges
por: Barbosa, Vítor A., et al.
Publicado: (2025)

Robustifying networks for flow problems against edge failure
por: Klyuchikov, Artyom, et al.
Publicado: (2025)

Finite dominating sets for the refueling station location problem in fleet operations
por: Nayeem, Moddassir Khan, et al.
Publicado: (2025)

Double interdiction problem on trees on the sum of root-leaf distances by upgrading edges
por: Li, Xiao, et al.
Publicado: (2024)

Benders decomposition for congested partial set covering location with uncertain demand
por: Calamita, Alice, et al.
Publicado: (2024)

Benders decomposition for the large-scale probabilistic set covering problem
por: Liang, Jie, et al.
Publicado: (2025)

Formulations of the continuous set-covering problem on networks: a comparative study
por: Xu, Liding, et al.
Publicado: (2024)

The dual-path fixing strategy and its application to the set-covering problem
por: Yamagishi, Paulo Michel F., et al.
Publicado: (2026)

Non-concave utility maximization problem with transaction costs and a given consistent price system
por: Gu, Lingqi, et al.
Publicado: (2024)

English version of "Screen-line counter location problem with O/D cut selection approach"
por: Sugiura, Satoshi
Publicado: (2024)

Towards large-scale probabilistic set covering problems: an efficient Benders decomposition approach
por: Lv, Wei, et al.
Publicado: (2024)

Maximum Shortest Path Interdiction Problem by Upgrading Nodes on Trees under Unit Cost
por: Zhang, Qiao, et al.
Publicado: (2025)

Solving maximally comonotone inclusion problems via an implicit Newton-like inertial dynamical system and its discretization
por: Tan, Z. Z., et al.
Publicado: (2024)

The sum of root-leaf distance interdiction problem with cardinality constraint by upgrading edges on trees
por: Li, Xiao, et al.
Publicado: (2023)

An ideal-sparse generalized moment problem reformulation for completely positive tensor decomposition exploiting maximal cliques of multi-hypergraphs
por: Huang, Pengfei, et al.
Publicado: (2025)

Solving the waste bin location problem with uncertain waste generation rate: a bi-objective robust optimization approach
por: Rossit, Diego, et al.
Publicado: (2024)

Exact and heuristic methods for the discrete parallel machine scheduling location problem
por: Kramer, Raphael, et al.
Publicado: (2020)

Competitive EV charging station location with queues
por: Nguyen, The Minh, et al.
Publicado: (2025)

Optimizing edge weights in the inverse eigenvector centrality problem
por: Passacantando, Mauro, et al.
Publicado: (2026)

Univariate representations of solutions to generic polynomial complementarity problems
por: Hieu, Vu Trung, et al.
Publicado: (2024)

A characterization of maximal inhomogeneous-quadratic-free sets
por: Muñoz, Gonzalo, et al.
Publicado: (2026)

Stable MPC with maximal terminal sets and quadratic terminal costs
por: Johansson, Mikael, et al.
Publicado: (2024)

A Mathematical Optimization Approach to Multisphere Support Vector Data Description
por: Blanco, Víctor, et al.
Publicado: (2025)