Continuous location of an assembly station

DOI10.1007/s11750-011-0185-9zbMath1273.90111OpenAlexW1981293359MaRDI QIDQ356516

Mohamed Elosmani, Frank Plastria

Publication date: 26 July 2013

Published in: Top (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11750-011-0185-9

zbMATH Keywords

nonlinear optimizationsupply chain managementlocationnon-convex optimizationWeiszfeld algorithm

Mathematics Subject Classification ID

Continuous location (90B85) Transportation, logistics and supply chain management (90B06)

Related Items (1)

Up- and downgrading the Euclidean 1-median problem and knapsack Voronoi diagrams

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the convergence of the Weiszfeld algorithm for continuous single facility location-allocation problems
• On the point for which the sum of the distances to \(n\) given points is minimum
• Location with acceleration-deceleration distance
• Continuous location problems and big triangle small triangle: Constructing better bounds
• GBSSS: The generalized big square small square method for planar single- facility location
• Weber problems with alternative transportation systems
• Solving the ordered one-median problem in the plane
• Weber problems with mixed distances and regional demand
• The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems
• An Algorithm for Large Zero-One Knapsack Problems
• Heuristic Methods for Location-Allocation Problems
• The Weiszfeld Algorithm: Proof, Amendments, and Extensions
• A note on Fermat's problem

This page was built for publication: Continuous location of an assembly station