Cover Image

An efficient branch-and-cut approach for the sequential competitive facility location problem under partially binary rule

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Guo, Yu-Qi, Wang, Yan-Ru, Chen, Wei-Kun, Dai, Yu-Hong
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 large-scale competitive facility location problems with limited choice rule
by: Chen, Wei-Kun, et al.
Published: (2024)

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

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)

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

A model-free approach for solving choice-based competitive facility location problems using simulation and submodularity
by: Legault, Robin, et al.
Published: (2022)

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)

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

A sequential linear complementarity problem method for generalized Nash equilibrium problems
by: Diao, Ruoyu, et al.
Published: (2026)

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

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

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

The Cooperative Maximal Covering Location Problem with ordered partial attractions
by: Domínguez, Concepción, et al.
Published: (2023)

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

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

$\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)

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

Revisiting Johnson's rule for minimizing makespan in the Two-Machine Flow Shop scheduling problem
by: Della Croce, Federico, et al.
Published: (2025)

Distributed Recursion Revisited
by: Zhang, Wei-Yang, et al.
Published: (2024)

GFORS: GPU-Accelerated First-Order Method with Randomized Sampling for Binary Integer Programs
by: Wei, Ningji, 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)

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

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)

A cut-and-project perspective for linearized Bregman iterations
by: Dai, Yu-Hong, et al.
Published: (2024)

Adjustable Robust Nonlinear Network Design Without Controllable Elements under Load Scenario Uncertainties
by: Thürauf, Johannes, et al.
Published: (2024)

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

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

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)

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

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

Second-order sequential optimality conditions for nonlinear semidefinite optimization problems
by: Li, Huimin, et al.
Published: (2025)

A second-order sequential optimality condition for nonlinear second-order cone programming problems
by: Fukuda, Ellen H., et al.
Published: (2023)

Mixed-Integer Linear Optimization for Cardinality-Constrained Random Forests
by: Burgard, Jan Pablo, et al.
Published: (2024)

Mixed-Integer Linear Optimization for Semi-Supervised Optimal Classification Trees
by: Burgard, Jan Pablo, et al.
Published: (2024)

Mixed-integer linearity in nonlinear optimization: a trust region approach
by: De Marchi, Alberto
Published: (2023)