Cover Image

Mixed-integer linear programming approaches for nested $p$-center problems with absolute and relative regret objectives

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Brandstetter, Christof, Sinnl, Markus
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

A generic Branch-and-Cut algorithm for bi-objective binary linear programs
by: Fouilhoux, Pierre, et al.
Published: (2024)

A study of distributionally robust mixed-integer programming with Wasserstein metric: on the value of incomplete data
by: Ketkov, Sergey S.
Published: (2023)

Towards a geometric characterization of unbounded integer cubic optimization problems via thin rays
by: Del Pia, Alberto
Published: (2025)

Revisiting some classical linearizations of the quadratic binary optimization problem
by: Punnen, Abraham P., et al.
Published: (2024)

A column-generation approach for an electricity technician routing and scheduling problem with a lexicographic objective
by: Bangerter, Elise, et al.
Published: (2026)

An exact approach for the multi-depot electric vehicle scheduling problem
by: Haslinger, Xenia, et al.
Published: (2025)

An efficient optimization model and tabu search-based global optimization approach for continuous p-dispersion problem
by: Lai, Xiangjing, et al.
Published: (2024)

Capacitated power dominating set problem: a solution approach based on forbidden propagation sets
by: Lucci, Mauro, et al.
Published: (2026)

The Mixed Integer Trust Region Problem
by: Del Pia, Alberto
Published: (2024)

Tightening the mixed integer linear formulation for the piecewise linear approximation in general dimensions
by: Ploussard, Quentin, et al.
Published: (2025)

Semidefinite programming and linear equations vs. homomorphism problems
by: Ciardo, Lorenzo, et al.
Published: (2023)

Tree-based formulation for the multi-commodity flow problem
by: Spoorendonk, Simon, et al.
Published: (2025)

A parallel pull labelling algorithm for the resource constrained shortest path problem
by: Petersen, Bjørn, et al.
Published: (2025)

Convex mixed-integer optimization with Frank-Wolfe methods
by: Hendrych, Deborah, et al.
Published: (2022)

Competing for the most profitable tour: The orienteering interdiction game
by: Álvarez-Miranda, Eduardo, et al.
Published: (2024)

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

Multilevel Facility Location Optimization: A Novel Integer Programming Formulation and Approaches to Heuristic Solutions
by: Alidaee, Bahram, et al.
Published: (2024)

Lower bounds for the integrality gap of the bi-directed cut formulation of the Steiner Tree Problem
by: Bernardelli, Ambrogio Maria, et al.
Published: (2024)

Order acceptance and scheduling in capacitated job shops
by: Linß, Florian, et al.
Published: (2024)

Market proliferation and the impact of locational complexity on network restructuring
by: Pinar-Pérez, J. M., et al.
Published: (2024)

Highly Connected Graph Partitioning: Exact Formulation and Solution Methods
by: Swamy, Rahul, et al.
Published: (2024)

Factorized binary polynomial optimization
by: Del Pia, Alberto
Published: (2024)

Chorded cycle facets of the clique partitioning polytope
by: Irmai, Jannik, et al.
Published: (2024)

Beyond hypergraph acyclicity: limits of tractability for pseudo-Boolean optimization
by: Del Pia, Alberto, et al.
Published: (2024)

Robust Deterministic Policies for Markov Decision Processes under Budgeted Uncertainty
by: Wu, Fei, et al.
Published: (2024)

Assortment Optimization For Conference Goodies With Indifferent Attendees
by: Gutiérrez, Fernanda, et al.
Published: (2024)

Branch and Price for the Length-Constrained Cycle Partition Problem
by: Ghannam, Mohammed, et al.
Published: (2024)

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

Minimum Cut Representability of Stable Matching Problems
by: Faenza, Yuri, et al.
Published: (2025)

Real-time Optimization of Transport Chains for Single Wagon Load Railway Transport
by: Moldenhauer, Carsten, et al.
Published: (2025)

An SDP Relaxation for the Sparse Integer Least Squares Problem
by: Del Pia, Alberto, et al.
Published: (2022)

Maximum Cuts and Fractional Cut Covers: A Computational Study of a Randomized Semidefinite Programming Approach
by: Proença, Nathan Benedetto, et al.
Published: (2026)

Geoffrion's theorem beyond finiteness and rationality
by: Dey, Santanu S., et al.
Published: (2025)

Randomized Max-Vertex-Cover Interdiction with Matroid Constraints
by: Wang, Changjun, et al.
Published: (2026)

On the Virtual Network Embedding polytope
by: Benhamiche, Amal, et al.
Published: (2026)

Facet-Defining Inequalities for the Angle-Based DC Optimal Transmission Switching Formulation
by: Jabbari-Marand, Behnam, et al.
Published: (2026)

Shortest Paths in Graphs of Convex Sets
by: Marcucci, Tobia, et al.
Published: (2021)

A review of minimum cost box searching games
by: Lidbetter, Thomas
Published: (2025)