Formulations and Decomposition Methods for the Incomplete Hub Location Problem With and Without Hop-Constraints

@inproceedings{Camargo2015FormulationsAD,
  title={Formulations and Decomposition Methods for the Incomplete Hub Location Problem With and Without Hop-Constraints},
  author={Ricardo Saraiva de Camargo},
  year={2015}
}
The incomplete hub location problem with and without hop-constraints is modeled using a Leontief substitution system approach. The Leontief formalism provides a set of important theoretical properties and delivers formulations with tight linear bounds that can explicitly incorporate hop constraints for each origin-destination pair of demands. Furthermore, the proposed formulations are amenable to a Benders decomposition technique which can solve large scale test instances. The performance of… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 49 references

Totally unimodular leontief directed hypergraphs

E. M. de Sá, R. S. Camargo, G. Miranda
Linear Algebra and its Applications • 2013
View 6 Excerpts
Highly Influenced

Practical enhancements to the Magnanti-Wong method

Oper. Res. Lett. • 2008
View 6 Excerpts
Highly Influenced

Partitioning procedures for solving mixed - integer programming problems

J. F. Benders
Numerisch Mathematik • 1962
View 3 Excerpts
Highly Influenced

E ffi cient algorithms for the uncapacitated single allocation p - hub median problem

R. Z. Farahani, M. Hekmatfar, A. B. Arabani, E. Nikbakhsh
Location Science • 2013
View 1 Excerpt

Similar Papers

Loading similar papers…