Newsgroups: comp.constraints
Path: cantaloupe.srv.cs.cmu.edu!das-news2.harvard.edu!news2.near.net!howland.reston.ans.net!pipex!oleane!jussieu.fr!univ-lyon1.fr!pasteur.fr!news2.EUnet.fr!news.fnet.fr!ilog!puget
From: puget@ilog.ilog.fr (Jean-Francois Puget)
Subject: Re: Benchmark
Message-ID: <1995May14.192315.1399@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: Sun, 14 May 95 19:23:15 GMT
Lines: 26

In article <3p2n05$ba0@news.tuwien.ac.at>, anton@mips.complang.tuwien.ac.at (Anton Ertl) writes:
|> In article <1995May12.141354.22674@ilog.fr>, puget@ilog.ilog.fr (Jean-Francois Puget) writes:
[...]
|> 
|> |> 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).


On a PC DX4, at 60 MHz, the search for a solution plus the proof of
optimality took 25954 seconds using Ilog Solver. On a sparc station 20
(sparc at 60 Mhz), it would be about twice as fast. Did you solve the
problem for 13? 

-- 
  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
