Hub Location as the Minimization of a Supermodular Set Function

DOI10.1287/OPRE.2014.1263zbMath1304.90120OpenAlexW2107357529MaRDI QIDQ2935299

Elena Fernández, Iván A. Contreras

Publication date: 22 December 2014

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.2014.1263

zbMATH Keywords

integer programmingsupermodular functionshub locationcutting plane methods

Mathematics Subject Classification ID

Integer programming (90C10) Discrete location and assignment (90B80)

Related Items (16)

Exact and heuristic algorithms for the design of hub networks with multiple lines ⋮ Benders decomposition applied to profit maximizing hub location problem with incomplete hub network ⋮ Multi-level facility location as the maximization of a submodular set function ⋮ An exact algorithm for the modular hub location problem with single assignments ⋮ Exact and heuristic approaches for the cycle hub location problem ⋮ A branch‐and‐cut algorithm for hub network design problems with profits ⋮ Formulations and Approximation Algorithms for Multilevel Uncapacitated Facility Location ⋮ Trade-offs between the stepwise cost function and its linear approximation for the modular hub location problem ⋮ A new distributionally robust \(p\)-hub median problem with uncertain carbon emissions and its tractable approximation method ⋮ A two-stage stochastic programming approach for influence maximization in social networks ⋮ Exact solution of hub network design problems with profits ⋮ Disaggregated Benders decomposition and branch-and-cut for solving the budget-constrained dynamic uncapacitated facility location and network design problem ⋮ Perspectives on modeling hub location problems ⋮ The capacitated directed cycle hub location and routing problem under congestion ⋮ An exact cutting plane method for \(k\)-submodular function maximization ⋮ A tailored Benders decomposition approach for last-mile delivery with autonomous robots

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Adapting polyhedral properties from facility to hub location problems
• Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem
• Uncapacitated Euclidean hub location: strengthened formulation, new facets and a relax-and-cut algorithm
• New formulations for the uncapacitated multiple allocation hub location problem
• Tight bounds from a path based formulation for the tree of hub location problem
• Maximization of submodular functions: theory and enumeration algorithms
• The tree of hubs location problem
• Maximizing a submodular function by integer programming: Polyhedral results for the quadratic case
• Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
• Integer programming formulations of discrete hub location problems
• Preprocessing and cutting for multiple allocation hub location problems.
• A branch and cut algorithm for hub location problems with single assignment
• General network design: a unified view of combined location and network design problems
• New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem
• Star \(p\)-hub median problem with modular arc capacities
• Network hub location problems: The state of the art
• Benders Decomposition for Large-Scale Uncapacitated Hub Location
• Branch and Price for Large-Scale Capacitated Hub Location Problems with Single Assignment
• Hub Arc Location Problems: Part I—Introduction and Results
• Hub Arc Location Problems: Part II—Formulations and Optimal Algorithms
• The hub location and network design problem with fixed and variable arc costs: formulation and dual-based solution heuristic
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Maximising Real-Valued Submodular Functions: Primal and Dual Heuristics for Location Problems
• A cost function property for plant location problems
• Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
• An analysis of approximations for maximizing submodular set functions—I
• Best Algorithms for Approximating the Maximum of a Submodular Set Function
• Hub Location and the p-Hub Median Problem
• An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems
• Locating Discretionary Service Facilities, II: Maximizing Market Size, Minimizing Inconvenience
• Solving the hub location problem in a star–star network

This page was built for publication: Hub Location as the Minimization of a Supermodular Set Function