[ספר][B] Distributed control of robotic networks: a mathematical approach to motion coordination algorithms

F Bullo, J Cortés, S Martinez - 2009‏ - books.google.com
This self-contained introduction to the distributed control of robotic networks offers a
distinctive blend of computer science and control theory. The book presents a broad set of …

Retail store density and the cost of greenhouse gas emissions

GP Cachon - Management Science, 2014‏ - pubsonline.informs.org
The density, size, and location of stores in a retailer's network influences both the retailer's
and the consumers' costs. With stores few and far between, consumers must travel a long …

Analytical framework for recurrence network analysis of time series

JF Donges, J Heitzig, RV Donner, J Kurths - Physical Review E—Statistical …, 2012‏ - APS
Recurrence networks are a powerful nonlinear tool for time series analysis of complex
dynamical systems. While there are already many successful applications ranging from …

Inventory pre-positioning for humanitarian operations

AR Akkihal - 2006‏ - dspace.mit.edu
This research examines the impact of inventory pre-positioning on humanitarian operations.
The study identifies optimal locations for warehousing non-consumable inventories required …

[HTML][HTML] Maximising coverage of spatial demand for service

D Tong, AT Murray - Papers in Regional Science, 2009‏ - Elsevier
How to represent geographic space has long been an issue in location modelling. Facilities,
demand and/or the region of interest are often abstracted using aggregated points …

An efficient solution method for Weber problems with barriers based on genetic algorithms

M Bischoff, K Klamroth - European Journal of Operational Research, 2007‏ - Elsevier
In this paper we consider the problem of locating one new facility with respect to a given set
of existing facilities in the plane and in the presence of convex polyhedral barriers. It is …

Hardness of Packing, Covering and Partitioning Simple Polygons with Unit Squares

M Abrahamsen, J Stade - 2024 IEEE 65th Annual Symposium …, 2024‏ - ieeexplore.ieee.org
We show that packing axis-aligned unit squares into a simple polygon P is NP-hard, even
when P is an orthogonal and orthogonally convex polygon with half-integer coordinates. It …

Semi-discrete optimal transport: a solution procedure for the unsquared Euclidean distance case

V Hartmann, D Schuhmacher - Mathematical Methods of Operations …, 2020‏ - Springer
We consider the problem of finding an optimal transport plan between an absolutely
continuous measure and a finitely supported measure of the same total mass when the …

A continuous analysis framework for the solution of location–allocation problems with dense demand

A Murat, V Verter, G Laporte - Computers & Operations Research, 2010‏ - Elsevier
Location–allocation problems arise in several contexts, including supply chain and data
mining. In its most common interpretation, the basic problem consists of optimally locating …

Extended grassfire transform on medial axes of 2d shapes

L Liu, EW Chambers, D Letscher, T Ju - Computer-Aided Design, 2011‏ - Elsevier
The medial axis is an important shape descriptor first introduced by Blum (1967)[1] via a
grassfire burning analogy. However, the medial axes are sensitive to boundary …