Journal: CEJOR

Volume 25, Issue 4

739 -- 741Tibor Csendes, Csanád Imreh, József Temesi. Editorial
743 -- 770Edina Berlinger, Anita Lovas, Péter Juhász. State subsidy and moral hazard in corporate financing
771 -- 790László Csató. Measuring centrality by a generalization of degree
791 -- 807Csongor Gy. Csehi, Márk Farkas. Truck routing and scheduling
809 -- 830Balázs Dávid, Miklós Krész. The dynamic vehicle rescheduling problem
831 -- 858Fabian Dunke, Stefan Nickel. Evaluating the quality of online optimization algorithms by discrete event simulation
859 -- 878Ernestas Filatovas, Algirdas Lancinskas, Olga Kurasova, Julius Zilinskas. A preference-based multi-objective evolutionary algorithm R-NSGA-II with stochastic local search
879 -- 888Balázs Fleiner, Balázs Nagy, Attila Tasnádi. Optimal partisan districting on planar geographies
889 -- 905Ali Asghar Foroughi, Roohollah Abbasi Shureshjani. Solving generalized fuzzy data envelopment analysis model: a parametric approach
907 -- 928Zsolt Tibor Kosztyán, Cs. Hegedüs, Attila Imre Katona. Treating measurement uncertainty in industrial conformity control
929 -- 952László Pál. Empirical study of the improved UNIRANDI local search method
953 -- 966Marc P. Renault. Online algorithms with advice for the dual bin packing problem
967 -- 984Péter Tar, Bálint Stágel, István Maros. Parallel search paths for the simplex algorithm
985 -- 1006Tamás Vinkó, Kitti Gelle. Basin Hopping Networks of continuous global optimization problems

Volume 25, Issue 3

521 -- 523Janez Povh, Lidija Zadnik Stirn, Janez Zerovnik. Editorial
525 -- 543Karlo Bala, Dejan Brcanov, Nebojsa Gvozdenovic. Two-echelon location routing synchronized with production schedules and time windows
545 -- 560Tomás Reznar, Jan Martinovic, Katerina Slaninová, Ekaterina Grakova, Vít Vondrák. Probabilistic time-dependent vehicle routing problem
561 -- 585Helena Gaspars-Wieloch. Newsvendor problem under complete uncertainty: a case of innovative products
587 -- 609Athanassios Nikolakopoulos, Ioannis Ganas. Economic model predictive inventory routing and control
611 -- 625Marko Bohanec, Nejc Trdin, Branko Kontic. A qualitative multi-criteria modelling approach to the assessment of electric energy production technologies in Slovenia
627 -- 649Matej Mihelcic, Marko Bohanec. Approximating incompletely defined utility functions of qualitative multi-criteria modeling method DEX
651 -- 664L'udmila Jánosíková, Milos Herda, Michal Haviar. p-median problem
665 -- 677Jaroslav Janácek, Marek Kvet. Semi-fair design of emergency service system with failing centers
679 -- 697Michaela Chocholatá, Andrea Furková. Does the location and the institutional background matter in convergence modelling of the EU regions?
699 -- 723Zehui Shao, Aleksander Vesel, Jin Xu. Frequency assignment problem in networks with limited spectrum
725 -- 737Milan Hladík. Interval convex quadratic programming problems in a general form

Volume 25, Issue 2

261 -- 285Raimo P. Hämäläinen, Ilkka Leppänen. Cheap talk and cooperation in Stackelberg games
287 -- 301Henryk Gurgul, Artur Machno. The impact of asynchronous trading on Epps effect on Warsaw Stock Exchange
303 -- 323Yuichi Takano, Nobuaki Ishii, Masaaki Muraki. Multi-period resource allocation for estimating project costs in competitive bidding
325 -- 343Yasar A. Ozcan, Jaya Khushalani. Assessing efficiency of public health and medical care provision in OECD countries after a decade of reform
345 -- 376Alexandra Anderluh, Vera C. Hemmelmayr, Pamela C. Nolz. Synchronizing vans and cargo bikes in a city distribution network
377 -- 392Dimitri Blueschke, I. Savin. No such thing as a perfect hammer: comparing different objective function specifications for optimal control
393 -- 415Joseph R. Kakeneno, Cathal MacSwiney Brugha. Usability of Nomology-based methodologies in supporting problem structuring across cultures: the case of participatory decision-making in Tanzania rural communities
417 -- 439Sankar Kumar Roy, Gurupada Maity, Gerhard-Wilhelm Weber. Multi-objective two-stage grey transportation problem using utility function with goals
441 -- 471Martin Bod'a. Stochastic sensitivity analysis of concentration measures
473 -- 489Luka Tomat, Mirko Gradisar. One-dimensional stock cutting: optimization of usable leftovers in consecutive orders
491 -- 520André Scholz, Gerhard Wäscher. Order Batching and Picker Routing in manual order picking systems: the benefits of integrated routing

Volume 25, Issue 1

1 -- 28Raka Jovanovic, Milan Tuba, Stefan Voß. A multi-heuristic approach for solving the pre-marshalling problem
29 -- 54Vahidreza Ghezavati, S. Hooshyar, Reza Tavakkoli-Moghaddam. A Benders' decomposition algorithm for optimizing distribution of perishable products considering postharvest biological behavior in agri-food supply chain: a case study of tomato
55 -- 70Zoltán Blázsik, Zoltán Imre Fajfrik. A heuristic framework on a common generalization of the Vehicle Routing Problem and the Linear Ordering Problem
71 -- 90Yves Molenbruch, Kris Braekers, An Caris. Operational effects of service level variations for the dial-a-ride problem
91 -- 122Congcong Yang, Alfred Taudes, Guozhi Dong. Efficiency analysis of European Freight Villages: three peers for benchmarking
123 -- 138Muris Lage Junior, Moacir Godinho Filho. Master disassembly scheduling in a remanufacturing system with stochastic routings
139 -- 144Rico Walter. A note on minimizing the sum of squares of machine completion times on two identical parallel machines
145 -- 158Yue Qi. On the criterion vectors of lines of portfolio selection with multiple quadratic and multiple linear objectives
159 -- 182Mohammed Chahim, Dieter Grass, Richard F. Hartl, Peter M. Kort. Product innovation with lumpy investment
183 -- 201Wenjing Liu, Ke Liu, Lulu Yang. A dynamic programming model for effect of worker's type on wage arrears
203 -- 230Herbert Dawid, Reinhold Decker, Thomas Hermann, Hermann Jahnke, Wilhelm Klat, Rolf König, Christian Stummer. Management science in the era of smart consumer products: challenges and research perspectives
231 -- 260Ulrich Pferschy, Rostislav Stanek. Generating subtour elimination constraints for the TSP from pure integer solutions