A Heuristic Procedure For Path Location With Multisource Demand

DOI10.1080/03155986.2003.11732674MaRDI QIDQ6039330zbMATH OpenOpenAlexFDO

Authors P. 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 relaxationmultisourcepath locationsubgradient optimization

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Recommendations

• A tree search algorithm for the multi-commodity location problem
• Upper and lower bounds for the single source capacitated location problem.
• A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints
• Bounds and heuristics for the shortest capacitated paths problem
• Efficient algorithms for the capacitated concentrator location problem

Cited in

(6)

• A heuristic algorithm for the earliest arrival flow with multiple sources
• Location of speed-up subnetworks
• A Lagrangian relaxation approach for expansion of a highway network
• A Multicriteria Districting Heuristic For The Aggregation Of Zones And Its Use In Computing Origin-Destination Matrices
• Multiobjective facility location model for optimizing Arctic oil spill response
• Location coverage models with demand originating from nodes and paths: Application to cellular network design

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6039330)