A Decomposition Method for the Solution of Dual-Angular Integer Programs.
STANFORD UNIV CALIF SYSTEMS OPTIMIZATION LAB
Pagination or Media Count:
Integer linear programming problems whose constraint matrices have dual-angular structures arise in several types of applications, particularly those which seek to specify a strategy for future actions based on observed results of previous decisions. An implicit enumeration method for integer linear programming is developed for application to problems with such dual-angular constraint matrices. Modified author abstract
- Operations Research