David,
I think this problem falls into the category of graph algos. It seems
there is some research required to get a suitable solution. Have you
done some investigations yourself and can point the community to
starting points, so people might have an easier time to get ideas?
Cheers,
/peter neubauer
GTalk: neubauer.peter
Skype peter.neubauer
Phone +46 704 106975
LinkedIn http://www.linkedin.com/in/neubauer
Twitter http://twitter.com/peterneubauer
http://www.neo4j.org - Your high performance graph database.
http://startupbootcamp.org/ - Öresund - Innovation happens HERE.
http://www.thoughtmade.com - Scandinavia's coolest Bring-a-Thing party.
On Wed, Aug 10, 2011 at 3:25 PM, David Gildea
david.gil...@prudential.com wrote:
Hi All,
I have an interesting problem I am trying to solve and would like some
direction on how I could solve it using Neo4j.
I work in a large building where the teams of developers are all over the
places and we would like to keep teams together. So I would like to solve
2 problems hopefully at the same time. Assuming a have a Neo4j database of
all employees, the reporting relationships and who the work with and also
the seating location as a property I would like to calculate
The optimal seating plan that would have all team co-located and beside
their manager and
Doing that with the least amount of moves for the computer department that
actually need to the physical computers and phones etc.
Is this that kind of problem that Neo4j could help solve, I think yes
based on a basic knowledge of graph databases, but perhaps someone could
give me some guidance on the suitability of Neo4j and a possible solution.
Thanks
Dave
___
Neo4j mailing list
User@lists.neo4j.org
https://lists.neo4j.org/mailman/listinfo/user
___
Neo4j mailing list
User@lists.neo4j.org
https://lists.neo4j.org/mailman/listinfo/user
