MULTI-FACILITY LOCATION PROBLEM WITH NONINCREASING PIECEWISE LINEAR DEMAND ON A TREE

DOI10.15807/jorsj.43.333zbMath0998.90050OpenAlexW2134505094MaRDI QIDQ4538185

Masashi Umezawa, Hisakazu Nishino

Publication date: 11 July 2002

Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.15807/jorsj.43.333

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Discrete location and assignment (90B80)

This page was built for publication: MULTI-FACILITY LOCATION PROBLEM WITH NONINCREASING PIECEWISE LINEAR DEMAND ON A TREE