Cover Image

Minmax regret maximal covering location problems with edge demands

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Baldomero-Naranjo, Marta, Kalcsics, Jörg, Rodríguez-Chía, Antonio M.
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Upgrading edges in the maximal covering location problem
by: Baldomero-Naranjo, Marta, et al.
Published: (2024)

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

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

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

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

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

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

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

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

No-regret optimization of time-varying bilevel problems
by: Mauduit, Eliabelle, et al.
Published: (2026)

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

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

Hub location with congestion and time-sensitive demand
by: Domínguez-Bravo, Carmen-Ana, et al.
Published: (2024)

An exact pricing algorithm for revenue maximization under the logit demand function
by: Nayeem, Moddassir Khan, et al.
Published: (2025)

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

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

A graph-informed regret metric for optimal distributed control
by: Martinelli, Daniele, et al.
Published: (2025)

Low-regret shape optimization in the presence of missing Dirichlet data
by: Kunisch, Karl, et al.
Published: (2024)

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

Mixed-integer linear programming approaches for nested $p$-center problems with absolute and relative regret objectives
by: Brandstetter, Christof, et al.
Published: (2024)

Saturation-aware robust optimal operation control of microgrids based on minimum-regret optimization
by: Pratap, Ujjwal, et al.
Published: (2025)

The relief distribution problem with trucks and drones under incomplete demand information
by: Neugebauer, Aaron, et al.
Published: (2026)

On vehicle routing problems with stochastic demands -- Scenario-optimal recourse policies
by: Ota, Matheus J., et al.
Published: (2026)

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

A tactical time slot management problem under mixed logit demand
by: Abdolhamidi, Dorsa, et al.
Published: (2024)

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

Time-varying Gaussian Process Bandit Optimization with Experts: no-regret in logarithmically-many side queries
by: Mauduit, Eliabelle, et al.
Published: (2025)

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

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

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

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

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

On vehicle routing problems with stochastic demands -- Generic disaggregated integer L-shaped formulations
by: Ota, Matheus J., et al.
Published: (2025)

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

Online Convex Optimization and Integral Quadratic Constraints: An automated approach to regret analysis
by: Jakob, Fabian, et al.
Published: (2025)

Planning minimum regret $CO_2$ pipeline networks
by: Bogs, Stephan, et al.
Published: (2025)

Localized exploration in contextual dynamic pricing achieves dimension-free regret
by: Chai, Jinhang, et al.
Published: (2024)

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

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

Analysing the interactions between demand side and supply side investment decisions in an oligopolistic electricity market using a stochastic mixed complementarity problem
by: Devine, M. T., et al.
Published: (2024)