ebook img

European Journal of Operational Research 1995: Vol 83 Table of Contents PDF

5 Pages·1995·1.2 MB·English
by  
Save to my drive
Quick download
Download
Most books are stored in the elastic cloud where traffic is expensive. For this reason, we have a limit on daily download.

Preview European Journal of Operational Research 1995: Vol 83 Table of Contents

EUROPEAN eas JOURNAL OF OPERATIONAL ‘4 ) me RAT Ns | is RESEARCH LSEVIER European Journal of Operational Research 83 (1995) 716-718 Contents Volume 83 Optimization methods for electric utility resource planning B.F. Hobbs An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts N. Christofides and E. Hadjiconstantinou An exact algorithm for general, orthogonal, two-dimensional knapsack problems E. Hadjiconstantinou and N. Christofides A method for the cutting stock problem with different qualities M. Ronnqvist A classification of formulations for the (time-dependent) traveling salesman problem L. Gouveia and S. VoB A new extension of local search applied to the Dial-A-Ride Problem P. Healy and R. Moll Estimation and determination of shortest path length in a road network with obstacles N. Dubois and F. Semet A differential game approach to the dynamic mixed behavior traffic network equilibrium problem B.-W. Wie Temporal distribution of public transport demand during the peak period A.S. Alfa and M. Chen Time depending shortest-path problems with applications to railway networks K. Nachtigall Refueling strategies to maximize the operational range of a nonidentical vehicle fleet Y. Yuan and A. Mehrez Properties of expected costs and performance measures in stochastic models of scheduled transport M. Carey and A. Kwiecinski The hub location and routing problem T. Aykin A smooth penalty function algorithm for network-structured problems S.A. Zenios, M.C. Pinar and R.S. Dembo A suboptimal solution to a hierarchial network design problem using dynamic programming N.G.F. Sancho A comment on “Models, modelling and modellers: an application to risk analysis” by B. Wahlstrom. European Journal of Operational Research 75 (1994) 477-487 W.W. Cooper Reply to W.W. Cooper. European Journal of Operational Research 83 (1995) 245-246 B. Wahlstrom Special Issue: 10th EURO Summer Institute - Combinatorial Optimization 249 Tenth EURO Summer Institute C. Roucairol, H. Thiriez, J. Krarup, G. Plateau and P. Tolla 253 Some thoughts on combinatorial optimisation M.H. Bjorndal, A. Caprara, P.I. Cowling, F. Della Croce, H. Lourengo, F. Malucelli, A.J. Orman, D. Pisinger, C. Rego and J.J. Salazar EUROPEAN eas JOURNAL OF OPERATIONAL ‘4 ) me RAT Ns | is RESEARCH LSEVIER European Journal of Operational Research 83 (1995) 716-718 Contents Volume 83 Optimization methods for electric utility resource planning B.F. Hobbs An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts N. Christofides and E. Hadjiconstantinou An exact algorithm for general, orthogonal, two-dimensional knapsack problems E. Hadjiconstantinou and N. Christofides A method for the cutting stock problem with different qualities M. Ronnqvist A classification of formulations for the (time-dependent) traveling salesman problem L. Gouveia and S. VoB A new extension of local search applied to the Dial-A-Ride Problem P. Healy and R. Moll Estimation and determination of shortest path length in a road network with obstacles N. Dubois and F. Semet A differential game approach to the dynamic mixed behavior traffic network equilibrium problem B.-W. Wie Temporal distribution of public transport demand during the peak period A.S. Alfa and M. Chen Time depending shortest-path problems with applications to railway networks K. Nachtigall Refueling strategies to maximize the operational range of a nonidentical vehicle fleet Y. Yuan and A. Mehrez Properties of expected costs and performance measures in stochastic models of scheduled transport M. Carey and A. Kwiecinski The hub location and routing problem T. Aykin A smooth penalty function algorithm for network-structured problems S.A. Zenios, M.C. Pinar and R.S. Dembo A suboptimal solution to a hierarchial network design problem using dynamic programming N.G.F. Sancho A comment on “Models, modelling and modellers: an application to risk analysis” by B. Wahlstrom. European Journal of Operational Research 75 (1994) 477-487 W.W. Cooper Reply to W.W. Cooper. European Journal of Operational Research 83 (1995) 245-246 B. Wahlstrom Special Issue: 10th EURO Summer Institute - Combinatorial Optimization 249 Tenth EURO Summer Institute C. Roucairol, H. Thiriez, J. Krarup, G. Plateau and P. Tolla 253 Some thoughts on combinatorial optimisation M.H. Bjorndal, A. Caprara, P.I. Cowling, F. Della Croce, H. Lourengo, F. Malucelli, A.J. Orman, D. Pisinger, C. Rego and J.J. Salazar Contents Volume 83 FUN: A dynamic method for scheduling problems B. Bugnon, K. Stoffel and M. Widmer Heuristics for biquadratic assignment problems and their computational comparison R.E. Burkard and E. Cela A bound for the Symmetric Travelling Salesman Problem through matroid formulation P. Cowling and F. Maffioli Generalized pairwise interchanges and machine scheduling F. Della Croce Scheduling jobs within time windows on identical parallel machines: New model and algorithms V. Gabrel A comparative study of both standard and adaptive versions of threshold accepting and simulated annealing algorithms in three scheduling problems C.K.Y. Lin, K.B. Haley and C. Sparks Job-shop scheduling: Computational study of local search and large-step optimization methods H.R. Lourencgo Lower bounds for the quadratic semi-assignment problem F. Malucelli and D. Pretolani The inverse-parametric knapsack problem R.E. Burkard and U. Pferschy A minimal algorithm for the Multiple-Choice Knapsack Problem D. Pisinger Using Tabu search for solving a dynamic multi-terminal truck dispatching problem C. Rego and C. Roucairol Differential game models of advertising competition G.M. Erickson Trip frequency scheduling for bus route management in Bangkok D.L. van Oudheusden and W. Zhu Coal blending optimization under uncertainty J.-S. Shih and H.C. Frey Modeling investment uncertainty in the costs of global CO, emission policy J.R. Birge and C.H. Rosa Stochastic annealing for synthesis under uncertainty L. Painton and U. Diwekar Solving stochastic programming problems via Kalman filter and affine scaling S. Puthenpura, L. Sinha, S.-C. Fang and R. Saigal A new approach to stochastic programming problems: Discrete model R.R. Joshi Stochastic analysis of combat models under different termination decision rules N.K. Jaiswal, Y. Sangeeta and S.C. Gaur A cooperative fuzzy game theoretic approach to multiple objective design optimization A.K. Dhingra and S.S. Rao Fuzzy optimal flow on imprecise structures S. Chanas, M. Delgado, J.L. Verdegay and M.A. Vila Three models of fuzzy integer linear programming F. Herrera and J.L. Verdegay Grey integer programming: An application to waste management planning under uncertainty G.H. Huang, B.W. Baetz and G.G. Patry The bottleneck generalized assignment problem S. Martello and P. Toth Modelling pairwise comparisons on ratio scales N. Bryson, A. Mobolurin and O. Ngwenyama A new aggregation—disaggregation algorithm T. Shioyama and K. Tanaka Coupling the auxiliary problem principle with descent methods of pseudoconvex programming D. Zhu and P. Marcotte Contents Volume 83 Automatic decrease of the penalty parameter in exact penalty function methods M. Mongeau and A. Sartenaer Data envelopment analysis: Visualizing the results S. El-Mahgary and R. Lahdelma A note on exact algorithms for the bottleneck generalized assignment problem S. Martello and P. Toth Book Reviews, L.F. Gelders (ed.) Stochastic Programming, P. Kall and S.W. Wallace Quality and Reliability of Technical Systems, A. Birolini Systems and Decision Making - A Management Science Approach, H.G. Daellenbach Optimization in Industry: Mathematical Programming and Modeling Techniques in Practice, T.A. Ciriani and R.C. Leachman (eds.) Contents Volume 83

See more

The list of books you might like

Most books are stored in the elastic cloud where traffic is expensive. For this reason, we have a limit on daily download.