Generators and the Template Method Pattern. A Paradigm for Combinatorial Experimentation

Marc Espie ()
Additional contact information
Marc Espie: Université Paris 7, LIAFA

A chapter in Formal Power Series and Algebraic Combinatorics, 2000, pp 791-800 from Springer

Abstract: Abstract In order to find new combinatorial results, experimental trial on whole collections of combinatorial objects can prove very helpful. From a practical point of view, such collections may take a lot of memory to build, whereas a simple enumeration of these would often be enough. The well-known programming concept of generators can be applied to build such enumerations without excessive practical complexity. This paper reviews that technique, along with an almost automatic translation technique to implement generative algorithms in C++.

Date: 2000
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-662-04166-6_78

Ordering information: This item can be ordered from
http://www.springer.com/9783662041666

DOI: 10.1007/978-3-662-04166-6_78

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().