scientific article; zbMATH DE number 7497034

DOI10.22067/IJNAO.V9I1.68851MaRDI QIDQ3389573FDOQ3389573

Authors: Maryam Abareshi, Mehdi Zaferanieh 

Publication date: 23 March 2022

Title of this publication is not available (Why is that?)

zbMATH Keywords

facility location1-median problemprobabilistic weightsprobabilistic traveling times

Mathematics Subject Classification ID

Numerical analysis (65-XX) Operations research, mathematical programming (90-XX)

Cites Work

• Title not available (Why is that?)
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
• Title not available (Why is that?)
• The network \(p\)-median problem with discrete probabilistic demand weights
• Title not available (Why is that?)
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• Title not available (Why is that?)
• An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs
• Computing the 2‐median on tree networks in O(n lg n) time
• A heuristic algorithm for solving large location-inventory problems with demand uncertainty

Cited In (5)

• Solving the median problem with continuous demand on a network
• The \(p\)-median problem with upgrading of transportation costs and minimum travel time allocation
• The 1-Median And 1-Antimedian Problems With Continuous Probabilistic Demand Weights
• The 1-median and 1-highway problem
• Solving the 1-median problem on a network with continuous demand and demand surplus

This page was built for publication:

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