Solving Nonlinear Single-Facility Network Location Problems

DOI10.1287/OPRE.34.5.732zbMATH Open0619.90020OpenAlexW2058326358MaRDI QIDQ3757657FDOQ3757657

Authors:

Publication date: 1986

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.34.5.732

Recommendations

• Solving nonlinear multiple-facility network location problems
• scientific article; zbMATH DE number 4003873
• Locating A Median Subtree On A Network
• Some reverse location problems
• scientific article; zbMATH DE number 1394671

zbMATH Keywords

computational complexityside constraintssemiseparabilitysingle- facility network locationtreelike segment

Mathematics Subject Classification ID

Convex programming (90C25) Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Inventory, storage, reservoirs (90B05)

Cited In (6)

• Title not available (Why is that?)
• Networklike metric spaces
• Discrete Center Problems
• Solving nonlinear multiple-facility network location problems
• The Variance Location Problem on a Network with Continuously distributed demand
• Title not available (Why is that?)

This page was built for publication: Solving Nonlinear Single-Facility Network Location Problems

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