scientific article
From MaRDI portal
Publication:3806960
zbMath0657.90035MaRDI QIDQ3806960
Publication date: 1988
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
exact solutionbranch-and-boundheuristic algorithmsWeber problemcentral factilityoptimal selection of points of supplysupply surplus
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonlinear programming (90C30) Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05)
Related Items (6)
Continuous location of an assembly station ⋮ Solving the 1-median problem on a network with continuous demand and demand surplus ⋮ Up- and downgrading the Euclidean 1-median problem and knapsack Voronoi diagrams ⋮ GBSSS: The generalized big square small square method for planar single- facility location ⋮ On the convergence of the Weiszfeld algorithm for continuous single facility location-allocation problems ⋮ Undesirable facility location with minimal covering objectives
This page was built for publication:
