Hub location as the minimization of a supermodular set function
From MaRDI portal
Recommendations
Cites work
- A branch and cut algorithm for hub location problems with single assignment
- A cost function property for plant location problems
- Adapting polyhedral properties from facility to hub location problems
- An analysis of approximations for maximizing submodular set functions—I
- An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems
- Benders decomposition for large-scale uncapacitated hub location
- Best Algorithms for Approximating the Maximum of a Submodular Set Function
- Branch and price for large-scale capacitated hub location problems with single assignment
- Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- General network design: a unified view of combined location and network design problems
- scientific article; zbMATH DE number 1803765 (Why is no real title available?)
- scientific article; zbMATH DE number 3904328 (Why is no real title available?)
- Hub arc location problems: I. Introduction and results
- Hub Arc Location Problems: Part II—Formulations and Optimal Algorithms
- Hub Location and the p-Hub Median Problem
- Hub location problems in urban traffic networks
- Integer programming formulations of discrete hub location problems
- Locating Discretionary Service Facilities, II: Maximizing Market Size, Minimizing Inconvenience
- Maximising Real-Valued Submodular Functions: Primal and Dual Heuristics for Location Problems
- Maximization of submodular functions: theory and enumeration algorithms
- Maximizing a submodular function by integer programming: Polyhedral results for the quadratic case
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Network hub location problems: The state of the art
- New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem
- New formulations for the uncapacitated multiple allocation hub location problem
- Preprocessing and cutting for multiple allocation hub location problems.
- 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
- The hub location and network design problem with fixed and variable arc costs: formulation and dual-based solution heuristic
- The tree of hubs location problem
- Tight bounds from a path based formulation for the tree of hub location problem
- Uncapacitated Euclidean hub location: strengthened formulation, new facets and a relax-and-cut algorithm
Cited in
(19)- An exact algorithm for the modular hub location problem with single assignments
- Exact and heuristic approaches for the cycle hub location problem
- Trade-offs between the stepwise cost function and its linear approximation for the modular hub location problem
- 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
- A new distributionally robust \(p\)-hub median problem with uncertain carbon emissions and its tractable approximation method
- 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
- Benders decomposition applied to profit maximizing hub location problem with incomplete hub network
- 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
- Formulations and Approximation Algorithms for Multilevel Uncapacitated Facility Location
- A branch‐and‐cut algorithm for hub network design problems with profits
- Two-stage robust multimodal hub network design under budgeted demand uncertainty: a Benders decomposition approach and a case study
- Clustering-driven matheuristic for profit-oriented hub location problem with origin and destination assignments
- A strong formulation for multiple allocation hub location based on supermodular inequalities
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)
