Skip to content

Optimization Online

  • Welcome
  • Repository
  • Submit
  • About
  • Help
  • My Eprints

The p-center problem: Using equivalent instances to obtain better results

Published: 2024/05/31, Updated: 2024/12/20
  • Alfredo MarĂ­n
Categories (Mixed) Integer Linear Programming, Integer Programming Tags integer programming, location Short URL: https://optimization-online.org/?p=26575

Article

Download

View PDF

On the integrality gap of the Complete Metric Steiner Tree Problem via a novel formulation
A Geometric Unification of Distributionally Robust Covariance Estimators: Shrinking the Spectrum by Inflating the Ambiguity Set
Log in


Repository

Author List

Months

Categories

Keywords

alternating direction method of multipliers augmented lagrangian method benders decomposition bilevel optimization Branch-and-Bound branch-and-cut chance constraints column generation combinatorial optimization complexity constrained optimization convex optimization cutting planes decomposition derivative-free optimization distributionally robust optimization duality dynamic programming first-order methods global convergence global optimization heuristics integer programming interior point methods large-scale optimization linear programming machine learning mixed-integer linear programming mixed-integer nonlinear programming mixed-integer programming multiobjective optimization nonconvex optimization nonlinear optimization nonlinear programming nonsmooth optimization optimal control optimization proximal point algorithm quadratic programming robust optimization semidefinite programming stochastic optimization stochastic programming trust-region methods unconstrained optimization

© 2026 Optimization Online • Child Theme of GeneratePress
For feedback or questions, contact optonline@wid.wisc.edu.