Priority-based search for combinatorial optimization problems
Number of patents in Portfolio can not be more than 2000
United States of America Patent
Stats
-
N/A
Issued Date -
Feb 10, 2005
app pub date -
Aug 5, 2003
filing date -
Aug 5, 2003
priority date (Note) -
Abandoned
status (Latency Note)
Importance
Abstract
A method solves a combinatorial optimization problem including multiple elements and values. An ordering function is applied to an instance of the combinatorial optimization problem to produce an ordering of elements. The ordering of the elements is modified repeatedly to produce a re-ordering of the elements. A placement function is applied to each re-ordering of the elements to obtain solutions of the combinatorial optimization problem, until a termination condition is reached, and a best solution is selected.
First Claim
Family
International Classification(s)
Cited Art Landscape
Patent Citation Ranking
Recipient Email Address
Recipient Email Address
Comment
Recipient Email Address
Add to Portfolio(s)
To add this patent to one, or more, of your portfolios, simply click the add button.
This Patent is in these Portfolios:
Add to additional portfolios:
Last Refreshed On:
Changes done successfully