On the generation of circuits and minimal forbidden sets

Mathematical Programming

Volumn 102, Issue 1, 2005, Pages 185-203

  Stork, Frederik ^a   Uetz, Marc ^b  

^a ILOG Deutschland GmbH   (Germany)

^b MAASTRICHT UNIVERSITY   (Netherlands)

Author keywords

Circuit; Counting; Enumeration; Forbidden set; Independence system; Project scheduling; Resource constraints

Indexed keywords

ALGORITHMS; NETWORKS (CIRCUITS); POLYNOMIALS; PROBLEM SOLVING; RANDOM PROCESSES; SCHEDULING;

ENUMERATION; FORBIDDEN SET; INDEPENDENCE SYSTEM; PROJECT SCHEDULING; RESOURCE CONSTRAINTS;

SET THEORY;

EID: 12344330553     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10107-004-0512-0     Document Type: Article

References (27)

1. Alvarez-Valdés Olaguíbel, R., Tamarit Goerlich, J.M.: The project scheduling polyhedron: Dimension, facets, and liftig theorems. Eur. J. Oper. Res. 67, 204-220 (1993)
2. Balas, E.: Project scheduling with resource constraints. In: Beale, E.M.L., (ed.). Applications of Mathematical Programming Techniques. The English University Press, London, 1970
3. Bartusch, M.: An algorithm for generating all maximal independent subsets of posets. Computing 26, 343-354 (1981)
4. Bartusch, M.: Optimierung von Netzplänen mit Anordnungsbeziehungen bei knappen Betriebsmitteln. PhD thesis, Rheinisch-Westfälische Technische Hochschule Aachen, Aachen, Germany, 1984
5. Bartusch, M., Möhring, R.H., Radermacher, F.J.: Scheduling project networks with resource constraints and time windows. Ann. Oper. Res. 16, 201-240 (1988)
6. Boros, E., Elbassioni, K., Khachiyan, L., Makino, K.: Dual-bounded generating problems: All minimal integer solutions for a monotone system of linear inequalities. SIAM J. Comput. 31, 1624-1643 (2002)
7. Boros, E., Gurvich, V., Hammer, P.L.: Dual subimplicants of positive boolean functions. Optim. Meth. Softw. 10, 147-156 (1998)
8. Brandstädt, A., Le, V.B., Spinrad, J.P.: Graph Classes: A Survey. SIAM Monographs on Discrete Mathematics and Applications. Society for Industrial and Applied Mathematics. Philadelphia, PA, 1999
9. Chvátal, V., Hammer, P.L.: Aggregation of inequalities in integer programming. Ann. Disc. Math. 1, 145-162 (1977)
10. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York, 1979
11. Igelmund, G., Radermacher, F.J.: Algorithmic approaches to preselective strategies for stochastic scheduling problems. Networks 13, 29-48 (1983)
12. Igelmund, G., Radermacher, F.J.: Preselective strategies for the optimization of stochastic project networks under resource constraints. Networks 13, 1-28 (1983)
13. Johnson, D.S., Yannakakis, M., Papadimitriou, C.H.: On generating all maximal independent sets. Inf. Processing Lett. 27, 119-123 (1988)
14. Kolisch, R., Sprecher, A.: PSPLIB - A project scheduling problem library. Eur. J. Oper. Res. 96, 205-216 (1996)
15. Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Generating all maximal independent sets: NP-hardness and polynomial-time algorithms. SIAM J. Comput. 9, 558-565 (1980)
16. Möhring, R.H.: Algorithmic aspects of comparability graphs and interval graphs. In: Rival, I., (ed.), Graphs and Order, NATO Advanced Science Institute Series, D. Reidel Publishing Company, Dordrecht, 1985, pp. 41-101
17. Möhring, R.H., Skutella, M., Stork, F.: Scheduling with AND/OR precedence constraints. SIAM J. Comput. 2004. To appear
18. Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading, MA, 1994
19. Pritsker, A.A.B., Watters, L.J., Wolfe, P.M.: Multi project scheduling with limited resources: A zero-one programming approach. Manage. Sci. 16, 93-108 (1969)
20. Provan, J.S., Ball, M.O.: The complexity of counting cuts and of the probability that a graph is connected. SIAM J. Comput. 12, 777-788 (1983)
21. PSPLIB. http://www.bwl.uni-kiel.de/Prod/psplib/, 2000
22. Radermacher, F.J.: Scheduling of project networks. Ann. Oper. Res. 4, 227-252 (1985)
23. Roy, B., Sussmann, B.: Les problèmes d'ordonnancement avec contraintes disjonctives. Note D.S. 9 bis, SEMA, Paris, France, 1964
24. Stork, F.: Stochastic Resource-Constrained Project Scheduling. PhD thesis, Institut für Mathematik, Technische Universität Berlin, Berlin, Germany, 2001
25. Valiant, L.G.: The complexity of computing the permanent. Theor. Comput. Sci. 8, 189-201 (1979)
26. Valiant, L.G.: The complexity of enumeration and reliability problems. SIAM J. Comput. 8, 410-421 (1979)
27. Yannakakis, M.: The complexity of the partial order dimension problem. SIAM J. Algebraic Disc. Meth. 3, 351-358 (1982)