Publications
.
1995.
O caracterizare structurala a multimilor partiale D-continue. Studii si Cercetari Matematice. 47:81-96.
.
1995. .
1995. On Decision-Mappings Related to Process Network Synthesis Problem. Acta Cybernetica. 13:319-328.
.
1998. Explicit bounds for the number of feasible solutions of special PNS-problem classes. Pure Mathematics and Applications. 9:17-27.
.
1998. .
1999.
On a Merging Reduction of the Process Network Synthesis Problem. Acta Cybernetica. 14:251-261.
.
1999. On bottleneck and k-sum versions of the Process Network Synthesis problems. Novi Sad Journal of Mathematics. 30:11-19.
.
2000. A Look Ahead Branch-and-Bound Procedure for Solving PNS Problems. Pure Mathematics and Applications. 11:265-279.
.
2000. On a well solvable class of the PNS problem. Novi Sad Journal of Mathematics. 30:21-30.
.
2000. Heuristics for the PNS problem. Optimization theory: Recent development from Mátraháza. :1-18.
.
2001. A Procedure Based on Automaton Theory Approach for Solving Modified PNS Problems. Pure Mathematics and Applications. 13:159-169.
.
2002. A partial enumeration algorithm for solving PNS problems. Mathematical and Computer Modelling. 38:855-864.
.
2003. .
2004.
Reduction techniques for the PNS problems: a novel technique and a review. Optimization and Engineering. 10:351-361.
.
2009. .
2011.
Reliability considerations for process network synthesis problems. CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH. 22?
.
2013.