47

Elcsendes/MOT/almanach.pdf · 2008-12-25 · esei c mmel AT arsas ag v end egei r ovid ismertet es miv olt a l atogat asuk eredm en y e oldal Szakmai utak a T arsas ag k olts eg en

  • Upload
    others

  • View
    0

  • Download
    0

Embed Size (px)

Citation preview

Page 1: Elcsendes/MOT/almanach.pdf · 2008-12-25 · esei c mmel AT arsas ag v end egei r ovid ismertet es miv olt a l atogat asuk eredm en y e oldal Szakmai utak a T arsas ag k olts eg en

A Magyar Oper�aci�okutat�asi T�arsas�ag Almanachja

���� � ����

tervezet

Page 2: Elcsendes/MOT/almanach.pdf · 2008-12-25 · esei c mmel AT arsas ag v end egei r ovid ismertet es miv olt a l atogat asuk eredm en y e oldal Szakmai utak a T arsas ag k olts eg en

El�osz�o

Az el�osz�o ideiglenesen ink�abb csak a terveket �a kik�uld�ott tervezetet� tartalmazza�

� Eln�oki bevezet�o �kb� oldal��

� A t�arsas�agi �elet h�rei�

� A T�arsas�ag postai �es egy�eb c�mei �e�mail� gopher� ftp�site� stb��

� Az id�oszak opkut fejlem�enyei �attekint�o cikk �j�o lenne� ha a Pr�ekopa Andr�astsiker�ulne ehhez megnyerni� ���� oldal��

� A fontosabb el�oad�asok k�oz�ul egy�kett�o teljes sz�ovege �pl� Klafszky Emil Egerv�a�ri el�oad�asa� vagy a Ziermann Margit Eml�ek�ul�esr�ol� kb� ��� oldal��

� Az Ellen�orz�o Bizotts�ag jelent�ese a MOT els�o p�ar �ev�enek p�enz�ugyeir�ol ���� oldal��

� Szakoszt�alyi besz�amol�o ��� oldal� Gerencs�er L�aszl�o��

� Kit�untet�esek ismertet�esekkel� f�enyk�eppel �� oldal��

� A tiszteletbeli tagok ismertet�ese�

� Az id�oszak �uj tudom�anyos min�os�t�esei c�mmel�

� A T�arsas�ag vend�egei r�ovid ismertet�es� mi volt a l�atogat�asuk eredm�enye ��oldal�� Szakmai utak a T�arsas�ag k�olts�eg�en �ha volt ilyen��

� Tiszts�egvisel�ok felsorol�asa� m�uk�od�esi id�oszakuk�

� A t�arsas�ag jogi szem�ely jelleg�u tagjai r�ovid ismertet�essel �ha van ilyen��

� V�alogat�as az id�oszak megjelent� Mo��on el�erhet�o szakirodalm�ab�ol �c�mek list�ajakiad�oval� �arral�� Ide tartozhatna a kor�abban m�ar tervezett opkut jegyzet�gy�ujtem�eny annak a felm�er�ese� hogy mib�ol is tan�tanak opkutot ma n�alunk�illetve hogy hol lehet ilyen jegyzeteket el�erni�

� Fontos lenne �ossze�rni az itthon el�erhet�o opkut jelleg�u foly�oiratokat� hogy nekelljen mindig k�ulf�oldr�ol megrendelni egy�egy cikk m�asolat�at�

Page 3: Elcsendes/MOT/almanach.pdf · 2008-12-25 · esei c mmel AT arsas ag v end egei r ovid ismertet es miv olt a l atogat asuk eredm en y e oldal Szakmai utak a T arsas ag k olts eg en

� Az id�oszak publik�aci�os jegyz�eke� A Current Mathematical Publications �altal�gyeltek megvannak� a tagok ezt a list�at eg�esz�ten�ek ki teljes terjedelm�u� refer�altfoly�oiratban megjelent cikkekkel� A teljes list�at szerkesztj�uk� egyes k�ozlem�enyekkimaradhatnak� majd �evsz�am �es az els�o magyar szerz�o szerinti abc�sorrendberendezz�uk� �kb� ����� oldal�

� Opkut jelleg�u szemin�arium�sorozatok c�mekkel�

� Az id�oszak OTKA� OMFB� MKM stb� elnyert kutat�asi p�aly�azatai c�mekkel�r�esztvev�okkel� r�ovid besz�amol�okkal �� oldal�� �TEMPUS��

� Az egy�uttm�uk�od�o szakmai szervezetek �Bolyai T�arsulat� NJSZT� Gazdas�ag�modellez�esi T�arsas�ag� MTA Op�Kut� Bizotts�aga�� nemzetk�ozi kapcsolataink�IFORS� szomsz�edos orsz�agok t�arsas�agai� �����

� Az id�oszak konferenci�ainak el�oad�asai szerz�okkel� c�mekkel �Apmod� Szeged�P�ecs� M�atraf�ured� Visegr�ad� �����

� Opkut PhD programok r�ovid le�r�assal � oldal��

� Szakmai m�uhelyek besz�amol�oi� egy�uttm�uk�od�esek�

� A v�eg�ere kell tartalomjegyz�ek�

� Egy technikai megold�as� a jelen tervezet is megtal�alhat�o az

ftp ftp�jate�u�szeged�huanonymouse�mail c�mcd �pub�math�optimization�MOTls �lget almanach�texquit

utas�t�asokkal� itt lehetne a mindenkori v�altozatot hozz�af�erhet�ov�e tenni� �gyk�onnyebb lenne a sz�ocikkek jelleg�et megismertetni� az aktu�alis �allapotot b�ar�mikor lek�erdezni�

Minden tov�abbi javaslatot �or�ommel fogadunk�

A MOT vezet�os�ege

P�s�� Az alapul szolg�al�o kiadv�anyok az NJTSZ �evk�onyve �es a JATE ��� �evenk�entkiadott� Almanachja voltak�

Page 4: Elcsendes/MOT/almanach.pdf · 2008-12-25 · esei c mmel AT arsas ag v end egei r ovid ismertet es miv olt a l atogat asuk eredm en y e oldal Szakmai utak a T arsas ag k olts eg en

�� fejezet

Az oper�aci�okutat�as ������ kozott

���� Az ��������� �evek magyar oper�aci�okutat�asi

k�ozlem�enyei

Az �ossze�all�t�as a Current Mathematical Publications ������� �es �evfolyamai alapj�ank�esz�ult� �es azokat a k�ozlem�enyeket tartalmazza �a magyar szerz�ok abc�sorrendj�eben��amelyek ott az oper�aci�okutat�ashoz voltak sorolva ���� ��A� ��B� ��C� ��D�� �es fe�lismerhet�oen volt magyar �vagy magyarorsz�agi� szerz�oj�uk� Az eredeti ��es a MOTtagoknak megk�uld�ott� list�akhoz k�epest itt csak a t�enylegesen az adott �evben megjelentk�ozlem�enyeket tartottuk meg� Az ut�olag refer�altakat vagy kit�or�olt�uk� vagy �attett�uk amegfelel�o �evhez� B�ar a CMP h�arom hetente t�obb sz�az matematikai foly�oiratot refer�al�n�eh�any� az oper�aci�okutat�as szempontj�ab�ol fontos kimarad bel�ole� �Igy az al�abbi list�akterm�eszetesen nem az �osszes magyar oper�aci�okutat�asi k�ozlem�enyt tartalmazza� Ennekellen�ere� bizonyos szempontb�ol pontos k�epet ny�ujt arr�ol� hogy mely hazai publik�aci�okl�athat�ok k�ulf�old�on�

�Minden igyekezet ellen�ere is kimaradhatott k�ozlem�eny a felsorol�asb�ol� ez�ert a listakieg�esz�t�ese seg�tene��

����

� Aba�y J�ozsef �H�KMU�� E� Spedicato� A class of scaled direct methods forlinear systems� Ann� Inst� Statist� Math� ������� ����� ���C��

�� Acz�el� J� ���WTRL�IT�� Merging relative scores� our correct ways and a wrongway� J� Comput� Inform� ����� ��� ���A��

�� Bayalinov� E�B� ���AOSKR�� Coordination of economic interests� Izv� Akad�Nauk Kirgiz� SSR ��� ��� ���A��

�� Bellay� �A� �H�BUDT�� Markovian models of urban tra�c� An application ofthe Feynman�Kac formula� Studia Sci� Math� Hungar� ������� ������� ���B���J��

Page 5: Elcsendes/MOT/almanach.pdf · 2008-12-25 · esei c mmel AT arsas ag v end egei r ovid ismertet es miv olt a l atogat asuk eredm en y e oldal Szakmai utak a T arsas ag k olts eg en

�� Bernau Heinz �H�AOS�C�� Quadratic programming problems and related linearcomplementary problems� J� Optim� Theory Appl� ������� ������� ���C��

�� Bernau Heinz �H�AOS�C�� Some remarks on the vector optimization method ofFandel� OR Spektrum ������ ����� ���C��

�� Bir�o Mikl�os �H�AOS�C�� The interval subset sum problem� Optimization ������ ������� ���C��

�� Bogm�er A�� I� Jo�o �H�AOS�� A�K� Kelmans ���MOSC�� Spanning trees of a graphand network reliability� Ann� Univ� Sci� Budapest� Sect� Math� ������� ������� ���B��

�� Boros Endre ��RTG�OR�� Y� Crama� P�L� Hammer� Upper�bounds for quad�ratic �� maximization� Oper� Res� Lett� ������ ����� ���C��

�� Csendes Tibor �H�SZEG�CY�� Interval method for bounding level sets� revisitesand tested with global optimization problems� BIT ������� ������� ���C��

� Csirik� J� �H�SZEG�C�� Frenk� J�B�G�� Labb�e� M�� Zhang� S�� On the multidi�mensional vector bin packing� Acta Cybernet� ������ ������ ���B��

�� Dancs� S� �H�KMU�� Generalized tangent cone and an optimization problem ina normed space� J� Optim� Theory Appl� ������� ����� ���C��

�� Frank Andr�as �H�EOTVO�C�� Packing paths in planar graphs� Combinatorica������ ������ ���B��

�� F�ul�op J�anos �H�AOS�C�� A �nite cutting plane method for solving linear pro�grams with an additional reverse convex constraint� European J� Oper� Res�������� ������� ���C��

�� F�ul�op J�anos �H�AOS�C�� Jaumard� B�� On transforming the satis�ability andmaximum satis�ability problems into set covering problems� Report ���� MTASZTAKI� Budapest� ��� ���C��

�� Forg�o Ferenc �H�KMU�� Schick� G�J�� A Bayesian approach for updating weightsof criteria for multicriteria decision problems� Pure Math� Appl� Ser� B ���������� ���C��

�� K�eri� G�� Methods of nonconvex quadratic optimization based on the matrixcopositivity investigation� Alkalmaz� Mat� Lapok �������� ���� ���C��

�� Klafszky Emil �H�BUDT�� Mayer J�anos �H�AOS�C�� Terlaky Tam�as �H�EOTV�OR�� A new convergent algorithm for the continuous modular design problem�Arabian J� Sci� Engrg� ������ ������� ���C��

Page 6: Elcsendes/MOT/almanach.pdf · 2008-12-25 · esei c mmel AT arsas ag v end egei r ovid ismertet es miv olt a l atogat asuk eredm en y e oldal Szakmai utak a T arsas ag k olts eg en

�� Kolumb�an J� �R�CLUJ�� L� Blaga �R�CLUJM�� On the weakly convex sets�Studia Univ� Babes�Bolyai Math� ������� ���� ���� ��C��

��� Koml�osi S�andor �H�PECS�� On a possible generalization of Pshenichnyi�s qua�sidi�erentibility� Optimization ������ �� ���C��

�� R� Kannan� Lov�asz L�aszl�o �H�EOTVO�C�� H�E� Scarf� The shapes of polyhedra�Math� Oper� Res� ������ ������� ���C��

��� Lov�asz L�aszl�o �H�EOTVO�� Schrijver� A�� Matrix cones� projection representa�tions� and stable set polyhedra� Polyhedral combinatorics �Morristown� ������ AMS� Providence� ���� ���B��

��� Maros Istv�an �H�AOS�C�� MILP� Linear programmin optimizer for personalcomputers under DOS� Report �� MTA SZTAKI� Budapest� ��� ���C��

��� Matits �Agnes� measurement of the reliability of projected data� Pure Math�Appl� Ser� B� ����� ����� ���B��

��� Mik�o Gy� �H�KMU�� Risk taking� a new approach� Pure Math Appl� Ser� C������ ���� ���A��

��� Moln�ar� S� �H�CMDI�� F� Szidarovszky ��AZ�I�� L� Lengyel� Adaptive andextrapolative expectations in a producer�consumer multiplemarket� PureMath�Appl� Ser� ����� ������� ���A��

��� Silverman� S�� A� N�adas ��IBM�� On the game of googol as the secretary prob�lem� Strategies for sequential search and selection in real time� ������ Provi�dence� ��� ���D��

��� Pint�er J�anos� On the convergence of adaptive partition methods in global op�timization� Optimization ������ ������ ���C��

��� Pint�er J�anos� Globally optimized calibration of environmental models� Ann�Oper� Res� ������� ���� ���C��

��� Pint�er J�anos� Adaptive partition strategies for solving multiextremal optimiza�tion problems �Hungarian�� Alkalmaz� Mat� Lapok �������� ������� ���C��

�� Pr�ekopa Andr�as ��RTG�� Sharp bounds on probabilities using linear program�ming� Oper� Res� ������� ������� ���B� ��C��

��� Pr�ekopa Andr�as ��RTG�OR�� The discrete moment problem and linear pro�gramming� Discrete Appl� Math� ������� ������� ���C��

��� Pr�ekopa Andr�as �H�AOS�� Totally positive linear programming problems� Func�tional analysis� optimization� and mathematical economics� ������ OxfordUniv� Press� New York� ��� ���C��

Page 7: Elcsendes/MOT/almanach.pdf · 2008-12-25 · esei c mmel AT arsas ag v end egei r ovid ismertet es miv olt a l atogat asuk eredm en y e oldal Szakmai utak a T arsas ag k olts eg en

��� Pr�ekopa Andr�as ��RTG�OR�� Dual method for the solution of a one�stagestochastic programming problem with random RHS obeying a dicrete probabil�ity distribution� Z� Oper� Res� ������� ����� ���C��

��� Rapcs�ak T� �H�AOS�C�� Borzs�ak P�� On separable product functions� Report����� MTA SZTAKI� Budapest ��� ���C��

��� Rapcs�ak Tam�as �H�AOS�C�� Tensor optimization� Report ��� MTA SZTAKI�Budapest� ��� ���C��

��� Rapcs�ak T� �H�AOS�C�� Borzs�ak P�� On separable product functions� Opti�mization ������ ����� ���C��

��� Rapcs�ak T� �H�AOS�C�� Szente J� �H�BUDT�G�� On the connection betweenmachanical force equilibrium and nonlinear programming� Z� Angew� Math�Mech� ������� ������� ���C��

��� Sebesty�en� Z� �H�EOTVO�AA�� A general saddle point theorem and its appli�cations� Acta Math� Hungar� ������� ������� ���D��

��� Seb�o Andr�as Undirected distances and the postman�structure of graphs J� Com�bin� Theory Ser� B� B������� ���� ���B��

�� Seb�o Andr�as� The cographic multi�ow problem� an epilogue� Polyhedral com�binatorics �Morristown� ���� AMS� ������� Providence� ���� ���B��

��� Sonnevend Gy� �H�EOTV�NA�� Stoer� J�� Global ellipsoidal approximationsand homotopy methods for solving convex analytic programs� Appl� Math�Optim� ������ ����� ���C��

��� Sonnevend� Gy� �H�EOTVO�� Stoer� J�� Zhao� G�� On the complexity of follow�ing the central path of linear programs by linear extrapolation� XIV� Symp� onOper� Res� �Ulm� ���� ���� Methods of Oper� Res� ������� Athen�aum�Hain ���C��

��� Sonnevend� Gy� �D�WRZB�A�� Applications of analytic centers for the numer�ical solution of semiin�nite� convex programs arising in control theory� SystemModelling and Optimization� Lect� Notes in Contr� and Inform� Sci� ������������� ���M� ��C��

��� Okuguchi� K�� Szidarovszky Ferenc �H�KMU�� The theory of oligopoly withmulti�product �rms� Lect� Notes in Economics ���� Springer� Berlin� ������A��

��� Szidarovszky Ferenc �H�KMU�� K� Okuguchi� Dynamic oligopoly� models withincomplete information� Appl� Math� Comput� ������� ���� ���A��

Page 8: Elcsendes/MOT/almanach.pdf · 2008-12-25 · esei c mmel AT arsas ag v end egei r ovid ismertet es miv olt a l atogat asuk eredm en y e oldal Szakmai utak a T arsas ag k olts eg en

��� Szidarovszky F� �H�KMU�� Multiproduct Cournot oligopolies with market sat�uration� Pure Math� Appl� Ser� B ����� ��� ���A��

��� Szidarovszky F� �H�KMU�� Cournot equilibrium and joint pro�t maximizingprices in multi�product oligopolies� Pure Math� Appl� Ser� B ����� �������B��

��� Szidarovszky� F� ��AZ�I�� K� Okuguchi �J�TOKYM�EC�� On the existence anduniqueness of equilibrium in Cournot oligopoly with product di�erentiation�Pure Math� Appl� Ser� B� ����� ������ ���D��

��� Szidarovszky F� �H�KMU�� Okuguchi� K�� Extrapolative expectations in anoligopoly with multi�product �rms� Pure Math� Appl� Ser� B ����� ��������A��

�� Szidarovszky F� �H�KMU�� Okuguchi� K�� On multistep and monotone stabilityof equilibria in a multi�product oligopoly� Pure Math� Appl� Ser� B ���������� ���A��

��� Szidarovszky� F� �H�KMU�� Okuguchi� K�� On a general Stackelbergtype leader�follower oligopoly model� Ann� Univ� Sci� Budapest Sect� Comput� ��������� ���D��

��� Sztrik J� �H�LAJO�� G�al T� �H�LAJO�� A queuing model for a terminal systemsubject to breakdowns� Comput� Math� Appl� ������ ����� ���B��

��� Goldberg� A�V�� Tardos �Eva ��CRNL�O�� Tarjan� R�E�� Network �ow algo�rithms� Paths �ows� and VLSI�layout �Bonn� ���� ����� Algorithms Com�bin�� Springer� Berlin� ��� ���B��

��� J�K� Lenstra� D�B� Shmoys� Tardos �Eva ��CRNL�� Approximation algorithmsfor scheduling unrelated parallel machines� Math� Programming ������� ������ ���B��

��� Terlaky� T� �H�EOTVO�OR�� On Karmarkar type algorithms� Alkalmaz� Mat�Lapok �������� ����� ���C��

��� Petrov� N�N�� I� Turay� A pursuit problem on a graph� Vestnik Leningrad Univ�Mat� Mekh�� Astronom� ������ ��� ���D��

��� Faigle� Ullrich� Tur�an Gy�orgy �H�AOS�R�� Static on�line decomposition of se�ries�parallel and interval orders� XIII� Symp� on Oper� Res� �Paderborn� ����������� Methods of Oper� Res� ������� Athen�aum� Hain ���B��

��� V�zv�ari B�ela �H�AOS�C�� On some generalizations of the greedy method of theknapsack problem� Wiss� Z� Tech� Hochsch� Leuna�Merseburg ������� ������� ���C��

Page 9: Elcsendes/MOT/almanach.pdf · 2008-12-25 · esei c mmel AT arsas ag v end egei r ovid ismertet es miv olt a l atogat asuk eredm en y e oldal Szakmai utak a T arsas ag k olts eg en

����

� Acz�el J� ���WTRL�� Why� how and how not to apply mathematics to economicsand to other social behavioural sciences� Grazer Math� Berichte ������ �����A��

�� Banai� M�� B� Luk�acs� Economic examples for exactly solvable variational prob�lems� Mat� Lapok ������ ������ ���A��

�� B�ardossy� A� �D�KLRH�� I� Bogardi ��NL�� Duckstein� L� ��AZ�I�� Fuzzy setand probabilistic techniques for health�risk analysis� Appl� Math� Comput������� ������ ���B��

�� L�aszl�o Berke ��NASA���� P� Hajela ��RSP�� Application of neural nets instructural optimization� Optimization of large structural systems �Brechtes�gaden� ��� ������ ���C� ��K��

�� Boros� E� ��RTG�OR�� P�L� Hammer ��RTG�OR�� The max�cut problem andquadratic �� optimization� polyhedral aspects� relaxations and bounds� Ann�Oper� Res� ������ ���� ���C��

�� Csendes� T�� Test results of interval methods for global optimization� IMACSAnnals on Comp� Appl� Math� ����� �������

�� Csirik J� �H�SZEG�� Frenk� J�B�G�� Galambos� G� �H�SZEG�� Rinnooy Kan�A�H�G�� Probabilistic analysis of algorithms for dual bin packing problems� J�Algorithms ����� ������ ���B��

�� Csirik� J� �H�SZEG�B�� Johnson� S�D�� Bounded space on�line bin packing� bestis better than �rst� Proc� Second Ann� Symp� on Discrete Algorithms� �SanFrancisco� ��� ������ ACM� New York� ��� ���C��

�� Csirik� J� �H�SZEG�C�� J�B�G� Frenk �NL�ROTT�E�� M� Labb�e� S� Zhang �NL�ROTT�E�� Heuristics for the �� min�knapsack problem� Acta Cybernet� ����� ���� ���C��

�� Fodor� J�C� �H�EOTVO�CC�� Strict preference relations based on weak t�norms�Aggregation and best choices of imprecise opinions� Fuzzy Sets and Systems������ ������� ���A��

� Fodor� J�C� �H�EOTVO�CC�� Aggregation of preferences� an axiomatic ap�proach with applications� Ann� Univ� Sci� Budapest� Sect� Comput� ��������� ���C��

�� Fodor� J�C� �H�EOTVO�CC�� M� Roubens �B�LIEG�� Fuzzy preference mod�elling� an overview� Ann� Univ� Sci� Budapest� Sect� Comput� ���������� ���C��

Page 10: Elcsendes/MOT/almanach.pdf · 2008-12-25 · esei c mmel AT arsas ag v end egei r ovid ismertet es miv olt a l atogat asuk eredm en y e oldal Szakmai utak a T arsas ag k olts eg en

�� Forg�o F� �H�BUEC�� M� Olajos� A family of cost allocation methods for a tree�Pure Math� Appl� ����� ��� ���D��

�� F�ul�op J�anos �H�AOS�C�� A �nite cutting plane method for facial disjunctiveprograms� Z� Oper� Res� ������ �� ���C��

�� Galambos� G� �H�SZEG�AC�� A �� lower bound for the two�dimensional on�linerectangle bin�packing� Acta Cybernet� ����� ���� ���B��

�� Giorgi� G� �I�PAVI�� Koml�osi S�andor �H�PECS�� Inertia theorems in optimiza�tion� Pure Math� Appl� Ser� B ����� ������� ���C� ���

�� Kov�acs� M� �H�EOTVO�CC�� Linear programming with centered fuzzy num�bers� Ann� Univ� Sci� Budapest� Sect� Comput� ����� ����� ���C��

�� Kov�acs M� �H�EOTVO�C�� Vasilev� F�P�� Convergence rate for regularized bar�rier function methods� Optimization ������ ������� ���C��

�� Lov�asz L�aszl�o �H�EOTVO�C�� Schrijver� A�� Cones of matrices and set�func�tions and �� optimization� SIAM J� Optim� ���� ����� ���C��

��� J�E� Taylor ��MI�D�� J� L�og�o �H�BUDT�� Analysis and design of elastic�softe�ning truss structures based on a mixed�form extremum principle� Optimizationof large structural systems �Brechtesgaden� ��� ������� ���K� ��C��

�� Korte� B� �D�BONN�O�� Lov�asz L�aszl�o �H�EOTVO�C�� R� Schrader �D�BONN�O�� Greedoids� Algorithms and Combinatorics� Springer� Berlin� �� ���B���C��

��� Morvai G� �H�BUDT�� Empirical log�optimal portfolio selection� Problems Con�trol Inform� Theory ������ ������� ���A��

��� E�M�T� Hendrix �NL�AGWA�� J� Pint�er ���DLHS�EV�� An application of Lip�schitzian global optimization to product design� J� Global Optim� ���������� ���C��

��� Pr�ekopa Andr�as ��RTG�� Boros Endre ��RTG�� On the existence of a feasible�ow in transportation network� Oper� Res� ������ ���� ���B��

��� Rapcs�ak Tam�as �H�AOS�C�� Geodetic convexity in nonlinear optimization� J�Optim� Theory Appl� ������ ����� ���C��

��� Sonnevend� Gy� �H�EOTVO�NA�� Applications of analytic centers� Numericallinear algebra� digital signal processing and parallel algorithms� Springer Berlin���� ������ ���C��

Page 11: Elcsendes/MOT/almanach.pdf · 2008-12-25 · esei c mmel AT arsas ag v end egei r ovid ismertet es miv olt a l atogat asuk eredm en y e oldal Szakmai utak a T arsas ag k olts eg en

��� Sonnevend� Gy� �H�EOTVO�� J� Stoer �D�WRZB�A�� G�Y� Zhao �D�WRZB�A�� On the complexity of following the central path of linear programs by linearextrapolation� Math� Programming ������ ������� ���C��

��� Goldberg� J�� Szidarovszky� F� ��AZ�I�� A general model and convergence re�sults for determining vehicle utilization in emergency systems� Comm� Statist�Stochastic Models ����� ����� ���B��

��� Szidarovszky� F� ��AZ�I�� S� Moln�ar �H�CMDI�� K� Okuguchi �J�TOKYM�EC��An N�person Stackelberg leader�leader model� Appl� Math� Comput� ������������ ���A��

��� Szidarovszky� F� �H�KMU�� K� Okuguchi �J�TOKYM�EC�� The e�ects of entryin an oligopoly with multi�product �rms� Pure Math� Appl� Ser� B� ��������� ���A��

�� Szidarovszky� F� ��AZ�I�� J� Yen ��AZ�I�� Stability of a special oligopoly mar�ket� Pure Math� Appl� ����� ����� ���A��

��� Chernyak� A�I�� Sztrik� J� �H�LAJO�� Asymptotik behaviour of a complex re�newable standby system with fast repair� Problems of Control Inform� Theory������ ����� ���B��

��� Sztrik� J� �H�LAJO�� Modelling of heterogeneous multiprocessor systems withrandomly changing parameters� Acta Cybernet� ����� ���� ���M� ��B��

��� Tak�acs Lajos ��CWR�� On a probability problem connected with railway tra�c�Appl� Math� Stochastic Anal� ����� ��� ���B��

��� Goldberg� A�V�� Plotkin� S�A�� Tardos �Eva ��CRNL�OR�� Combinatorial algo�rithms for the generalized circulation problem� Math� Oper� Res� ���������� ���C��

��� Plotkin� S�A� ��STF�� D�B� Shmoys ��CRNL�� �E� Tardos ��CRNL�� Fastapproximation algorithms for fractional packing and covering problems� ��ndAnn� Symp� on Foundations of Computer Science� IEEE� Los Alamitos� ������� ��� ���C� ��B��

��� den Hertog� D�� Roos� C�� Terlaky� T� �H�EOTVO�� A polynomial method ofweighted centers for convex quadratic programming� J� Inform� Optim� Sci������ ������ ���C��

��� den Hertog� D�� Roos� C�� Terlaky� T� �H�EOTVO�� A potential�reduction vari�ant of Renegar�s short�step path�following method for linear programming� Lin�ear Algebra Appl� ������ ����� ���C��

Page 12: Elcsendes/MOT/almanach.pdf · 2008-12-25 · esei c mmel AT arsas ag v end egei r ovid ismertet es miv olt a l atogat asuk eredm en y e oldal Szakmai utak a T arsas ag k olts eg en

����

� Aba�y� J� �H�BUEC�� Superlinear convergence theorems for Newton�type meth�ods for nonlinear systems of equations� J� Optim� Theory Appl� �������������� ���C��

�� Barab�as� Gy� �D�HGN�� Implementing no�derivative optimizing procedures foroptimization of econometric models� Adv� Stud� Theoret� Appl� Econometrics������� ���� ���C��

�� B�ar�any� I� ���LNDUC�� Fair distribution protocols or how the players replacefortune� Math� Oper� Res� ������ ������� ���D��

�� B�ar�any I� ��YALE�F�� J� Lee ��YALE�OR�� M�S� Hubik ��YALE�� Classi�ca�tion of two�person ordinal bimatrix games� Internat� J� Game Theory ������������� ���D��

�� Bollob�as� B� ���CAMB� A� Meir ��LAS�� A travelling salesman problem in thek�dimensional unit cube� Oper� Res� Letters ����� ��� ���C��

�� Boros� E� ��RTG�OR�� Y� Crama �NL�LIMB�QE�� P�L� Hammer ��RTG�OR��Chv�atal cuts and odd cycle inequalities in quadratic �� optimization� SIAM J�Discrete Math� ������ ����� ���C��

�� Csaba L�aszl�o �H�AOS�C�� R�J� Faudree ��MEMP�� Gy�arf�as Andr�as �H�AOS�C�� Lehel Jen�o �H�AOS�C�� R�H� Schelp� Networks communicating for eachpairing of terminals� Networks ������� ������ ���C� ��B��

�� Csendes Tibor� Numerical testing of interval methods of global optimization�In� Optimization� models� methods� solutions �Russian�� Nauka� Novosibirsk����� ������ ���C��

�� Csenki� A� ���ASTN�AM�� The joint distribution of sojourn times in �niteMarkov processes� Adv� in Appl� Probab� ������� ���� ���J� ��B��

�� Csirik J�anos A� ���CAMBT�� Optimal strategy for the �rst player in the Penneyante game� Combin� Probab� Comput� ����� ���� ���D��

� Csirik J�anos �H�SZEG�AC�� Hans Kellerer �A�GRAZ�OR�� Gerhard J� Woeg�inger �A�TGRZ�B�� The exact LPT�bound for maximizing the minimum com�pletion time� Oper� Res� Lett� ����� ������ ���C� ��B��

�� Coleman� T�F� ��CRNL�C�� P�A� Fenyes ��GMRL�� Partitioned quasi�Newtonmethods for nonlinear equality constrained optimization� Math� Programming������� ���� ���C��

Page 13: Elcsendes/MOT/almanach.pdf · 2008-12-25 · esei c mmel AT arsas ag v end egei r ovid ismertet es miv olt a l atogat asuk eredm en y e oldal Szakmai utak a T arsas ag k olts eg en

�� Erd�os P�eter L� �NL�TWEN�A�� Sz�ekely L�aszl�o �H�EOTVO�C�� Evolutionarytrees� an integer multicommodity max��ow�min�cut theorem� Adv� in Appl�Math� ������ ������� ���B� ��C� ����

�� Farkas M� �H�BUDT�� Kotsis M� �H�BUDT�� Modelling predator�prey andwage�employment dynamics� In� Dynamic economic models and optimal con�trol� North�Holland� Amsterdam� ���� ������ ���A� ��C��

�� C� Fodor J�anos �H�EOTVO�CC�� An axiomatic approach to fuzzy preferencemodelling� Fuzzy Sets and Systems ������� ����� ���A� ����

�� C� Fodor J�anos �H�EOTVO�� M� Rubens �B�LIEG�� Aggregation of strict pref�erence relations in MCDM procedures� In� Fuzzy Approach to Reasoning andDecision�making� Kluwer� Dordrecht� ���� ���� ���A� ����

�� Frank Andr�as �H�EOTVO�C�� T� Nishizeki� N� Saito� H� Suzuki� Tardos �Eva ��CRNL�OR�� Algorithms for routing around a rectangle� Discrete Appl� Math�������� ������� ���C� ��Q� ��B��

�� Frank� A� �H�EOTVO�C�� Augmenting graphs to meet edge�connectivity re�quirements� SIAM J� on Discrete Math� ������ ����� ���B��

�� Fedrizzi� M� �I�TRNT�� R� Full�er �D�AACH�UR�� Stability in possibilistic lin�ear programming with continuous fuzzy number parameters� Fuzzy Sets andSystems ������� ���� ���C��

��� F�ul�op J�anos �H�AOS�OR�� Prill M�aria �H�AOS�OR�� On the minimax approx�imation in the class of the univariate piecewise constant functions� Oper� Res�Lett� ������ ������ ��� ��C��

�� F�ul�op J�anos �H�AOS�OR�� A semi�in�nite programming method for approx�imating load duration curves by polynomials� Computing ������� ��������C� ��K��

��� Dhagat� A� ���BC�C�� P� G�acs ��BOST�C�� P� Winkler ��BELL��� On playing twenty questions with a liar� Proc�of the �rd Annual ACM�SIAM Symp� onDiscrete Algorithms� ����� ACM� New York� ��� ���P� ��D��

��� Gyetv�an Ferenc �H�PECSEC�QM�� Yong SHi ��NEOB�� Week duality theoreman complementary slackness theorem for linear matrix programming problems�Oper� Res� Lett� ����� ������� ���C� ��N��

��� Horv�ath Mikl�os �H�EOTVO�AA�� Jo�o I� �H�EOTVO�AA�� Szentmikl�ossy Z� �H�AOS�� A problem in game theory� Studia Sci� Math� Hungar� ������� ����������D��

Page 14: Elcsendes/MOT/almanach.pdf · 2008-12-25 · esei c mmel AT arsas ag v end egei r ovid ismertet es miv olt a l atogat asuk eredm en y e oldal Szakmai utak a T arsas ag k olts eg en

��� J�ozsef S�andor� Probabilistic and fuzzy panel modelling� Kybernetika ������������ ���A� ����

��� E� Klafszky �H�BUDTAK�� T� Terlaky �H�EOTVO�� Some generalizations of thecriss�cross method for quadratic programming� Optimization ������� ��������C��

��� Kom�aromi �E� �H�BUEC�DA�� Probabilistic constraints in primal and dual lin�ear programs� duality results� J� Optim� Theory Appl� ������� ������� ���C���N��

��� Giorgi� G� �I�PAVI�BS�� Koml�osi S�andor �H�PECSEC�� Dini derivatives in op�timization I� Riv� Mat� Sci� Econom� Social� ������ No� � �����

��� Giorgi� G� �I�PAVI�BS�� Koml�osi S�andor �H�PECSEC�� Dini derivatives in op�timization II� Riv� Mat� Sci� Econom� Social� ������ No� �� ���� ���C��

��� Kov�acs Margit �H�EOTVO�CC�� A concept of optimality for fuzzi�ed linearprogramming based on penalty function� In� Fuzzy Approach to Reasoningand Decision�making� Kluwer� Dordrecht� ���� ����� ���C� ����

�� Herrera� F� �E�GRAN�AI�� Kov�acs Margit �H�EOTVO�CC�� J�L� Verdegay �E�GRAN�AI�� An optimum concept for fuzzi�ed linear programming problems� aparametric approach� Tatra Mt� Math� Publ� ����� ����� ���C� ����

��� Gargano� L� �I�SLRN�I��� J� K�orner �H�AOS�� U� Vaccaro �I�SLRN�I��� Searchproblems for two irregular coins with incomplete feedback� the underwheightmodel� Discrete Appl� Math� ������� ���� ���B��

��� I� Lengyel �H�AOS��� Computational notes to the Gilmore�Gomory cuttingstock algorithm� Alkalmaz� Mat� Lapok ������ ����� ���C��

��� Bj�orner� A� �S�RIT�� Lov�asz L�aszl�o �H�EOTVO�C�� Chip��ring games on di�rected graphs� J� Algebraic Combin� ����� ������� ���D� ��C��

��� Lov�asz� L� �H�EOTVO�C�� H�E� Scarf ��YALE�F�� The generalized basis re�duction algorithm� Math� Oper� Res� ������ ������ ���� ��C��

��� Cs� M�esz�aros �H�AOS�C�� Basis inverse of large�scale and sparse linear pro�gramming problems� Alkalmaz� Mat� Lapok ������ ������ ���C� ��K��

��� Morvai Guszt�av �H�BUDT�� Portfolio choice based on the empirical distribu�tion� Kybernetika ������� ������� ���A��

��� Pach J�anos ��CCNY�C�� On the Game of Misery� Studia Sci� Math� Hungar�������� ������� ���D� ��A��

Page 15: Elcsendes/MOT/almanach.pdf · 2008-12-25 · esei c mmel AT arsas ag v end egei r ovid ismertet es miv olt a l atogat asuk eredm en y e oldal Szakmai utak a T arsas ag k olts eg en

��� J� Pint�er� Lipschitzian global optimization� some prospective applications� Re�cent advances in global optimization� Princeton� ������� ����� ���C��

��� Pint�er J�anos �H�RWAT�� Convergence quali�cation of adaptive partition algo�rithms in global optimization� Math� Programming ������� ������� ���C��

�� Szidarovszky Ferenc ��AZ�I�� Y� Jerome ��AZ�I�� On the stability of controlleddynamic oligopolies� Pure Math� Appl� Ser� B� ������ ����� ���A� ��D��

��� F� Szidarovszky ��AZ�I�� S� Rassenti ��AZ�EC�� J� Yen ��AZ�IS�� Modi�edCournot expectations in dynamic oligopolies� Pure Math� Appl� Ser� B������� ����� ���A��

��� Argyros� I�K� ��CMRN�� F� Szidarovszky ��AZ�I�� On the monotone conver�gence of algorithmic models� Appl� Math� Comput� ������� ����� ���C��

��� Argyros� I�K� ��CMRN�� F� Szidarovszky ��AZ�I�� On the convergence of op�timization algorithms modeled by point�to�set mappings� Pure Math� Appl�Ser� B� ������ ����� ���C� ��K��

��� Merill� B�� Ferenc Szidarovszky ��AZ�I�� Limit cycles in Goodwin�s model� PureMath� Appl� ������ ����� ���A��

��� Szidarovszky� Ferenc ��AZ�I�� Tam�as D� Zsitvay� Necessary and su�cient con�ditions for the existence of equilibria in general con�ict models� Pure Math�Appl� ������ �� ���D��

��� Szidarovszky� Ferenc ��AZ�I�� K� Okuguchi� On the uniqueness of equilibriumin Cournot oligopoly with product di�erentiation� Pure Math� Appl� ���������� ���D�

��� Sztrik� J� �H�LAJO�� Modelling of a single bus multiprocessor system operatingin markovian environments� Comput� Math� Appl� ������� ����� ���M���B��

��� Sztrik J�anos �H�LAJO�� B�D� Bunday ���BRDF�� An asymptotic approach tothe multiple machine interference problem with Markovian environments� Publ�Math� Debrecen ������ ������� ���K� ��B��

��� C�H� Norton ��MIT�� S�A� Plotkin ��STF�C�� �E� Tardos ��CRNL�OR�� Usingseparation algorithms in �xed dimensions� J� Algorithms ������ ����� ���C��

�� Tardos� �E� ��CRNL�OR�� Strongly polynomial and combinatorial algorithmsin optimization� Proc� of the Int� Congr� of Math� �������� Tokyo ���C��

Page 16: Elcsendes/MOT/almanach.pdf · 2008-12-25 · esei c mmel AT arsas ag v end egei r ovid ismertet es miv olt a l atogat asuk eredm en y e oldal Szakmai utak a T arsas ag k olts eg en

��� King� V� ��NEC�� S� Rao ��NEC�� R�E� Tarjan ��PRIN�� A faster determin�istic maximum �ow algorithm� Proc� of the �rd Annual ACM�SIAM Symp� onDiscrete Algorithms� ������ ACM� New York� ��� ���A��

��� Fukuda� K�� T� Terlaky �NL�DELFM�� Linear complementarity and orientedmatroids� J� Oper� Res� Soc� Japan ������� ���� ���C��

��� den Hertog� D� �NL�DELFM�� C� Roos �NL�DELFM�� T� Terlaky �H�EOTVO��On the classical logarithmic barrier function method for a class of smooth convexprogramming problems� J� Opt� Theory Appl� ������� ��� ���C��

��� den Hertog� D� �NL�DELFT�� C� Roos �NL�DELFT�� T� Terlaky �H�EOTVO�OR�� A large�step analytic center method for a class of smooth convex program�ming problems� SIAM J� on Optimization ������ ����� ���C��

��� den Hertog �NL�DELFT�� C� Roos �NL�DELFT�� Terlaky Tam�as �H�EOTVO��A build�up variant of the logarithmic barrier method for LP� Oper� Res� Lett������� ���� ���C��

��� Kurzhanskii� A�B� �A�IASA�DS�� I� V�alyi �A�IASA�DS�� Ellipsoidal techniquesfor dynamic systems� control synthesis for uncertain systems� Dynamics Control������ ��� ���B� ��D��

��� V�zv�ari� B� �TR�BILK�IE�� On the optimality of the greedy solutions of thegeneral knapsack problems� Optimization ������� ����� ���C��

��� V�zv�ari� B� �TR�BILK�IE�� On the optimality of the greedy solutions of thegeneral knapsack problems� Optimization ������� ����� ���C��

����

� Aba�y J� �H�BUEC�MC�� Forg�o F� �H�BUEC�MC�� Globally convergent al�gorithm for solving nonlinear equations� J� Optim� Theory Appl� ������������� ���H� ��C��

�� J� Beck ��RTG�� Achievement games and the probabilistic method� Combina�torics �Budapest� ���� ���� ���D��

�� E� Boros ��RTG�� P�L� Hammer ��RTG�� Cut�polytopes� Boolean quadraticpolytopes and nonnegative quadratic pseudo�Boolean functions� Math� Oper�Res� ������ ������� ���C� ��C��

�� Bors�o Zsolt �H�AOS�P�� A characterization of ranking methods based on t�norms� Found� Comput� Decision Sci� ������ ��� ���A�����

Page 17: Elcsendes/MOT/almanach.pdf · 2008-12-25 · esei c mmel AT arsas ag v end egei r ovid ismertet es miv olt a l atogat asuk eredm en y e oldal Szakmai utak a T arsas ag k olts eg en

�� H� Bunke �CH�BERN�AM�� Csirik J�anos �H�SZEG�C�� An algorithm for match�ing run�length coded strings� Computing ������� ������ ���Q� ��C��

�� T� Csendes �H�SZEG�CY�� T� Rapcs�ak �H�AOS�C�� Nonlinear coordinate trans�formations for unconstrained optimization� I� Basic transformations� J� GlobalOptim� ������ ����� ���C��

�� Csendes� T�� J� Pint�er� The impact of accelerating tools on the interval subdi�vision algorithm for global optimization� Eur� J� Oper� Res� ������� �������

�� Csendes� T�� J� Pint�er� A new interval method for locating the boundary oflevel sets� Int� J� Comput� Math� ������� ������

�� Csendes Tibor �H�SZEG�CY�� An interval method for bounding level sets� Al�kalmaz� Mat� Lapok ������ ����� ��K� ��C

�� Kristinsdottir� B�P�� Z�B� Zabinsky� T� Csendes� M�E� Tuttle� Methodologies fortolerance intervals� Interval Computations ������ ������

� Csirik J� �H�SZEG�C�� The parametric behavior of the �rst��t decreasing binpacking algorithm� J� Algorithms ������ ��� ���B��

�� Csirik J�anos �H�SZEG�AC�� A� van Vliet �NL�ROTT�EM�� An on�line algorithmfor multidimensional bin packing� Oper� Res� Letters� ������ ����� ���C��

�� Fejes T�oth L� �H�AOS�� Flight in a packing of disks� Discrete Comput� Geom������� �� ���� ��C��

�� R� Full�er �H�EOTVO�C�� H��J� Zimmermann �D�AACH�OR�� Fuzzy reasoningfor solving fuzzy mathematical programming problems� Fuzzy Sets and Systems������� ���� ���C� ��B��

�� Galambos G�abor �H�SZEG�AC�� G�J� Woeginger �A�TGRZ�TI�� An on�linescheduling heuristic with better worst�case ratio than Graham�s list schedul�ing� SIAM J� Comput� ������� ������� ���B��

�� Galambos G�abor �H�SZEG�AC�� G�J� Woeginger �A�TUGRZ�B�� Repackinghelps in bounded space on�line bin�packing� Computing ������� ������� ���B���C��

�� J�C� Harsanyi ��CA�� Normative validity and meaning of von Neumann�Mor�genstern Utilities� Frontiers of game theory� MIT Press� ��� ���A� ��D��

�� Katona G�O�H� �H�AOS�� Woyczynski� W�A� ��CRW�CH�� Optimization ofthe reliability polynomial in presence of mediocre elements� Networks �������������� ���B� ��M��

Page 18: Elcsendes/MOT/almanach.pdf · 2008-12-25 · esei c mmel AT arsas ag v end egei r ovid ismertet es miv olt a l atogat asuk eredm en y e oldal Szakmai utak a T arsas ag k olts eg en

�� S� Koml�osi �H�PECSEC�� On pseudoconvex functions� Acta Sci� Math� ������� ������� ���C� ����

��� S� Koml�osi� Quasiconvex �rst�order approximations and generalized Kuhn�Tucker conditions� Eur� J� Oper� Res� ������� ��������

�� S� Koml�osi� First and second order characterizations of pseudolinear functions�Eur� J� Oper� Res� ������� ��������

��� F� Herrera �E�GRAN�AI�� M� Kov�acs �H�EOTV�C�� A parametric approach for�g�p��fuzzi�ed linear programming problems� J� Fuzzy Math� ����� ���������C� ����

��� Herrera� F� �E�GRAN�AI�� Kov�acs Margit �H�EOTVO�CC�� J�L� Verdegay �E�GRAN�AI�� Optimality for fuzzi�ed mathematical programming problems� aparametric approach� Fuzzy Sets and Systems ������� ������� ���C��

��� M� Gr�otsel �D�TUB�� L� Lov�asz �H�EOTVO�C�� A� Schrijver �NL�MATH�� Ge�ometric algorithms and combinatorial optimization� Springer� Berlin� ��� ������C��

��� L� Lov�asz �H�EOTVO�C�� M� Simonovits �H�AOS�� Random walks in a con�vex body and an improved volume algorithm� Random Structures Algorithms������ ������ ���C� ��� ��J� ��K��

��� I� Maros ��RTG�OR�� A practical anti�degeneracy row selection technique innetwork linear programming� Ann� Oper� Res� ���������� ������ ���C��

��� Applied Mathematical programming and modelling� Ed� G� Mitra� I� Maros�Ann� Oper� Res� ������� ���� ��C��

��� Nagy� Tam�as� Stochastic variants of the entropy programming� Alkalmaz� Mat�Lapok ������ ����� ���C��

��� P� Kall �CH�ZRCH�� J� Mayer �H�AOS�C�� SLP�IOR� on the design of a work�bench for testing SLP codes� Investigation Oper� ������ ���� ���C��

��� J� Mayer �H�AOS�C�� Probabilistic constrained optimization a brief summaryon theory and algorithms� Investigation Oper� ������ ����� ���C��

�� M�esz�aros� Csaba� On the modi�cations of the a�ne scaling algorithm for linearprogramming� Alkalmaz� Math� Lapok ������ ����� ���C��

��� T� Rapcs�ak �H�AOS�C�� T� Csendes �H�SZEG�CY�� Nonlinear coordinate trans�formations for unconstrained optimization� II� Theoretical background� J�Global Optim� ������ ������� ���C� ��K��

Page 19: Elcsendes/MOT/almanach.pdf · 2008-12-25 · esei c mmel AT arsas ag v end egei r ovid ismertet es miv olt a l atogat asuk eredm en y e oldal Szakmai utak a T arsas ag k olts eg en

��� S�akovics J�ozsef �E�BARA�EA�� Delay bargaining games with complete infor�mation� J� Econom� Theory ������� ����� ���D��

��� A� Seb�o �F�GREN�AM�� Integer plane multi�ows with a �xed number of de�mands� J� Combin� Theory Ser� B� ������� ���� ���B� ��C� ��C��

��� Szidarovszky Ferenc ��AZ�I�� J� Yerome ��AZ�IS�� On the controllability ofdiscrete dynamic oligopolies under adaptive expectations� Appl� Math� Com�put� ������� ����� ���A� ��B��

��� F� Szidarovszky �H�BUEC�MC�� K� Okoguchi �J�TOKYM�EC�� Dynamic oligo�poly with complete information� Belg� J� Oper� Res� Statist� Comput� Sci�������� ���� ���A��

��� Sztrik J�anos �H�LAJO�� B�D� Bunday ���BRDF�� Asymptotic analysis of theheterogeneous machine interference problem with random environments� Appl�Math� Modelling ������ ���� ���K� ��B��

��� J� Sztrik �H�LAJO�� B�D� Bunday ���BRDF�� An assymptotic approach to themultiple machine interference problem with Markovian environments� Ann�Univ� Sci� Budapest Sect� Comput� ������ ����� ���B� ��K��

��� V�T� Tan �H�AOS�� A method to determine weights of criteria in multiattributedecision making� Pure Math� Appl� ������ ������ ���B� ��C��

��� Tardos �Eva ��CRN�ENO�� V�V� Vazirani ���IITND�C�� Improved bounds forthe max��ow min�multicut ratio for planar and Krr�free graphs� Inform� Pro�cess� Lett� ������� ����� ���B� ��C� ��Q��

�� Orlin� J�B� ��MIT�MG�� S�A� Plotkin ��STF�C�� Tardos �Eva ��CRN�ENO��Polynomial dual network simplex algorithms� Math� Programming �������������� ���C� ��B��

��� Shmoys� D�B� ��CRNL�ENO�� Tardos �Eva ��CRNL�ENO�� Scheduling unre�lated machines with costs� Proc� of the �th Annual ACM�SIAM Symposiumon Discrete Algorithms� ACM� New York� ���� ������� ���M� ��B��

��� Shmoys� D�B� ��CRNL�OR�� �E� Tardos ��CRNL�OR�� An approximation al�gorithm for the generalized assignment problem� Math� Programming ������������� ���C� ��B��

��� Sonnevend� Gy�orgy �H�EOTVO�NM�� Constructing feedback control in di�er�ential games by use of central trajectories� in� Optimal Control� Freiburg���� Internat� Ser� Numer� Math�� Birkhauser� Basel� ���� ������� ��D

��� Szidarovszky� Ferenc ��AZ�I�� J� Yen� Control in a special consumer�producermarket� Pure MAth� Appl� ������ ������ ���A��

Page 20: Elcsendes/MOT/almanach.pdf · 2008-12-25 · esei c mmel AT arsas ag v end egei r ovid ismertet es miv olt a l atogat asuk eredm en y e oldal Szakmai utak a T arsas ag k olts eg en

��� H� Booth ��TN�C�� R�E� Tarjan ��PRIN�CS�� Finding the minimumcost max�imum �ow in a series�parallel network� J� Algorithms ������ ������ ���B���C� ��Q��

��� T� Terlaky �H�EOTVO�� S�Z� Zhong �NL�GRON�E�� Pivot rules for linear pro�gramming� a survey on recent theoretical developments� Ann� Oper� Res����������� ������� ���C��

��� K�M� Anstreicher ��IA�MG�� D� den Hertog �NL�DELFT�� C� ROOS �NL�DELFT�� T� Terlaky �NL�DELFT�� A long�step barrier method for convexquadratic programming� Algorithmica ������ ������� ���C��

��� O� G�uler� D� den Hertog� C� Roos� T� Terlaky �NL�DELFT�� T� Tsuchiya�Degeneracy in interior point methods for linear programming� a survey� Ann�Oper� Res� ���������� ����� ���C��

��� den Hertog �NL�DELFM�� C� Roos �NL�DELFM�� Terlaky T� �NL�DELFM��The linear complementarity problem� su�cient matrices� and the criss�crossmethod� Linear Algebra Appl� ������� �� ���C� ���

�� Harary� F� ��NMS�C�� Tuza Zsolt �H�AOS�C�� Two graph�colouring games�Bull� Austral� Math� Soc� ������� ���� ���D� ��C��

����

� J� Aba�y �I�BERG�MI�� A� Dolci �I�BERG�MI�� M� Gaviano �I�CAGL�� Bayesi�an stopping rules for improvement of local minima algorithms in global opti�mization� Optimization ������� ������ ���C� ��K��

�� J� Acz�el ���WTRL�� Z� Moszner �PL�PUCR�� New results on �scale� and �size�arguments justifying invariance properties of empirical indices and laws� Math�Social Sci� ������� ���� ���� ��A��

�� Acz�el� J�anos D� ���WTRL�� R� Girgensohn� On the determination of price andquantity indices and their monotonicity� In� Inequalities and applications� ������ World Sci� Publ�� River Edge� ��� ���A��

�� B�ar�any� Imre �H�AOS�� R� Howe� H�E� Scarf� The complex of maximal latticefree simplices� Math� Programming ������� ������ ���C��

�� Duckstein� L�� Andr�as B�ardossy �D�KLRH�HY�� A� Tecle� Istv�an Bog�ardi ��NE�CE�� Fuzzy composite programming with application to wastewater man�agementunder changing physical conditions� Fuzzy optimization� Physica� Hei�delberg� ���� ����� ���C��

Page 21: Elcsendes/MOT/almanach.pdf · 2008-12-25 · esei c mmel AT arsas ag v end egei r ovid ismertet es miv olt a l atogat asuk eredm en y e oldal Szakmai utak a T arsas ag k olts eg en

�� J� Beck ��RTG�� Deterministic graph games and a probabilistic intuition� Com�bin� Probab� Comput� ������ ���� ���D� ��C��

�� E� Boros ��RTG�CS�� Y� Crama �NL�LIMB�QE�� P�L� Hammer ��RTG�OR��M� SAKS ��UCSD�CS�� A complexity index for satis�ability problems� SIAMJ� Comput� ������� ����� ���Q� ��C��

�� E� Boros ��RTG�CS�� P�L� Hammer ��RTG�OR�� M�E� Hartmann ��NC�DO��R� Shamir �IL�TLAV�C�� Balancing problems in acyclic networks� DiscreteAppl� Math� ������� ����� ���Q� ��B��

�� Boros� Endre ��RTG�OR�� P�L� Hammer� J�N� Hooker� Predicting cause�e�ectrelationships from incomplete discrete observations� SIAM J� Discrete Math������� ������� ��J� ��C

�� Buksz�ar� J� �H�EOTVO�AN�� Istv�an Jo�o�H�EOTVO�AN�� A minimax theorem�Ann� Univ� Sci� Budapest� Sect� Math� ������� ����� ���C��

� A� Cs�ebfalvi� G� Cs�ebfalvi �H�PECS�I�� Post�buckling analysis of frames by ahybrid path�following method� Generalized convexity� �P�ecs� ���� ��������� ���C��

�� J� Dombi �H�AOS�R�� N�J� Vincze� Universal characterization of nontransitivepreferences� Math� Social Sci� ������� ���� ���A��

�� Domokos� Andr�as �R�CLUJ�� A minimax theorem� Ann� Univ� Sci� Budapest�Sect� Math� ������� ����� ���C��

�� P�L� Erd�os �NL�MATH�� L� Sz�ekely �H�EOTVO�C�� On weighted multiway cutsin trees� Math� Programming ������� ����� ���C� ��C��

�� F� Forg�o �H�BUEC�� On the existence of Nash�equilibrium in n�person general�ized concave games� Generalized convexity� �P�ecs� ���� ����� ��� ���C��

�� A� Frank �H�EOTVO�C�� Z� Szigeti �H�EOTVO�C�� On packing T�cuts� J�Combin� Theory Ser� B� ������ ������ ���B��

�� Carlsson� Ch�� Full�er R�obert �H�EOTVO�C�� Interdependence in fuzzy multipleobjective programming� Fuzzy Sets and Systems ������� ���� ���C��

�� Ecklund� P�� M� Federicci� R�obert Full�er �H�EOTVO�C�� Stability in multiob�jective possibilistic linear programs with weakly noninteractive fuzzy numbercoe�cients� Fuzzy optimization� Physica� Heidelberg� ���� �������� ��C

�� J� F�ul�op �H�AOS�C�� A cutting plane algorithm for linear optimization over thee�cient set� Generalized convexity� �P�ecs� ���� �������� ��� ���C��

��

Page 22: Elcsendes/MOT/almanach.pdf · 2008-12-25 · esei c mmel AT arsas ag v end egei r ovid ismertet es miv olt a l atogat asuk eredm en y e oldal Szakmai utak a T arsas ag k olts eg en

��� G� Galambos� A� van Vliet �NL�ROTT�EM�� Lower bounds for �� �� and ��dimensional on�line bin packing algorithms� Computing ������� ������ ���B���C��

�� Horv�ath� Mikl�os �H�EOTVO�AN�� Istv�an Jo�o�H�EOTVO�AN�� On a minimaxtheorem� Ann� Univ� Sci� Budapest� Sect� Math� ������� ���� ���C��

��� Ill�es� Tibor �H�EOTVO�OR�� G�abor Kassay �R�CLUJ�� Farkas type theoremsfor generalized convexities� Pure Math� Appl� ������ ������� ���C��

��� Jo�o� Istv�an �H�EOTVO�AN�� G� Kassay �R�CLUJ�� On saddle points of set�valued mappings� Ann� Univ� Sci� Budapest� Sect� Math� ������� ���������C

��� P� Kas� E� Klafszky �H�BUDT�MG�� On the duality of the mixed entropy pro�gramming� Optimization ������� ������� ���N� ��C��

��� L� Blaga �R�PICN�� I� Kolumb�an �R�CLUJ�� Optimization on closely convexsets� Generalized convexity� �P�ecs� ���� ����� ��� ���C��

��� Generalized convexity� Ed� S� Koml�osi� T� Rapcs�ak� S� Schaible� Springer� ������� ��C��

��� S� Koml�osi � Generalized monotonicity in nonsmooth analysis� Generalizedconvexity� �P�ecs� ���� �������� ��� ���C��

��� S� Koml�osi� M� Pappalardo� A general scheme for �rst order approximations�Optimization Methods ! Software ������ ������

��� F� Herrera �E�GRAN�AI�� J�L� Verdegay �E�GRAN�AI�� M� Kov�acs �H�EOTV�C�� Homogeneous linear fuzzy functions and ranking methods in fuzzy linearprogramming problems� J� Uncertain� Fuzziness Knowledge�Based Systems������ ����� ���C� ����

��� M� Kov�acs �H�EOTVO�C�� F�P� Vasilev �RS�MOSC�CM�� On the convergencerate of regulaziation methods for ill�posed extremal problems� Numerical anal�ysis and mathematical modelling� �Warsaw� ���� �������� ��� ���C� ��K��

�� Kov�acs� Margit �H�EOTVO�C�� Fuzzy linear programming with centered fuzzynumbers� Fuzzy optimization� Physica� Heidelberg� ���� ����� ���C��

��� Lakatos� L� �H�EOTVO�AG�� On a simple continuous cyclic�waiting problem�Ann� Univ� Budapest� Sect� Comput� ������ ���� ���B��

��� J�E� Falk ��GWU�OP�� S�W� Palocsay ��JMAD�DS�� Image space analysis ofgeneralized fractional programs� J� Global Opt� ������ ����� ���C��

Page 23: Elcsendes/MOT/almanach.pdf · 2008-12-25 · esei c mmel AT arsas ag v end egei r ovid ismertet es miv olt a l atogat asuk eredm en y e oldal Szakmai utak a T arsas ag k olts eg en

��� A� Pr�ekopa �H�EOTVO�OR�� Estimation of cause�e�ect relationship undernoise� J� Appl� Probab� �A����� ������� ���B� ��B��

��� T� Rapcs�ak �H�AOS�C�� On the connectedness of the solution set to linearcomplementarity systems� J� Optim� Theory Appl� ������� ����� ���C��

��� T� Rapcs�ak �H�AOS�C�� Geodesic convexity on Rn� Generalized convexity��P�ecs� ���� ����� ��� ���C��

��� T� Rapcs�ak �H�AOS�C�� On the connectedness of the solution set to nonlinearcomplementarity systems� J� Optim� Theory Appl� ������ ����� ���C��

��� T� Solymosi ��ILCC�MS�� T�E�S� Raghavan ��ILCC�MS�� An algorithm for�nding the nucleolus of assignment games� Internat� J� Game Theory ����������� ���D��

��� Gy� Sonnevend �H�EOTVO�NA�� A new class of a high order interior pointmethod for the solution of convex semi�in�nite optimization problems� Compu�tational optimal control �Munich� ���� ����� ��� ���C��

��� Shahrokhi� F�� L�aszl�o A� Sz�ekely �H�EOTVO�� On canonical concurrent �ows�crossing number and graph expansion� Combin� Probab� Comput� ������������� ���B��

�� F� Szidarovszky ��AZ�I�� S� Moln�ar �H�CMDI�SA�� Learning in a dynamicproducer�consumer market� Appl� Math� Comput� ������� ������� ���A��

��� I�K� Argyros ��CMRN�� F� Szidarovszky ��AZ�I�� Some notions of nonsta�tionary multistep iteration processes� Acta Math� Hungar� ������� ����������C��

��� Szidarovszky� Ferenc ��AZ�I�� I�K� Argyros� On the convergence of modi�edcontractions� J� Comput� Appl� Math� ������� ����� ���C��

��� P� Szil�agyi� A class of di�erentiable generalized convex functions� Generalizedconvexity� �P�ecs� ���� ����� ��� ���C��

��� H�C� Lai� P� Szil�agyi �H�BUDT�EE�� Alternative theorems and saddlepoint re�sults for convex programming problems of set functions with values in orderedvector spaces� Acta Math� Hungar� ������� ����� ���C��

��� R�K� Ahuja ���IITK�IE�� J�B� Orlin ��MIT�MG�� C� Stein ��DTM�� R�E� Tar�jan ��PRIN�CS�� Improved algorithms for bipartite network �ow� SIAM J�Comput� ������� ������� ���B��

��

Page 24: Elcsendes/MOT/almanach.pdf · 2008-12-25 · esei c mmel AT arsas ag v end egei r ovid ismertet es miv olt a l atogat asuk eredm en y e oldal Szakmai utak a T arsas ag k olts eg en

��� B� Hoppe ��CRNL�C�� �E� Tardos ��CRNL�OR�� Polynomial time algorithmsfor some evacuation problems� Proc� ACM�SIAM Symp� on Discrete Algo�rithms �Arlington� ���� ������� ��� ���B��

��� P� Klein ��BRN�C�� S� Plotkin ��STF�C�� C� Stein ��DTM�� �E� Tardos ��CRNL�OR�� Faster approximation algorithms for the unit capacity concurrent�ow problem with applications to routing and �nding sparse cuts� SIAM J�Comput� ������� ������� ���Q� ��C��

��� K�M� Anstreicher ��IA�� T� Terlaky �NL�DELFT�� A monotonic build�up sim�plex algorithm for linear programming� Oper� Res� ������� ������ ���C��

��� D� den Hertog �NL�DELFT�� C� Roos �NL�DELFT�� T� Terlaky �H�EOTVO��Inverse Barrier methods for linear programming� RAIRO Rech� Oper� ������������ ���C��

�� B� Jansen �NL�DELFT�� C� Roos �NL�DELFT�� T� Terlaky �H�EOTVO�� Thetheory of linear programming� skew symmetric self�dual problems and the cen�tral path� Optimization ������� ������� ���C��

��� Jansen� B�� C� Roos� Tam�as Terlaky �NL�DELFT�� J��P� Vial� Primal�dualalgorithms for linear programming based on the logarithmic barrier method� J�Optim� Theory Appl� ������� ��� ���C��

��� den Hertog� D�� C� Roos� Tam�as Terlaky �H�EOTVO�� Adding and deletingconstraints in the logarithmic barrier method for LP� Advances in Optimizationand approximation� Kluwer� Dordrecht� ������ ��� ���C��

��� Poljak� S�� Zsolt Tuza �H�AOS�� The expected relative error of the polyhedralapproximation of the max�cut problem� Oper� Res� Letters ������ �������C��

��� Vizv�ari� B�ela �TR�BILK�IE�� F� Yilmaz� An ordering �enumerative� algorithmfor nonlinear �� programming� J� Global Optimization ������ ������� ���C��

����

� Acz�el J����WTRL�� Some recent applications of functional equations to thesocial and behavioral sciences� Aeguationes Math� ������� ����� ���A��

�� Bak�o Andr�as �H�BUDT�� Emil Klafszky �H�BUDT�� Tam�as Sz�antai �H�BUDT��L�aszl�o G�asp�ar� Optimization techniques for planning highway pavement im�provements� Ann� Oper� Res� ������� ����� ���C��

�� Bencz�ur� A�A� ��MIT�� Counterexamples for directed and node capacitatedcut�trees� SIAM J� Comput� ������� ������ ���B��

��

Page 25: Elcsendes/MOT/almanach.pdf · 2008-12-25 · esei c mmel AT arsas ag v end egei r ovid ismertet es miv olt a l atogat asuk eredm en y e oldal Szakmai utak a T arsas ag k olts eg en

�� Boros� Endre ��RTG�CS�� Andr�as Recski �H�BUDTEE�CS�� Ferenc Wettl �H�BUDT�T�� Unconstrained multilayer switchbox routing� Ann� Oper� Res�������� ����� ���B��

�� Boros� Endre ��RTG�CS�� P�l� Hammer� J�N� Hooker� Boolean regression�Ann� Oper� Res� ������� ������ ���C��

�� Csendes� Tibor �H�SZEg�CY�� Z�B� Zabinsky� B�P� Kristinsdottir� Consturctinglarge feasible suboptimal intervals for constrained nonlinear optimization� Ann�Oper� Res� ������� ������� ���C��

�� Csenki� A� ���ASTN�AM�� A dependability measure for Markov models of re�pairable systems� solution by randomization and computational experience�Comput� Math� Appl� ������� ���� ���B��

�� Cz�edli� G�abor �H�SZEG�B�� Gy�orgy Pol�ak� When do coalitions form a lattice�Acta Sci� Math� ������� ������ ���D��

�� Fodor� J�anos �H�EOTVO�� M� Roubens� Characterization of weighted maxi�mum and some related operations� Inform Sci� ������� ���� ���C��

�� Fodor� J�anos �H�EOTVO�C�� M� Roubens� Structure of transitive valued binaryrelations� Math� Social Sci� ������� ���� ���A��

� Bang�Jensen� J�� Andr�as Frank �H�EOTVO�C�� B� Jackson� Preserving andincreasing local edge�connectivity in mixed graphs� SIAM J� Discrete Math������� ����� ���C��

�� F�ul�op� J�anos �H�AOS�OR�� Deletion�by�infeasibility rule for DC�constrainedglobal optimization� J� Optim� Theory Appl� ������� ������� ���C��

�� Galambos� G�abor� G�J� Woeginger� Minimizing the weighted number of latejobs in UET open shops� ZOR ������ ���� ���C��

�� Galambos� G�abor �A�TGRZ�IM�� G�J� Woeginger� On�line bin packing � a re�stricted survey� ZOR ������� ����� ���C��

�� Koml�osi� S�andor �H�PECSEC�� Generalized monotonicity and generalized con�vexity� J� Optim� Theory Appl� ������� ������ ���C��

�� Combinatorial Optimization� Ed�� Cook� W�� L�aszl�o Lov�asz� P� Seymour� AMS�Providence� ��� �����

�� Lov�asz� L�aszl�o ��YALE�C�� Randomized algorithms in combinatorial optimiza�tion� in� Combinatorial Optimization� AMS� Providence� ���� ����� ���C��

��

Page 26: Elcsendes/MOT/almanach.pdf · 2008-12-25 · esei c mmel AT arsas ag v end egei r ovid ismertet es miv olt a l atogat asuk eredm en y e oldal Szakmai utak a T arsas ag k olts eg en

�� AppliedMathematical Programming and Modelling� Ann� Oper� Res� �������Baltzer� Basel� ed� Istv�an Maros� G� Mitra �����

�� Maros� Istv�an ���BRNL�� Csaba M�esz�aros �H�AOS�C�� A numerically exactimplementation of the simplex method� Ann� Oper� Res� ������� ��� ���C��

��� Kall� P� J�anos Mayer �CH�ZRCH�OR�� Computer support for modeling in stochas�tic linear programming� in Stochastic Programming� Springer� Berlin� ��������� ���C��

�� Rapcs�ak� Tam�as �H�AOS�C�� Tensor approximations of smooth nonlinear com�plementary problems� in Variational inequalities and network equilibrium prob�lems� Erice� ���� Plenum� New York� ���� ������� ���C��

��� Rapcs�ak� Tam�as �H�AOS�C�� T�T� Thang �H�ASO�C�� Nonlinear Coordinaterepresentations of smooth optimization problems� J� Optim� Theory Appl�������� ������� ���C��

��� Ponsati�Obiols� C�� J�ozsef S�akovics �E�BARA�EA�� The war of attrition withincomplete information� Math� Social Sci� ������� ������� ���D��

��� Szidarovszky� Ferenc ��AZ�I�� J� Yen� Dymanic Cournot oligopolies with pro�duction adjustment costs� J� Math� Econom� ������� ���� ���A��

��� Hoppe� B�� �Eva Tardos ��CRNL�OR�� The quickest transshipment problem�Proc� ACM�SIAM� San Francisco� ���� ����� ���B��

��� Leighton� F�T�� F� Makedon� S� Plotkin� C� Stein� �Eva Tardos ��CRNL�OR�� S�Tragoudlas� Fast approximation algorithms for multicommodity �ow problems�J� Comput� System Sci� ������� ������� ���B��

��� Plotkin� S�� D�B� Shmoys� �Eva Tardos ��CRNL�OR�� Fast approximation al�gorithms for fractional packing and covering problems� Math� Oper� Res�������� ������ ���C��

��� den Hertog� D�� J� Kalinski� C� Roos� T� Terlaky �H�EOTVO�� A logarith�mic barrier cutting plane method for convex programming� Ann� Oper� Res�������� ����� ���C��

��� Poljak� S�� Zsolt Tuza �H�AOS�C�� Maximumcuts and large bipartite subgraphs�in� Combinatorial Optimization� AMS� Providence� ���� ����� ���C��

��

Page 27: Elcsendes/MOT/almanach.pdf · 2008-12-25 · esei c mmel AT arsas ag v end egei r ovid ismertet es miv olt a l atogat asuk eredm en y e oldal Szakmai utak a T arsas ag k olts eg en

��� Tudom�anyos konferenci�ak

������ XX�Magyar Operaciokutatasi Konferencia Esztergom

����

Az el�oad�asok list�aja�

Alf�oldi Ferenc� G�abor Andr�as� K�o Andrea� Lovrics L�aszl�o� Mesters�eges idegh�al�oza�tok banki alkalmaz�asai

Bacsi Zsuzsanna� Zemankovics Ferenc� �Oszi b�uza �es kukorica szimul�aci�os modellvalid�aci�os k�s�erletei

Bencz�ur Andr�as� A Kolmogorov bonyolults�ag �es a Solomono��Levin univerz�alis apri�ori eloszl�as szerepe az indukt�v k�ovetkeztet�esben

Bir�o Mikl�os� Trendek a d�ont�est�amogat�asban

C� Fodor J�anos� Preferencia modellez�es� t�obbkrit�erium�u d�ont�esek

Csendes Tibor� �Ujabb eredm�enyek intervallum�aritmetik�an alapul�o glob�alis opti�maliz�al�asi m�odszerekkel

Edvi Tibor� Karmarkar projekt�v sk�al�az�asi algoritmusa

F�abi�an Csaba Istv�an� LINX� egy interakt�v line�aris programoz�ast t�amogat�o rutin�gy�ujtem�eny

F� Kov�acs Erzs�ebet� Margin�alis pontok a sokdimenzi�os t�erben

Gyetv�an Ferenc� J�at�ekelm�eleti megk�ozel�t�es a hatalmi er�ok eloszl�as�anak �ert�ekel�es�erea magyar parlamentben

Gyurkovics �Eva� Tak�acs Tibor� Bizonytalan param�eter�u rendszerek stabiliz�al�asa

Hajdu Mikl�os� Egy algoritmus az MPM�cost modell megalkot�as�ara

Hal�asz Edit� Neur�alis �aramk�or�ok alkalmaz�asa az oper�aci�okutat�asban

Ill�es Tibor� Eg�esz�ert�ek�u programoz�as alkalmaz�asa egy v�eges�geometriai probl�em�ara

Jo�o Istv�an� Kassay G�abor� Konvex halmazok� minimax t�etelek �es alkalmaz�asaik

Koml�osi S�andor� �Altal�anos�tott deriv�altak az optimaliz�al�aselm�eletben

L�aszl�o Zolt�an� Mih�alyk�on�e Orb�an �Eva� A Poisson folyamat n�ovekm�eny�enek szupr�e�mum�ar�ol

��

Page 28: Elcsendes/MOT/almanach.pdf · 2008-12-25 · esei c mmel AT arsas ag v end egei r ovid ismertet es miv olt a l atogat asuk eredm en y e oldal Szakmai utak a T arsas ag k olts eg en

L�orincz S�andor� T�erbeli szerel�es t�obbv�altoz�os �utemid�o kiegyenl�t�ese

Mahmud A� Al�Ftise� Hujter Mih�aly� Egy multi�project �utemez�esi probl�ema sz�am��t�og�epes algoritmusa

Moln�ar S�andor� Vertikum t�pus�u line�aris rendszerek vizsg�alat�ar�ol

�� Sz�am�t�og�epes d�ont�est�amogat�as� a DSS program

Nagy Tam�as� Az entr�opia programoz�as �es n�eh�any alkalmaz�asa

Pa�al Jen�o� Agroter�apia�vesztes�egfelt�ar�o modell

Pog�any E�orsn�e� Zsigmond Ildik�o� A kvadratikus hozz�arendel�esi feladat �es alkal�maz�asai

Rapcs�ak Tam�as� Thang T�T�� �Altal�anos�tott inverzek a nemline�aris optimaliz�al�asban

So�os Csaba Zolt�an� Mez�ogazdas�agi nagy�uzemek csoportstrukt�ur�aj�anak komplex e�lemz�ese

Szab�o Imre� Az �eletk�epess�egi t�etelek alkalmaz�asai az ir�any�t�aselm�eletben

Sz�antai Tam�as� A PCSP �Probabilistically Costrained Stochastic Programming�programrendszer bemutat�asa

Szenteleki K�aroly� Az Agro�okol�ogiai Inform�aci�os Rendszer �AIIR� szerepe a re�gion�alis strat�egiai tervez�es t�amogat�as�aban

Szigeti Ferenc� V�altoz�o strukt�ur�aj�u rendszerek ir�any�that�os�aga �es meg�gyelhet�os�ege

Varga Zolt�an� Stabilit�asi k�erd�esek a popul�aci�odinamik�aban

������ XXIth International Conference on Mathematical Pro�

gramming Matraf�ured ����

Az el�oad�asok list�aja�

Berbyuk� V�E�� Ivakh� G�F�� New method of discretization for nonlinear optimalcontrol problems

Cs�ebfalvi A�� Cs�ebfalvi Gy�� Geometrically non�linear analysis of space trusses usingsparse quasi�Newton algorithms

Csendes T�� On the space complexity of interval global optimization algorithms

De�ak I�� A convergence theorem for asynchronous algorithms

��

Page 29: Elcsendes/MOT/almanach.pdf · 2008-12-25 · esei c mmel AT arsas ag v end egei r ovid ismertet es miv olt a l atogat asuk eredm en y e oldal Szakmai utak a T arsas ag k olts eg en

Eriksson� J�� Lindstroem� P�� Sequential and parallel interval global optimizationalgorithms for solving nonlinear least squares problems

Fegyverneki� S�� MM�estimation of location and scatter

F�ul�op� J�� A polyhedral outer�approximation algorithm for solving canonical D�C�problems

Gal�antai� A�� ABS�methods for solving nonlinear equations

Gergel� V�� A global optimization method using derivatives

Giannessi� F�� Connections between Lagrangian and Pontryagin maximum principle

G�unzel� H�� A nontrivial Whitney�partition of the set of stationary points in para�metric optimization

Hegelund� P�� Madsen� K�� Parallel interval methods for global optimization

Hocks� M�� An introduction to linear optimization with veri�cation

Hujter� M�� How to �nd the optimal packing of congruent circles in a square�

Ill�es� T�� B�eres� L�� Integer programming model for an unsolved problem of �niteprojective geometry

Jansson� Ch�� A global minimization method

Jongen� H�Th�� On the decomposition of the Karush�Kuhn�Tucker set in �multi�parametric optimization

K�eri� G�� On a kind of almost copositive matrices and a theorem of Hall and Newman

Koml�osi� S�� Pappalardo� M�� First order approximations in optimization

Krarup� J�� Inter�European cooperation within OR�MS� new initiatives

Mazzoleni� P�� Variable dependent nonlinear order relations

Nagy� T�� Applications of the entropy programming

Oetli� W�� Blum� E�� Variational principles for equilibrium problems

Pappalardo� M�� Regularity conditions in nonlinear programming

Pellegrini� L�� Necessary optimality conditions for nondi�erentiable extremum prob�lems with equality constraints

Rapcs�ak� T�� On the connectedness of feasible regions of complementarity systems

��

Page 30: Elcsendes/MOT/almanach.pdf · 2008-12-25 · esei c mmel AT arsas ag v end egei r ovid ismertet es miv olt a l atogat asuk eredm en y e oldal Szakmai utak a T arsas ag k olts eg en

Ratz� D�� New results on global optimization with automatic result veri�cation

Spedicato� E�� On sparse symmetric and positive de�nite secant updates

Terlaky� T�� Zhang� Sh�� A survey on pivot rules for linear programming

Terlaky� T�� Guler� O�� Roos� C�� Vial� J�Ph�� Interio point approach to the theoryof linear programming

Thang� T�T�� Rapcs�ak� T�� A polynomial variable metric algorithm for linear pro�gramming

Vajda� S�� Farkas alternatives and applications

V�alyi� I�� Ellipsoidal methods for a problem of time optimal control

V�as�arhelyi� A�� Rapcs�ak� T�� Mathematical model of structural analysis in case ofprocesses

Zimmermann� U�� On the complexity of balanced �ow problems

������ XXI� Magyar Operaciokutatasi Konferencia Szeged

����

Az el�oad�asok list�aja�

Abonyi�T�oth Zsolt� Minim�alis metsz�essz�am�u blokkol�o halmazok vizsg�alata bels�opontos m�odszerrel

Bajalinov Erik� A munkan�elk�ulis�eggel kapcsolatos probl�em�ak modellez�es�enek egymegk�ozel�t�es�er�ol

Bartalos Istv�an� Dud�as Tibor �es Imreh Bal�azs� N�eh�any TSP heurisztika sz�am�t�og�e�pes �osszehasonl�t�o vizsg�alata

Bir�o Mikl�os� Modell�ep�t�es �es t�obbkrit�erium�u elemz�es Microsoft Excel k�ornyezetben

Bolla Marianna �es Tusn�ady G�abor� Kvadratikus alakok �osszeg�enek optimum�ar�ol

Bokor J�ozsef �es Gianone L�aszl�o� Bizonytalan param�eter�u rendszerek ir�any�t�asa min�imax krit�erium alapj�an

Chik�an Attila� Egy k�eszletez�esi d�ont�est�amogat�o rendszer v�azlata

Keith Crandall �es Hajdu Mikl�os� Algoritmus a CPM feladat �legrosszabb� megold�a�s�ara

��

Page 31: Elcsendes/MOT/almanach.pdf · 2008-12-25 · esei c mmel AT arsas ag v end egei r ovid ismertet es miv olt a l atogat asuk eredm en y e oldal Szakmai utak a T arsas ag k olts eg en

Czirok L�aszl�o �es Zawiasa Robert� Transzputerek� T�Node az oper�aci�okutat�asban �esaz oktat�asban

Cs�aki P�eter� Csisz�ar Levente� F�olsz Ferenc� Keller Krisztina� M�esz�aros Csaba� Rap�cs�ak Tam�as �es Turch�anyi Piroska� A WINGDSS ��� csoportos d�ont�est�amogat�orendszer fel�ep�t�ese �es fejleszt�esi ir�anyai

Cs�aki P�eter� Csisz�ar Levente� F�olsz Ferenc� Keller Krisztina� M�esz�aros Csaba� Rap�cs�ak Tam�as �es Turch�anyi Piroska� WINGDSS� Csoportos d�ont�eseket t�amogat�okeretrendszer k�uls�o adatb�azisok �es programrendszerek integr�al�asi lehet�os�eg�evel

Cs�aki P�eter� Csisz�ar Levente� F�olsz Ferenc� Keller Krisztina� M�esz�aros Csaba�Rapcs�ak Tam�as �es Turch�anyi Piroska� �Erz�ekenys�egi vizsg�alati modellek aWINGDSS csoportos d�ont�est�amogat�o rendszerben

Cs�aki P�eter� Csisz�ar Levente� F�olsz Ferenc� Keller Krisztina� M�esz�aros Csaba� Rap�cs�ak Tam�as �es Turch�anyi Piroska� WINGDSS alkalmaz�asok

Csallner Andr�as Erik� Intervallum�felez�o glob�alis optimaliz�al�o m�odszerek �osszeha�sonl�t�asa

Csendes Tibor� B�P� Kristinsdottir �es Z�B� Zabinsky� Jav�tott hat�ekonys�ag�u algorit�musok felt�eteles nemline�aris optimaliz�al�asi feladatok toleranci�aval val�o megold�a�s�ara

Cs�ebfalvi Anik�o �es Cs�ebfalvi Gy�orgy� Egy homot�opi�an alapul�o egys�eges �utk�ovet�om�odszer r�acsostart�ok stabilit�asvizsg�alat�ara

Csisz�ar Imre� A maximum entr�opia m�odszer� axiomatika �es algoritmusok

Dombi J�ozsef� T�obbt�enyez�os d�ont�esek �altal�anos modellje

Domokos Andr�as� Minimax t�etelek

D�ogei S�andor� Vagyonbiztos�t�asi d�jkalkul�aci�os probl�em�ak

Fegyverneki S�andor� A Student�eloszl�as param�etereinek a becsl�ese

Augusto Ferrante� Gy�orgy Michaletzky and Michele Pavon� Splitting subspaces andgeneralized spectral factors

C� Fodor J�anos� Aggreg�al�as t�obbkrit�erium�u d�ont�esi probl�em�akban

Friedler Ferenc �es L�T� Fan� Reduction of subproblem size for the combinatoriallyaccelerated branch and bound algorithm of process network synthesis

Friedler Ferenc� L�T� Fan �es Imreh Bal�azs� Maximal structure generation in processnetwork synthesis

��

Page 32: Elcsendes/MOT/almanach.pdf · 2008-12-25 · esei c mmel AT arsas ag v end egei r ovid ismertet es miv olt a l atogat asuk eredm en y e oldal Szakmai utak a T arsas ag k olts eg en

Mahmud Al�Ftise �es T�anczos Katalin� Egy integr�alt projekt ir�any�t�asi rendszer

Full�er R�obert� Az alternat�v�ak j�os�ag�anak m�er�ese fuzzy t�obbc�elf�uggv�eny�u MP prob�l�em�akban

F�ul�op J�anos� Nemkonvex programoz�asi feladatok egy speci�alis oszt�aly�ar�ol

Gerencs�er L�aszl�o �es V�ag�o Zsuzsanna� Folytonos idej�u rendszerek identi�k�aci�oja

Gyurkovics �Eva �es Tak�acs Tibor� Bizonytalan param�eter�u� kapcsolt rendszerek sta�biliz�al�asa

Harnos Zsolt� A kock�azat kezel�ese a mez�ogazdas�agi tervez�esben

Hujter Mih�aly� A lefed�esi sug�ar �es a Frobenius�probl�ema

Ill�es Tibor �es Kassay G�abor� �Altal�anos�tott Farkas t�etelek �es dualit�as elm�elet

Ill�es Tibor �es Jakob Krarup� Maxim�alis C��mentes p�aros gr�afok �es egy h�atizs�ak�t�pus�u feladat megold�asa

Kassay G�abor� A line�aris egyenl�otlens�egek �es Farkas Gyula t�etele

Kolumb�an G�eza �es V�zv�ari B�ela� Egy� a telekommunik�aci�oban haszn�alatos �aramk�orfrakt�al tulajdons�agai

Kolumb�an J�ozsef� Egy �altal�anos�tott nyeregpontt�etelr�ol

Koml�osi S�andor� �Altal�anos�tott monotonit�as �es �altal�anos�tott konvexit�as

Kov�acs Margit� A fuzzy line�aris programoz�as modelljei

Kov�acs Zolt�an� Friedler Ferenc �es L�T� Fan� Algorithmic generation of the NLPmodel for separation network synthesis

Maros Istv�an �es M�esz�aros Csaba� Nagym�eret�u� numerikusan neh�ez LP feladatokmegold�asi m�odszerei

Martos B�ela� A nyugd�jak egyenl�otlens�eg�enek komponensei

M�at�e Levente� NYUGDMEG �ugyviteli rendszer

M�esz�aros Csaba� Felt�olt�od�es elleni technika bels�o pontos algoritmusokban

Moln�ar S�andor �es Szigeti Ferenc� Id�ot�ol f�ugg�o vertikum�t�pus�u line�aris rendszerekr�ol

Musz�ely Gy�orgy� A munkanapok sz�am�anak hat�as�at�ol megtiszt�tott havi adatokel�o�all�t�asa

Page 33: Elcsendes/MOT/almanach.pdf · 2008-12-25 · esei c mmel AT arsas ag v end egei r ovid ismertet es miv olt a l atogat asuk eredm en y e oldal Szakmai utak a T arsas ag k olts eg en

Racsk�o P�eter� Harnos Zsolt �es Szeidl L�aszl�o� D�ont�esi modellek �es kock�azatelemz�esa gabonatermeszt�esben

Rapcs�ak Tam�as �es Tran Thanh Thang� Egy polinomi�alis� v�altoz�o metrik�aj�u algorit�mus oszt�aly line�aris programoz�asra

Simonovits Andr�as� Koroszt�alyok k�ozti k�ul�onbs�egek �es optim�alis t�arsadalombiztos��t�asi rendszerek egy kv�azi�stacioner gazdas�agban

Somly�odi L�aszl�o� V�zmin�os�egi �es k�ornyezeti modellez�es� a bizonytalans�agok �es asztochasztikus hat�asok szerepe

Sonnevend Gy�orgy� Centr�alis utakon alapul�o m�odszerek visszacsatolt ir�any�t�asokkonstru�al�as�ara

Sonnevend Gy�orgy� Magasrend�u extrapol�aci�os algoritmusok a centr�alis �utak k�ovet�e�s�ere konvex szemiin�nit feladatokban� alkalmaz�asok

Sz�antai Tam�as� A PCSP �Probabilistic Constrained Stochastic Programming� pro�gramrendszer �uj verzi�oja

Sz�ep Katalin� Mez�ogazdas�agi kistermel�essel foglalkoz�o h�aztart�asok gazd�alkod�asimodelljei

Tall�os P�eter� Az �eletk�epess�egelm�elet n�eh�any �ujabb k�erd�es�er�ol

Terdik Gy�orgy� On problem of stochastic bilinear realization

Varga Csaba� Lusternik�Schnirelman t�pus�u t�etel �es alkalmaz�asa a geodetikus von�alak elm�elet�eben

Varga J�ozsef� Szimul�aci�os modell p�enzpiaci �arak el�orejelz�es�ere

Varga J�ozsef� Friedler Ferenc �es L�T� Fan� Combinatorial technique for multiperiodprocess network synthesis

Varga L�aszl�o� Er�om�uvi berendez�esek karbantart�as�utemez�ese �es kapcsolata a matem�atikai �utemez�eselm�elettel

Varga Zolt�an� A szelekci�os modellek meg�gyelhet�os�eg�er�ol

Varr�o Zolt�an� Leszab�as kongruens t�eglalapokra �es t�eglatestekre

V�arlaki P�eter �es Bokor J�ozsef� Szinkronisztikus sztochasztikus rendszerek� realiz�aci�o�es identi�k�aci�o

V�as�arhelyin�e Szab�o Anna �es Rapcs�ak Tam�as� Folyamatok modellez�ese matematikaiprogramoz�assal

V�or�os J�ozsef �es Bug�ar Gy�ongyi� A k�olts�egf�uggv�enyek n�eh�any probl�em�aja

��

Page 34: Elcsendes/MOT/almanach.pdf · 2008-12-25 · esei c mmel AT arsas ag v end egei r ovid ismertet es miv olt a l atogat asuk eredm en y e oldal Szakmai utak a T arsas ag k olts eg en

������ XXIIth International Conference on Mathematical Pro�

gramming Matraf�ured ����

Az el�oad�asok list�aja�

Balla� Katalin� A di�erential equation approach to constrained optimization prob�lems

Bartalos� Istv�an� On a subtour patching heuristic for the asymetric TSP

Burkard� Rainer� Mathematical programs in the treatment of human cancer

Crouzeix� Jean�Pierre� Generalized convexity� generalized monotonicity and separa�bility

Csallner� Andr�as Erik� Large interval selection rule and convergence speed in intervalmethods

Cs�ebfalvi� Anik�o� Nonlinear path�following method for stability of structures

Cs�ebfalvi� Gy�orgy� Expert on the �oor an intelligent statistical quality controlsystem

Csendes� Tibor� The role of the interval subdivision selection rule in branch�and�bound algorithms for global optimization

Friedler� Ferenc� Reduction of subproblem size for the accelerated branch and boundalgorithm of process network synthesis

F�ul�op� J�anos� On concave minimization� subject to linear constraints and an addi�tional facial reverse convex constraint

Gergel� Victor� Information models and methods in global optimization

Gfrerer� Helmut� Continuity of locally optimal solutions in nonlinear programming

Giannessi� Franco� Some remarks on duality for variational inequalities

Glover� Barney� Solvability theorems for nonconvex systems and applications tooptimization

Horst� Reiner� A decomposition approach for the global minimization of biconcavefunctions over polytopes

Hujter� Mih�aly� On the QR factorization of matrices by graphs

Ill�es� Tibor � Szirmai� �Akos� Solving the hyperbolic programming problem usingCriss�Cross method

��

Page 35: Elcsendes/MOT/almanach.pdf · 2008-12-25 · esei c mmel AT arsas ag v end egei r ovid ismertet es miv olt a l atogat asuk eredm en y e oldal Szakmai utak a T arsas ag k olts eg en

Ill�es� Tibor� Mutually orthogonal latin squares and �� programming problems

Jeyakumar� V�� Complete characterizations of optimality in constrained global op�timization

Kaltinska� Rumena� RZtools�Family of interactive optimization systems

Kas� P�eter� On the dual of linear inverse problems

Kassay� G�abor� On saddle points of set�valued mappings

Kolumb�an� J�ozsef� Sandwich minimax theorems

Koml�osi� S�andor� Monotonicity and quasimonotonicity in nonsmooth analysis

Krarup� Jakob� What did Torricelli actually do around ����

Maros� Istv�an� Experiences with solving large�scale linear programming problems

Mayer� J�anos� Peter Kall� On model management aspects of stochastic LP

M�esz�aros� Csaba� Anti �ll�in technique in interior point methods

Mizuno� Shinji� An infeasible interior point algorithm using projections onto a con�vex set

Monhor� Davaadorjin� On the random variables representing activity duration instochastic PERT

Oetli� Werner� On "�monotonicity

Rapcs�ak� Tam�as � Thang� Trahn T�� On nonlinear coordinate representations ofsmooth optimization problems

Roos� C�� A new primal�dual a�n scaling direction for LP

Sergeyev� Yaroslav� Using local information in parallel global optimization

Sonnevend� Gy�orgy� High order extrapolation algorithms for following the centralpaths in linear �convex� programming

Sz�antai� Tam�as� New version of PCSP �Probabilistic Constrained Stochastic Pro�gramming� code

Terlaky� Tam�as� Polynomial a�ne scaling algorithms for linear complementarityproblemns

Turch�anyi� P� � Cs�aki� P� � Csisz�ar� L� � F�olsz� F� � Keller� K� � M�esz�aros� Cs� �Rapcs�ak� T�� WINGDSS � a visual interactive decision support shell

��

Page 36: Elcsendes/MOT/almanach.pdf · 2008-12-25 · esei c mmel AT arsas ag v end egei r ovid ismertet es miv olt a l atogat asuk eredm en y e oldal Szakmai utak a T arsas ag k olts eg en

Uhrin� B�ela� Discrete Lp�approximation for � � p � � an example of a globaloptimization problem

Zimmermann� Uwe� Optimization of tra�c lines

������ IIIrd Workshop on Global Optimization Szeged ����

Az el�oad�asok list�aja�

C�S� Adjiman� I�P� Androulakis� C�D� Maranas and Christodoulos A� Floudas� AGlobal Optimization Method� �BB

K�G� Ramakrishnan� M�G�C� Resende and P�M� Pardalos� An LP�Based Branch andBound Algorithm for the Quadratic Assignment Problem

Immanuel M� Bomze� Evolution Towards the Maximum Clique

Patrizio Cintioli� Pierluigi Maponi� Donatella Ponziani and Francesco Zirilli� TheGraph Partitioning Problem and the Nodal Properties of the Eigenvectors ofthe Laplacian

Wilfried Bollweg� Numerical Simulation of Crystal Structures by Simulated Anneal�ing

Inmaculada Garcia and P�M� Ortigosa� A Parallel Implementation of the ControlRandom Search algorithm to optimize a reconstruction from projection problem

Tale Geramitchioski and Ilios Vilos� Optimisation of the Reducing Gear Box withMinimisation its Own Weight

Eligius Hendrix� Global Optimization and Decision Support

Donald Jones� William Baritompa and Yaroslav Sergeyev� DIRECT� a Global Op�timization Algorithm for Computer�Aided Engineering

Arnold Neumaier� NOP � a Compact Input Format for Nonlinear OptimizationProblems

Panos M� Pardalos� Continuous Approaches to Discrete Optimization Problems

Jorge Mor�e and Zhijun Wu� Smoothing Transform and Continuation for GlobalOptimization

Hisham Al�Mharmah and James Calvin� Average Performance of Composite andNon�composite Algorithms for Global Optimization of Stochastic Functions

Marco Locattelli� On Relaxing the Hypotheses for the Application of Multi LevelSingle Linkage

��

Page 37: Elcsendes/MOT/almanach.pdf · 2008-12-25 · esei c mmel AT arsas ag v end egei r ovid ismertet es miv olt a l atogat asuk eredm en y e oldal Szakmai utak a T arsas ag k olts eg en

Zolt�an Kovacs� F� Friedler and L�T� Fan� Algorithmic Generation of the Mathemat�ical Programming Model for Process Network Synthesis

Andr�as Pfening and Mikl�os Telek� Optimal Rejuvenation Policy for Slowly Degrad�ing Server Software

Andrew T� Phillips� J� Ben Rosen and Ken A� Dill� CGU� A Global OptimizationAlgorithm for Protein Structure Prediction

Olga Yu� Polyakova� Reducing the Problem of Organization Structure Adaptationto Optimization Problem in Boolean Space

Jean�Francois Pusztaszeri� Paul E� Rensing and Thomas M� Liebling� Tracking El�ementary Particles near their Primary Vertex� A Combinatorial Approach

Emilio Carrizosa and Frank Plastria� Locating an Undesirable Facility by General�ized Cutting Planes

Stephan Dallwig� Arnold Neumaier and Hermann Schichl� GLOPT � A Program forConstrained Global Optimization

Alexander S� Strekalovsky and Igor L� Vasiliev� On Global Search in Non�ConvexOptimal Control Problem

Chris J� Price� A Multistart Linkage Algorithm Using First Derivatives

Marco Locatelli and Fabio Schoen� Analysis of Threshold Accepting Global Opti�mization Methods

Kristina Holmqvist� Athanasios Migdalas and Panos M� Pardalos� Greeedy Ran�domized Adaptive Search for a Location Problem with Economy of Scale

Bal�azs Imreh� F� Friedler and L�T� Fan� Polynomial Algorithm for Improving theBounding Procedure in Solving Process Network Synthesis by a Branch andBound Method

Roman G� Strongin� Global Optimization �Systematic Approach Employing PeanoMappings�

Yaroslav D� Sergeyev� An Algorithm for Minimizing Functions with LipschitzianDerivatives

Dietmar Ratz� Techniques for Gap�Treating and Box�Splitting in Interval NewtonGauss�Seidel Steps for Global Optimization

Alexander S� Strekalovsky and Ider Tsevendorj� Reverse Convex Programming�Theory and Algorithms�

��

Page 38: Elcsendes/MOT/almanach.pdf · 2008-12-25 · esei c mmel AT arsas ag v end egei r ovid ismertet es miv olt a l atogat asuk eredm en y e oldal Szakmai utak a T arsas ag k olts eg en

Oleg V� Khamisov� To the Global Minimization of Functions with Concave Minorant

Reiner Horst� Linearly Constrained Global Optimization of Functions with ConcaveMinorants

Michael Nast� Subdivision of Simplices Relative to a Cutting Plane with Applica�tions in Concave Minimization and Volume Computation

E�S� Mistakidis and Panagiotu D� Panagiotopoulos� Hemivariational Inequailies andGlobal Optimization� Numerical Search for the Optima�

Sonja Berner� Parallel Methods for Veri�ed Global Optimization Practice andTheory

Andr�as Erik Csallner and Tibor Csendes� Convergence Speed of Interval Methodsfor Global Optimization and the Joint E�ects of Algorithmic Modi�cations

M�N� Vrahatis� D�G� Sotiropoulos and E�C� Triantafyllou� Global Optimization forImprecise Problems

Victor P� Gergel� Information Models and Methods to Support Global OptimizationProcedures

J�anos D� Pint�er� LGO � An Implementation of a Lipschitzian Global OptimizationProcedure

Tam�as Rapcs�ak� An Unsolved Problem of Fenchel

Nguyen Van Thoai� A Method for Solving a Utility Function Program in MultipleObjective Nonlinear Optimization

Gerardo Toraldo and Panos M� Pardalos� Quadratic Programming with Box Con�straints

Jens Hichert� Armin Ho�mann and H�X� Phu� The Computation of the EssentialSupremum by using Integral Methods

Zelda B� Zabinsky and Birna P� Kristinsdottir� Complexity Analysis IntegratingPAS� PRS and Simulated Annealing

Antanas #Zilinskas� Global Optimization and Visualization of Multidimensional Data

Tibor Csendes� Global Optimization Methods for Process Network Synthesis

Chris Stephens and William Baritompa� Global Optimization Requires Global In�formation

��

Page 39: Elcsendes/MOT/almanach.pdf · 2008-12-25 · esei c mmel AT arsas ag v end egei r ovid ismertet es miv olt a l atogat asuk eredm en y e oldal Szakmai utak a T arsas ag k olts eg en

Victor Korotkich� On a Mechanism of Natural Formation and its Use in GlobalOptimization

Jonas Mockus� Audris Mockus and Linas Mockus� Bayesian Heuristic Approach toDiscrete and Global Optimization

���� � XIII� International Conference on Mathematical Pro�

gramming Matrahaza ���

Az el�oad�asok list�aja�

Crouzeix� J�P�� Pseudomonotone variational inequality problems� existence of solu�tions�

Maugeri� Antonio� Dynamic models and generalized equilibrium problems�

Klatte� Diethard� Error bounds for solutions of convex inequalities�

Pardalos� Panos� Approximate algorithms for the distance geometry problem�

Horst� Reiner� Utility function programs and optimization over the e�cient set inmultiple objective decision making�

F�ul�op� J�anos� A �nite partitioning algorithm for linear optimization over the e�cientset�

Kall� Peter� On testing SLP algorithms and codes�

Mayer� J�anos� Numerical experiences with some algorithms for jointly chance con�strained problems�

Sz�antai� Tam�as� On the k�out�of�r�from�n� F reliability systems with unequal ele�ment probabilities�

De�ak� Istv�an� Regression estimates for multinormal distribution functions�

Terlaky� Tam�as� Optimal basis identi�cation and Balinski�Tucker tableaus in quadraticprogramming linear complementarity problems�

Maros� Istv�an� Dual steps in sparse simplex method for mixed integer programming�

Nygreen� Bjorn� An example of model speci�c preprocessing for a class of integerprogramming models�

Giannessi� Franco� On separation and vector extrema�

Oettli� Werner� Quasi�complementarity problems of R�type�

��

Page 40: Elcsendes/MOT/almanach.pdf · 2008-12-25 · esei c mmel AT arsas ag v end egei r ovid ismertet es miv olt a l atogat asuk eredm en y e oldal Szakmai utak a T arsas ag k olts eg en

Pappalardo� Massimo� Separation and regularity in the image space�

Krarup� Jakob� Locational analysis involving both positive and negative weigths�

Gass� Saul I�� Fitting circles and spheres to measuring machine data�

Uhrin� B�ela� Some algorithms in the geometry of numbers�

Schaible� Siegfried� Generalized monotonicity and equilibrium problems�

Koml�osi� S�andor� Generalized concavity and generalized monotonicity in vector op�timization�

Za�aroni� Alberto� Necessary conditions for vector optimality with radial subdi�er�entials�

Castagnoli� Erio� Direct and indirect duality for dominance relations�

Mazzoleni� Piera� Weak monotone operators�

Cigola� Margherita� Linear operators and monotonicity�

Modesti� Paola� Two�level optimization in imitative stock�markets�

Forg�o� Ferenc� Necessary conditions for Maxmin $ Minmax�

Rapcs�ak� Tam�as� Variable metric methods along geodesics�

Gromicho� Joaquim� Computational aspects of quasiconvex minimization�

M�alyusz� Levente� A primal�dual algorithm for the Young programming�

Temesi� J�ozsef� A new approach to the multiple criteria decision support systems�

Dombi� J�ozsef� General framework for multi�criteria decision making� the evaluationtheory�

Solymosi� Tam�as� On computing the nucleolus of a balanced connected game�

Ullrich� Christian P�� Fast veri�cation of linear system solutions�

Balla� Katalin� On linear iterations and their solutions with prescribed asymptoticbehavior�

Vizv�ari� B�ela� The generalizations of Benders decomposition for cone programming�

Ujv�ari� Mikl�os� A simple proof of duality theorems in semide�nite programming�

Friedler� Ferenc� Accelerated branch�and�bound method for solving process networksynthesis problems with sectionally continuous cost functions�

��

Page 41: Elcsendes/MOT/almanach.pdf · 2008-12-25 · esei c mmel AT arsas ag v end egei r ovid ismertet es miv olt a l atogat asuk eredm en y e oldal Szakmai utak a T arsas ag k olts eg en

Csendes� Tibor� Comparative study of global optimization methods for process net�work synthesis�

Cs�ebfalvi� Anik�o� Optimal topology design of space trusses�

Cs�ebfalvi� Gy�orgy� A project management learning�teaching system�

Bacsi� Zsuzsanna� Chaotic behaviour in a non�linear discrete deterministic pricemodel�

Galambos� G�abor� On�line data compression�

Szab�o� Tam�as� The analysis of an industrial technological problem with the proce�dures of operations research�

Balogh� L�aszl�o� Computational research of orthogonal latin squares�

Jelasity� M�ark� Property analysis� an approach on understanding GAs�

��

Page 42: Elcsendes/MOT/almanach.pdf · 2008-12-25 · esei c mmel AT arsas ag v end egei r ovid ismertet es miv olt a l atogat asuk eredm en y e oldal Szakmai utak a T arsas ag k olts eg en

�� fejezet

T�arsas�agi �elet

��� A MOT tagjai

Arra k�ert�uk a MOT tagjait� hogy adjanak r�ovid ismertet�est magukr�ol� munk�ajukr�ol�A jelen fejezet ezeket a bemutatkoz�o jelent�eseket tartalmazza� Ez az�ert is fontos�mert nem nagyon ismerj�uk egym�ast� a sejtett szakter�uletek se mindig stimmelnek� Ak�ert adatok a k�ovetkez�ok voltak� sz�ulet�esi id�o� hely� jelenlegi munkahely� hol v�egzett�tudom�anyos min�os�t�es ideje tudom�anyos tiszts�egek� kit�untet�esek� kutat�asi ter�ulet� �esamit mag�ar�ol m�eg k�ozl�esre �erdemesnek tart�

Csallner Andr�as Erik ���� Szeged� MTA M�UKKI ��������� Rendszertech�nikai Oszt�aly� J�ozsef Attila Tudom�anyegyetem ���������� Alkalmazott Infor�matikai Tansz�ek� Juh�asz Gyula Tan�ark�epz�o F�oiskola ������� Sz�am�t�astechnikaTansz�ek� Egyetemi tanulm�anyok� JATE ��������� MTA Tudom�anyos �Osz�t�ond�j ��������� Doktori �Oszt�ond�j ��������� Kutat�asi ter�ulet� glob�alisoptimaliz�al�as� intervallum�matematika�

Csendes Tibor ���� Szeged� J�ozsef Attila Tudom�anyegyetem ������� Alkal�mazott Informatikai Tansz�ek� Egyetemi docens ������� tansz�ekcsoport vezet�ohelyettes ������� Egyetemi tanulm�anyok� JATE ���������� A matematikaitudom�any kandid�atusa ������ Szakmai vagy tudom�anyos tiszts�egek� MTAOper�aci�okutat�asi Bizotts�aga ������� MOT vezet�os�eg ������ NJSZT Hun�garian Transputer Users Group vezet�os�eg ������ �es az MTA rendk�v�uli k�oz�gy�ul�es�en a doktorok egyik k�epvisel�oje� Kit�untet�esek� a JATE Kalm�ar L�aszl�od�ja ����� �es a Bolyai T�arsulat Farkas Gyula d�ja ������ Kutat�asi ter�ulet�glob�alis optimaliz�al�as� intervallum�matematika �es a nemline�aris optimaliz�al�ask�ul�onb�oz�o alkalmaz�asai�

Ferenczy Antal ���� H�odmez�ov�as�arhely� Kert�eszeti �es �Elelmiszeripari Egyetem������ Matematika �es Informatika Tansz�ek� egyetemi adjunktus ������� E�gyetemi tanulm�anyok� ELTE ��������� Kutat�asi ter�ulet� biometria� oper�a�ci�okutat�as �es informatika alkalmaz�asa az agr�ar�agazatban�

Page 43: Elcsendes/MOT/almanach.pdf · 2008-12-25 · esei c mmel AT arsas ag v end egei r ovid ismertet es miv olt a l atogat asuk eredm en y e oldal Szakmai utak a T arsas ag k olts eg en

Ill�es Tibor ���� Szabadka� Egyetemi tanulm�anyok� ELTE ���������� mate�matikus szak� dr� univ� oper�aci�okutat�asb�ol ��� �Ph�D� �atmin�os�t�es folyamat�ban�� �All�as� Eastern Mediterranean University �Dept� of Mathematics� �������� ELTE Oper�aci�okutat�asi Tansz�ek egyetemi adjunktus ������� tudom�anyosmunkat�ars ���������� MTA Sztaki Matematikai F�ooszt�aly tudom�anyos se�g�edmunkat�ars ���������� tudom�anyos munkat�ars ������ Szakmai vagy tu�dom�anyos tiszts�egek� Bolyai J�anos Matematikai T�arsas�ag Alkalmazott Mate�matikai Bizotts�ag titk�ara ���������� alap�t�o tagja a MOT�nak� Farkas Gyulad�j ����� �Oszt�ond�jak� TEMPUS �Royal Holloway and Bedford New College����� � h�et�� Peregrinatio II �Delfti M�uszaki Egyetem� Delft� ���� � h�onap��Rom�aniai Soros Alap�tv�any �Babes�Bolyai Egyetem� Kolozsv�ar� ���� � h�onap���Allami E�otv�os �Oszt�ond�j �Koppenh�agai Egyetem� Koppenh�aga� ���� � h�onap��Alap�tv�any a Magyar Tudom�any�ert ����� � h�onap�� Kutat�asi ter�ulet� v�eges ge�ometri�ak� latin n�egyzetek� �� programoz�as� line�aris �es nemline�aris programoz�as�es alkalmaz�asaik�

Kassay G�abor ���� Sz�ekelyudvarhely� Rom�ania� Babes�Bolyai Tudom�anyegye�tem� Kolozsv�ar� Egyetemi Docens ������� Egyetemi tanulm�anyok� Babes�Bolyai Tudom�anyegyetem� Kolozsv�ar ���������� A matematikai tudom�anyokdoktora ������ Tudom�anyos t�arsas�agok tagja� Rom�an Matematikai T�arsas�ag�Magyar Oper�aci�okutat�asi T�arsas�ag� N�emet Oper�aci�okutat�asi T�arsas�ag� Ku�tat�asi ter�ulet� Nemline�aris Anal�zis �es alkalmaz�asai az optimaliz�aci�oban�

Pint�er J�anos Budapest� ���� Research Scientist� Pinter Consulting Services�PCS�� Halifax� N�S�� Kanada �es Honorary Adjunct Professor� Dalhousie Univer�sity� Halifax� Egyetemi tanulm�anyok� ELTE TTK ���������� A matematikaitudom�any kandid�atusa �Moszkvai �Allami �Lomonoszov� Egyetem� ����� Dok�tori elj�ar�as folyamatban� Szakmai vagy tudom�anyos tiszts�egek� MTA Oper�aci�o�kutat�asi Bizotts�ag tagja ��������� a Journal of Global Optimization szerkesz�t�os�eg�enek tagja ������ Kutat�asi ter�ulet� nemline�aris optimaliz�aci�o� modell�alkot�as� d�ont�esi rendszerek� algoritmusok �ezen bel�ul els�osorban� glob�alis �essztochasztikus optimaliz�aci�o�� tudom�anyos� m�uszaki�gazdas�agi �es k�ornyezetv�e�delmi alkalmaz�asok�

Terlaky Tam�as ���� Delfti M�uszaki Egyetem ������� Statisztika� Val�osz�n�us�eg�sz�am�t�as �es Oprer�aci�okutat�asi Tansz�ek� Egyetemi docens ������� Egyetemitanulm�anyok� ELTE matematikus ���������� A matematikai tudom�any kan�did�atusa ������ Szakmai vagy tudom�anyos tiszts�egek� MTA Oper�aci�okutat�asiBizotts�aga ��������� Kit�untet�esek� Bolyai T�arsulat Farkas Gyula d�ja ������ Featured Speaker � �International Symposium on Mathematical Programming�Lausanne� ����� Kutat�asi ter�ulet� line�aris �es nemline�aris optimaliz�al�as� bels�o�pontos m�odszerek� szemide�nite optimaliz�al�as� kombinatorikus optimaliz�al�as�ir�any�tott matroidok� alkalmaz�asok� frekvencia hozz�arendel�esi feladat� nukle�arisreaktor optimaliz�al�as� v�zszint szab�alyoz�as� stb�

��

Page 44: Elcsendes/MOT/almanach.pdf · 2008-12-25 · esei c mmel AT arsas ag v end egei r ovid ismertet es miv olt a l atogat asuk eredm en y e oldal Szakmai utak a T arsas ag k olts eg en

V�ag�o Zsuzsanna ���� Veszpr�em� Csepel Vas �es f�emm�uvek� SZI ��������� BMEG�ep�eszkar Mat� Tsz� �������� MTA SZTAKI������� Egyetemi tanulm�anyok�ELTE ���������� PhD� matematika� ELTE ������ egyetemi doktor� ma�tematika� ELTE� ���� Kutat�asi ter�ulet� Folytonos idej�u line�aris rendszerekstatisztikai elemz�ese �es ir�any�t�asa� Gazdas�agi id�osorok modellez�ese �es elemz�ese�

�� C�mjegyz�ek

Csallner Andr�as Erik JGYTF� Sz�am�t�astechnika Tsz����� Szeged� Boldogasszony sgt� ��Tefelon� �� ��� ���� ���� mell�ekE�mail� csallner%kurrah�cab�jgytf�u�szeged�hu

Csendes Tibor JATE� Alkalmazott Informatikai Tansz�ek����� Szeged� �Arp�ad t�er �� Postac�m� ��� Szeged� Pf� ����Telefon� �� �������� fax� �� �������E�mail� csendes%inf�u�szeged�hu�WWW� ��http���www�inf�u�szeged�hu�&csendes�

Ill�es Tibor ELTE Oper�aci�okutat�asi Tansz�ek���� Budapest� M�uzeum krt� ����Telefon� �������� ��uzenetr�ogz�t�o �es fax is�E�mail� illes%konig�elte�hu

Kassay G�abor Babes�BolyaI University� Faculty of Mathematics�Str� M� Kogalniceanu � ���� Cluj� Romania�Telefon� ����������� fax� �����������E�mail� kassay%math�ubbcluj�ro

��

Page 45: Elcsendes/MOT/almanach.pdf · 2008-12-25 · esei c mmel AT arsas ag v end egei r ovid ismertet es miv olt a l atogat asuk eredm en y e oldal Szakmai utak a T arsas ag k olts eg en

��

Page 46: Elcsendes/MOT/almanach.pdf · 2008-12-25 · esei c mmel AT arsas ag v end egei r ovid ismertet es miv olt a l atogat asuk eredm en y e oldal Szakmai utak a T arsas ag k olts eg en

�� fejezet

Summary in English

Here comes a summary of the almanach in English�

��

Page 47: Elcsendes/MOT/almanach.pdf · 2008-12-25 · esei c mmel AT arsas ag v end egei r ovid ismertet es miv olt a l atogat asuk eredm en y e oldal Szakmai utak a T arsas ag k olts eg en

Tartalomjegyz�ek

El�osz�o �

�� Az oper�aci�okutat�as ������ kozott �

�� Az ������� �evek magyar oper�aci�okutat�asi k�ozlem�enyei � � � � � � � ���� � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � ��� � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � ���� � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � ��� � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � ���� � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � ���� � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � ��

��� Tudom�anyos konferenci�ak � � � � � � � � � � � � � � � � � � � � � � � � ������ XX� Magyar Oper�aci�okutat�asi Konferencia� Esztergom� �� � ������� XXIth International Conference on Mathematical Programming�

M�atraf�ured� ��� � � � � � � � � � � � � � � � � � � � � � � � � � ������� XXI� Magyar Oper�aci�okutat�asi Konferencia� Szeged� ��� � � � ������� XXIIth International Conference on Mathematical Program�

ming� M�atraf�ured� ��� � � � � � � � � � � � � � � � � � � � � � � ������� IIIrd Workshop on Global Optimization� Szeged� ��� � � � � � ������� XIII� International Conference on Mathematical Programming�

M�atrah�aza� ��� � � � � � � � � � � � � � � � � � � � � � � � � � ��

�� T�arsas�agi �elet �

��� A MOT tagjai � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � ����� C�mjegyz�ek � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � ��

�� Summary in English

Tervezet� January �� ���

i