Zero-one integer programming is a mathematical method of using a series of yes (1) and no (0) answers to arrive at a solution.

A timetabling problem is formulated as a large integer linear programming problem in 0-1 variables. A solution method based on Lagrangean relaxation coupled with subgradient optimization is presented.

Patterns in JavaA tale of three patternsby Kevlin HenneyListing 1. Iteration over a sorted binary tree using recursive descent in an enumeration method.

Mixed integer programming modeling for the satellite three-dimensional component assignment and layout optimization problem [J].

A timetabling problem is formulated as a large integer linear programming problem in 0-1 variables. A solution method based on Lagrangean relaxation coupled with subgradient optimization is presented.