A Heuristic Procedure For Path Location With Multisource Demand

DOI10.1080/03155986.2003.11732674OpenAlexW2397006241MaRDI QIDQ6039330

Pascual Fernández, Alfredo Marín

Publication date: 5 May 2023

Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03155986.2003.11732674

zbMATH Keywords

Lagrangian relaxationsubgradient optimizationpath locationmultisource

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (3)

Location coverage models with demand originating from nodes and paths: Application to cellular network design ⋮ A Lagrangian relaxation approach for expansion of a highway network ⋮ Location of speed-up subnetworks

This page was built for publication: A Heuristic Procedure For Path Location With Multisource Demand