Author:
Ali Agha Iqbal,Han Hyun-Soo,Kennington Jeffery L.
Publisher
Springer Berlin Heidelberg
Reference23 articles.
1. Ali, A. I., H. Han. 1994a. “Computational Implementation of Fujishige's Graph Realizability Algorithm,” Working Paper, School of Management, University of Massachusetts at Amherst.
2. Ali, A. I., H. Han. 1994b. “Extracting Hidden Network Submatrices of a (0,1) Matrix Using a PQ-graph,” Working Paper, School of Management, University of Massachusetts at Amherst.
3. Ali, A. I., H. Thiagarajan. 1989. “A Network Relaxtion Based Enumeration Algorithm for Set Partioning,” European Journal of Operational Research, 38, 76–89.
4. Avis, A. 1980. “A Note on Some Computationally Difficult Set Covering problems,” Mathematical Programming, 18, 135–143.
5. Balas, E. 1980. “Cutting Planes from Conditional Bounds: A New Approach to Set Covering,” Mathematical Programming Study, 12, 19–36.