Image de couverture de livre

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

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Brandstetter, Christof, Sinnl, Markus
Format:	Preprint
Publié:	2024
Sujets:	Optimization and Control Discrete Mathematics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Investigating mixed-integer programming approaches for the $p$-$α$-closest-center problem
par: Gaar, Elisabeth, et autres
Publié: (2026)

Exact solution approaches for the discrete $α$-neighbor $p$-center problem
par: Gaar, Elisabeth, et autres
Publié: (2022)

A generic Branch-and-Cut algorithm for bi-objective binary linear programs
par: Fouilhoux, Pierre, et autres
Publié: (2024)

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

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

Revisiting some classical linearizations of the quadratic binary optimization problem
par: Punnen, Abraham P., et autres
Publié: (2024)

A column-generation approach for an electricity technician routing and scheduling problem with a lexicographic objective
par: Bangerter, Elise, et autres
Publié: (2026)

An exact approach for the multi-depot electric vehicle scheduling problem
par: Haslinger, Xenia, et autres
Publié: (2025)

An efficient optimization model and tabu search-based global optimization approach for continuous p-dispersion problem
par: Lai, Xiangjing, et autres
Publié: (2024)

Capacitated power dominating set problem: a solution approach based on forbidden propagation sets
par: Lucci, Mauro, et autres
Publié: (2026)

The Mixed Integer Trust Region Problem
par: Del Pia, Alberto
Publié: (2024)

Tightening the mixed integer linear formulation for the piecewise linear approximation in general dimensions
par: Ploussard, Quentin, et autres
Publié: (2025)

Semidefinite programming and linear equations vs. homomorphism problems
par: Ciardo, Lorenzo, et autres
Publié: (2023)

Tree-based formulation for the multi-commodity flow problem
par: Spoorendonk, Simon, et autres
Publié: (2025)

A parallel pull labelling algorithm for the resource constrained shortest path problem
par: Petersen, Bjørn, et autres
Publié: (2025)

Convex mixed-integer optimization with Frank-Wolfe methods
par: Hendrych, Deborah, et autres
Publié: (2022)

Competing for the most profitable tour: The orienteering interdiction game
par: Álvarez-Miranda, Eduardo, et autres
Publié: (2024)

Benders decomposition algorithms for minimizing the spread of harmful contagions in networks
par: Tanınmış, Kübra, et autres
Publié: (2023)

Multilevel Facility Location Optimization: A Novel Integer Programming Formulation and Approaches to Heuristic Solutions
par: Alidaee, Bahram, et autres
Publié: (2024)

Lower bounds for the integrality gap of the bi-directed cut formulation of the Steiner Tree Problem
par: Bernardelli, Ambrogio Maria, et autres
Publié: (2024)

Order acceptance and scheduling in capacitated job shops
par: Linß, Florian, et autres
Publié: (2024)

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

Highly Connected Graph Partitioning: Exact Formulation and Solution Methods
par: Swamy, Rahul, et autres
Publié: (2024)

Factorized binary polynomial optimization
par: Del Pia, Alberto
Publié: (2024)

Chorded cycle facets of the clique partitioning polytope
par: Irmai, Jannik, et autres
Publié: (2024)

Beyond hypergraph acyclicity: limits of tractability for pseudo-Boolean optimization
par: Del Pia, Alberto, et autres
Publié: (2024)

Robust Deterministic Policies for Markov Decision Processes under Budgeted Uncertainty
par: Wu, Fei, et autres
Publié: (2024)

Assortment Optimization For Conference Goodies With Indifferent Attendees
par: Gutiérrez, Fernanda, et autres
Publié: (2024)

Branch and Price for the Length-Constrained Cycle Partition Problem
par: Ghannam, Mohammed, et autres
Publié: (2024)

Benders decomposition for congested partial set covering location with uncertain demand
par: Calamita, Alice, et autres
Publié: (2024)

Minimum Cut Representability of Stable Matching Problems
par: Faenza, Yuri, et autres
Publié: (2025)

Real-time Optimization of Transport Chains for Single Wagon Load Railway Transport
par: Moldenhauer, Carsten, et autres
Publié: (2025)

An SDP Relaxation for the Sparse Integer Least Squares Problem
par: Del Pia, Alberto, et autres
Publié: (2022)

Maximum Cuts and Fractional Cut Covers: A Computational Study of a Randomized Semidefinite Programming Approach
par: Proença, Nathan Benedetto, et autres
Publié: (2026)

Geoffrion's theorem beyond finiteness and rationality
par: Dey, Santanu S., et autres
Publié: (2025)

Randomized Max-Vertex-Cover Interdiction with Matroid Constraints
par: Wang, Changjun, et autres
Publié: (2026)

On the Virtual Network Embedding polytope
par: Benhamiche, Amal, et autres
Publié: (2026)

Facet-Defining Inequalities for the Angle-Based DC Optimal Transmission Switching Formulation
par: Jabbari-Marand, Behnam, et autres
Publié: (2026)

Shortest Paths in Graphs of Convex Sets
par: Marcucci, Tobia, et autres
Publié: (2021)

A review of minimum cost box searching games
par: Lidbetter, Thomas
Publié: (2025)