Volume 22, Number 1, Winter 2010

• 
  John W. Chinneck: From the Editor. 1
• 
  Warren B. Powell: Feature Article - Merging AI and OR to Solve High-Dimensional Stochastic Optimization Problems Using Approximate Dynamic Programming. 2-17
• 
  John N. Tsitsiklis: Commentary - Perspectives on Stochastic Optimization Over Time. 18-19
• 
  Andrzej Ruszczynski: Commentary - Post-Decision States and Separable Approximations Are Powerful Tools of Approximate Dynamic Programming. 20-22
• 
  Warren B. Powell: Rejoinder - The Languages of Stochastic Optimization. 23-25
• 
  Robert Fourer, Chandrakant Maheshwari, Arnold Neumaier, Dominique Orban, Hermann Schichl: Convexity and Concavity Detection in Computational Graphs: Tree Walks for Convexity Assessment. 26-43
• 
  Dimitris Bertsimas, Omid Nohadani, Kwong Meng Teo: Nonconvex Robust Optimization for Problems with Constraints. 44-58
• 
  Michel Bierlaire, M. Thémans, Nicolas Zufferey: A Heuristic for Nonlinear Global Optimization. 59-70
• 
  Stephen E. Chick, Jürgen Branke, Christian Schmidt: Sequential Sampling to Myopically Maximize the Expected Value of Information. 71-80
• 
  Kaeyoung Shin, Raghu Pasupathy: An Algorithm for Fast Generation of Bivariate Poisson Random Vectors. 81-92
• 
  Oliver Bastert, Benjamin Hummel, Sven de Vries: A Generalized Wedelin Heuristic for Integer Programming. 93-107
• 
  Matteo Fischetti, Domenico Salvagnin: Pruning Moves. 108-119
• 
  Barry McCollum, Andrea Schaerf, Ben Paechter, Paul McMullan, Rhydian Lewis, Andrew J. Parkes, Luca Di Gaspero, Rong Qu, Edmund K. Burke: Setting the Research Agenda in Automated Timetabling: The Second International Timetabling Competition. 120-130
• 
  Krzysztof C. Kiwiel: An Inexact Bundle Approach to Cutting-Stock Problems. 131-143
• 
  Richard J. Caron, Tim Traynor, Shafiu Jibrin: Feasibility and Constraint Analysis of Sets of Linear Matrix Inequalities. 144-153
• 
  Emilio Carrizosa, Belen Martin-Barragan, Dolores Romero Morales: Binarized Support Vector Machines. 154-167
• 
  Christoph Buchheim, Angelika Wiegele, Lanbo Zheng: Exact Algorithms for the Quadratic Linear Ordering Problem. 168-177

Volume 22, Number 2, Spring 2010

• 
  John W. Chinneck: From the Editor. 179
• 
  Wanpracha Art Chaovalitwongse, Chun-An Chou, Tanya Y. Berger-Wolf, Bhaskar DasGupta, Saad I. Sheikh, Mary V. Ashley, Isabel C. Caballero: New Optimization Model and Algorithm for Sibling Reconstruction from Genetic Markers. 180-194
• 
  Daniele Catanzaro, Alessandra Godi, Martine Labbé: A Class Representative Model for Pure Parsimony Haplotyping. 195-209
• 
  Daniel Jupiter, Jessica Sahutoglu, Vincent VanBuren: TreeHugger: A New Test for Enrichment of Gene Ontology Terms. 210-221
• 
  Tobias Fanslau, Andreas Bortfeldt: A Tree Search Algorithm for Solving the Container Loading Problem. 222-235
• 
  Sanjeeb Dash, Marcos Goycoolea, Oktay Günlük: Two-Step MIR Inequalities for Mixed Integer Programs. 236-249
• 
  Jakob Puchinger, Günther R. Raidl, Ulrich Pferschy: The Multidimensional Knapsack Problem: Structure and Algorithms. 250-265
• 
  Matthew S. Maxwell, Mateo Restrepo, Shane G. Henderson, Huseyin Topaloglu: Approximate Dynamic Programming for Ambulance Redeployment. 266-281
• 
  Samir Elhedhli, Huyu Wu: A Lagrangean Heuristic for Hub-and-Spoke System Design with Capacity Selection and Congestion. 282-296
• 
  Stefan Irnich, Guy Desaulniers, Jacques Desrosiers, Ahmed Hadjar: Path-Reduced Costs for Eliminating Arcs in Routing and Scheduling. 297-313
• 
  Mike Hewitt, George L. Nemhauser, Martin W. P. Savelsbergh: Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem. 314-325
• 
  Jeffery L. Kennington, Charles D. Nicholson: The Uncapacitated Time-Space Fixed-Charge Network Flow Problem: An Empirical Investigation of Procedures for Arc Capacity Assignment. 326-337

Volume 22, Number 3, Summer 2010

• 
  Dries R. Goossens, Rudolf Müller, Frits C. R. Spieksma: Algorithms for Recognizing Economic Properties in Matrix Bid Combinatorial Auctions. 339-352
• 
  David Pardoe, Peter Stone, Maytal Saar-Tsechansky, Tayfun Keskin, Kerem Tomak: Adaptive Auction Mechanism Design and the Incorporation of Prior Knowledge. 353-370
• 
  Anthony Przybylski, Xavier Gandibleux, Matthias Ehrgott: A Recursive Algorithm for Finding All Nondominated Extreme Points in the Outcome Set of a Multiobjective Integer Programme. 371-386
• 
  Andrew C. Trapp, Oleg A. Prokopyev: Solving the Order-Preserving Submatrix Problem via Integer Programming. 387-400
• 
  Albert Einstein Fernandes Muritiba, Manuel Iori, Enrico Malaguti, Paolo Toth: Algorithms for the Bin Packing Problem with Conflicts. 401-415
• 
  Markus Arns, Peter Buchholz, Andriy Panchenko: On the Numerical Analysis of Inhomogeneous Continuous-Time Markov Chains. 416-432
• 
  Hans L. Bodlaender, Albert Hendriks, Alexander Grigoriev, Nadejda V. Grigorieva: The Valve Location Problem in Simple Network Topologies. 433-442
• 
  Alexander Erdelyi, Huseyin Topaloglu: A Dynamic Programming Decomposition Method for Making Overbooking Decisions Over an Airline Network. 443-456
• 
  Raul Cruz-Cano, David S. H. Chew, Kwok Pui Choi, Ming-Ying Leung: Least-Squares Support Vector Machine Approach to Viral Replication Origin Prediction. 457-470
• 
  Rajeev Kumar, Ram D. Gopal, Robert S. Garfinkel: Freedom of Privacy: Anonymous Data Collection with Respondent-Defined Privacy Protection. 471-481
• 
  Hong Wan, Bruce E. Ankenman, Barry L. Nelson: Improving the Efficiency and Efficacy of Controlled Sequential Bifurcation for Simulation Factor Screening. 482-492
• 
  Juan Pablo Vielma, Shabbir Ahmed, George L. Nemhauser: A Note on "A Superior Representation Method for Piecewise Linear Functions". 493-497

Volume 22, Number 4, Fall 2010

• 
  John W. Chinneck: From the Editor. 499
• 
  Hanif D. Sherali, Ki-Hwan Bae, Mohamed Haouari: Integrated Airline Schedule Design and Fleet Assignment: Polyhedral Analysis and Benders' Decomposition Approach. 500-513
• 
  Andreas Schutt, Peter J. Stuckey: Incremental Satisfiability and Implication for UTVPI Constraints. 514-527
• 
  Murat Köksalan, Banu Soylu: Bicriteria p-Hub Location Problems and Evolutionary Algorithms. 528-542
• 
  Jean-Paul Watson, Roger J.-B. Wets, David L. Woodruff: Scalable Heuristics for a Class of Chance-Constrained Stochastic Programs. 543-554
• 
  Kumar Abhishek, Sven Leyffer, Jeff Linderoth: FilMINT: An Outer Approximation-Based Solver for Convex Mixed-Integer Nonlinear Programs. 555-567
• 
  Shabbir Ahmed, Ozan Gozbasi, Martin W. P. Savelsbergh, Ian Crocker, Tim Fox, Eduard Schreibmann: An Automated Intensity-Modulated Radiation Therapy Planning System. 568-583
• 
  M. Gisela Bardossy, S. Raghavan: Dual-Based Local Search for the Connected Facility Location and Related Problems. 584-602
• 
  Ibrahim Muter, S. Ilker Birbil, Güvenç Sahin: Combination of Metaheuristic and Exact Algorithms for Solving Set Covering-Type Optimization Problems. 603-619
• 
  Brian J. Lunday, Hanif D. Sherali, Theodore S. Glickman: The Nested Event Tree Model with Application to Combating Terrorism. 620-634
• 
  Sean Barnes, Bruce L. Golden, Edward A. Wasil: MRSA Transmission Reduction Using Agent-Based Modeling and Simulation. 635-646
• 
  John W. Chinneck: Appreciation to Referees. 647-650

last updated on Sat May 18 06:16:29 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page