Electronic Resource
Springer
Journal of combinatorial optimization
3 (1999), S. 17-30
ISSN:
1573-2886
Keywords:
partition
;
combinatorial properties
;
reduction
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
Abstract The three-partition problem is one of the most famous strongly NP-complete combinatorial problems. We introduce properties which, in many cases, can allow either a quick solution of an instance or a reduction of its size. The average effectiveness of the properties proposed is tested through computational experiments.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1023/A:1009856820553
Permalink
Library |
Location |
Call Number |
Volume/Issue/Year |
Availability |