The Houses and Utilities Crossing Problem

The edges that connect each utility (green disks) to each house (blue squares) are in a single color. Each house in turn has a spectrum of colored edges that connect it to each utility. The red points are crossing points of utility lines. The object is to minimize the number of crossings for a particular set of utilities and houses by shifting their locations.
The minimal known number of crossings for 6, 7, 8, …, 14 houses and utilities is 1, 2, 4, 8, 16, 24, 36, 54, 77-81. The exact value of the last, for seven houses and seven utilities, has been a long unsolved question.

comments
 
Powered by Wolfram Mathematica
Give us your feedback
Give us your feedback

Source page:




 often  occasionally  never

Note: Please do not include anything you consider confidential or proprietary. Your message and contact information may be shared with the author of any specific Demonstration for which you give feedback, but will not otherwise be published or distributed.
Privacy Policy »

Note: To run this Demonstration you need the free
Mathematica Player
or Mathematica 7+
Download or upgrade to Mathematica Player 7
I already have Mathematica Player or Mathematica 7+