Mathematical models for selection of optimal place and size of connections considering the time-value of money

DOI10.1016/j.ejor.2009.01.050zbMath1177.90260OpenAlexW1970175246MaRDI QIDQ1044096

Amir Rastpour, Mohammad Shahrokh Esfahani

Publication date: 10 December 2009

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2009.01.050

zbMATH Keywords

linear programminginvestment analysisnonlinear programminglogisticseconomics

Mathematics Subject Classification ID

Continuous location (90B85) Nonlinear programming (90C30) Linear programming (90C05) Transportation, logistics and supply chain management (90B06) Portfolio theory (91G10)

Related Items (1)

Optimization models for a single-plant district cooling system

Cites Work

• The \(K\)-connection location problem in a plane
• Designing two-echelon supply networks
• Location of infrastructure in urban railway networks
• A dual ascent approach to the fixed-charge capacitated network design problem
• Network design and flow problems with cross-arc costs
• Distribution network design: Selection and sizing of congested connections
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Approximate solutions of capacitated fixed-charge minimum cost network flow problems
• DoorFAST: A constructive procedure to optimally layout a facility including aisles and door locations basedon anaisle flow distance metric
• Supply facility and input/output point locations in the presence of barriers

This page was built for publication: Mathematical models for selection of optimal place and size of connections considering the time-value of money