𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Satisfiability Problem for Probabilistic Ordered Branching Programs

✍ Scribed by M. Agrawal; T. Thierauf

Publisher
Springer
Year
2001
Tongue
English
Weight
246 KB
Volume
34
Category
Article
ISSN
1433-0490

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Mixed-integer column generation algorith
Mixed-integer column generation algorithms and the probabilistic maximum satisfiability problem
✍ Pierre Hansen; Brigitte Jaumard; Marcus Poggi de Araga˜o πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 950 KB

The column generation approach to large-scale linear programming is extended to the mixed-integer case. Two general algorithms, a dual and a primal one, are presented. Both involve finding k-best solutions to combinatorial optimization subproblems. Algorithms for these subproblems must be tailored t