default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCentral European Journal of Operations Research, Volume 16
Volume 16, Number 1, March 2008
- Gyula Mezey:
A practical prioritization by multi-level group decision support. 1-15 - Karl Inderfurth
, Kampan Mukherjee:
Decision support for spare parts acquisition in post product life cycle. 17-42 - Jörg Schütze:
Pricing strategies for perishable products: the case of Vienna and the hotel reservation system hrs.com. 43-66 - Marek Kocan:
Cyclic behavior in dynamic investment decisions for deregulated energy markets. 67-78 - José M. F. Craveirinha, Rita Girão-Silva, João C. N. Clímaco:
A meta-model for multiobjective routing in MPLS networks. 79-105
Volume 16, Number 2, June 2008
- Oliver Stein, Georg Still, Tamás Terlaky, Gerhard-Wilhelm Weber:
Editorial. 107-109 - Etienne de Klerk:
The complexity of optimizing over a simplex, hypercube or sphere: a short survey. 111-125 - Ivo Nowak, Stefan Vigerske:
LaGO: a (heuristic) Branch and Cut algorithm for nonconvex MINLPs. 127-138 - Riccardo Cambini, Claudio Sodini:
A computational comparison of some branch and bound methods for indefinite quadratic programs. 139-152 - Laura Carosi, Laura Martein:
A sequential method for a class of pseudoconcave fractional problems. 153-164 - János D. Pintér:
Model development and optimization in interactive computing environments. 165-178 - Ralf Werner:
Cascading: an adjusted exchange method for robust conic programming. 179-189 - Laura Scrimali:
The financial equilibrium problem with implicit budget constraints. 191-203 - Qinghong Zhang:
Uniform LP duality for semidefinite and semi-infinite programming. 205-213 - Alireza Ghaffari-Hadigheh, Habib Ghaffari Hadigheh, Tamás Terlaky:
Bi-parametric optimal partition invariancy sensitivity analysis in linear optimization. 215-238
Volume 16, Number 3, September 2008
- Suliman Al-Homidan:
Semidefinite programming for the educational testing problem. 239-249 - Joana Dias, M. Eugénia V. Captivo, João C. N. Clímaco:
A dynamic location problem with maximum decreasing capacities. 251-280 - Walter J. Gutjahr, Stefan Katzensteiner, Peter Reiter, Christian Stummer, Michaela Denk:
Competence-driven project portfolio selection, scheduling and staff assignment. 281-306 - Dorota Kuchta:
A modification of a solution concept of the linear programming problem with interval coefficients in the constraints. 307-316 - Imre Dobos, Adél Floriska:
The efficiency of remanufacturing in a dynamic input-output model. 317-328
Volume 16, Number 4, December 2008
- Tibor Csendes, József Temesi:
Editorial. 329-330 - István Borgulya:
An algorithm for the capacitated vehicle routing problem with route balancing. 331-343 - Sándor Bozóki:
Solution of the least squares method problem of pairwise comparison matrices. 345-358 - Ferenc Forgó, János Fülöp:
On the implementation of the L-Nash bargaining solution in two-person bargaining games. 359-377 - Zoltán Blázsik, Csanád Imreh, Zoltán Kovács:
Heuristic algorithms for a complex parallel machine scheduling problem. 379-390 - Péter Kárász:
A special discrete cyclic-waiting queuing system. 391-406 - Pál Pusztai:
An application of the greedy heuristic of set cover to traffic checks. 407-414 - Tamás Rapcsák, Miklós Ujvári:
Some results on pseudolinear quadratic fractional functions. 415-424 - Tamás Solymosi:
Bargaining sets and the core in partitioning games. 425-440 - Ashraf A. Gouda, Tamás Szántai:
Rare event probabilities in stochastic networks. 441-461
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-08-14 21:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
