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

DOI10.1016/0167-6423(91)90022-PzbMATH Open0732.68076OpenAlexW2062341684MaRDI QIDQ808723FDOQ808723

Maarten M. Fokkinga

Publication date: 1991

Published in: Science of Computer Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6423(91)90022-p

zbMATH Keywords

transformational programmingalgebraic manipulations

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Specification and verification (program logics, model checking, etc.) (68Q60)

Cited In (3)

• A problem reduction based approach to discrete optimization algorithm design
• Parallelization of divide-and-conquer in the Bird-Meertens formalism
• Categories, relations and dynamic programming

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• An overview of backtrack search satisfiability algorithms 👍 👎
• Toward a model for backtracking and dynamic programming 👍 👎
• Transformational Programming and the Derivation of Algorithms 👍 👎
• Backjump-based backtracking for constraint satisfaction problems 👍 👎
• Transformational programming and the paragraph problem 👍 👎
• Toward the concept of backtracking computation 👍 👎
• Deciding Full Branching Time Logic by Program Transformation 👍 👎
• Logic Based Program Synthesis and Transformation 👍 👎

This page was built for publication: An exercise in transformational programming: Backtracking and Branch-and- Bound

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q808723)