The profit-oriented hub line location problem with elastic demand
From MaRDI portal
Publication:6047874
DOI10.1016/j.cor.2023.106335OpenAlexW4381988789MaRDI QIDQ6047874
No author found.
Publication date: 13 September 2023
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2023.106335
Cites Work
- Looking for edge-equitable spanning trees
- A conditional \(p\)-hub location problem with attraction functions
- Facility location for market capture when users rank facilities by shorter travel and waiting times
- A quadratic integer program for the location of interacting hub facilities
- The traveling salesman problem: An overview of exact and approximate algorithms
- Location of hubs in a competitive environment
- Exact and heuristic approaches for the cycle hub location problem
- Global optimization of nonconvex problems with convex-transformable intermediates
- Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints
- Perspectives on modeling hub location problems
- An improved Benders decomposition algorithm for the tree of hubs location problem
- Topological design of a two-level network with ring-star configuration
- Star \(p\)-hub median problem with modular arc capacities
- Integer Programming Formulation of Traveling Salesman Problems
- Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON
- Solving the hub location problem in a star–star network
- Allocating servers to facilities, when demand is elastic to travel and waiting times
This page was built for publication: The profit-oriented hub line location problem with elastic demand
