Directed hypergraphs as a modelling paradigm

Bala M., Martin K.,A mathematical programning approach to data base normalization, Technical report, Graduate School of Business, University of Chicago, 1993.

Basu A., Blanning R. W.,A tool for modeling decision support systems, Management Science, 40 (12), 1994, 1579–1600.

Berge C.,Graphs and Hypergraphs, North-Holland, Amsterdam, 1973.

Berge C.,Minimax theorems for normal hypergraphs and balanced hyper-graphs—a survey, Annals of Discrete Mathematics, 21, 1984, 3–19.

Berce C.,Hypergraphs: Combinatorics of Finite Sels, North-Holland, Amsterdam, 1989.

Boley H.,Directed recursive label node hyeergraphs: a new representation language, Artificial Intelligence, 9, 1977, 49–85.

Cook S.,The complexity of theorem-proving procedures, in Proc. 3-th acm symp. on Theory of Computing, 1971, 151–158.

Dowling W., Gallier J.,Linear-time algorithms for testing the satisfiability of propositional Horn formulae, J. Logic Programming, 3, 1984, 267–284.

Dyckhoff H.,A typology of cutting and packing problems, European J. Oper. Res., 44, 1990, 145–159.

Furtado A. L.,Formal aspects of the relational model, Information Systems, 3, 1978, 131–140.

Gale D.,The Theory of Linear Economic Models, McGraw-Hill, New York, NY, 1960.

Gallo G., Gentile C., Pretolani D., Rago G.,Max Horn Sat and the minimum cut problem on directed hypergaphs, Math. Programming, 80, 1998, 213–237.

Gallo G., Licheri N., Scutellà M. G.,The Hypergraph Simplex approach: some experimental results, Ricerca Operativa, 78 (anno XXVI), 1996, 21–54.

Gallo G., Longo G., Nguyen S., Pallottino S. Directed hypergraphs and applications, Discrete Appl. Math., 40, 1993, 177–201.

Gallo G., Pallottino S.,Hypergraph models and algorithms for the Assembly Problem, Technical Report TR-6/92, Dipartimento di Informatica, Università di Pisa, Pisa, Italy, 1992.

Gallo G., Scutellà, M. G.,Minimum makespan assembly plans, Technical Report TR-98-10, Dipartimento di Informatica, Università di Pisa, Pisa, Italy, 1998.

Gallo G., Urbani G.,Algorithms for testing the satisfiability of propositional formulae, J. Logic Programming, 7, 1989, 45–61.

Gambale M., Nonato M., Scutellà M. G.,The cutting stock problem: a new model based on hypergraph flows, Ricerca Operativa, 74 (anno XXV), 1995, 73–97.

Garey M. R., Johnson D. S.,Computers and Intractability: A Guide to the Theory of NP-completcness, W. H. Freeman, San Francisco, CA, 1979.

Gnesi S., Montanari U., Martelli A.,Dynamic programming as graph searching: an algebraic approach, J. Assoc. Comput. Mach, 28, 1981, 737–751.

Henderson J. M., Quandt R. E.,Microeconomic Theory, a Mathematical approach, McGraw-Hill, New York, NY, 1971.

Hopcroft J. E., Ullman J. D.,Formal languages and their relation to automata. Addison-Wesley, 1969.

Itai A., Makowsky J.,On the complexity of Herbrand’s theorem, Technical Report T. R. 213, Dept. Comp. Sci., Israel Inst. of Technology, Israel, 1982.

Italiano G. F., Nanni U.,On line maintenance of minimal directed hypergraphs, in Prec. 3 Convegno Italiano di Informatica Teorica, World Science Press, 1989, 335–349.

Jaumard B., Simeone B.,On the complexity of the maximum satisfiability problem for Horn formulas, Inform. Process. Lett., 26, 1987, 1–4.

Jeroslow R. G., Martin R. K., Rardin R. R., Wang G.,Gainfree Leontief substitution flow problems, Math. Programming, 57, 1992, 375–414.

Knuth D. E.,A generatization of Dijkstra’s algorithm, Inform. Process. Lett., 6 (1), 1977, 1–5.

Levi G., Sirovich F.,Generulized And/Or Graphs, Artificial Intelligence, 7, 1976, 243–259.

Lucchesi C. L., Osborn S. L.,Candidate keys for relations, J. Comput. System Sci., 17, 1978, 270–279.

Maier D.,Minimum covers in the relational data base model, J. Assoc. Comput. Mach., 27, 1980, 664–674.

Marcotte P., Nguyen S.,Hyperpath formulations of traffic assignment problems, in P. Marcotte and S. Nguyen, editors,Equilibrium and Advanced Transportation Modelling, Kluwer Academic, MA, 1998, 175–200.

Martelli A., Montanari U.,Additive And/Or graphs, Proceeding IJCAI, 3, 1977, 1–11.

Homen De Mello L. S., Sanderson A. C.,And/Or graph representation of assenbly plans, IEEE Transactions on Robotics and Automation, 6, 1990, 188–199.

Nguyen S., Pallottino S. Equilibrium traffic assignment for large scale transit network, European J. Oper. Res., 37, 1988, 176–186.

Nguyen S., Pallottino S. Hyperpaths and shortest hyperpaths, in B. Simeone, editor,Combinatorial Optimization, volume 1403 ofLectures Notes in Mathematics, Springer-Verlag, Berlin, 1989, 258–271.

Nilsson N. J.,Problem Solving Methods in Artificial Intelligence, McGraw-Hill, New York, NY, 1971.

Nilsson N. J.,Principles of Artificial Intelligence, Morgan Kaufmann, Los Altos, CA, 1980.

Cambini R., Gallo G., Scutella M. G.,Flows on hypergraphs, Math. Programming, 78, 1997, 195–217.

Scheithauer G., Terno H.,About the gap between the optimal values of the integer and continnous relaxation one-dimensional cutting stock prblem, in Oper. Res. Proc., Springer Verlag, Berlin 1992.

Scheithauer G., Terno H.,The modified integer round-up property for the one-dimensional cutting stock problem, European J. Oper. Res., 84, 1995, 562–571.

Scheithauer G., Terno H.,Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem, Oper. Res. Lett., 20, 1997, 93–100.

Takayama A.,Mathematical Economics, Cambridge University Press, 1985.

Ullman J. D.,Principles of Database Systems, Computer Science Press, Reckville, MD, 1982.