Cover Image

An efficient branch-and-cut algorithm for the multiple probabilistic covering location problem

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Wang, Yan-Ru, Chen, Wei-Kun, Ljubić, Ivana
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control 90C11
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

An efficient branch-and-cut approach for the sequential competitive facility location problem under partially binary rule
by: Guo, Yu-Qi, et al.
Published: (2025)

An efficient branch-and-cut approach for large-scale competitive facility location problems with limited choice rule
by: Chen, Wei-Kun, et al.
Published: (2024)

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

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

Lagrangian cuts generated by batch to efficiently solve two-stage stochastic mixed-integer program
by: Xiaoyu, Luo, et al.
Published: (2024)

A study of column generation embedded in scalarization methods for the bi-objective cutting stock problem
by: Borges, Jennifer C., et al.
Published: (2026)

Exploiting Overlap Information in Chance-constrained Program with Random Right-hand Side
by: Lv, Wei, et al.
Published: (2024)

A branch-and-cut algorithm for vehicle routing problems with three-dimensional loading constraints
by: Tamke, Felix, et al.
Published: (2024)

Solving decision problems with endogenous uncertainty and conditional information revelation using influence diagrams
by: Herrala, Olli, et al.
Published: (2023)

An extension of an RLT-based solver to MINLP polynomial problems
by: González-Díaz, Julio, et al.
Published: (2024)

GFORS: GPU-Accelerated First-Order Method with Randomized Sampling for Binary Integer Programs
by: Wei, Ningji, et al.
Published: (2025)

Benders decomposition algorithms for minimizing the spread of harmful contagions in networks
by: Tanınmış, Kübra, et al.
Published: (2023)

Bundle methods with quadratic cuts for deterministic and stochastic strongly convex optimization problems
by: Guigues, Vincent, et al.
Published: (2017)

On exactness of SDP relaxation for the maximum cut problem
by: Bhardwaj, Avinash, et al.
Published: (2025)

Bi-Parameterized Two-Stage Stochastic Min-Max and Min-Min Mixed Integer Programs
by: Kang, Sumin, et al.
Published: (2025)

Exact augmented Lagrangian duality for mixed integer convex optimization
by: Bhardwaj, Avinash, et al.
Published: (2022)

Exact Decomposition Branching exploiting Lattice Structures
by: Halbig, Katrin, et al.
Published: (2024)

The Quadratic Bin Packing Problem: Exact Formulations and Algorithm
by: Chagas, Vítor Gomes, et al.
Published: (2026)

Distributionally Risk-Receptive and Robust Multistage Stochastic Integer Programs and Interdiction Models
by: Kang, Sumin, et al.
Published: (2024)

Adaptive Partitioning for Chance-Constrained Problems with Finite Support
by: Roland, Marius, et al.
Published: (2023)

Augmentation approaches for Mixed Integer Programming
by: Puerto, Justo, et al.
Published: (2025)

$\mathcal{V}$-Polyhedral Disjunctive Cuts
by: Balas, Egon, et al.
Published: (2022)

Neural Embedded Mixed-Integer Optimization for Location-Routing Problems
by: Kaleem, Waquar, et al.
Published: (2024)

On a minimization problem of the maximum generalized eigenvalue: properties and algorithms
by: Nishioka, Akatsuki, et al.
Published: (2023)

Spectral Outer-Approximation Algorithms for Binary Semidefinite Problems
by: de Roux, Daniel, et al.
Published: (2025)

A nonsmooth Frank-Wolfe algorithm through a dual cutting-plane approach
by: Mazanti, Guilherme, et al.
Published: (2024)

A symmetric primal-dual algorithmic framework for saddle point problems
by: He, Hongjin, et al.
Published: (2022)

An Exact Algorithm for Public Transport Line Planning Considering Passenger and Operational Costs and Lost Demand
by: Hansen, Siv Marie Cartland, et al.
Published: (2026)

CatMADS: Mesh Adaptive Direct Search for constrained blackbox optimization with categorical variables
by: Audet, Charles, et al.
Published: (2025)

A Frank-Wolfe-based primal heuristic for quadratic mixed-integer optimization
by: Mexi, Gioni, et al.
Published: (2025)

A Unifying Convexification Framework for Chance-Constrained Programs via Bilinear Extended Formulations over a Simplex
by: Davarnia, Danial, et al.
Published: (2025)

Multi-timescale Stochastic Programming with Applications in Power Systems
by: Zhang, Yihang, et al.
Published: (2025)

Surrogate-based categorical neighborhoods for mixed-variable blackbox optimization
by: Audet, Charles, et al.
Published: (2026)

Tighter yet more tractable relaxations and nontrivial instance generation for sparse standard quadratic optimization
by: Bomze, Immanuel, et al.
Published: (2024)

Combining Gradient Information and Primitive Directions for High-Performance Mixed-Integer Optimization
by: Lapucci, Matteo, et al.
Published: (2024)

A Safe Approximation Based on Mixed-Integer Optimization for Non-Convex Distributional Robustness Governed by Univariate Indicator Functions
by: Dienstbier, Jana, et al.
Published: (2023)

Exact solution approaches for the discrete $α$-neighbor $p$-center problem
by: Gaar, Elisabeth, et al.
Published: (2022)

Superadditivity-based valid inequalities and asymptotic bounds for the vehicle routing problem with stochastic demands
by: Legault, Robin, et al.
Published: (2025)

Investigating mixed-integer programming approaches for the $p$-$α$-closest-center problem
by: Gaar, Elisabeth, et al.
Published: (2026)

On feasibility cuts for chance-constrained multicommodity network design problems
by: Wouda, Niels A., et al.
Published: (2024)