An integer analogue of Carathe´odory's theorem
Journal of Combinatorial Theory Series B
Theory of linear and integer programming
Theory of linear and integer programming
A geometric Buchberger algorithm for integer programming
Mathematics of Operations Research
Variation of cost functions in integer programming
Mathematical Programming: Series A and B
A Variant of the Buchberger Algorithm for Integer Programming
SIAM Journal on Discrete Mathematics
Buchberger Algorithm and Integer Programming
AAECC-9 Proceedings of the 9th International Symposium, on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Minimal Solutions of Linear Diophantine Systems: Bounds and Algorithms
RTA '91 Proceedings of the 4th International Conference on Rewriting Techniques and Applications
Decomposition of Integer Programs and of Generating Sets
ESA '97 Proceedings of the 5th Annual European Symposium on Algorithms
Hilbert Bases, Caratheodory's Theorem and Combinatorial Optimization
Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference
A Combinatorial Approach to Reconstruct Petri Nets from Experimental Data
CMSB '08 Proceedings of the 6th International Conference on Computational Methods in Systems Biology
Petri nets for systems and synthetic biology
SFM'08 Proceedings of the Formal methods for the design of computer, communication, and software systems 8th international conference on Formal methods for computational systems biology
An algorithmic framework for network reconstruction
Theoretical Computer Science
An algorithmic framework for network reconstruction
Theoretical Computer Science
How might petri nets enhance your systems biology toolkit
PETRI NETS'11 Proceedings of the 32nd international conference on Applications and theory of Petri Nets
Under-approximation of Reachability in Multivalued Asynchronous Networks
Electronic Notes in Theoretical Computer Science (ENTCS)
On Minimality and Equivalence of Petri Nets
Fundamenta Informaticae - Concurrency, Specification and Programming
| Hi-index | 0.00 |
The purpose of this paper is to present a strictly mathematical model for interaction networks, to address the question of steady-state analysis, and to outline an approach for reconstructing models from experimental data. Our expositions require notations and basic results from discrete mathematics. Therefore, we also introduce some elementary background material from this field.