An exercise in transformational programming: Backtracking and Branch-and-Bound

Share/Save/Bookmark

Fokkinga, M.M. (1991) An exercise in transformational programming: Backtracking and Branch-and-Bound. Science of Computer Programming, 16 (1). pp. 19-48. ISSN 0167-6423

open access
[img]
Preview
PDF
205kB
Abstract:We present a formal derivation of program schemes that are usually called Backtracking programs and Branch-and-Bound programs. The derivation consists of a series of transformation steps, specifically algebraic manipulations, on the initial specification until the desired programs are obtained. The well-known notions of linear recursion and tail recursion are extended, for structures, to elementwise linear recursion and elementwise tail recursion; and a transformation between them is derived too.
Item Type:Article
Additional information:Imported from EWI/DB PMS [db-utwente:arti:0000003416], http://www.elsevier.com/
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/66236
Official URL:http://dx.doi.org/10.1016/0167-6423(91)90022-P
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page