Hub location as the minimization of a supermodular set function
From MaRDI portal
Publication:2935299
DOI10.1287/OPRE.2014.1263zbMATH Open1304.90120OpenAlexW2107357529MaRDI QIDQ2935299FDOQ2935299
Authors: Elena Fernández, Ivan 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
Recommendations
Cites Work
- Best Algorithms for Approximating the Maximum of a Submodular Set Function
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- The tree of hubs location problem
- 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.
- 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
- Network hub location problems: The state of the art
- Benders decomposition for large-scale uncapacitated hub location
- Title not available (Why is that?)
- Title not available (Why is that?)
- Hub Location and the p-Hub Median Problem
- An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems
- Adapting polyhedral properties from facility to hub location problems
- Uncapacitated Euclidean hub location: strengthened formulation, new facets and a relax-and-cut algorithm
- New formulations for the uncapacitated multiple allocation hub location problem
- An analysis of approximations for maximizing submodular set functions—I
- A branch and cut algorithm for hub location problems with single assignment
- Hub location problems in urban traffic networks
- Hub arc location problems: 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
- Tight bounds from a path based formulation for the tree of hub location problem
- Branch and price for large-scale capacitated hub location problems with single assignment
- Locating Discretionary Service Facilities, II: Maximizing Market Size, Minimizing Inconvenience
- Maximization of submodular functions: theory and enumeration algorithms
- 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
- Solving the hub location problem in a star–star network
- Star \(p\)-hub median problem with modular arc capacities
- Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem
- Maximizing a submodular function by integer programming: Polyhedral results for the quadratic case
- Maximising Real-Valued Submodular Functions: Primal and Dual Heuristics for Location Problems
Cited In (16)
- A new distributionally robust \(p\)-hub median problem with uncertain carbon emissions and its tractable approximation method
- Trade-offs between the stepwise cost function and its linear approximation for the modular hub location problem
- 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
- Exact and heuristic algorithms for the design of hub networks with multiple lines
- Multi-level facility location as the maximization of a submodular set function
- Benders decomposition applied to profit maximizing hub location problem with incomplete hub network
- An exact algorithm for the modular hub location problem with single assignments
- The capacitated directed cycle hub location and routing problem under congestion
- A branch‐and‐cut algorithm for hub network design problems with profits
- A two-stage stochastic programming approach for influence maximization in social networks
- Exact and heuristic approaches for the cycle hub location problem
- An exact cutting plane method for \(k\)-submodular function maximization
- A tailored Benders decomposition approach for last-mile delivery with autonomous robots
- Formulations and Approximation Algorithms for Multilevel Uncapacitated Facility Location
- Perspectives on modeling hub location problems
This page was built for publication: Hub location as the minimization of a supermodular set function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2935299)
