default search action
SCOR 2012: Nottingham, UK
- Stefan Ravizza, Penny L. Holborn:
3rd Student Conference on Operational Research, SCOR 2012, April 20-22, 2012, Nottingham, UK. OASIcs 22, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2012, ISBN 978-3-939897-39-2 - Stefan Ravizza, Penny L. Holborn:
Frontmatter, Table of Contents, Preface, Conference Organisation. - Ralf Borndörfer, Guillaume Sagnol, Elmar Swarat:
A Case Study on Optimizing Toll Enforcements on Motorways. 1-10 - Sergio Morales-Enciso, Jürgen Branke:
Revenue maximization through dynamic pricing under unknown market behaviour. 11-20 - Shona Blair, Tim Bedford, John Quigley:
Empirical Bayes Methods for Discrete Event Simulation Performance Measure Estimation. 21-30 - Timothy S. Mbasuen, Richard C. Darton:
The Transition to an Energy Sufficient Economy. 31-42 - Javeria Iqbal, Iftikhar Ahmad, Günter Schmidt:
Can online trading algorithms beat the market? An experimental evaluation. 43-52 - Marcin Siepak:
An exact algorithm for the uncertain version of parallel machines scheduling problem with the total completion time criterion. 53-63 - Péter Tar, István Maros:
Product Form of the Inverse Revisited. 64-74 - Maria Barbati:
The design of transportation networks: a multi objective model combining equity, efficiency and efficacy. 75-83 - Michela Lai, Massimo Di Francesco, Paola Zuddas:
Heuristics for the routing of trucks with double container loads. 84-93 - Minja R. Marinovic, Dragana D. Makajic-Nikolic, Milan J. Stanojevic, Lena S. Dordevic:
Optimization of electricity trading using linear programming. 94-102 - Andrea Peano, Maddalena Nonato, Marco Gavanelli, Stefano Alvisi, Marco Franchini:
A Bilevel Mixed Integer Linear Programming Model for Valves Location in Water Distribution Systems. 103-112
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.