The Facility Location Problem with Concave Cost Functions

The Facility Location Problem with Concave Cost Functions

Bibliographic Details
Main Authors:	Hajiaghayi, Mohammad Taghi, Mahdian, Mohammad, Mirrokni, Vahab S.
Published:	2023
Online Access:	https://hdl.handle.net/1721.1/149960

Similar Items

Strategyproof Facility Location for Concave Cost Functions
by: Fotakis, Dimitris, et al.
Published: (2016)

Facility location and the analysis of algorithms through factor-revealing programs
by: Mahdian, Mohammad, 1976-
Published: (2005)

Composable core-sets for diversity and coverage maximization
by: Indyk, Piotr, et al.
Published: (2018)

Combinatorial optimization problems with concave costs
by: Stratila, Dan
Published: (2009)

Contextual bandits with cross-learning
by: Balseiro, Santiago, et al.
Published: (2021)

Generalized Benders decomposition for competitive facility location with concave demand and zone-specialized variable attractiveness
by: Lin, Yun Hui, et al.
Published: (2022)

A composite algorithm for the concave-cost LTL consolidation problem
by: Balakrishnan, Anantaram., et al.
Published: (2009)

Submodular Secretary Problem and Extensions
by: Zadimoghaddam, Morteza, et al.
Published: (2010)

The retailer facility location problem
by: Rosenfield, Donald B.
Published: (2009)

The bidimensionality theory and its algorithmic applications
by: Hajiaghayi, MohammadTaghi
Published: (2006)

Strongly Polynomial Primal-Dual Algorithms for Concave Cost Combinatorial Optimization Problems
by: Magnanti, Thomas L., et al.
Published: (2012)

Decomposition methods for facility location problems
Published: (2004)

Approximation algorithms for distributed and selfish agents
by: Mirrokni, Vahab S
Published: (2006)

Two traveling salesman facility location problems
Published: (2003)

Network design problems for improving facility locations
by: Ingco, Divinagracia I. (Divinagracia Ilagan)
Published: (2005)

Nonparametric Bayes inference for concave distribution functions
by: Hansen, M, et al.
Published: (2002)

Coordinate ascent for maximizing nondifferentiable concave functions
Published: (2003)

Tight Approximation Algorithms for Maximum Separable Assignment Problems
by: Goemans, Michel X., et al.
Published: (2013)

Fixed Parameter Algorithms for Minor-Closed Graphs (of Locally Bounded Treewidth)
by: Demaine, Erik D., et al.
Published: (2023)

Equivalence of Local Treewidth and Linear Local Treewidth and its Algorithmic Applications
by: Demaine, Erik D., et al.
Published: (2023)

On the Max-Flow Min-Cut Ratio for Directed Multicommodity Flows
by: Hajiaghayi, MohammadTaghi, et al.
Published: (2005)

The Satisfiability Threshold of Random 3-SAT Is at Least 3.52
by: Hajiaghayi, MohammadTaghi, et al.
Published: (2005)

A review on multiple criteria undesirable facility location problems
by: Tang, Sai Hong, et al.
Published: (2013)

Approximating Buy-at-Bulk k-Steiner trees
by: Hajiaghayi, MohammadTaghi, et al.
Published: (2006)

Polylogarithmic Approximation Algorithm for Non-Uniform Multicommodity Buy-at-Bulk
by: Hajiaghayi, MohammadTaghi, et al.
Published: (2006)

Concavely−Priced Timed Automata
by: Jurdzinski, M, et al.
Published: (2008)

Preservation of log-concavity on summation
by: Johnson, O, et al.
Published: (2006)

Approximating Submodular Functions Everywhere
by: Goemans, Michel X., et al.
Published: (2011)

Facility location and pricing problem: discretized mill price and exact algorithms
by: Lin, Yun Hui, et al.
Published: (2023)

Approximation Algorithms via Contraction Decomposition
by: Hajiaghayi, Mohammad Taghi, et al.
Published: (2011)

Minimizing movement: Fixed-parameter tractability
by: Demaine, Erik D., et al.
Published: (2011)

Certain new class of concave functions defined by sălăgean differential operator
by: Ibtisam Aldawish,, et al.
Published: (2013)

Gradient bounded dynamic programming with submodular and concave extensible value functions
by: Lebedev, D, et al.
Published: (2021)

Facility location with Minimax envy
by: Cai, Q, et al.
Published: (2016)

Geometry of Log-Concave Density Estimation
by: Robeva, Elina, et al.
Published: (2021)

Concave-Convex Adaptive Rejection Sampling
by: Goeruer, D, et al.
Published: (2011)

Separable Concave Optimization Approximately Equals
by: Magnanti, Thomas L., et al.
Published: (2006)

Concavely−Priced Probabilistic Timed Automata
by: Kwiatkowska, G, et al.
Published: (2009)

CONCAVELY−PRICED PROBABILISTIC TIMED AUTOMATA
by: Jurdzinski, M, et al.
Published: (2009)

From Battlefields to Elections: Winning Strategies of Blotto and Auditing Games
by: Behnezhad, Soheil, et al.
Published: (2020)