Publications

Export 19 results:
Author [ Title(Asc)] Type Year
Filters: Author is Cs. Holló  [Clear All Filters]
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 
W
Blázsik Z, Holló C., Imreh B, Imreh C., Kovács Z.  2000.  On a well solvable class of the PNS problem. Novi Sad Journal of Mathematics. 30:21-30.
Ü
Holló C..  2011.  Üzleti webtechnológiák.
T
Holló C..  1995.  Tehnici de modelare în psihologie bazate pe teoria Fuzzy. Aplicatii pentru recunoasterea motivatiilor.
R
Holló C..  2013.  Reliability considerations for process network synthesis problems. CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH. 22?
Holló C., Imreh B, Imreh C..  2009.  Reduction techniques for the PNS problems: a novel technique and a review. Optimization and Engineering. 10:351-361.
P
Holló C..  2002.  A Procedure Based on Automaton Theory Approach for Solving Modified PNS Problems. Pure Mathematics and Applications. 13:159-169.
Holló C..  2003.  A partial enumeration algorithm for solving PNS problems. Mathematical and Computer Modelling. 38:855-864.
O
Romila B, Preda C, Holló C..  1993.  O caracterizare structurala a multimilor partiale D-continue.
Romila B, Preda C, Holló C..  1995.  O caracterizare structurala a multimilor partiale D-continue. Studii si Cercetari Matematice. 47:81-96.
M
Holló C..  1996.  Modele ale proceselor concurente bazate pe CSP.
Holló C., Blázsik Z, Imreh C., Kovács Z.  1999.  On a Merging Reduction of the Process Network Synthesis Problem. Acta Cybernetica. 14:251-261.
L
Holló C..  2000.  A Look Ahead Branch-and-Bound Procedure for Solving PNS Problems. Pure Mathematics and Applications. 11:265-279.
K
Blázsik Z, Holló C., Imreh B.  1999.  Kiszámolható korlátok speciális PNS-problémaosztályok lehetséges megoldásainak a számára. :182-194.
H
Blázsik Z, Holló C., Imreh C., Kovács Z.  2001.  Heuristics for the PNS problem. Optimization theory: Recent development from Mátraháza. :1-18.
Holló C..  2004.  Hálózati folyamatok szintézise.
E
Blázsik Z, Holló C., Imreh B.  1998.  Explicit bounds for the number of feasible solutions of special PNS-problem classes. Pure Mathematics and Applications. 9:17-27.
D
Blázsik Z, Holló C., Imreh B.  1998.  On Decision-Mappings Related to Process Network Synthesis Problem. Acta Cybernetica. 13:319-328.
C
Holló C..  1995.  Comunicare si concurentă în CSP.
B
Blázsik Z, Holló C., Imreh B, Imreh C., Kovács Z.  2000.  On bottleneck and k-sum versions of the Process Network Synthesis problems. Novi Sad Journal of Mathematics. 30:11-19.