European Journal of Operational Research

Strategic financial risk management and operations research
pp. 1-16(16)
Authors: Mulvey J.M.; Rosenbaum D.P.; Shetty B.

A note on the design of a two-sided, two-stage screening procedure with a prescribed outgoing quality
pp. 17-21(5)
Authors: Do S.B.; Hyuck M.K.

Audit scheduling with overlapping activities and sequence-dependent setup costs
pp. 22-33(12)
Authors: Dodin B.; Elimam A.A.

The application of reliability constrained stochastic capacity planning models to the service sector
pp. 34-40(7)
Author: Boronico J.S.

The DH/KD algorithm: a hybrid approach for unconstrained two-dimensional cutting problems
pp. 41-52(12)
Author: Hifi M.

Preference programming and inconsistent interval judgments
pp. 53-62(10)
Authors: Islam R.; Biswal M.P.; Alam S.S.

A Lagrangean heuristic for the facility location problem with staircase costs
pp. 63-74(12)
Authors: Holmberg K.; Ling J.

Heuristic concentration: two stage solution construction
pp. 75-86(12)
Authors: Rosing K.E.; ReVelle C.S.

Weber problems with alternative transportation systems
pp. 87-93(7)
Authors: Carrizosa E.; Rodriguez-Chia A.M.

A combined transportation and scheduling problem
pp. 94-104(11)
Authors: Equi L.; Gallo G.; Marziale S.; Weintraub A.

Linear programs for constraint satisfaction problems
pp. 105-123(19)
Authors: Zimmermann H.J.; Monfroglio A.

Mean value cross decomposition applied to integer programming problems
pp. 124-138(15)
Author: Holmberg K.

Fixing variables and generating classical cutting planes when using an interior point branch and cut method to solve integer programming problems
pp. 139-148(10)
Author: Mitchell J.E.

Fuzzy programming for multiobjective 0-1 programming problems through revised genetic algorithms
pp. 149-158(10)
Authors: Sakawa M.; Kato K.; Sunada H.; Shibano T.

Connectedness of efficient solutions in multiple criteria combinatorial optimization
pp. 159-166(8)
Authors: Ehrgott M.; Klamroth K.

Symmetric dual multiobjective programming
pp. 167-171(5)
Authors: Das L.N.; Nanda S.

The partial sum criterion for Steiner trees in graphs and shortest paths
pp. 172-182(11)
Authors: Duin C.W.; Volgenant A.

Algorithms for network piecewise-linear programs: A comparative study
pp. 183-199(17)
Authors: Marins F.A.S.; Senne E.L.F.; Darby-Dowman K.; Machado A.F.; Perin C.

Simple Lagrangian heuristic for the set covering problem
pp. 200-204(5)
Author: Haddadi S.

A method for convex curve approximation
pp. 205-212(8)
Authors: Yang X.Q.; Goh C.J.

Error noted in a Case Study on fund allocation using goal programming
pp. 213-214(2)
Authors: Baki F.; Fraser N.M.