Newsgroups: comp.constraints
Path: cantaloupe.srv.cs.cmu.edu!das-news2.harvard.edu!news2.near.net!news.mathworks.com!gatech!news.sprintlink.net!EU.net!news2.EUnet.fr!news.fnet.fr!ilog!puget
From: puget@ilog.ilog.fr (Jean-Francois Puget)
Subject: Re: Benchmark
Message-ID: <1995May15.124117.15778@ilog.fr>
To: anton@mips.complang.tuwien.ac.at (Anton Ertl)
Sender: news@ilog.fr
Nntp-Posting-Host: laumiere
Organization: ILOG S.A., France
References: <1995May12.141354.22674@ilog.fr> <3p2n05$ba0@news.tuwien.ac.at>
Date: Mon, 15 May 95 12:41:17 GMT
Lines: 34

In article <3p2n05$ba0@news.tuwien.ac.at>, anton@mips.complang.tuwien.ac.at (Anton Ertl) writes:
|> 
|> Yes, it's a nice problem. I used is as an example problem in my
|> Diplomarbeit (~Master's thesis). You can find a version of it without
|> graphics at
|> 
|> http://www.complang.tuwien.ac.at/Diplomarbeiten/ertl90.ps.gz
|> 
|> The section on the Golomb problem is on pages 73-75 and includes the
|> program (and no graphics, so this section is complete).
|> 
|> |> An optimal solution for Golomb 12 is:
|> |> 
|> |> 0  2  6  24  29  40  43  55  68  75  76  85
|> |> 
|> |> It is found after more than 2042000 backtracks.
|> |> The total number of backtracks (or fails) including the proof of
|> |> optimality is 3143316.
|> 
|> And how long did it take? My program took ~110000s on a DG Aviion 5000
|> (20MHz 88100).
|> 
|> - anton

From what I understand of your thesis, your program already knows the
value of the optimal length, thus it does not prove the optimality.

We achieve an order of magnitude speedup if we use this information.

-- 
  Jean-Francois Puget		 net : puget@ilog.fr
  ILOG S.A.                      url : http://www.ilog.fr
  2 Avenue Gallieni - BP 85	 tel : +33 1 46 63 66 66
  F-94253 Gentilly Cedex FRANCE	 fax : +33 1 46 63 15 82
