Last update:
Tue Dec 10 09:36:39 MST 2024
Harvey J. Greenberg Editor's Introduction . . . . . . . . . 1--1
Anonymous In Memoriam: Robert G. Jeroslow
(1942--1988) . . . . . . . . . . . . . . 2--6
Robert G. Jeroslow, (deceased) and
Jinchang Wang Dynamic Programming, Integral Polyhedra
and Horn Clause Knowledge Base . . . . . 7--19
Stavros A. Zenios Parallel Numerical Optimization: Current
Status and an Annotated Bibliography . . 20--43
Jaya Singhal and
Roy E. Marsten and
Thomas L. Morin Fixed Order Branch-and-Bound Methods for
Mixed-Integer Programming: The \pkgzoom
System . . . . . . . . . . . . . . . . . 44--51
Daniel P. Heyman and
Alyson Reeves Numerical Solution of Linear Equations
Arising in Markov Chain Models . . . . . 52--60
Harvey J. Greenberg Editor's Introduction . . . . . . . . . 61--61
Farhad Shahrokhi Approximation Algorithms for the Maximum
Concurrent Flow Problem . . . . . . . . 62--69
Kevin A. McShane and
Clyde L. Monma and
David Shanno An Implementation of a Primal-Dual
Interior Point Method for Linear
Programming . . . . . . . . . . . . . . 70--83
Ilan Adler and
Narendra Karmarkar and
Mauricio G. C. Resende and
Geraldo Veiga Data Structures and Programming
Techniques for the Implementation of
Karmarkar's Algorithm . . . . . . . . . 84--106
Tapas K. Som and
Robert G. Sargent A Formal Development of Event Graphs as
an Aid to Structured and Efficient
Simulation Programs . . . . . . . . . . 107--125
Andrew Reibman and
Kishor Trivedi and
Sanjaya Kumar and
Gianfranco Ciardo Analysis of Stiff Markov Chains . . . . 126--133
Harvey J. Greenberg Editor's Introduction . . . . . . . . . 135--136
John N. Hooker, Jr. Input Proofs and Rank One Cutting Planes 137--145
Masahiro Inuiguchi and
Hidetomo Ichihashi and
Hideo Tanaka Possibilistic Linear Programming with
Measurable Multiattribute Value
Functions . . . . . . . . . . . . . . . 146--158
Paul T. Boggs and
Paul D. Domich and
Janet R. Donaldson and
Christoph Witzgall Algorithmic Enhancements to the Method
of Centers for Linear Programming
Problems . . . . . . . . . . . . . . . . 159--171
Burton Simon A New Estimator of Sensitivity Measures
for Simulations Based on Light Traffic
Theory . . . . . . . . . . . . . . . . . 172--180
Avi Dechter and
Rina Dechter On the Greedy Solution of Ordering
Problems . . . . . . . . . . . . . . . . 181--189
Fred Glover Tabu Search --- Part I . . . . . . . . . 190--206
Harvey J. Greenberg Editor's Introduction . . . . . . . . . 207--208
Hosam M. Aboelfotoh and
Charles J. Colbourn Series-Parallel Bounds for the
Two-Terminal Reliability Problem . . . . 209--222
Robert L. Moose, Jr. Modeling Networks with Dynamic
Topologies . . . . . . . . . . . . . . . 223--231
Eitan Wacholder A Neural Network-Based Optimization
Algorithm for the Static Weapon-Target
Assignment Problem . . . . . . . . . . . 232--246
Andrew T. Phillips and
J. Ben Rosen Anomalous Acceleration in Parallel
Multiple-Cost-Row Linear Programming . . 247--251
Stein W. Wallace and
Roger J-B Wets Preprocessing in Stochastic Programming:
The Case of Uncapacitated Networks . . . 252--270
Larry J. LeBlanc and
Ronald V. Simmons Continuous Models for Capacity Design of
Large Packet-Switched Telecommunication
Networks . . . . . . . . . . . . . . . . 271--286
Roy E. Marsten and
Matthew J. Saltzman and
David F. Shanno and
George S. Pierce and
J. F. Ballintijn Implementation of a Dual Affine Interior
Point Algorithm for Linear Programming 287--297
Harvey J. Greenberg Editor's Introduction . . . . . . . . . 1--2
Anonymous Expediting Processing: What Can The
Author Do? . . . . . . . . . . . . . . . 3--3
Fred Glover Tabu Search --- Part II . . . . . . . . 4--32
Jadranka Skorin-Kapov Tabu Search Applied to the Quadratic
Assignment Problem . . . . . . . . . . . 33--45
David E. Whited and
Douglas R. Shier and
James P. Jarvis Reliability Computations for Planar
Networks . . . . . . . . . . . . . . . . 46--60
John Gleeson and
Jennifer Ryan Identifying Minimally Infeasible
Subsystems of Inequalities . . . . . . . 61--63
Chung-Lun Li and
David Simchi-Levi Worst-Case Analysis of Heuristics for
Multidepot Capacitated Vehicle Routing
Problems . . . . . . . . . . . . . . . . 64--73
Miguel Delgado and
Jose L. Verdegay and
Maria-Amparo Vila On Valuation and Optimization Problems
in Fuzzy Graphs: A General Approach and
Some Particular Cases . . . . . . . . . 74--83
Allan M. Tuchman and
Michael W. Berry Matrix Visualization in the Design of
Numerical Algorithms . . . . . . . . . . 84--92
Richard H. Jones Book Review . . . . . . . . . . . . . . 93--93
Harvey J. Greenberg Computational Testing: Why, How and How
Much . . . . . . . . . . . . . . . . . . 94--97
Harvey J. Greenberg Editor's Introduction . . . . . . . . . 99--99
Allen L. Barker and
Donald E. Brown and
Worthy N. Martin A Neural Network Implementation of a
Data Association Algorithm . . . . . . . 100--111
Stavros A. Zenios Matrix Balancing on a Massively Parallel
Connection Machine . . . . . . . . . . . 112--125
Bennett L. Fox Generating Markov-Chain Transitions
Quickly: I . . . . . . . . . . . . . . . 126--135
Christopher V. Jones An Introduction to Graph-Based Modeling
Systems, Part I: Overview . . . . . . . 136--151
Irvin J. Lustig The Influence of Computer Language on
Computational Comparisons: An Example
from Network Optimization . . . . . . . 152--161
David M. Nicol Parallel Solution of Sparse
One-Dimensional Dynamic Programming
Problems . . . . . . . . . . . . . . . . 162--173
James Kelly and
Bruce Golden and
Arjang Assad Using Simulated Annealing to Solve
Controlled Rounding Problems . . . . . . 174--185
Fernando L. Alvarado Manipulation and Visualization of Sparse
Matrices . . . . . . . . . . . . . . . . 186--207
Harvey J. Greenberg Editor's Introduction . . . . . . . . . 209--210
Edward P. C. Kao and
Kumar S. Narayanan Computing Steady-State Probabilities of
a Nonpreemptive Priority Multiserver
Queue . . . . . . . . . . . . . . . . . 211--218
Teofilo Gonzalez and
Eugene L. Lawler and
Sartaj Sahni Optimal Preemptive Scheduling of Two
Unrelated Processors . . . . . . . . . . 219--224
Christodoulos A. Floudas and
Avanish Aggarwal A Decomposition Strategy for Global
Optimum Search in the Pooling Problem 225--235
Bezalel Gavish and
Kemal Altinkemer Backbone Network Design Tools with
Economic Tradeoffs . . . . . . . . . . . 236--252
Laxmi P. Gewali and
Alex C. Meng and
Joseph S. B. Mitchell and
Simeon Ntafos Path Planning in 0/1/$ \infty $ Weighted
Regions with Applications . . . . . . . 253--272
Mohan L. Chaudhry and
Carl M. Harris and
William G. Marchal Robustness of Rootfinding in
Single-Server Queueing Models . . . . . 273--286
Michael V. Mannino and
Betsy S. Greenberg and
Sa Neung Hong Model Libraries: Knowledge
Representation and Reasoning . . . . . . 287--301
Harvey J. Greenberg Editor's Introduction . . . . . . . . . 303--303
In Chan Choi and
Clyde L. Monma and
David F. Shanno Further Development of a Primal-Dual
Interior Point Method . . . . . . . . . 304--311
Amiya K. Chakravarty and
Diptendu Sinha Knowledge Modularization for Adaptive
Decision Modeling . . . . . . . . . . . 312--324
Uwe H. Suhl and
Leena M. Suhl Computing Sparse LU Factorizations for
Large-Scale Linear Programming Bases . . 325--335
Che-Liang Yang and
Peter Kubat An Algorithm for Network Reliability
Bounds . . . . . . . . . . . . . . . . . 336--345
Joseph Y.-T. Leung and
Gilbert H. Young Minimizing Total Tardiness on a Single
Machine with Precedence Constraints . . 346--352
Kendall E. Nygard and
Paul Juell and
Nagesh Kadaba Neural Networks for Selective Vehicle
Routing Heuristics . . . . . . . . . . . 353--364
Matthew J. Saltzman and
Kevin S. McCurley Book Reviews . . . . . . . . . . . . . . 365--368
Harvey J. Greenberg Editor's Introduction . . . . . . . . . 1--2
Bennett L. Fox and
Andrew R. Young Generating Markov-Chain Transitions
Quickly: II . . . . . . . . . . . . . . 3--11
H. Sitaraman Approximation of Some Markov-Modulated
Poisson Processes . . . . . . . . . . . 12--22
Kenneth W. Bauer, Jr. and
Bipin Kochar and
Joseph J. Talavage Discrete Event Simulation Model
Decomposition by Principal Components
Analysis . . . . . . . . . . . . . . . . 23--32
Paul Helman and
Arnon Rosenthal A Mass Production Technique to Speed
Multiple-Query Optimization and Physical
Database Design . . . . . . . . . . . . 33--55
Renato De Leone and
Terence T.-H. Ow Parallel Implementation of Lemke's
Algorithm on the Hypercube . . . . . . . 56--62
Nimrod Megiddo On Finding Primal- and Dual-Optimal
Bases . . . . . . . . . . . . . . . . . 63--65
Asim Roy and
Somnath Mukhopadhyay Pattern Classification Using Linear
Programming . . . . . . . . . . . . . . 66--80
Harvey J. Greenberg and
John W. Chinneck and
Gerald M. Karam Book Reviews . . . . . . . . . . . . . . 81--83
Harvey J. Greenberg Editor's Introduction . . . . . . . . . 85--85
Raj Jagannathan Optimal Partial-Match Hashing Design . . 86--91
David N. Kempka and
Jeffery L. Kennington and
Hossam A. Zaki Performance Characteristics of the
Jacobi and the Gauss--Seidel Versions of
the Auction Algorithm on the Alliant
FX/8 . . . . . . . . . . . . . . . . . . 92--106
Hemant K. Bhargava and
Steven O. Kimbrough and
Ramayya Krishnan Unique Names Violations, a Problem for
Model Integration or You Say Tomato, I
Say Tomahto . . . . . . . . . . . . . . 107--120
Karla L. Hoffman and
Manfred Padberg Improving LP-Representations of Zero-One
Linear Programs for Branch-and-Cut . . . 121--134
Brigitte Jaumard and
Pierre Hansen and
Marcus Poggi de Aragão Column Generation Methods for
Probabilistic Logic . . . . . . . . . . 135--148
David Applegate and
William Cook A Computational Study of the Job-Shop
Scheduling Problem . . . . . . . . . . . 149--156
John W. Chinneck and
Erik W. Dravnieks Locating Minimal Infeasible Constraint
Sets in Linear Programs . . . . . . . . 157--168
Karel Zikan Technical Note --- Least-Squares Image
Registration . . . . . . . . . . . . . . 169--172
Harvey J. Greenberg SOFTWARE SECTION --- RANDMOD: A System
for Randomizing Modifications to an
Instance of a Linear Program . . . . . . 173--175
Jennifer Ryan Book Review . . . . . . . . . . . . . . 176--176
Harvey J. Greenberg Editor's Introduction . . . . . . . . . 179--179
Christopher V. Jones An Introduction to Graph-Based Modeling
Systems, Part II: Graph-Grammars and the
Implementation . . . . . . . . . . . . . 180--206
J. Ben Rosen and
Guo-Liang Xue Computational Comparison of Two
Algorithms for the Euclidean Single
Facility Location Problem . . . . . . . 207--212
Lawrence J. Osborne and
Billy E. Gillett A Comparison of Two Simulated Annealing
Algorithms Applied to the Directed
Steiner Problem on Networks . . . . . . 213--225
Thomas J. Sager and
Shi-Jen Lin A Pruning Procedure for Exact Graph
Coloring . . . . . . . . . . . . . . . . 226--230
Edward P. C. Kao Using State Reduction for Computing
Steady State Probabilities of Queues of
GI/PH/1 Types . . . . . . . . . . . . . 231--240
Frederick J. Portier and
Robert E. Haymond A Product Automaton Formalism for
Hierarchical, Modular, Discrete
Simulation . . . . . . . . . . . . . . . 241--252
Harvey J. Greenberg and
Frederic H. Murphy Approaches to Diagnosing Infeasible
Linear Programs . . . . . . . . . . . . 253--261
Frank Dammeyer and
Peter Forst and
Stefan Voss Technical Note --- On the Cancellation
Sequence Method of Tabu Search . . . . . 262--265
Weldon A. Lodwick Book Review . . . . . . . . . . . . . . 266--266
Harvey J. Greenberg Editor's Introduction . . . . . . . . . 267--268
Peter J. Stuckey Incremental Linear Constraint Solving
and Detection of Implicit Equalities . . 269--274
Peter C. Fetterolf and
G. Anandalingam Optimizing Interconnections of Local
Area Networks: An Approach Using
Simulated Annealing . . . . . . . . . . 275--287
Peter J. Downey Bounding Synchronization Overhead for
Parallel Iteration . . . . . . . . . . . 288--298
Jeffery L. Kennington and
Zhiming Wang An Empirical Analysis of the Dense
Assignment Problem: Sequential and
Parallel Implementations . . . . . . . . 299--306
Zbigniew Michalewicz and
George A. Vignaux and
Matthew Hobbs A Nonstandard Genetic Algorithm for the
Nonlinear Transportation Problem . . . . 307--316
Benjamin Melamed TES: A Class of Methods for Generating
Autocorrelated Uniform Variates . . . . 317--329
Jerzy W. Rozenblit and
Yueh M. Huang Rule-Based Generation of Model
Structures in Multifaceted Modeling and
System Design . . . . . . . . . . . . . 330--344
Gary J. Koehler Linear Discriminant Functions Determined
by Genetic Search . . . . . . . . . . . 345--357
Joobin Choobineh SQLMP: A Data Sublanguage for
Representation and Formulation of Linear
Mathematical Models . . . . . . . . . . 358--375
Gerhard Reinelt TSPLIB --- A Traveling Salesman Problem
Library . . . . . . . . . . . . . . . . 376--384
Harvey J. Greenberg Editor's Introduction . . . . . . . . . 1--1
Stuart Smith and
Leon Lasdon Solving Large Sparse Nonlinear Programs
Using GRG . . . . . . . . . . . . . . . 2--15
Robert Fourer and
Roy E. Marsten Solving Piecewise-Linear Programs:
Experiments with a Simplex Approach . . 16--31
Ulrich Faigle and
Walter Kern Some Convergence Results for
Probabilistic Tabu Search . . . . . . . 32--37
James K. Hurd and
Frederic H. Murphy Exploiting Special Structure in Primal
Dual Interior Point Methods . . . . . . 38--44
Stein W. Wallace and
Roger J-B. Wets Preprocessing in Stochastic Programming:
The Case of Linear Programs . . . . . . 45--59
Leonid B. Boguslavsky, Jr. and
Edward G. Coffman and
Edgar N. Gilbert and
Alexander Y. Kreinin Scheduling Checks and Saves . . . . . . 60--69
Jon Lee and
Jennifer Ryan Matroid Applications and Algorithms . . 70--98
Rakesh V. Vohra Book Review . . . . . . . . . . . . . . 99--99
Harvey J. Greenberg Editor's Introduction . . . . . . . . . 101--102
Sanjay Mehrotra Implementations of Affine Scaling
Methods: Approximate Solutions of
Systems of Linear Equations Using
Preconditioned Conjugate Gradient
Methods . . . . . . . . . . . . . . . . 103--118
Weldon A. Lodwick Preprocessing Nonlinear Functional
Constraints with Applications to the
Pooling Problem . . . . . . . . . . . . 119--131
Robert H. Clark and
Jeffery L. Kennington and
Robert R. Meyer and
Muthukrishnan Ramamurti Generalized Networks: Parallel
Algorithms and an Empirical Analysis . . 132--145
Martin W. P. Savelsbergh The Vehicle Routing Problem with Time
Windows: Minimizing Route Duration . . . 146--154
R. Ramesh and
Yong-Seok Yoon and
Mark H. Karwan An Optimal Algorithm for the
Orienteering Tour Problem . . . . . . . 155--165
Soren S. Nielsen and
Stavros A. Zenios Massively Parallel Algorithms for Singly
Constrained Convex Programs . . . . . . 166--181
Tao Yang and
Morton J. M. Posner and
James G. C. Templeton The Ca/M/s/m Retrial Queue: A
Computational Approach . . . . . . . . . 182--191
Anantaram Balakrishnan and
Kemal Altinkemer Using a Hop-Constrained Model to
Generate Alternative Communication
Network Design . . . . . . . . . . . . . 192--205
Gerhard Reinelt Fast Heuristics for Large Geometric
Traveling Salesman Problems . . . . . . 206--217
Nageswara S. V. Rao Technical Note --- On Performance of
Path Planning Algorithms in Unknown
Terrains . . . . . . . . . . . . . . . . 218--224
Anonymous From the Editor . . . . . . . . . . . . 225--225
Peter W. Glynn and
Philip Heidelberger Jackknifing under a Budget Constraint 226--234
Mustafa C. Pinar and
Stavros A. Zenios Parallel Decomposition of Multicommodity
Network Flows Using a Linear-Quadratic
Penalty Algorithm . . . . . . . . . . . 235--249
Frank Y. S. Lin and
James R. Yee A New Multiplier Adjustment Procedure
for the Distributed Computation of
Routing Assignments in Virtual Circuit
Data Networks . . . . . . . . . . . . . 250--266
Robert E. Bixby Implementing the Simplex Method: The
Initial Basis . . . . . . . . . . . . . 267--284
Chris Fraley and
Jean-Philippe Vial Alternative Approaches to Feasibility in
Projective Methods for Linear
Programming . . . . . . . . . . . . . . 285--299
Mohan L. Chaudhry Numerical Issues in Computing
Steady-State Queueing-Time Distributions
of Single-Server Bulk-Service Queues:
M/Gb/1 and M/Gd/1 . . . . . . . . . . . 300--310
Julio M. Stern Simulated Annealing with a Temperature
Dependent Penalty Function . . . . . . . 311--319
Sunil Chopra and
Edgar R. Gorres and
M. R. Rao Solving the Steiner Tree Problem on a
Graph Using Branch and Cut . . . . . . . 320--335
William J. Stewart and
Wei Wu Numerical Experiments with Iteration and
Aggregation for Markov Chains . . . . . 336--350
Parviz Ghandforoush and
John J. Daniels A Heuristic Algorithm for the Guillotine
Constrained Cutting Stock Problem . . . 351--356
Joseph S. B. Mitchell and
Jan Karel Lenstra Guest Editors' Introduction . . . . . . 357--359
David Eppstein Dynamic Three-Dimensional Linear
Programming . . . . . . . . . . . . . . 360--368
David Hartvigsen Recognizing Voronoi Diagrams with Linear
Programming . . . . . . . . . . . . . . 369--374
Esther M. Arkin and
Klara Kedem and
Joseph S. B. Mitchell and
Josef Sprinzak and
Michael Werman Matching Points into Pairwise-Disjoint
Noise Regions: Combinatorial Bounds and
Algorithms . . . . . . . . . . . . . . . 375--386
Jon Jouis Bentley Fast Algorithms for Geometric Traveling
Salesman Problems . . . . . . . . . . . 387--411
S. Louis Hakimi and
Martine Labbé Labbé and
Edward Schmeichel The Voronoi Partition of a Network and
Its Implications in Location Theory . . 412--417
Hossam ElGindy and
J. Mark Keil Efficient Algorithms for the Capacitated
$1$-Median Problem . . . . . . . . . . . 418--425
Hiroshi Imai and
D. T. Lee and
Chung-Do Yang $1$-Segment Center Problems . . . . . . 426--434
Elias Koutsoupias and
Christos H. Papadimitriou and
Martha Sideri On the Optimal Bisection of a Polygon 435--438
V. Chandru and
V. T. Rajan and
R. Swaminathan Monotone Pieces of Chains . . . . . . . 439--446
Laurent Alonso and
Arthur S. Goldstein and
Edward M. Reingold ``Lion and Man'': Upper and Lower Bounds 447--452
Bruce L. Golden From the Editor . . . . . . . . . . . . 1--1
Richard S. Barr and
Betty L. Hickman Feature Article --- Reporting
Computational Experiments with Parallel
Algorithms: Issues, Measures, and
Experts' Opinions . . . . . . . . . . . 2--18
John L. Gustafson Commentary --- The ``Tar Baby'' of
Computing: Performance Analysis . . . . 19--21
H. David Loshin and
Alex Vasilevsky Commentary --- Parallel Reporting
Guidelines Are on Target . . . . . . . . 22--23
Ewing L. Lusk Commentary --- Speedups and Insights . . 24--25
Donald L. Miller and
Joseph F. Pekny Commentary --- The Role of Performance
Metrics for Parallel Mathematical
Programming Algorithms . . . . . . . . . 26--28
Richard S. Barr and
Betty L. Hickman Rejoinder --- Using Parallel Empirical
Testing to Advance Algorithm Research 29--32
Hemant K. Bhargava Dimensional Analysis in Mathematical
Modeling Systems: A Simple Numerical
Method . . . . . . . . . . . . . . . . . 33--39
Stephen G. Nash and
Ariela Sofer A Barrier Method for Large-Scale
Constrained Optimization . . . . . . . . 40--53
Murali S. Shanker and
W. David Kelton and
Rema Padman Measuring Congestion for Dynamic Task
Allocation in Distributed Simulation . . 54--68
Mary A. Johnson Selecting Parameters of Phase
Distributions: Combining Nonlinear
Programming, Heuristics, and Erlang
Distributions . . . . . . . . . . . . . 69--83
Jonathan Eckstein The Alternating Step Method for
Monotropic Programming on the Connection
Machine CM-2 . . . . . . . . . . . . . . 84--96
Pierre Hansen and
Brigitte Jaumard and
Vincent Mathon State-of-the-Art Survey --- Constrained
Nonlinear $0$--$1$ Programming . . . . . 97--119
Giorgio Gallo and
Maria Grazia Scutell\`a Toward a Programming Environment for
Combinatorial Optimization: A Case Study
Oriented to Max-Flow Computations . . . 120--133
Robert J. Vanderbei ALPO: Another Linear Program Optimizer 134--146
Bennett L. Fox Shortening Future-Event Lists . . . . . 147--150
Shahram Ghandeharizadeh and
Robert R. Meyer and
Gary L. Schultz and
Jonathan Yackel Optimal Balanced Assignments and a
Parallel Database Application . . . . . 151--167
Miguel Nussbaum and
Eduardo A. Parra A Production Scheduling System . . . . . 168--181
Tamra J. Carpenter and
Irvin J. Lustig and
John M. Mulvey and
David F. Shanno Separable Quadratic Programming via a
Primal-Dual Interior Point Method and
its Use in a Sequential Procedure . . . 182--191
S. L. van de Velde Duality-Based Algorithms for Scheduling
Unrelated Parallel Machines . . . . . . 192--205
William Cook and
Thomas Rutherford and
Herbert E. Scarf and
David Shallcross An Implementation of the Generalized
Basis Reduction Algorithm for Integer
Programming . . . . . . . . . . . . . . 206--212
Richard M. Fujimoto Feature Article --- Parallel Discrete
Event Simulation: Will the Field
Survive? . . . . . . . . . . . . . . . . 213--230
Marc Abrams Commentary --- Parallel Discrete Event
Simulation: Fact or Fiction? . . . . . . 231--233
Rajive Bagrodia Commentary --- A Survival Guide for
Parallel Simulation . . . . . . . . . . 234--235
Yi-Bing Lin Commentary --- Will Parallel Simulation
Research Survive? . . . . . . . . . . . 236--238
Paul F. Reynolds, Jr. Commentary --- The Silver Bullet . . . . 239--241
Brian W. Unger and
John G. Cleary Commentary --- Practical Parallel
Discrete Event Simulation . . . . . . . 242--244
Richard M. Fujimoto Rejoinder --- Future Directions in
Parallel Simulation Research . . . . . . 245--248
Karl Heinz Borgwardt and
Renate Damm and
Rudolf Donig and
Gabriele Joas Empirical Studies on the Average
Efficiency of Simplex Variants under
Rotation Symmetry . . . . . . . . . . . 249--260
Dimitri P. Bertsekas and
David A. Castañon Parallel Asynchronous Hungarian Methods
for the Assignment Problem . . . . . . . 261--274
David Steiger and
Ramesh Sharda and
Brian Leclaire Graphical Interfaces for Network
Modeling: A Model Management System
Perspective . . . . . . . . . . . . . . 275--291
Winfried K. Grassmann and
Daniel P. Heyman Computation of Steady-State
Probabilities for Infinite-State Markov
Chains with Repeating Rows . . . . . . . 292--303
Michael J. Prietula and
Wen-Ling Hsu and
David Steier and
Allen Newell Applying an Architecture for General
Intelligence to Reduce Scheduling Effort 304--320
Bo Chen and
Vitaly A. Strusevich Approximation Algorithms for
Three-Machine Open Shop Scheduling . . . 321--326
Anonymous From the Editor . . . . . . . . . . . . 327--327
Jean-Yves Potvin State-of-the-Art Survey --- The
Traveling Salesman Problem: A Neural
Network Perspective . . . . . . . . . . 328--348
O. L. Mangasarian Mathematical Programming in Neural
Networks . . . . . . . . . . . . . . . . 349--360
Selwyn Piramuthu and
Chung-Ming Kuan and
Michael J. Shaw Learning Algorithms for Neural-Net
Decision Support . . . . . . . . . . . . 361--373
Zaiyong Tang and
Paul A. Fishwick Feedforward Neural Nets as Models for
Time Series Forecasting . . . . . . . . 374--385
Venkat Subramanian and
Ming S. Hung A GRG2-Based System for Training Neural
Networks: Design and Computational
Experience . . . . . . . . . . . . . . . 386--394
Mohammad M. Amini and
Richard S. Barr Network Reoptimization Algorithms: A
Statistically Designed Comparison . . . 395--409
Kevin D. Seppi and
J. Wesley Barnes and
Carl N. Morris A Bayesian Approach to Database Query
Optimization . . . . . . . . . . . . . . 410--419
Surya Danusaputro Liman and
Chung-Yee Lee Error Bound of a Heuristic for the
Common Due Date Scheduling Problem . . . 420--425
Matteo Fischetti and
Paolo Toth An Efficient Algorithm for the Min-Sum
Arborescence Problem on Complete
Digraphs . . . . . . . . . . . . . . . . 426--434
Irvin J. Lustig and
Roy E. Marsten and
David F. Shanno Feature Article --- Interior Point
Methods for Linear Programming:
Computational State of the Art . . . . . 1--14
Robert E. Bixby Commentary --- Progress in Linear
Programming . . . . . . . . . . . . . . 15--22
Michael A. Saunders Commentary --- Major Cholesky Would Feel
Proud . . . . . . . . . . . . . . . . . 23--27
Michael J. Todd Commentary --- Theory and Practice for
Interior-Point Methods . . . . . . . . . 28--31
Robert J. Vanderbei Commentary --- Interior-Point Methods:
Algorithms and Formulations . . . . . . 32--34
Irvin J. Lustig and
Roy E. Marsten and
David F. Shanno Rejoinder --- The Last Word on Interior
Point Methods for Linear Programming ---
For Now . . . . . . . . . . . . . . . . 35--36
Vincent Dugat and
Sandra Sandri Complexity of Hierarchical Trees in
Evidence Theory . . . . . . . . . . . . 37--49
Hasan Pirkul and
Sridhar Narasimhan Primary and Secondary Route Selection in
Backbone Computer Networks . . . . . . . 50--60
Rajiv M. Dewan Design of Performance Constrained Optic
Fiber Multidrop Access Networks . . . . 61--67
Joseph F. Pekny and
Donald L. Miller A Staged Primal-Dual Algorithm for
Finding a Minimum Cost Perfect
Two-Matching in an Undirected Graph . . 68--81
Ronny Aboudi and
Kurt Jörnsten Tabu Search for General Zero-One Integer
Programs Using the Pivot and Complement
Heuristic . . . . . . . . . . . . . . . 82--93
Ho-Won Jung and
Roy E. Marsten and
Matthew J. Saltzman Numerical Factorization Methods for
Interior Point Algorithms . . . . . . . 94--105
Bruce L. Golden From the Editor . . . . . . . . . . . . 107--107
Éric D. Taillard Parallel Taboo Search Techniques for the
Job Shop Scheduling Problem . . . . . . 108--117
E. H. L. Aarts and
P. J. M. van Laarhoven and
J. K. Lenstra and
N. L. J. Ulder A Computational Study of Local Search
Algorithms for Job Shop Scheduling . . . 118--125
Roberto Battiti and
Giampietro Tecchiolli The Reactive Tabu Search . . . . . . . . 126--140
Ulrich Dorndorf and
Erwin Pesch Fast Clustering Algorithms . . . . . . . 141--153
James C. Bean Genetic Algorithms and Random Keys for
Sequencing and Optimization . . . . . . 154--160
Edward J. Anderson and
Michael C. Ferris Genetic Algorithms for Combinatorial
Optimization: The Assemble Line
Balancing Problem . . . . . . . . . . . 161--173
Riyaz Sikora and
Michael Shaw A Double-Layered Learning Approach to
Acquiring Rules for Classification:
Integrating Genetic Algorithms with
Similarity-Based Learning . . . . . . . 174--187
Mary Melekopoglou and
Anne Condon On the Complexity of the Policy
Improvement Algorithm for Markov
Decision Processes . . . . . . . . . . . 188--192
Jacek Gondzio On Exploiting Original Problem Data in
the Inverse Representation of Linear
Programming Bases . . . . . . . . . . . 193--206
Arne Stolbjerg Drud CONOPT --- A Large-Scale GRG Code . . . 207--216
A. M. Pollatschek SSS: Subrouting Set for Experimenting in
Simulation Research . . . . . . . . . . 217--220
Christopher V. Jones Feature Article --- Visualization and
Optimization . . . . . . . . . . . . . . 221--257
Peter C. Bell Commentary --- Visualization and
Optimization: The Future Lies Together 258--260
Lawrence Bodin and
Laurence Levy Commentary --- Visualization in Vehicle
Routing and Scheduling Problems . . . . 261--269
Harvey J. Greenberg and
Frederic H. Murphy Commentary --- The Promise of OR is
Helping to Solve Problems . . . . . . . 270--272
Jerry Keiper and
Tom Wickham-Jones Commentary --- Designing Tools for
Visualization and Optimization . . . . . 273--277
Christopher V. Jones Rejoinder --- Anchoring and
Cross-Fertilization . . . . . . . . . . 278--280
Prakash P. Shenoy Consistency in Valuation-Based Systems 281--291
Khaled S. Al-Sultan A Newton Based Radius Reduction
Algorithm for Nearest Point Problems in
Pos Cones . . . . . . . . . . . . . . . 292--299
Harold J. Kushner and
Jichuan Yang A Numerical Method for Controlled
Routing in Large Trunk Line Networks via
Stochastic Control Theory . . . . . . . 300--316
Anonymous From the Editor . . . . . . . . . . . . 317--317
W. David Kelton Perspectives on Simulation Research and
Practice . . . . . . . . . . . . . . . . 318--328
Mufit Ozden Intelligent Objects in Simulation . . . 329--341
Athanassios N. Avramidis and
James R. Wilson A Flexible Method for Estimating Inverse
Distribution Functions in Simulation
Experiments . . . . . . . . . . . . . . 342--355
Mary A. Johnson and
Sanghoon Lee and
James R. Wilson Experimental Evaluation of a Procedure
for Estimating Nonhomogeneous Poisson
Processes Having Cyclic Behavior . . . . 356--368
Wade H. Shaw, Jr. and
Nathaniel J. Davis IV and
Richard A. Raines The Application of Metamodeling to
Interconnection Network Analysis . . . . 369--380
Sheldon H. Jacobson Convergence Results for Harmonic
Gradient Estimators . . . . . . . . . . 381--397
M. Hossein Safizadeh and
Robert Signorile Optimization of Simulation via
Quasi-Newton Methods . . . . . . . . . . 398--408
Nasir Ghiaseddin and
Khalil Matta and
Diptendu Sinha A Structured Expert System for Model
Management in Inventory Control . . . . 409--422
F. Harche and
J. N. Hooker and
G. L. Thompson A Computational Study of Satisfiability
Algorithms for Propositional Logic . . . 423--435
Constantine K. N. Osiakwan and
Selim G. Akl An EP Algorithm for Computing a Minimum
Weight Perfect Matching for a Set of
Points on the Plane . . . . . . . . . . 436--444
M. W. P. Savelsbergh Preprocessing and Probing Techniques for
Mixed Integer Programming Problems . . . 445--454
Donald L. Miller A Matching Based Exact Algorithm for
Capacitated Vehicle Routing Problems . . 1--9
George Kontoravdis and
Jonathan F. Bard A GRASP for the Vehicle Routing Problem
with Time Windows . . . . . . . . . . . 10--23
Moustapha Diaby and
R. Ramesh The Distribution Problem with Carrier
Service: A Dual Based Penalty Approach 24--35
Joseph Abate and
Ward Whitt Numerical Inversion of Laplace
Transforms of Probability Distributions 36--43
Stein W. Wallace and
Roger J-B Wets Preprocessing in Stochastic Programming:
The Case of Capacitated Networks . . . . 44--62
S. Thomas McCormick and
Michael L. Pinedo Scheduling n Independent Jobs on m
Uniform Machines with both Flowtime and
Makespan Objectives: A Parametric
Analysis . . . . . . . . . . . . . . . . 63--77
Dilip Chhajed and
Vijay Chandru Hulls and Efficient Sets for the
Rectilinear Norm . . . . . . . . . . . . 78--83
Th. M. Liebling and
F. Margot and
D. Müller and
A. Prodon and
L. Stauffer Disjoint Paths in the Plane . . . . . . 84--88
Lee K. Jones and
Richard C. Larson Efficient Computation of Probabilities
of Events Described by Order Statistics
and Applications to Queue Inference . . 89--100
Daniel P. Heyman and
Meredith J. Goldsmith Comparisons Between
Aggregation/Disaggregation and a Direct
Algorithm for Computing the Stationary
Probabilities of a Markov Chain . . . . 101--108
Kurt M. Bretthauer and
Bala Shetty and
Siddhartha Syam A Branch and Bound Algorithm for Integer
Quadratic Knapsack Problems . . . . . . 109--116
Anonymous Erratum . . . . . . . . . . . . . . . . 116--116
R. Bruce Mattingly A Revised Stochastic Complementation
Algorithm for Nearly Completely
Decomposable Markov Chains . . . . . . . 117--124
Peter J. Downey Bounds and Approximations for Overheads
in the Time to Join Parallel Forks . . . 125--139
David L. Jagerman and
Benjamin Melamed Spectral Analysis of Basic TES Processes 140--148
June S. Park and
Robert Bartoszy\'nski and
Walter A. Rosenkrantz Stability of $p$-Persistent CSMA/CD . . 149--159
Carsten Jordan and
Andreas Drexl A Comparison of Constraint and
Mixed-Integer Programming Solvers for
Batch Sequencing with Sequence-Dependent
Setups . . . . . . . . . . . . . . . . . 160--165
Robert Fourer and
David M. Gay Expressing Special Structures in an
Algebraic Modeling Language for
Mathematical Programming . . . . . . . . 166--190
Mauro Dell'Amico and
Silvano Martello Optimal Scheduling of Tasks on Identical
Parallel Processors . . . . . . . . . . 191--200
Sunan Han and
Dawei Hong and
Joseph Y.-T. Leung On the Asymptotic Optimality of
Multiprocessor Scheduling Heuristics for
the Makespan Minimization Problem . . . 201--204
Harvey J. Greenberg Analyzing the Pooling Problem . . . . . 205--217
Abraham Mehrez and
Geoffrey Steinberg A Matching Identification Problem: A
Knowledge Acquisition Approach . . . . . 218--231
A. M. A. Hariri and
C. N. Potts and
L. N. Van Wassenhove Single Machine Scheduling to Minimize
Total Weighted Late Work . . . . . . . . 232--242
Amit Basu Introduction to the Cluster on Knowledge
and Data Management . . . . . . . . . . 243--243
Sudha Ram and
Sridhar Narasimhan Incorporating the Majority Consensus
Concurrency Control Mechanism into the
Database Allocation Problem . . . . . . 244--256
Ram D. Gopal and
R. Ramesh and
Stanley Zionts Access Path Optimization in Relational
Joins . . . . . . . . . . . . . . . . . 257--268
Paulo B. Goes A Stochastic Model for Performance
Evaluation of Main Memory Resident
Database Systems . . . . . . . . . . . . 269--282
Evangelos Triantaphyllou and
Allen L. Soyster A Relationship Between CNF and DNF
Systems Derivable from Examples . . . . 283--285
Rajan Srikanth A Graph Theory-Based Approach for
Partitioning Knowledge Bases . . . . . . 286--297
Donald L. Miller and
Joseph F. Pekny A Staged Primal-Dual Algorithm for
Perfect $b$-Matching with Edge
Capacities . . . . . . . . . . . . . . . 298--320
Leon S. Lasdon and
John Plummer and
Gang Yu Primal-Dual and Primal Interior Point
Algorithms for General Nonlinear
Programs . . . . . . . . . . . . . . . . 321--332
S. Olariu and
J. L. Schwing and
J. Zhang Interval Graph Problems on
Reconfigurable Meshes . . . . . . . . . 333--348
T. W. Archibald and
K. I. M. McKinnon and
L. C. Thomas Performance Issues for the Iterative
Solution of Markov Decision Processes on
Parallel Computers . . . . . . . . . . . 349--357
Nils Jacob Berland Load Balancing in Hypercube Solution of
Stochastic Optimization Problems . . . . 358--364
Ananth Grama and
Vipin Kumar Parallel Search Algorithms for Discrete
Optimization Problems . . . . . . . . . 365--385
Elizabeth A. Eschenbach and
Christine A. Shoemaker and
Hugh M. Caffey Parallel Algorithms for Stochastic
Dynamic Programming with Continuous
State and Control Variables . . . . . . 386--401
Jonathan Eckstein and
\.I. \.Ilkay Boduro\uglu and
Lazaros C. Polymenakos and
Donald Goldfarb Data-Parallel Implementations of Dense
Simplex Methods on the Connection
Machine CM-2 . . . . . . . . . . . . . . 402--416
T. C. Hu and
Andrew B. Kahng and
Chung-Wen Albert Tsao Old Bachelor Acceptance: A New Class of
Non-Monotone Threshold Accepting Methods 417--425
Fred Glover Tabu Thresholding: Improved Search by
Nonmonotonic Trajectories . . . . . . . 426--442
Jeffrey W. Herrmann and
Chung-Yee Lee Solving a Class Scheduling Problem with
a Genetic Algorithm . . . . . . . . . . 443--452
Robert H. Storer and
S. David Wu and
Renzo Vaccari Problem and Heuristic Space Search
Strategies for Job Shop Scheduling . . . 453--467
David L. Woodruff Ghost Image Processing for Minimum
Covariance Determinants . . . . . . . . 468--473
Joseph Czyzyk and
Robert Fourer and
Sanjay Mehrotra A Study of the Augmented System and
Column-Splitting Approaches for Solving
Two-Stage Stochastic Linear Programs by
Interior-Point Methods . . . . . . . . . 474--490
Catherine C. McGeoch Feature Article --- Toward an
Experimental Method for Algorithm
Simulation . . . . . . . . . . . . . . . 1--15
Pierre L'Ecuyer Commentary --- Simulation of Algorithms
for Performance Analysis . . . . . . . . 16--20
James B. Orlin Commentary --- On Experimental Methods
for Algorithm Simulation . . . . . . . . 21--23
Douglas R. Shier Commentary --- On Algorithm Analysis . . 24--26
Catherine C. McGeoch Rejoinder --- Challenges in Algorithm
Simulation . . . . . . . . . . . . . . . 27--28
David P. Williamson and
Michel X. Goemans Computational Experience with an
Approximation Algorithm on Large-Scale
Euclidean Matching Instances . . . . . . 29--40
Abraham P. Punnen and
K. P. K. Nair An Improved Algorithm for the
Constrained Bottleneck Spanning Tree
Problem . . . . . . . . . . . . . . . . 41--44
J. P. C. Blanc and
R. D. Van der Mei Computation of Derivatives by Means of
the Power-Series Algorithm . . . . . . . 45--54
John W. Chinneck Localizing and Diagnosing
Infeasibilities in Networks . . . . . . 55--62
Weizhen Mao and
David M. Nicol Isomorphic Routing on a Toroidal Mesh 63--73
Edward P. C. Kao A Comparison of Alternative Approaches
for Numerical Solutions of GI/PH/1
Queues . . . . . . . . . . . . . . . . . 74--85
Laura A. Sanchis and
Arun Jagota Some Experimental and Theoretical
Results on Test Case Generators for the
Maximum Clique Problem . . . . . . . . . 87--102
Helmut E. Mausser and
Michael J. Magazine and
John B. Moore Application of an Annealed Neural
Network to a Timetabling Problem . . . . 103--117
Shouhong Wang A Self-Organizing Approach to Managerial
Nonlinear Discriminant Analysis: A
Hybrid Method of Linear Discriminant
Analysis and Neural Networks . . . . . . 118--124
Bruno Codenotti and
Giovanni Manzini and
Luciano Margara and
Giovanni Resta Perturbation: An Efficient Technique for
the Solution of Very Large Instances of
the Euclidean TSP . . . . . . . . . . . 125--133
Jacques Renaud and
Fayez F. Boctor and
Gilbert Laporte A Fast Composite Heuristic for the
Symmetric Traveling Salesman Problem . . 134--143
Erwin Pesch and
Ulrich A. W. Tetzlaff Constraint Propagation Based Scheduling
of Job Shops . . . . . . . . . . . . . . 144--157
Jean-Yves Potvin and
Tanguy Kervahut and
Bruno-Laurent Garcia and
Jean-Marc Rousseau The Vehicle Routing Problem with Time
Windows Part I: Tabu Search . . . . . . 158--164
Jean-Yves Potvin and
Samy Bengio The Vehicle Routing Problem with Time
Windows Part II: Genetic Search . . . . 165--172
David W. Coit and
Alice E. Smith and
David M. Tate Adaptive Penalty Methods for Genetic
Optimization of Constrained
Combinatorial Problems . . . . . . . . . 173--182
Haldun Aytug and
Gary J. Koehler Stopping Criteria for Finite Length
Genetic Algorithms . . . . . . . . . . . 183--191
Anonymous From the Editor . . . . . . . . . . . . 193--193
Youngho Lee and
Steve Y. Chiu and
Jennifer Ryan A Branch and Cut Algorithm for a Steiner
Tree-Star Problem . . . . . . . . . . . 194--201
Prakash Mirchandani The Multi-Tier Tree Problem . . . . . . 202--218
Leslie Hall Experience with a Cutting Plane
Algorithm for the Capacitated Spanning
Tree Problem . . . . . . . . . . . . . . 219--234
Rita Vachani and
Alexander Shulman and
Peter Kubat and
Julie Ward Multicommodity Flows in Ring Networks 235--242
Daniel Bienstock and
Oktay Günlük Capacitated Network Design ---
Polyhedral Structure and Computation . . 243--259
Anantaram Balakrishnan and
Srimathy Gopalakrishnan Selecting Ingot Sizes for Joint
Production of Sheet Products . . . . . . 260--273
Gabriel R. Bitran and
Susana V. Mondschein Inventory Management in Catalog Sales
Companies . . . . . . . . . . . . . . . 274--288
Karen Aardal and
Martine Labbé and
Janny Leung and
Maurice Queyranne On the Two-Level Uncapacitated Facility
Location Problem . . . . . . . . . . . . 289--301
R. J. M. Vaessens and
E. H. L. Aarts and
J. K. Lenstra Job Shop Scheduling by Local Search . . 302--317
Ravindra K. Ahuja and
James B. Orlin Use of Representative Operation Counts
in Computational Testing of Algorithms 318--330
T. Jayawardena and
S. Yakowitz Methodology for Stochastic Graph
Completion-Time Problems . . . . . . . . 331--343
Anuj Mehrotra and
Michael A. Trick A Column Generation Approach for Graph
Coloring . . . . . . . . . . . . . . . . 344--354
James P. Jarvis and
Douglas R. Shier An Improved Algorithm for Approximating
the Performance of Stochastic Flow
Networks . . . . . . . . . . . . . . . . 355--360
Igor Averbakh and
Oded Berman Bottleneck Steiner Subnetwork Problems
with $k$-Connectivity Constraints . . . 361--366
Minghe Sun and
Ralph E. Steuer Quad-Trees and Linear Lists for
Identifying Nondominated Criterion
Vectors . . . . . . . . . . . . . . . . 367--375
C. P. M. van Hoesel and
A. P. M. Wagelmans and
M. van Vliet An $ O (n \log n) $ Algorithm for the
Two-Machine Flow Shop Problem with
Controllable Machine Speeds . . . . . . 376--382
Pai-Chun Ma and
Frederic H. Murphy and
Edward A. Stohr An Implementation of LPFORM . . . . . . 383--401
J. A. Hoogeveen and
S. L. van de Velde A Branch-and-Bound Algorithm for
Single-Machine Earliness--Tardiness
Scheduling with Idle Time . . . . . . . 402--412
Joseph Abate and
Gagan L. Choudhury and
Ward Whitt On the Laguerre Method for Numerically
Inverting Laplace Transforms . . . . . . 413--427
Jan Korst and
Emile Aarts and
Jan Karel Lenstra Scheduling Periodic Tasks . . . . . . . 428--435
Bruce Golden Appreciation to Referees . . . . . . . . 436--437
Mohan Bala and
Kipp Martin A mathematical programming approach to
data base normalization . . . . . . . . 1--14
Jonathan Eckstein How Much Communication Does Parallel
Branch and Bound Need? . . . . . . . . . 15--29
Gintaras Palubeckis A branch-and-bound approach using
polyhedral results for a clustering
problem . . . . . . . . . . . . . . . . 30--42
Djangir A. Babayev and
Fred Glover and
Jennifer Ryan A new knapsack solution approach by
integer equivalent aggregation and
consistency determination . . . . . . . 43--50
Ger Koole On the use of the power series algorithm
for general Markov processes, with an
application to a Petri net . . . . . . . 51--56
Pierre L'Ecuyer Bad lattice structures for vectors of
nonsuccessive values produced by some
linear recurrences . . . . . . . . . . . 57--60
Teodor Gabriel Crainic and
Michel Toulouse and
Michel Gendreau Toward a Taxonomy of Parallel Tabu
Search Heuristics . . . . . . . . . . . 61--72
Jacek Gondzio Presolve analysis of linear programs
prior to applying an interior point
method . . . . . . . . . . . . . . . . . 73--91
J. A. Hoogeveen and
S. L. van de Velde Earliness-tardiness scheduling around
almost equal due dates . . . . . . . . . 92--99
J. Bhadury and
V. Chandru and
A. Maheshwari and
R. Chandrasekaran Art Gallery Problems for Convex Nested
Polygons . . . . . . . . . . . . . . . . 100--110
John R. Birge State-of-the-Art-Survey --- Stochastic
Programming: Computation and
Applications . . . . . . . . . . . . . . 111--133
Gordon P. Wright and
N. Dan Worobetz and
Myong Kang and
Radha V. Mookerjee and
Radha Chandrasekharan OR/SM: a prototype integrated modeling
environment based on structured modeling 134--153
Richard D. McBride and
John W. Mamer Solving multicommodity flow problems
with a primal embedded network simplex
algorithm . . . . . . . . . . . . . . . 154--163
John W. Chinneck Finding a useful subset of constraints
for analysis in an infeasible linear
program . . . . . . . . . . . . . . . . 164--174
Gagan L. Choudhury and
Ward Whitt Probabilistic scaling for the numerical
inversion of nonprobability transforms 175--184
Christian H. Bischof and
Ali Bouaricha and
Peyvand M. Khademi and
Jorge J. Moré Computing gradients in large-scale
optimization using automatic
differentiation . . . . . . . . . . . . 185--194
Bryan L. Deuermeyer and
Guy L. Curry and
Andrew T. Duchowski and
Srilakshmi Venkatesh An Automatic Approach to Deadlock
Detection and Resolution in Discrete
Simulation Systems . . . . . . . . . . . 195--205
Pierre L'Ecuyer and
Raymond Couture An implementation of the lattice and
spectral tests for multiple recursive
linear random number generators . . . . 206--217
David M. Cohen and
Daniel P. Heyman and
Asya Rabinovitch and
Danit Brown A Parallel Implementation of the GTH
Algorithm . . . . . . . . . . . . . . . 218--223
D. J. Daley and
L. D. Servi Estimating Waiting Times from
Transactional Data . . . . . . . . . . . 224--229
Colin R. Reeves Feature Article --- Genetic Algorithms
for the Operations Researcher . . . . . 231--250
Ravindra K. Ahuja and
James B. Orlin Commentary --- Developing Fitter Genetic
Algorithms . . . . . . . . . . . . . . . 251--253
Aaron Kershenbaum Commentary --- When Genetic Algorithms
Work Best . . . . . . . . . . . . . . . 254--255
David Levine Commentary --- Genetic Algorithms: A
Practitioner's View . . . . . . . . . . 256--259
Peter Ross Commentary --- What Are Genetic
Algorithms Good at? . . . . . . . . . . 260--262
Colin R. Reeves Rejoinder --- Genetic Algorithms: No
Panacea, but a Valuable Tool for the
Operations Researcher . . . . . . . . . 263--265
Oleg V. Verner and
Roger L. Wainwright and
Dale A. Schoenefeld Placing Text Labels on Maps and Diagrams
using Genetic Algorithms with Masking 266--275
Srinivas R. Chakravarthy and
Lan Bin A finite capacity queue with nonrenewal
input and exponential dynamic group
services . . . . . . . . . . . . . . . . 276--287
Andrew G. Glen and
Lawrence M. Leemis and
John H. Drew A Generalized Univariate
Change-of-Variable Transformation
Technique . . . . . . . . . . . . . . . 288--295
George S. Fishman and
L. Stephen Yarberry An Implementation of the Batch Means
Method . . . . . . . . . . . . . . . . . 296--310
Kristin P. Bennett and
Erin J. Bredensteiner A Parametric Optimization Method for
Machine Learning . . . . . . . . . . . . 311--318
Armin Scholl and
Robert Klein SALOME: A Bidirectional Branch-and-Bound
Procedure for Assembly Line Balancing 319--334
Anulark Pinnoi and
Wilbert F. Wilhelm A Branch and Cut Approach for Workload
Smoothing on Assembly Lines . . . . . . 335--350
Jan Korst and
Emile Aarts and
Jan Karel Lenstra Scheduling Periodic Tasks with Slack . . 351--362
B. A. Kijowski and
U. S. Palekar Optimal resource assignment of
preemptive periodic tasks on multiple
processors . . . . . . . . . . . . . . . 363--373
Bharat K. Kaku and
Joseph B. Mazzola A Tabu-Search Heuristic for the Dynamic
Plant Layout Problem . . . . . . . . . . 374--384
Catherine K. Murphy and
Michel Benaroch Adding Value to Induced Decision Trees
for Time-Sensitive Data . . . . . . . . 385--396
Kaushal Chari and
Tarun K. Sen An Integrated Modeling System for
Structured Modeling Using Model Graphs 397--416
Wen-Chyuan Chiang and
Robert A. Russell A Reactive Tabu Search Metaheuristic for
the Vehicle Routing Problem with Time
Windows . . . . . . . . . . . . . . . . 417--430
Geon Cho and
Dong X. Shaw A depth-first dynamic programming
algorithm for the tree knapsack problem 431--438
\.I. Kuban Altìnel and
John Oommen and
Necati Aras Vector Quantization for Arbitrary
Distance Function Estimation . . . . . . 439--451
Geir Dahl and
Mechthild Stoer A cutting plane algorithm for
multicommodity survivable network design
problems . . . . . . . . . . . . . . . . 1--11
Michael R. Bartolacci and
S. David Wu A virtual clustering approach for
routing problems in telecommunication
networks . . . . . . . . . . . . . . . . 12--24
Frederick Kaefer and
June S. Park Interconnecting LANs and a FDDI Backbone
Using Transparent Bridges: A Model and
Solution Algorithms . . . . . . . . . . 25--39
Sabyasachi Mitra and
Ishwar Murthy A dual ascent procedure with valid
inequalities for designing hierarchical
network topologies . . . . . . . . . . . 40--55
Matthew J. Realff and
George Stephanopoulos On the application of explanation-based
learning to acquire control knowledge
for branch and bound algorithms . . . . 56--71
Marne C. Cario and
Barry L. Nelson Numerical Methods for Fitting and
Simulating Autoregressive-to-Anything
Processes . . . . . . . . . . . . . . . 72--81
Gianfranco Ciardo and
Joshua Gluckman and
David Nicol Distributed State Space Generation of
Discrete-State Stochastic Models . . . . 82--93
Enver Yücesan and
Lee Schruben Complexity of Simulation Models: A Graph
Theoretic Approach . . . . . . . . . . . 94--106
Edward Rothberg and
Bruce Hendrickson Sparse matrix ordering methods for
interior point linear programming . . . 107--113
R. Armstrong and
S. Gu and
L. Lei An efficient algorithm for a class of
two-resource allocation problems . . . . 114--120
Pablo Moscato and
Michael G. Norman On the performance of heuristics on
finite and infinite fractal instances of
the Euclidean traveling salesman problem 121--132
Matteo Fischetti and
Juan José Salazar González and
Paolo Toth Solving the orienteering problem through
branch-and-cut . . . . . . . . . . . . . 133--148
A. T. Ernst and
M. Krishnamoorthy An exact solution approach based on
shortest-paths for $p$-hub median
problems . . . . . . . . . . . . . . . . 149--162
Yu-Li Chou and
H. Edwin Romeijn and
Robert L. Smith Approximating shortest paths in
large-scale networks with an application
to intelligent transportation systems 163--179
Luis Gouveia Using variable redefinition for
computing lower bounds for minimum
spanning and Steiner trees with hop
constraints . . . . . . . . . . . . . . 180--188
Hemant K. Bhargava and
Ramayya Krishnan and
Peter Piela On Formal Semantics and Analysis of
Typed Modeling Languages: An Analysis of
Ascend . . . . . . . . . . . . . . . . . 189--208
P. S. Bradley and
O. L. Mangasarian and
W. N. Street Feature Selection via Mathematical
Programming . . . . . . . . . . . . . . 209--217
Jonathan Eckstein and
Michael C. Ferris Operator-splitting methods for monotone
affine variational inequalities, with a
parallel application to optimal control 218--235
Julia L. Higle Variance reduction and objective
function evaluation in stochastic linear
programs . . . . . . . . . . . . . . . . 236--247
István Maros and
Gautam Mitra Strategies for creating advanced bases
for large-scale linear programming
problems . . . . . . . . . . . . . . . . 248--260
H. Paul Williams and
John M. Wilson Connections between integer linear
programming and constraint logic
programming---an overview and
introduction to the cluster of articles 261--264
Les Proll and
Barbara Smith Integer linear programming and
constraint programming approaches to a
template design problem . . . . . . . . 265--275
Ken Darby-Dowman and
James Little Properties of some combinatorial
optimization problems and their effect
on the performance of integer
programming and constraint logic
programming . . . . . . . . . . . . . . 276--286
Alexander Bockmayr and
Thomas Kasper Branch and Infer: a unifying framework
for integer and finite domain constraint
programming . . . . . . . . . . . . . . 287--300
Hachemi Bennaceur and
Idir Gouachi and
Gérard Plateau An incremental branch-and-bound method
for the satisfiability problem . . . . . 301--308
Ram D. Gopal and
Paulo B. Goes and
Robert S. Garfinkel Interval protection of confidential
information in a database . . . . . . . 309--322
J. H. Dulá and
R. V. Helgason and
N. Venugopal An algorithm for identifying the frame
of a pointed finite conical hull . . . . 323--330
Rajeev Motwani and
Vijay Saraswat and
Eric Torng Online scheduling with lookahead:
multipass assembly lines . . . . . . . . 331--340
H. A. J. Crauwels and
C. N. Potts and
L. N. Van Wassenhove Local search heuristics for the single
machine total weighted tardiness
scheduling problem . . . . . . . . . . . 341--350
Robert A. Benhenni An Approximate Analysis of a UNIX Macro
Process Scheduler . . . . . . . . . . . 351--357
Hemant K. Bhargava and
Ramayya Krishnan Feature Article --- The World Wide Web:
Opportunities for Operations Research
and Management Science . . . . . . . . . 359--383
Gordon H. Bradley and
Arnold H. Buss Commentary --- Dynamic, Distributed,
Platform Independent OR/MS Applications
--- A Network Perspective . . . . . . . 384--387
Robert Fourer Commentary --- Predictions for Web
Technologies in Optimization . . . . . . 388--389
Arthur M. Geoffrion Commentary --- A New Horizon for OR/MS 390--392
Michael Trick \rbrackary --- The World Wide Web: It's
the Customers . . . . . . . . . . . . . 393--395
Hemant K. Bhargava and
Ramayya Krishnan Rejoinder --- OR/MS, Electronic
Commerce, and the Virtual INFORMS
Community . . . . . . . . . . . . . . . 396--398
Sumit Sarkar and
Deb Ghosh Partitioning the Attribute Set for a
Probabilistic Reasoning System . . . . . 399--416
E. Andrew Boyd and
Rusty Burlingame and
Kenneth Lindsay An Efficient Algorithm for Solving an
Air Traffic Management Model of the
National Airspace System . . . . . . . . 417--426
Zonghao Gu and
George L. Nemhauser and
Martin W. P. Savelsbergh Lifted cover inequalities for $0$--$1$
integer programs: computation . . . . . 427--437
E. C. Sewell A branch and bound algorithm for the
stability number of a sparse graph . . . 438--447
Carl M. Harris and
William G. Marchal Distribution Estimation Using Laplace
Transforms . . . . . . . . . . . . . . . 448--458
Bruce L. Golden Appreciation to Referees . . . . . . . . 459--460
Laurent Michel and
Pascal Van Hentenryck LOCALIZER: a modeling language for local
search . . . . . . . . . . . . . . . . . 1--14
Kate A. Smith Neural networks for combinatorial
optimization: a review of more than a
decade of research . . . . . . . . . . . 15--34
Mark Fleischer and
Sheldon H. Jacobson Information theory and the finite-time
behavior of the simulated annealing
algorithm: experimental results . . . . 35--43
Manuel Laguna and
Rafael Marti GRASP and Path Relinking for $2$-Layer
Straight Line Crossing Minimization . . 44--52
Alain Hertz and
Gilbert Laporte and
Pierrette Nanchen Hugo Improvement procedures for the
undirected rural postman problem . . . . 53--62
Olivier Guieu and
John W. Chinneck Analyzing infeasible mixed-integer and
integer linear programs . . . . . . . . 63--77
Zhi-Long Chen and
Warren B. Powell Solving parallel machine scheduling
problems by column generation . . . . . 78--94
Erling D. Andersen On exploiting problem structure in a
basis identification procedure for
linear programming . . . . . . . . . . . 95--103
W. E. Wilhelm and
Pradip Som Analysis of stochastic assembly with
GI-distributed assembly time . . . . . . 104--116
Zonghao Gu and
George L. Nemhauser and
Martin W. P. Savelsbergh Lifted Cover Inequalities for $0$--$1$
Integer Programs: Complexity . . . . . . 117--123
Alberto Caprara and
David Pisinger and
Paolo Toth Exact Solution of the Quadratic Knapsack
Problem . . . . . . . . . . . . . . . . 125--137
William Cook and
André Rohe Computing Minimum-Weight Perfect
Matchings . . . . . . . . . . . . . . . 138--148
Jeffery L. Kennington and
Jason E. Whitler An efficient decomposition algorithm to
optimize spare capacity in a
telecommunications network . . . . . . . 149--160
James P. Kelly and
Jiefeng Xu A set-partitioning-based heuristic for
the vehicle routing problem . . . . . . 161--172
J. T. Linderoth and
M. W. P. Savelsbergh A computational study of search
strategies for mixed integer programming 173--187
Larry J. LeBlanc and
Jerome Chifflet and
Philippe Mahey Packet routing in telecommunication
networks with path and flow restrictions 188--197
Charles Fleurent and
Fred Glover Improved constructive multistart
strategies for the quadratic assignment
problem using adaptive memory . . . . . 198--204
Gérard Cornuéjols and
Milind Dawande A class of hard small $0$--$1$ programs 205--210
Gerhard J. Woeginger An approximation scheme for minimizing
agreeably weighted variance on a single
machine . . . . . . . . . . . . . . . . 211--216
P. S. Bradley and
Usama M. Fayyad and
O. L. Mangasarian Mathematical programming for data
mining: formulations and challenges . . 217--238
Hemant K. Bhargava Data Mining by Decomposition: Adaptive
Search for Hypothesis Generation . . . . 239--247
Siddhartha Bhattacharyya Direct Marketing Performance Modeling
Using Genetic Algorithms . . . . . . . . 248--257
Selwyn Piramuthu Feature Selection for Financial
Credit-Risk Evaluation Decisions . . . . 258--266
Akhil Kumar and
Ignacio Olmeda A Study of Composite or Hybrid
Classifiers for Knowledge Discovery . . 267--277
Michael V. Mannino and
Vijay S. Mookerjee Optimizing Expert Systems: Heuristics
for Efficiently Generating Low-Cost
Information Acquisition Strategies . . . 278--291
Igor Averbakh and
Oded Berman Parallel Complexity of Additive Location
Problems . . . . . . . . . . . . . . . . 292--298
Prabhudev Konana and
Sudha Ram Semantics-Based Transaction Processing
for Real-Time Databases: The Case of
Automated Stock Trading . . . . . . . . 299--315
Harvey J. Greenberg Matrix sensitivity analysis from an
interior solution of a linear program 316--327
Anonymous APMOD 2000 . . . . . . . . . . . . . . . 328--328
William J. Wolfe A fuzzy Hopfield--Tank traveling
salesman problem model . . . . . . . . . 329--344
Andrea Lodi and
Silvano Martello and
Daniele Vigo Heuristic and metaheuristic approaches
for a class of two-dimensional bin
packing problems . . . . . . . . . . . . 345--357
Vittorio Maniezzo Exact and approximate nondeterministic
tree-search procedures for the quadratic
assignment problem . . . . . . . . . . . 358--369
Antonio Frangioni and
Giorgio Gallo A bundle type dual-ascent approach to
linear multicommodity min-cost flow
problems . . . . . . . . . . . . . . . . 370--393
Joseph Abate and
Ward Whitt Computing Laplace transforms for
numerical inversion via continued
fractions . . . . . . . . . . . . . . . 394--405
Zeger Degraeve and
Linus Schrage Optimal integer solutions to industrial
cutting stock problems . . . . . . . . . 406--419
Brett W. Schug and
Matthew J. Realff Propagation of interval values in simple
processing networks . . . . . . . . . . 420--431
W. David Kelton From the Editor . . . . . . . . . . . . 1--1
Ellis L. Johnson and
George L. Nemhauser and
Martin W. P. Savelsbergh Progress in linear programming-based
algorithms for integer programming: an
exposition . . . . . . . . . . . . . . . 2--23
Marie Coffin and
Matthew J. Saltzman Statistical Analysis of Computational
Tests of Algorithms and Heuristics . . . 24--44
Robert E. Bixby and
Alexander Martin Parallelizing the Dual Simplex Method 45--56
Gerhard J. Woeginger When does a dynamic programming
formulation guarantee the existence of a
fully polynomial time approximation
scheme (FPTAS)? . . . . . . . . . . . . 57--74
David Pisinger A Minimal Algorithm for the Bounded
Knapsack Problem . . . . . . . . . . . . 75--82
W. David Kelton From the Editor . . . . . . . . . . . . 83--83
Anindya Datta and
Igor R. Viguier Handling Sensor Data in Rapidly Changing
Environments to Support Soft Real-Time
Requirements . . . . . . . . . . . . . . 84--103
Igor Averbakh and
Oded Berman Minmax regret median location on a
network under uncertainty . . . . . . . 104--110
J. M. van den Akker and
C. A. J. Hurkens and
M. W. P. Savelsbergh Time-indexed formulations for machine
scheduling problems: column generation 111--124
W. J. Gutjahr and
C. Strauss and
E. Wagner A Stochastic Branch-and-Bound Approach
to Activity Crashing in Project
Management . . . . . . . . . . . . . . . 125--135
Daniel J. Rosenkrantz and
Giri K. Tayi and
S. S. Ravi Algorithms for path-based placement of
inspection stations on networks . . . . 136--149
Jatinder N. D. Gupta and
Randall S. Sexton and
Enar A. Tunc Selecting scheduling heuristics using
neural networks . . . . . . . . . . . . 150--162
W. David Kelton From the Editor . . . . . . . . . . . . 163--163
Marcelo Prais and
Celso C. Ribeiro Reactive GRASP: an application to a
matrix decomposition problem in TDMA
traffic assignment . . . . . . . . . . . 164--176
Stefan E. Karisch and
Franz Rendl and
Jens Clausen Solving graph bisection problems with
semidefinite programming . . . . . . . . 177--191
K. Aardal and
R. E. Bixby and
C. A. J. Hurkens and
A. K. Lenstra and
J. W. Smeltink Market split and basis reduction:
towards a solution of the
Cornuéjols--Dawande instances . . . . . . 192--202
Peter Buchholz and
Gianfranco Ciardo and
Susanna Donatelli and
Peter Kemper Complexity of memory-efficient Kronecker
operations with applications to the
solution of Markov models . . . . . . . 203--222
Teodor Gabriel Crainic and
Michel Gendreau and
Judith M. Farvolden A simplex-based tabu search method for
capacitated network design . . . . . . . 223--236
Luca Maria Gambardella and
Marco Dorigo An ant colony system hybridized with a
new local search for the sequential
ordering problem . . . . . . . . . . . . 237--255
Saul I. Gass and
Donald Gross In Memoriam: Carl M. Harris . . . . . . 257--260
Carl M. Harris and
Percy H. Brill and
Martin J. Fischer Internet-Type Queues with Power-Tailed
Interarrival Times and Computational
Methods for Their Analysis . . . . . . . 261--271
David G. Humphrey and
James R. Wilson A revised simplex search procedure for
stochastic simulation response surface
optimization . . . . . . . . . . . . . . 272--283
Hanif D. Sherali and
J. Cole Smith and
Youngho Lee Enhanced Model Representations for an
Intra-Ring Synchronous Optical Network
Design Problem Allowing Demand Splitting 284--298
Mark Vroblefski and
R. Ramesh and
Stanley Zionts General open and closed queueing
networks with blocking: a unified
framework for approximation . . . . . . 299--316
José-Miguel Díaz-Báñez and
Francisco Gómez and
Ferran Hurtado Approximation of Point Sets by
$1$-Corner Polygonal Chains . . . . . . 317--323
Spyros Kontogiorgis Practical piecewise-linear approximation
for monotropic optimization . . . . . . 324--340
Francis Sourd and
Wim Nuijten Multiple-machine lower bounds for
shop-scheduling problems . . . . . . . . 341--352
Anonymous Appreciation to Referees . . . . . . . . 353--355
Anonymous Author Index . . . . . . . . . . . . . . 356--357
Anonymous Subject Classification and Key Word
Index to Volume 12 . . . . . . . . . . . 358--360
W. David Kelton From the Editor . . . . . . . . . . . . 1--1
Ram D. Gopal and
R. Ramesh and
Stanley Zionts Cascade Graphs: Design, Analysis and
Algorithms for Relational Joins . . . . 2--28
Joel A. Shapiro and
Warren B. Powell and
David Bernstein A Flexible Java Representation for
Uncertainty in Online
Operations-Research Models . . . . . . . 29--55
Egon Balas and
Neil Simonetti Linear time dynamic-programming
algorithms for new classes of restricted
TSPs: a computational study . . . . . . 56--75
Michael O. Ball and
Andrew Vakhutinsky Fault-Tolerant Virtual Path Layout in
ATM Networks . . . . . . . . . . . . . . 76--94
H. P. Williams and
Hong Yan Representations of the all\_different
Predicate of Constraint Satisfaction in
Integer Programming . . . . . . . . . . 96--103
Dorit S. Hochbaum and
Eli V. Olinick The Bounded Cycle-Cover Problem . . . . 104--119
C. A. Glass and
C. N. Potts and
V. A. Strusevich Scheduling batches with sequential job
processing for two-machine flow and open
shops . . . . . . . . . . . . . . . . . 120--137
Michiel Blom and
Sven O. Krumke and
Willem E. de Paepe and
Leen Stougie The Online TSP Against Fair Adversaries 138--148
Christos Alexopoulos and
David Goldsman and
Gamze Tokol Properties of batched quadratic-form
variance parameter estimators for
simulations . . . . . . . . . . . . . . 149--156
Han Hoogeveen and
Petra Schuurman and
Gerhard J. Woeginger Non-approximability results for
scheduling problems with minsum criteria 157--168
Csaba Mészáros and
Jacek Gondzio Addendum to: ``Presolve analysis of
linear programs prior to applying an
interior point method'' [INFORMS J.
Comput. \bf 9 (1997), no. 1, 73--91;
MR1478041 (99a:90120)] by Gondzio . . . 169--170
W. David Kelton From the Editor . . . . . . . . . . . . 171--171
M. L. Chaudhry and
U. C. Gupta and
V. Goswami Modeling and analysis of discrete-time
multiserver queues with batch arrivals:
$ G I^X / {\rm Geom} / m $ . . . . . . . 172--180
Jeffery L. Kennington and
Mark W. Lewis The Path Restoration Version of the
Spare Capacity Allocation Problem with
Modularity Restrictions: Models,
Algorithms, and an Empirical Analysis 181--190
Jeff T. Linderoth and
Eva K. Lee and
Martin W. P. Savelsbergh A parallel, linear programming-based
heuristic for large-scale set
partitioning problems . . . . . . . . . 191--209
John W. Chinneck Fast Heuristics for the Maximum Feasible
Subsystem Problem . . . . . . . . . . . 210--223
Alberto Caprara and
Giuseppe Lancia and
See-Kiong Ng Sorting permutations by reversals
through branch-and-price . . . . . . . . 224--244
Steven Chamberland and
Brunilde Sans\`o On the Design Problem of Multitechnology
Networks . . . . . . . . . . . . . . . . 245--256
W. David Kelton From the Editor . . . . . . . . . . . . 257--257
Vipul Jain and
Ignacio E. Grossmann Algorithms for hybrid MILP/CP models for
a class of optimization problems . . . . 258--276
Natalie M. Steiger and
James R. Wilson Convergence Properties of the Batch
Means Method for Simulation Output
Analysis . . . . . . . . . . . . . . . . 277--293
Todd S. Munson and
Francisco Facchinei and
Michael C. Ferris and
Andreas Fischer and
Christian Kanzow The semismooth algorithm for large scale
complementarity problems . . . . . . . . 294--311
Huifen Chen Initialization for NORTA: generation of
random vectors with specified marginals
and correlations . . . . . . . . . . . . 312--331
Xiao-Bai Li and
James Sweigart and
James Teng and
Joan Donohue and
Lori Thombs A Dynamic Programming Based Pruning
Method for Decision Trees . . . . . . . 332--344
Felisa J. Vázquez-Abad and
Sheldon H. Jacobson Phantom harmonic gradient estimators for
nonpreemptive priority queueing systems 345--359
Constantine N. Goulimis Technical note on: ``Optimal integer
solutions to industrial cutting stock
problems'' [INFORMS J. Comput. \bf 11
(1999), no. 4, 406--419; 1758626] by Z.
Degraeve and L. Schrage . . . . . . . . 360--360
W. David Kelton From the Editor . . . . . . . . . . . . 1--1
David Goldsman and
Seong-Hee Kim and
William S. Marshall and
Barry L. Nelson Ranking and selection for steady-state
simulation: procedures and perspectives 2--19
Giovanni Felici and
Klaus Truemper A MINSAT Approach for Learning in Logic
Domains . . . . . . . . . . . . . . . . 20--36
Marjan van den Akker and
Han Hoogeveen and
Steef van de Velde Combining column generation and
Lagrangean relaxation to solve a
single-machine common due date problem 37--51
Richard K. Congram and
Chris N. Potts and
Steef L. van de Velde An iterated dynasearch algorithm for the
single-machine total weighted tardiness
scheduling problem . . . . . . . . . . . 52--67
George J. Kyparisis and
Christos Koulamas Assembly-line scheduling with concurrent
operations and parallel machines . . . . 68--80
James P. Brumbaugh-Smith and
Douglas R. Shier Minimax Models for Diverse Routing . . . 81--95
W. David Kelton From the Editor . . . . . . . . . . . . 97--97
Jean-Paul Watson and
Laura Barbulescu and
L. Darrell Whitley and
Adele E. Howe Contrasting structured and random
permutation flow-shop scheduling
problems: search-space topology and
algorithm performance . . . . . . . . . 98--123
Morganna Carmem Diniz and
Edmundo de Souza e Silva and
H. Richard Gail Calculating the distribution of a linear
combination of uniform order statistics 124--131
David Applegate and
William Cook and
Sanjeeb Dash and
André Rohe Solution of a Min-Max Vehicle Routing
Problem . . . . . . . . . . . . . . . . 132--143
Vetle I. Torvik and
Evangelos Triantaphyllou Minimizing the average query complexity
of learning monotone Boolean functions 144--174
Tjark Vredeveld and
Cor Hurkens Experimental comparison of approximation
algorithms for scheduling unrelated
parallel machines . . . . . . . . . . . 175--189
W. David Kelton From the Editor . . . . . . . . . . . . 191--191
Michael C. Fu Feature Article: Optimization for
simulation: Theory vs. Practice . . . . 192--215
Sigrún Andradóttir Simulation Optimization: Integrating
Research and Practice . . . . . . . . . 216--219
Peter W. Glynn Additional Perspectives on Simulation
for Optimization . . . . . . . . . . . . 220--222
James P. Kelly Simulation Optimization is Evolving . . 223--225
Michael C. Fu Simulation Optimization in the Future:
Evolution or Revolution? . . . . . . . . 226--227
Celso C. Ribeiro and
Eduardo Uchoa and
Renato F. Werneck A hybrid GRASP with perturbations for
the Steiner problem in graphs . . . . . 228--246
Morten Riis and
Kim Allan Andersen Capacitated Network Design with
Uncertain Demand . . . . . . . . . . . . 247--260
Steve Derkic and
James E. Stafford Symbolic Computation of Moments in
Priority Queues . . . . . . . . . . . . 261--277
Jackie Rees and
Gary J. Koehler An Evolutionary Approach to Group
Decision Making . . . . . . . . . . . . 278--292
John W. Chinneck From the Guest Editor: Special Issue on
the Merging of Mathematical Programming
and Constraint Programming . . . . . . . 293--294
John N. Hooker Logic, Optimization, and Constraint
Programming . . . . . . . . . . . . . . 295--321
Robert Fourer and
David M. Gay Extending an algebraic modeling language
to support constraint programming . . . 322--344
Pascal Van Hentenryck Constraint and Integer Programming in
OPL . . . . . . . . . . . . . . . . . . 345--372
Bruce Davey and
Natashia Boland and
Peter J. Stuckey Efficient intelligent backtracking using
linear programming . . . . . . . . . . . 373--386
Michela Milano and
Greger Ottosson and
Philippe Refalo and
Erlendur S. Thorsteinsson The role of integer programming
techniques in constraint programming's
global constraints . . . . . . . . . . . 387--402
Filippo Focacci and
Andrea Lodi and
Michela Milano A Hybrid Exact Algorithm for the TSPTW 403--417
W. David Kelton Appreciation to Referees . . . . . . . . 418--420
W. David Kelton From the Editor . . . . . . . . . . . . 1--1
Anonymous Institute for Operations Research and
the Management Sciences . . . . . . . . 2--2
Zhiwei Fu and
Bruce L. Golden and
Shreevardhan Lele and
S. Raghavan and
Edward A. Wasil A genetic algorithm-based approach for
building accurate decision trees . . . . 3--22
Eva K. Lee and
Richard J. Gallagher and
David A. Patterson A linear programming approach to
discriminant analysis with a
reserved-judgment region . . . . . . . . 23--41
Kaj Holmberg and
Di Yuan A multicommodity network-flow problem
with side constraints on paths solved by
column generation . . . . . . . . . . . 42--57
Zeger Degraeve and
Marc Peeters Optimal Integer Solutions to Industrial
Cutting-Stock Problems: Part 2,
Benchmark Results . . . . . . . . . . . 58--81
David Applegate and
William Cook and
André Rohe Chained Lin--Kernighan for large
traveling salesman problems . . . . . . 82--92
Alberto Caprara The Reversal Median Problem . . . . . . 93--113
Michael R. Bussieck and
Arne Stolbjerg Drud and
Alexander Meeraus MINLPLib---a collection of test models
for mixed-integer nonlinear programming 114--119
Alexander Tuzhilin and
Louiqa Raschid From the Guest Co-Editors . . . . . . . 121--122
Cyrus Shahabi and
Farnoush Banaei-Kashani Efficient and Anonymous Web-Usage Mining
for Web Personalization . . . . . . . . 123--147
Zhiqiang Zheng and
Balaji Padmanabhan and
Steven O. Kimbrough On the Existence and Significance of
Data Preprocessing Biases in Web-Usage
Mining . . . . . . . . . . . . . . . . . 148--170
Myra Spiliopoulou and
Bamshad Mobasher and
Bettina Berendt and
Miki Nakagawa A Framework for the Evaluation of
Session Reconstruction Heuristics in
Web-Usage Analysis . . . . . . . . . . . 171--190
Jaideep Srivastava and
Robert Cooley Web Business Intelligence: Mining the
Web for Actionable Knowledge . . . . . . 191--207
Alexander Strehl and
Joydeep Ghosh Relationship-Based Clustering and
Visualization for High-Dimensional Data
Mining . . . . . . . . . . . . . . . . . 208--230
David Kelton From the Editor . . . . . . . . . . . . 231--231
Anonymous Institute for Operations Research and
the Management Sciences . . . . . . . . 232--232
William Cook and
Paul Seymour Tour Merging via Branch-Decomposition 233--248
Robert M. Nauss Solving the generalized assignment
problem: an optimizing and heuristic
approach . . . . . . . . . . . . . . . . 249--266
Oluf Faroe and
David Pisinger and
Martin Zachariasen Guided Local Search for the
Three-Dimensional Bin-Packing Problem 267--283
Sven de Vries and
Rakesh V. Vohra Combinatorial Auctions: A Survey . . . . 284--309
Silvano Martello and
Michele Monaci and
Daniele Vigo An Exact Approach to the Strip-Packing
Problem . . . . . . . . . . . . . . . . 310--319
Zvi Drezner A new genetic algorithm for the
quadratic assignment problem . . . . . . 320--330
Anonymous From the Editor . . . . . . . . . . . . 331--331
Anonymous Institute for Operations Research and
the Management Sciences . . . . . . . . 332--332
Paolo Toth and
Daniele Vigo The granular tabu search and its
application to the vehicle-routing
problem . . . . . . . . . . . . . . . . 333--346
Olli Bräysy A reactive variable neighborhood search
for the vehicle-routing problem with
time windows . . . . . . . . . . . . . . 347--368
Paola Cappanera and
Antonio Frangioni Symmetric and asymmetric parallelization
of a cost-decomposition algorithm for
multicommodity flow problems . . . . . . 369--384
Gérard Cornuéjols and
Yanjun Li and
Dieter Vandenbussche K-Cuts: A Variation of Gomory Mixed
Integer Cuts from the LP Tableau . . . . 385--396
Ricki G. Ingalls and
Douglas J. Morrice and
Enver Yücesan and
Andrew B. Whinston Execution conditions: a formalization of
event cancellation in simulation graphs 397--411
Winfried K. Grassmann The use of eigenvalues for finding
equilibrium probabilities of certain
Markovian two-dimensional queueing
problems . . . . . . . . . . . . . . . . 412--421
Anonymous Appreciation to Referees . . . . . . . . 422--425
Anonymous Author Index . . . . . . . . . . . . . . 426--427
Anonymous Key Word Index . . . . . . . . . . . . . 428--429
W. David Kelton From the Editor . . . . . . . . . . . . 1--1
Anonymous Institute for Operations Research and
the Management Sciences . . . . . . . . 2--2
Eva K. Lee Generating cutting planes for mixed
integer programming problems in a
parallel computing environment . . . . . 3--26
Zong-Zhi Lin and
James C. Bean and
Chelsea C. White A hybrid genetic/optimization algorithm
for finite-horizon, partially observed
Markov decision processes . . . . . . . 27--38
Wilbert E. Wilhelm and
Radu Gadidov A Branch-and-Cut Approach for a Generic
Multiple-Product, Assembly-System Design
Problem . . . . . . . . . . . . . . . . 39--55
Alexandra Makri and
Diego Klabjan A New Pricing Scheme for Airline Crew
Scheduling . . . . . . . . . . . . . . . 56--67
Mihoko V. Bennett and
Thomas R. Willemain The Filtered Nearest Neighbor Method for
Generating Low-Discrepancy Sequences . . 68--72
Gyana R. Parija and
Shabbir Ahmed and
Alan J. King On Bridging the Gap Between Stochastic
Integer Programming and MIP Solver
Technologies . . . . . . . . . . . . . . 73--83
Sourour Elloumi and
Martine Labbé and
Yves Pochet A new formulation and resolution method
for the $p$-center problem . . . . . . . 84--94
Syam Menon and
Ali Amiri Scheduling Banner Advertisements on the
Web . . . . . . . . . . . . . . . . . . 95--105
W. David Kelton From the Editor . . . . . . . . . . . . 107--107
Anonymous Institute for Operations Research and
the Management Sciences . . . . . . . . 108--108
Richard D. McBride and
John W. Mamer Implementing an LU factorization for the
embedded network simplex algorithm . . . 109--119
Willem E. de Paepe and
Jan Karel Lenstra and
Jiri Sgall and
René A. Sitters and
Leen Stougie Computer-aided complexity classification
of dial-a-ride problems . . . . . . . . 120--132
Mutsunori Yagiura and
Toshihide Ibaraki and
Fred Glover An ejection chain approach for the
generalized assignment problem . . . . . 133--151
John F. Shortle and
Percy H. Brill and
Martin J. Fischer and
Donald Gross and
Denise M. B. Masi An algorithm to compute the waiting time
distribution for the $ M / G / 1 $ queue 152--161
Jeffery L. Kennington and
Karen R. Lewis Generalized networks: the theory of
preprocessing and an empirical analysis 162--173
Jeffery L. Kennington and
Eli V. Olinick Wavelength translation in WDM networks:
optimization models and solution
procedures . . . . . . . . . . . . . . . 174--187
Alain Billionnet and
Éric Soutif Using a mixed integer programming tool
for solving the 0-1 quadratic knapsack
problem . . . . . . . . . . . . . . . . 188--197
Francis Sourd The continuous assignment problem and
its application to preemptive and
non-preemptive scheduling with irregular
cost functions . . . . . . . . . . . . . 198--208
W. David Kelton From the Editor . . . . . . . . . . . . 209--209
Anonymous Institute for Operations Research and
the Management Sciences . . . . . . . . 210--210
Harvey J. Greenberg and
William E. Hart and
Giuseppe Lancia Opportunities for combinatorial
optimization in computational biology 211--231
Jacek B\la\.zewicz and
Fred Glover and
Marta Kasprzak DNA Sequencing --- Tabu and Scatter
Search Combined . . . . . . . . . . . . 232--240
Sadan Kulturel-Konak and
Bryan A. Norman and
David W. Coit and
Alice E. Smith Exploiting tabu search memory in
constrained problems . . . . . . . . . . 241--254
John W. Chinneck The constraint consensus method for
finding approximately feasible points in
nonlinear programs . . . . . . . . . . . 255--265
Barry L. Nelson and
Michael R. Taaffe The Pht/Pht/$ \infty $ Queueing System:
Part I --- The Single Node . . . . . . . 266--274
Barry L. Nelson and
Michael R. Taaffe The [Pht/Pht/$ \infty $]K Queueing
System: Part II --- The Multiclass
Network . . . . . . . . . . . . . . . . 275--283
Hui-Chin Tang and
Chiang Kao Searching for good multiple recursive
random number generators via a genetic
algorithm . . . . . . . . . . . . . . . 284--290
K. A. Ariyawansa and
Andrew J. Felt On a new collection of stochastic linear
programming test problems . . . . . . . 291--299
Amy N. Langville and
William J. Stewart Testing the nearest Kronecker product
preconditioner on Markov chains and
stochastic automata networks . . . . . . 300--315
Yves Pochet and
Mathieu Van Vyve A General Heuristic for Production
Planning Problems . . . . . . . . . . . 316--327
Harvey J. Greenberg From the guest editor for the special
issue on computational molecular
biology/bioinformatics . . . . . . . . . 329--330
David S. H. Chew and
Kwok Pui Choi and
Hans Heidner and
Ming-Ying Leung Palindromes in SARS and Other
Coronaviruses . . . . . . . . . . . . . 331--340
Yonil Park and
John L. Spouge Searching for Multiple Words in a Markov
Sequence . . . . . . . . . . . . . . . . 341--347
Giuseppe Lancia and
Maria Cristina Pinotti and
Romeo Rizzi Haplotyping populations by pure
parsimony: complexity of exact and
approximation algorithms . . . . . . . . 348--359
Gad Kimmel and
Roded Sharan and
Ron Shamir Computational problems in noisy SNP and
haplotype analysis: block scores, block
identification, and population
stratification . . . . . . . . . . . . . 360--370
Jonathan P. K. Doye and
Robert H. Leary and
Marco Locatelli and
Fabio Schoen Global Optimization of Morse Clusters by
Potential Energy Transformations . . . . 371--379
Bernard Chazelle and
Carl Kingsford and
Mona Singh A semidefinite programming approach to
side chain positioning with new rounding
strategies . . . . . . . . . . . . . . . 380--392
Rumen Andonov and
Stefan Balev and
Nicola Yanev Protein threading: from mathematical
models to parallel implementations . . . 393--405
Genetha Anne Gray and
Tamara G. Kolda and
Ken Sale and
Malin M. Young Optimizing an empirical scoring function
for transmembrane protein structure
determination . . . . . . . . . . . . . 406--418
Cláudio N. Meneses and
Zhaosong Lu and
Carlos A. S. Oliveira and
Panos M. Pardalos Optimal solutions for the closest-string
problem via integer programming . . . . 419--429
Winfried Just and
Gianluca Della Vedova Multiple sequence alignment as a
facility-location problem . . . . . . . 430--440
Abdullah N. Arslan and
Ömer E\ugecio\uglu Dynamic programming based approximation
algorithms for sequence alignment with
constraints . . . . . . . . . . . . . . 441--458
Dan Gusfield and
Satish Eddhu and
Charles Langley The Fine Structure of Galls in
Phylogenetic Networks . . . . . . . . . 459--469
Courtney Stanton and
J. MacGregor Smith Steiner Trees and $3$-D Macromolecular
Conformation . . . . . . . . . . . . . . 470--485
W. David Kelton Appreciation to Referees . . . . . . . . 486--489
Anonymous Author Index . . . . . . . . . . . . . . 490--491
Anonymous Key Word Index . . . . . . . . . . . . . 492--493
Anonymous Institute for Operations Research and
the Management Sciences: Board of
Directors and Editors for 2004 . . . . . 494--494
Anonymous From the Editor . . . . . . . . . . . . 1--1
Anonymous Institute for Operations Research and
the Management Sciences: Board of
Directors and Editors for 2005 . . . . . 2--2
Eric L. Savage and
Lee W. Schruben and
Enver Yücesan On the Generality of Event-Graph Models 3--9
Teodor Gabriel Crainic and
Federico Malucelli and
Maddalena Nonato and
François Guertin Meta-heuristics for a class of
demand-responsive transit systems . . . 10--24
W. Nick Street Oblique multicategory decision trees
using nonlinear programming . . . . . . 25--31
Siwate Rojanasoonthon and
Jonathan Bard A GRASP for parallel machine scheduling
with time windows . . . . . . . . . . . 32--51
Sophie Demassey and
Christian Artigues and
Philippe Michelon Constraint-propagation-based cutting
planes: an application to the
resource-constrained project scheduling
problem . . . . . . . . . . . . . . . . 52--65
Michael Tortorella Numerical solutions of renewal-type
integral equations . . . . . . . . . . . 66--74
Dae W. Choi and
Nam K. Kim and
Kyung C. Chae A two-moment approximation for the $ G I
/ G / c $ queue with finite capacity . . 75--81
Paola Cappanera and
Marco Trubian A local-search-based heuristic for the
demand-constrained multidimensional
knapsack problem . . . . . . . . . . . . 82--98
Yong Tan and
Kamran Moinzadeh and
Vijay S. Mookerjee Optimal processing policies for an
e-commerce web server . . . . . . . . . 99--110
Vicente Campos and
Manuel Laguna and
Rafael Martí Context-independent scatter and tabu
search for permutation problems . . . . 111--122
Martin W. P. Savelsbergh and
R. N. Uma and
Joel Wein An experimental study of LP-based
approximation algorithms for scheduling
problems . . . . . . . . . . . . . . . . 123--136
Anonymous From the Editor . . . . . . . . . . . . 137--137
Anonymous Institute for Operations Research and
the Management Sciences: Board of
Directors and Editors for 2005 . . . . . 138--138
Robert Fourer and
Leo Lopes and
Kipp Martin LPFML: a W3C XML schema for linear and
integer programming . . . . . . . . . . 139--158
Vardges Melkonian and
Éva Tardos Primal-dual-based algorithms for a
directed network design problem . . . . 159--174
José M. Valério de Carvalho Using extra dual cuts to accelerate
column generation . . . . . . . . . . . 175--182
Pasquale Avella and
Maurizio Boccia and
Bernardo D'Auria Near-optimal solutions of large-scale
single-machine scheduling problems . . . 183--191
Michel Denault and
Jean-Louis Goffin The analytic-center cutting-plane method
for variational inequalities: a
quadratic-cut approach . . . . . . . . . 192--206
Eduardo Camponogara and
Sarosh N. Talukdar Designing communication networks to
decompose network control problems . . . 207--223
Renata M. Aiex and
Mauricio G. C. Resende and
Panos M. Pardalos and
Gerardo Toraldo GRASP with path relinking for
three-index assignment . . . . . . . . . 224--247
Neil Keon and
G. ``Anand'' Anandalingam A new pricing model for competitive
telecommunications services using
congestion discounts . . . . . . . . . . 248--262
Jack P. C. Kleijnen and
Susan M. Sanchez and
Thomas W. Lucas and
Thomas M. Cioppa State-of-the-Art Review: A User's Guide
to the Brave New World of Designing
Simulation Experiments . . . . . . . . . 263--289
Bruce Golden and
S. Raghavan and
Daliborka Stanojevi\'c Heuristic search for the generalized
minimum spanning tree problem . . . . . 290--304
Ann Vandevelde and
Han Hoogeveen and
Cor Hurkens and
Jan Karel Lenstra Lower Bounds for the Head-Body-Tail
Problem on Parallel Machines: A
Computational Study of the
Multiprocessor Flow Shop . . . . . . . . 305--320
J. Cole Smith and
Sheldon H. Jacobson An Analysis of the Alias Method for
Discrete Random-Variate Generation . . . 321--327
Lorenzo Brunetta and
Philippe Grégoire A general purpose algorithm for
three-dimensional packing . . . . . . . 328--338
Sigurdur Ólafsson and
Jaekyung Yang Intelligent Partitioning for Feature
Selection . . . . . . . . . . . . . . . 339--355
Alberto Caprara and
Juan-José Salazar-González Laying out sparse graphs with provably
minimum bandwidth . . . . . . . . . . . 356--373
Daniel D. Zeng and
J. Leon Zhao Effective Role Resolution in Workflow
Management . . . . . . . . . . . . . . . 374--387
Anonymous Institute for Operations Research and
the Management Sciences: Board of
Directors and Editors for 2005 . . . . . 388--388
Laurent Michel and
Pascal Van Hentenryck A modeling layer for
constraint-programming libraries . . . . 389--401
Illya V. Hicks Planar branch decompositions. I. The
ratcatcher . . . . . . . . . . . . . . . 402--412
Illya V. Hicks Planar branch decompositions. II. The
cycle method . . . . . . . . . . . . . . 413--421
Minghe Sun Warm-start routines for solving
augmented weighted Tchebycheff network
programs in multiple-objective network
programming . . . . . . . . . . . . . . 422--437
Diane E. Vaughan and
Sheldon H. Jacobson and
Shane N. Hall and
Laura A. McLay Simultaneous generalized hill-climbing
algorithms for addressing sets of
discrete optimization problems . . . . . 438--450
Igor Averbakh The minmax relative regret median
problem on networks . . . . . . . . . . 451--461
R. Chandrasekaran and
Young U. Ryu and
Varghese S. Jacob and
Sungchul Hong Isotonic Separation . . . . . . . . . . 462--474
Joni L. Jones and
Gary J. Koehler A heuristic for winner determination in
rule-based combinatorial auctions . . . 475--489
Anonymous Institute for Operations Research and
the Management Sciences: Board of
Directors and Editors for 2005 . . . . . 490--490
Anonymous Appreciation to Referees . . . . . . . . 491--493
Anonymous Author Index . . . . . . . . . . . . . . 494--495
Anonymous Key Word Index . . . . . . . . . . . . . 496--497
Anonymous From the Editor . . . . . . . . . . . . 1--1
Anonymous Institute for Operations Research and
the Management Sciences --- Board of
Directors and Editors for 2006 . . . . . 2--2
Michael E. Kuhl and
Sachin G. Sumant and
James R. Wilson An automated multiresolution procedure
for modeling complex arrival processes 3--18
Diane L. Evans and
Lawrence M. Leemis and
John H. Drew The distribution of order statistics for
discrete random variables with
applications to bootstrapping . . . . . 19--30
Huseyin Topaloglu and
Warren B. Powell Dynamic-programming approximations for
stochastic time-staged integer
multicommodity-flow problems . . . . . . 31--42
Joel A. Shapiro and
Warren B. Powell A metastrategy for large-scale resource
management based on informational
decomposition . . . . . . . . . . . . . 43--60
Antonio Frangioni and
Antonio Manca A computational study of cost
reoptimization for min-cost flow
problems . . . . . . . . . . . . . . . . 61--70
Michele Monaci and
Paolo Toth A set-covering-based heuristic approach
for bin-packing problems . . . . . . . . 71--85
Gérard Cornuéjols and
Miroslav Karamanov and
Yanjun Li Early estimates of the size of
branch-and-bound trees . . . . . . . . . 86--96
José H. Dulá and
Francisco J. López Algorithms for the frame of a finitely
generated unbounded polyhedron . . . . . 97--110
Miguel F. Anjos and
Anthony Vannelli A new mathematical-programming framework
for facility-layout design . . . . . . . 111--118
Anurag Agarwal and
Varghese S. Jacob and
Hasan Pirkul An improved augmented neural-network
approach for scheduling problems . . . . 119--128
John J. H. Forrest and
Jayant Kalagnanam and
Laszlo Ladanyi A column-generation approach to the
multiple knapsack problem with color
constraints . . . . . . . . . . . . . . 129--134
Anonymous From the Guest Editor --- Special
Cluster on Operations Research in
Electrical and Computer Engineering . . 135--136
Laleh Behjat and
Anthony Vannelli and
William Rosehart Integer Linear Programming Models for
Global Routing . . . . . . . . . . . . . 137--150
Sin Ming Loo and
B. Earl Wells Task Scheduling in a Finite-Resource,
Reconfigurable Hardware/Software
Codesign Environment . . . . . . . . . . 151--172
Praveen Pai and
Emad Gad and
Ramachandra Achar and
Michel Nakhla and
Roni Khazaka A projection-based reduction approach to
computing sensitivity of steady-state
response of nonlinear circuits . . . . . 173--185
Shirook M. Ali and
Natalia K. Nikolova and
Mohamed H. Bakr A discrete adjoint variable method for
printed-circuit board computer-aided
design . . . . . . . . . . . . . . . . . 186--196
Dorothy Kucar and
Anthony Vannelli Using Eigenvectors to Partition Circuits 197--208
Ruslan Sadykov and
Laurence A. Wolsey Integer programming and constraint
programming in solving a multimachine
assignment scheduling problem with
deadlines and release dates . . . . . . 209--217
Seok Ho Chang and
Dae Won Choi Modeling and performance analysis of a
finite-buffer queue with batch arrivals,
batch services, and setup times: the $
M^X / G^Y / 1 / K + B $ queue with setup
times . . . . . . . . . . . . . . . . . 218--228
Debabrata Dey and
Zhongju Zhang and
Prabuddha De Optimal Synchronization Policies for
Data Warehouses . . . . . . . . . . . . 229--242
Kaushik Dutta and
Samit Soni and
Sridhar Narasimhan and
Anindya Datta Optimization in Object Caching . . . . . 243--254
Hemant K. Bhargava and
Daewon Sun and
Susan H. Xu Stockout compensation: joint inventory
and price optimization in electronic
retailing . . . . . . . . . . . . . . . 255--266
Xiao Fang and
Olivia R. Liu Sheng and
Wei Gao and
Balakrishna R. Iyer A Data-Mining-Based Prefetching Approach
to Caching for Network Storage Systems 267--282
Elaine Chew From the Guest Editor --- Special
Cluster on Computation in Music . . . . 283--284
Darrell Conklin and
Christina Anagnostopoulou Segmental Pattern Discovery in Music . . 285--293
Emilia Gómez Tonal Description of Polyphonic Audio
for Music Content Processing . . . . . . 294--304
Elaine Chew Slicing It All Ways: Mathematical Models
for Tonal Induction, Approximation, and
Segmentation Using the Spiral Array . . 305--320
Judy A. Franklin Recurrent Neural Networks for Music
Computation . . . . . . . . . . . . . . 321--338
Alexandra L. Uitdenbogerd and
Abhijit Chattaraj and
Justin Zobel Methodologies for Evaluation of
Note-Based Music-Retrieval Systems . . . 339--347
Ioannis Gamvros and
Bruce Golden and
S. Raghavan The multilevel capacitated minimum
spanning tree problem . . . . . . . . . 348--365
Joakim Kalvenes and
Jeffery Kennington and
Eli Olinick Base Station Location and Service
Assignments in W-CDMA Networks . . . . . 366--376
Guidong Zhu and
Jonathan F. Bard and
Gang Yu A Branch-and-Cut Procedure for the
Multimode Resource-Constrained
Project-Scheduling Problem . . . . . . . 377--390
Stefan Irnich and
Daniel Villeneuve The shortest-path problem with resource
constraints and $k$-cycle elimination
for $ k \geq 3$ . . . . . . . . . . . . 391--406
W. David Kelton From the Editor . . . . . . . . . . . . 407--407
Joseph Abate and
Ward Whitt A unified framework for numerically
inverting Laplace transforms . . . . . . 408--421
Ramesh Bollapragada and
Yanjun Li and
Uday S. Rao Budget-constrained, capacitated hub
location to maximize expected demand
coverage in fixed-wireless
telecommunication networks . . . . . . . 422--432
Jean-François Cordeau and
Manlio Gaudioso and
Gilbert Laporte and
Luigi Moccia A memetic heuristic for the generalized
quadratic assignment problem . . . . . . 433--443
Jie Sun and
Xinwei Liu Scenario formulation of stochastic
linear programs and the homogeneous
self-dual interior-point method . . . . 444--454
Linda S. Moonen and
Frits C. R. Spieksma Exact algorithms for a loading problem
with bounded clique width . . . . . . . 455--465
Gerhard Reinelt and
Klaus M. Wenger Maximally violated mod-$p$ cuts for the
capacitated vehicle-routing problem . . 466--479
Andrea Lodi and
Michela Milano and
Louis-Martin Rousseau Discrepancy-Based Additive Bounding
Procedures . . . . . . . . . . . . . . . 480--493
Xiaoming Huo and
Seoung Bum Kim and
Kwok-Leung Tsui and
Shuchun Wang FBP: A Frontier-Based Tree-Pruning
Algorithm . . . . . . . . . . . . . . . 494--505
Yong Tan and
Yonghua Ji and
Vijay S. Mookerjee Analyzing Document-Duplication Effects
on Policies for Browser and Proxy
Caching . . . . . . . . . . . . . . . . 506--522
Anonymous Appreciation to Referees . . . . . . . . 523--526
Anonymous Author Index . . . . . . . . . . . . . . 527--528
Anonymous Key Word Index . . . . . . . . . . . . . 529--530
Prakash Mirchandani From the Editor . . . . . . . . . . . . 1--1
Hanif D. Sherali and
Churlzu Lim Enhancing Lagrangian dual optimization
for linear programs by obviating
nondifferentiability . . . . . . . . . . 3--13
Ravindra K. Ahuja and
Wei Huang and
H. Edwin Romeijn and
Dolores Romero Morales A heuristic approach to the multi-period
single-sourcing problem with production
and inventory capacities and
perishability constraints . . . . . . . 14--26
Gleb Belov and
Guntram Scheithauer Setup and open-stacks minimization in
one-dimensional stock cutting . . . . . 27--35
David Pisinger and
Mikkel Sigurd Using decomposition techniques and
constraint programming for solving the
two-dimensional bin-packing problem . . 36--51
Petra Schuurman and
Tjark Vredeveld Performance guarantees of local search
for multiprocessor scheduling . . . . . 52--63
Vincent T'kindt and
Federico Della Croce and
Jean-Louis Bouquard Enumeration of Pareto optima for a
flowshop scheduling problem with two
criteria . . . . . . . . . . . . . . . . 64--72
Laura Di Giacomo and
Giacomo Patrizi and
Emanuele Argento Linear Complementarity as a General
Solution Method to Combinatorial
Problems . . . . . . . . . . . . . . . . 73--79
Jeffrey W. Ohlmann and
Barrett W. Thomas A compressed-annealing heuristic for the
traveling salesman problem with time
windows . . . . . . . . . . . . . . . . 80--90
Julian Molina and
Manuel Laguna and
Rafael Martí and
Rafael Caballero SSPMO: a scatter tabu search procedure
for non-linear multiobjective
optimization . . . . . . . . . . . . . . 91--100
Michael C. Fu and
Jian-Qiang Hu and
Chun-Hung Chen and
Xiaoping Xiong Simulation allocation for determining
the best design in the presence of
correlated sampling . . . . . . . . . . 101--111
John F. Shortle and
Martin J. Fischer and
Percy H. Brill Waiting-time distribution of $ M / D_N /
1 $ queues through numerical Laplace
inversion . . . . . . . . . . . . . . . 112--120
Jesus R. Artalejo and
Antonis Economou and
M. J. Lopez-Herrero Algorithmic analysis of the maximum
queue length in a busy period for the $
M / M / c $ retrial queue . . . . . . . 121--126
Rakesh Gupta and
Amitava Bagchi and
Sumit Sarkar Improving Linkage of Web Pages . . . . . 127--136
Juan Feng and
Hemant K. Bhargava and
David M. Pennock Implementing Sponsored Search in Web
Search Engines: Computational Evaluation
of Alternative Mechanisms . . . . . . . 137--148
W. David Kelton From the Interim Editor . . . . . . . . 149--149
Emily K. Lada and
James R. Wilson and
Natalie M. Steiger and
Jeffrey A. Joines Performance of a wavelet-based spectral
procedure for steady-state simulation
analysis . . . . . . . . . . . . . . . . 150--160
Jiaqiao Hu and
Michael C. Fu and
Vahid R. Ramezani and
Steven I. Marcus An evolutionary random policy search
algorithm for solving Markov decision
processes . . . . . . . . . . . . . . . 161--174
Johannes O. Royset and
R. Kevin Wood Solving the bi-objective maximum-flow
network-interdiction problem . . . . . . 175--184
Gediminas Adomavicius and
Alexander Tuzhilin Validation sequence optimization: a
theoretical approach . . . . . . . . . . 185--200
Armann Ingolfsson and
Elvira Akhmetshina and
Susan Budge and
Yongyue Li and
Xudong Wu A survey and experimental comparison of
service-level-approximation methods for
nonstationary $ M(t) / M / s(t) $
queueing systems with exhaustive
discipline . . . . . . . . . . . . . . . 201--214
Alma Riska and
Evgenia Smirni ETAQA solutions for infinite Markov
processes with repetitive structure . . 215--228
Giuseppe Andreello and
Alberto Caprara and
Matteo Fischetti Embedding $ \{ 0, 1 / 2 \} $-Cuts in a
Branch-and-Cut Framework: A
Computational Study . . . . . . . . . . 229--238
Panos Parpas and
Berç Rustem Computational assessment of nested
Benders and augmented Lagrangian
decomposition for mean-variance
multistage stochastic problems . . . . . 239--247
Zhongju Zhang and
Debabrata Dey and
Yong Tan Pricing Communication Services with
Delay Guarantee . . . . . . . . . . . . 248--260
Ramón Alvarez-Valdes and
Rafael Martí and
Jose M. Tamarit and
Antonio Parajón GRASP and path relinking for the
two-dimensional two-stage cutting-stock
problem . . . . . . . . . . . . . . . . 261--272
Gary J. Koehler Conditions that obviate the
no-free-lunch theorems for optimization 273--279
W. David Pisinger and
Anders Bo Rasmussen and
Rune Sandvik Solution of large quadratic knapsack
problems through aggressive reduction 280--290
Murat Köksalan and
Selcen (Pamuk) Phelps An evolutionary metaheuristic for
approximating preference-nondominated
solutions . . . . . . . . . . . . . . . 291--301
Hoi-Ming Chi and
Okan K. Ersoy and
Herbert Moskowitz and
Kemal Altinkemer Toward automated intelligent
manufacturing systems (AIMS) . . . . . . 302--312
John W. Chinneck From the Editor . . . . . . . . . . . . 313--313
Christos Alexopoulos and
Nilay Tanìk Argon and
David Goldsman and
Natalie M. Steiger and
Gamze Tokol and
James R. Wilson Efficient computation of overlapping
variance estimators for simulation . . . 314--327
Zsolt Ugray and
Leon Lasdon and
John Plummer and
Fred Glover and
James Kelly and
Rafael Martí Scatter search and local NLP solvers: a
multistart framework for global
optimization . . . . . . . . . . . . . . 328--340
Efstathios Avdis and
Ward Whitt Power Algorithms for Inverting Laplace
Transforms . . . . . . . . . . . . . . . 341--355
William Cook and
Daniel G. Espinoza and
Marcos Goycoolea Computing with domino-parity
inequalities for the traveling salesman
problem (TSP) . . . . . . . . . . . . . 356--365
Gino J. Lim and
Michael C. Ferris and
Stephen J. Wright and
David M. Shepard and
Matthew A. Earl An optimization framework for conformal
radiation treatment planning . . . . . . 366--380
Tito Homem-de-Mello A study on the cross-entropy method for
rare-event probability estimation . . . 381--394
David Pisinger Denser packings obtained in $ O(n \log
\log n) $ time . . . . . . . . . . . . . 395--405
Jon Lee and
François Margot On a Binary-Encoded ILP Coloring
Formulation . . . . . . . . . . . . . . 406--415
Ravindra K. Ahuja and
Jon Goodstein and
Amit Mukherjee and
James B. Orlin and
Dushyant Sharma A Very Large-Scale Neighborhood Search
Algorithm for the Combined
Through-Fleet-Assignment Model . . . . . 416--428
Sudip Bhattacharjee and
Hong Zhang and
R. Ramesh and
Dee H. Andrews A Decomposition and Guided Simulation
Methodology for Large-Scale System
Design: A Study in QoS-Capable Intranets
with Fixed and Mobile Components . . . . 429--442
Andrew Lim and
Xingwen Zhang A two-stage heuristic with ejection
pools and generalized ejection chains
for the vehicle routing problem with
time windows . . . . . . . . . . . . . . 443--457
Mustapha Bouhtou and
Stan van Hoesel and
Anton F. van der Kraaij and
Jean-Luc Lutton Tariff Optimization in Networks . . . . 458--469
Emilio Carrizosa and
Belén Martín-Barragán and
Frank Plastria and
Dolores Romero Morales On the selection of the globally optimal
prototype subset for nearest-neighbor
classification . . . . . . . . . . . . . 470--479
Attahiru Sule Alfa and
Jungong Xue Efficient computations for the discrete
$ G I / G / 1 $ system . . . . . . . . . 480--484
John W. Chinneck From the Editor . . . . . . . . . . . . 485--485
Zhiqiang Zheng and
Balaji Padmanabhan Constructing Ensembles from Data
Envelopment Analysis . . . . . . . . . . 486--496
Rommel G. Regis and
Christine A. Shoemaker A stochastic radial basis function
method for the global optimization of
expensive functions . . . . . . . . . . 497--509
I. Robert Chiang and
Manuel A. Nunez Improving Web-Catalog Design for Easy
Product Search . . . . . . . . . . . . . 510--519
Jordi Castro A Shortest-Paths Heuristic for
Statistical Data Protection in Positive
Tables . . . . . . . . . . . . . . . . . 520--533
Edward Rothberg An Evolutionary Algorithm for Polishing
Mixed Integer Programming Solutions . . 534--541
Kevin R. Hutson and
Terri L. Schlosser and
Douglas R. Shier On the distributed Bellman--Ford
algorithm and the looping problem . . . 542--551
Pierre Hansen and
Jack Brimberg and
Dragan Uro\vsevi\'c and
Nenad Mladenovi\'c Primal-dual variable neighborhood search
for the simple plant-location problem 552--564
Milind Dawande and
Rakesh Gupta and
Sanjeewa Naranpanawe and
Chelliah Sriskandarajah A traffic-grooming algorithm for
wavelength-routed optical networks . . . 565--574
Dario Landa-Silva and
Edmund K. Burke Asynchronous cooperative local search
for the office-space-allocation problem 575--587
Kaushal Chari and
Manish Agrawal Multi-Issue Automated Negotiations Using
Agents . . . . . . . . . . . . . . . . . 588--595
José Niño-Mora A $ (2 / 3)n^3 $ fast-pivoting algorithm
for the Gittins index and optimal
stopping of a Markov chain . . . . . . . 596--606
Maria Garcia de la Banda and
Peter J. Stuckey Dynamic programming to minimize the
maximum number of open stacks . . . . . 607--617
Francesco Carrabs and
Jean-François Cordeau and
Gilbert Laporte Variable neighborhood search for the
pickup and delivery traveling salesman
problem with LIFO loading . . . . . . . 618--632
Nicholas G. Hall and
Zhixin Liu and
Chris N. Potts Rescheduling for Multiple New Orders . . 633--645
Ravindra K. Ahuja and
Krishna C. Jha and
James B. Orlin and
Dushyant Sharma Very Large-Scale Neighborhood Search for
the Quadratic Assignment Problem . . . . 646--657
Anonymous Appreciation to Referees . . . . . . . . 658--660
Anonymous Author Index . . . . . . . . . . . . . . 661--662
Anonymous Key Word Index . . . . . . . . . . . . . 663--664
Anonymous From the Editor . . . . . . . . . . . . 1--1
Jonathan Eckstein and
Avigdor Gal and
Sarit Reiner Monitoring an information source under a
politeness constraint . . . . . . . . . 3--20
H. Neil Geismar and
Gilbert Laporte and
Lei Lei and
Chelliah Sriskandarajah The integrated production and
transportation scheduling problem for a
product with a short lifespan . . . . . 21--33
San-Yih Hwang and
Wan-Shiou Yang Discovering generalized
profile-association rules for the
targeted advertising of new products . . 34--45
Namsik Chang and
Olivia R. Liu Sheng Decision-tree-based knowledge discovery:
single- vs. multi-decision-tree
induction . . . . . . . . . . . . . . . 46--54
Oscar Cordón and
Sergio Damas and
Jose Santamaría and
Rafael Martí Scatter search for the point-matching
problem in 3D image registration . . . . 55--68
Fernando S. Oliveira A constraint logic programming algorithm
for modeling dynamic pricing . . . . . . 69--77
Ruibin Bai and
Graham Kendall A model for fresh produce shelf-space
allocation and inventory management with
freshness-condition-dependent demand . . 78--85
Massimiliano Caramia and
Paolo Dell'Olmo and
Giuseppe F. Italiano Novel local-search-based approaches to
university examination timetabling . . . 86--99
Ravi Bapna and
Sanjukta Das and
Robert Garfinkel and
Jan Stallaert A Market Design for Grid Computing . . . 100--111
Hulisi Ogut and
Huseyin Cavusoglu and
Srinivasan Raghunathan Intrusion-Detection Policies for IT
Security Breaches . . . . . . . . . . . 112--123
Jörg Homberger A Parallel Genetic Algorithm for the
Multilevel Unconstrained Lot-Sizing
Problem . . . . . . . . . . . . . . . . 124--132
Louis-Philippe Bigras and
Michel Gamache and
Gilles Savard Time-indexed formulations and the total
weighted tardiness problem . . . . . . . 133--142
Luc Mercier and
Pascal Van Hentenryck Edge Finding for Cumulative Scheduling 143--153
Christos D. Tarantilis and
Emmanouil E. Zachariadis and
Chris T. Kiranoudis A hybrid guided local search for the
vehicle-routing problem with
intermediate replenishment facilities 154--168
Jaya Singhal and
Kalyan Singhal A noniterative algorithm for the
linear-quadratic profit-maximization
model for smoothing multiproduct
production . . . . . . . . . . . . . . . 169--178
Qi-Ming He and
Hanqin Zhang An algorithm for computing minimal
Coxian representations . . . . . . . . . 179--190
Luciana S. Buriol and
Mauricio G. C. Resende and
Mikkel Thorup Speeding Up Dynamic Shortest-Path
Algorithms . . . . . . . . . . . . . . . 191--204
Irit Katriel Matchings in Node-Weighted Convex
Bipartite Graphs . . . . . . . . . . . . 205--211
Mhand Hifi and
Rym M'Hallah and
Toufik Saadi Algorithms for the constrained
two-staged two-dimensional cutting
problem . . . . . . . . . . . . . . . . 212--221
Konstantin Artiouchine and
Philippe Baptiste and
Juliette Mattioli The $K$ King Problem, an Abstract Model
for Computing Aircraft Landing
Trajectories: On Modeling a Dynamic
Hybrid System with Constraints . . . . . 222--233
Abderezak Touzene A tensor sum preconditioner for
stochastic automata networks . . . . . . 234--242
F. Sibel Salman and
R. Ravi and
John N. Hooker Solving the capacitated local access
network design problem . . . . . . . . . 243--254
José Niño-Mora A faster index algorithm and a
computational study for bandits with
switching costs . . . . . . . . . . . . 255--269
S. Irnich A unified modeling and solution
framework for vehicle routing and local
search-based metaheuristics . . . . . . 270--287
Sumit Kunnumkal and
Huseyin Topaloglu Exploiting the structural properties of
the underlying Markov decision problem
in the Q-learning algorithm . . . . . . 288--301
Enrico Malaguti and
Michele Monaci and
Paolo Toth A metaheuristic approach for the vertex
coloring problem . . . . . . . . . . . . 302--316
Haldun Aytug and
Gary J. Koehler and
Ling He Risk minimization and minimum
description for linear discriminant
functions . . . . . . . . . . . . . . . 317--331
Mauro Dell'Amico and
Manuel Iori and
Silvano Martello and
Michele Monaci Heuristic and exact algorithms for the
identical parallel machine scheduling
problem . . . . . . . . . . . . . . . . 333--344
Ravi Bapna and
Paulo Goes and
Alok Gupta and
Gilbert Karuga Predicting Bidders' Willingness to Pay
in Online Multiunit Ascending Auctions:
Analytical and Empirical Insights . . . 345--355
Young U. Ryu and
Hyeun-Suk Rhee Improving intrusion prevention models:
dual-threshold and dual-filter
approaches . . . . . . . . . . . . . . . 356--367
Teodor Gabriel Crainic and
Guido Perboli and
Roberto Tadei Extreme point-based heuristics for
three-dimensional bin packing . . . . . 368--384
Hiroshi Haramoto and
Makoto Matsumoto and
Takuji Nishimura and
François Panneton and
Pierre L'Ecuyer Efficient Jump Ahead for $ \mathbb {F}_2
$-Linear Random Number Generators . . . 385--390
Syam Menon and
Rakesh Gupta Optimal broadcast scheduling in packet
radio networks via branch and price . . 391--399
Christian Roed Pedersen and
Lars Relund Nielsen and
Kim Allan Andersen The bicriterion multimodal assignment
problem: introduction, analysis, and
experimental results . . . . . . . . . . 400--411
F. Parreño and
R. Alvarez-Valdes and
J. M. Tamarit and
J. F. Oliveira A maximal-space algorithm for the
container loading problem . . . . . . . 412--422
Xue Bai and
Rema Padman and
Joseph Ramsey and
Peter Spirtes Tabu search-enhanced graphical models
for classification in high dimensions 423--437
Juan Pablo Vielma and
Shabbir Ahmed and
George L. Nemhauser A lifted linear programming
branch-and-bound algorithm for
mixed-integer conic quadratic programs 438--450
Gerardo Minella and
Rubén Ruiz and
Michele Ciavotta A review and evaluation of
multiobjective algorithms for the
flowshop scheduling problem . . . . . . 451--471
Francis Sourd and
Olivier Spanjaard A multiobjective branch-and-bound
framework: application to the
biobjective spanning tree problem . . . 472--484
Bahar Biller and
Barry L. Nelson Evaluation of the ARTAFIT method for
fitting time-series input processes for
simulation . . . . . . . . . . . . . . . 485--498
John W. Chinneck From the Editor . . . . . . . . . . . . 499--499
Yuelin Shen Reactive Tabu Search in a Team-Learning
Problem . . . . . . . . . . . . . . . . 500--509
J. D. Griffiths and
G. M. Leonenko and
J. E. Williams Approximation to the transient solution
of the $ M / E_k / 1 $ queue . . . . . . 510--515
B. Addis and
M. Locatelli and
F. Schoen Disk packing in a square: a new global
optimization approach . . . . . . . . . 516--524
Elizabeth D. Dolan and
Robert Fourer and
Jean-Pierre Goux and
Todd S. Munson and
Jason Sarich Kestrel: an interface from optimization
modeling systems to the NEOS server . . 525--538
Hui Xiong and
Wenjun Zhou and
Mark Brodie and
Sheng Ma Top-$k$ $ \phi $ correlation computation 539--552
April K. Andreas and
J. Cole Smith Mathematical programming algorithms for
two-path routing problems with
reliability considerations . . . . . . . 553--564
Shivaram Subramanian and
Hanif D. Sherali An effective deflected subgradient
optimization scheme for implementing
column generation for large-scale
airline crew scheduling problems . . . . 565--578
Chun-Hung Chen and
Donghai He and
Michael Fu and
Loo Hay Lee Efficient Simulation Budget Allocation
for Selecting an Optimal Subset . . . . 579--595
Huseyin Topaloglu A stochastic approximation method to
compute bid prices in network revenue
management problems . . . . . . . . . . 596--610
Miguel F. Anjos and
Anthony Vannelli Computing globally optimal solutions for
single-row layout problems using
semidefinite programming and cutting
planes . . . . . . . . . . . . . . . . . 611--617
Christian Blum Beam-ACO for Simple Assembly Line
Balancing . . . . . . . . . . . . . . . 618--627
Feng Yang and
Bruce E. Ankenman and
Barry L. Nelson Estimating Cycle Time Percentile Curves
for Manufacturing Systems via Simulation 628--643
Mauro Birattari and
Prasanna Balaprakash and
Thomas Stützle and
Marco Dorigo Estimation-based local search for
stochastic combinatorial optimization
using delta evaluations: a case study on
the probabilistic traveling salesman
problem . . . . . . . . . . . . . . . . 644--658
Anonymous Appreciation to Referees . . . . . . . . 659--661
Anonymous Author Index . . . . . . . . . . . . . . 662--664
Anonymous Key Word Index . . . . . . . . . . . . . 665--666
Alessandro Agnetis and
Arianna Alfieri and
Gaia Nicosia Single-machine scheduling problems with
generalized preemption . . . . . . . . . 1--12
C. Arbib and
F. Marinelli Exact and asymptotically exact solutions
for a class of assortment problems . . . 13--25
Rafael Martí and
Abraham Duarte and
Manuel Laguna Advanced Scatter Search for the Max-Cut
Problem . . . . . . . . . . . . . . . . 26--38
Jesús A. De Loera and
Raymond Hemmecke and
Matthias Köppe Pareto Optima of Multicriteria Integer
Linear Programs . . . . . . . . . . . . 39--48
Hanif D. Sherali and
Antoine G. Hobeika and
Chawalit Jeenanunta An optimal constrained pruning strategy
for decision trees . . . . . . . . . . . 49--61
Dionne M. Aleman and
H. Edwin Romeijn and
James F. Dempsey A Response Surface Approach to Beam
Orientation Optimization in
Intensity-Modulated Radiation Therapy
Treatment Planning . . . . . . . . . . . 62--76
J. Puerto and
A. M. Rodríguez-Chía and
A. Tamir Minimax regret single-facility ordered
median location problems on networks . . 77--87
Athanassios N. Avramidis and
Nabil Channouf and
Pierre L'Ecuyer Efficient correlation matching for
fitting discrete multivariate
distributions with arbitrary marginals
and normal-copula dependence . . . . . . 88--106
Christian Valente and
Gautam Mitra and
Mustapha Sadki and
Robert Fourer Extending algebraic modelling languages
for stochastic programming . . . . . . . 107--122
Raf Jans Solving lot-sizing problems on parallel
identical machines using
symmetry-breaking constraints . . . . . 123--136
Santanu S. Dey and
Jean-Philippe Richard Linear-programming-based lifting and its
application to primal cutting-plane
algorithms . . . . . . . . . . . . . . . 137--150
Giuseppe Lancia and
Paolo Serafini A set-covering approach with column
generation for parsimony haplotyping . . 151--166
Francis Sourd New exact algorithms for one-machine
earliness-tardiness scheduling . . . . . 167--175
John W. Chinneck From the Editor . . . . . . . . . . . . 177--177
Abhijit Gosavi Reinforcement learning: a tutorial
survey and recent advances . . . . . . . 178--192
Sigrún Andradóttir and
Andrei A. Prudius Balanced explorative and exploitative
search with estimation for simulation
optimization . . . . . . . . . . . . . . 193--208
Assefaw H. Gebremedhin and
Arijit Tarafdar and
Alex Pothen and
Andrea Walther Efficient computation of sparse Hessians
using coloring and automatic
differentiation . . . . . . . . . . . . 209--223
Davaatseren Baatar and
Natashia Boland and
Robert Johnston and
Horst W. Hamacher A New Sequential Extraction Heuristic
for Optimizing the Delivery of Cancer
Radiation Treatment Using Multileaf
Collimators . . . . . . . . . . . . . . 224--241
Robert Fourer and
Leo Lopes StAMPL: A Filtration-Oriented Modeling
Tool for Multistage Stochastic Recourse
Problems . . . . . . . . . . . . . . . . 242--256
Sven Leyffer A complementarity constraint formulation
of convex multiobjective optimization
problems . . . . . . . . . . . . . . . . 257--267
Lars Magnus Hvattum and
Arne Lòkketangen and
Gilbert Laporte Scenario tree-based heuristics for
stochastic inventory-routing problems 268--285
Zan Huang and
Dennis K. J. Lin The Time-Series Link Prediction Problem
with Applications in Communication
Surveillance . . . . . . . . . . . . . . 286--303
Richard Laundy and
Michael Perregaard and
Gabriel Tavares and
Horia Tipi and
Alkis Vazacopoulos Solving hard mixed-integer programming
problems with Xpress--MP: a MIPLIB 2003
case study . . . . . . . . . . . . . . . 304--313
Han-Lin Li and
Hao-Chun Lu and
Chia-Hui Huang and
Nian-Ze Hu A superior representation method for
piecewise linear functions . . . . . . . 314--321
E. Chisonge Mofya and
J. Cole Smith A dynamic programming algorithm for the
generalized minimum filter placement
problem on tree structures . . . . . . . 322--332
Walter Rei and
Jean-François Cordeau and
Michel Gendreau and
Patrick Soriano Accelerating Benders decomposition by
local branching . . . . . . . . . . . . 333--345
John W. Chinneck From the Editor --- Special Cluster on
High-Throughput Optimization . . . . . . 347--348
Michael R. Bussieck and
Michael C. Ferris and
Alexander Meeraus Grid-Enabled Optimization with GAMS . . 349--362
Laurent Michel and
Andrew See and
Pascal Van Hentenryck Transparent Parallelization of
Constraint Programming . . . . . . . . . 363--382
Y. Xu and
T. K. Ralphs and
L. Ladányi and
M. J. Saltzman Computational experience with a software
framework for parallel integer
programming . . . . . . . . . . . . . . 383--397
Michael C. Ferris and
Christos T. Maravelias and
Arul Sundaramoorthy Simultaneous batching and scheduling
using dynamic decomposition on a grid 398--410
Rommel G. Regis and
Christine A. Shoemaker Parallel stochastic global optimization
using radial basis functions . . . . . . 411--426
Hao Howard Zhang and
Leyuan Shi and
Robert Meyer and
Daryl Nazareth and
Warren D'Souza Solving Beam-Angle Selection and Dose
Optimization Simultaneously via
High-Throughput Computing . . . . . . . 427--444
Jeff Linderoth and
François Margot and
Greg Thain Improving Bounds on the Football Pool
Problem by Integer Programming and
High-Throughput Computing . . . . . . . 445--457
Charles H. Reilly Synthetic optimization problem
generation: show us the correlations! 458--467
Jingpeng Li and
Uwe Aickelin and
Edmund K. Burke A Component-Based Heuristic Search
Method with Evolutionary Eliminations
for Hospital Personnel Scheduling . . . 468--479
Yang Yuan and
Suvrajeet Sen Enhanced cut generation methods for
decomposition-based branch and cut for
two-stage stochastic mixed-integer
programs . . . . . . . . . . . . . . . . 480--487
Xiaoqun Wang Dimension reduction techniques in
quasi-Monte Carlo methods for option
pricing . . . . . . . . . . . . . . . . 488--504
Edmund K. Burke and
Graham Kendall and
Glenn Whitwell A Simulated Annealing Enhancement of the
Best-Fit Heuristic for the Orthogonal
Stock-Cutting Problem . . . . . . . . . 505--516
John W. Chinneck From the Editor . . . . . . . . . . . . 517--517
Jean-Yves Potvin State-of-the art review---evolutionary
algorithms for vehicle routing . . . . . 518--548
Daria Terekhov and
J. Christopher Beck and
Kenneth N. Brown A constraint programming approach for
solving a queueing design and control
problem . . . . . . . . . . . . . . . . 549--561
Andreas T. Ernst and
Vicky H. Mak and
Luke R. Mason An exact method for the minimum
cardinality problem in the treatment
planning of intensity-modulated
radiotherapy . . . . . . . . . . . . . . 562--574
Franz Rothlauf An encoding in metaheuristics for the
minimum communication spanning tree
problem . . . . . . . . . . . . . . . . 575--584
Lei Lei and
Hua Zhong and
W. Art Chaovalitwongse On the Integrated Production and
Distribution Problem with Bidirectional
Flows . . . . . . . . . . . . . . . . . 585--598
Peter Frazier and
Warren Powell and
Savas Dayanik The knowledge-gradient policy for
correlated normal beliefs . . . . . . . 599--613
Piyush Kumar and
E. Alper Yìldìrìm An algorithm and a core set result for
the weighted Euclidean one-center
problem . . . . . . . . . . . . . . . . 614--629
Ira Gerhardt and
Barry L. Nelson Transforming renewal processes for
simulation of nonstationary arrival
processes . . . . . . . . . . . . . . . 630--640
William Cook and
Sanjeeb Dash and
Ricardo Fukasawa and
Marcos Goycoolea Numerically Safe Gomory Mixed-Integer
Cuts . . . . . . . . . . . . . . . . . . 641--649
Anonymous Appreciation to Referees . . . . . . . . 650--653
Anonymous Author Index . . . . . . . . . . . . . . 654--655
Anonymous Key Word Index . . . . . . . . . . . . . 656--656
John W. Chinneck From the Editor . . . . . . . . . . . . 1--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
[MR2663501] . . . . . . . . . . . . . . 18--19
Andrzej Ruszczy\'nski Commentary --- Post-decision states and
separable approximations are powerful
tools of approximate dynamic programming
[MR2663501] . . . . . . . . . . . . . . 20--22
Warren B. Powell Rejoinder --- the languages of
stochastic optimization [MR2663501;
MR2663502; MR2663503] . . . . . . . . . 23--25
Robert Fourer and
Chandrakant Maheshwari and
Arnold Neumaier and
Dominique Orban and
Hermann Schichl Convexity and concavity detection in
computational graphs: tree walks for
convexity assessment . . . . . . . . . . 26--43
Dimitris Bertsimas and
Omid Nohadani and
Kwong Meng Teo Nonconvex robust optimization for
problems with constraints . . . . . . . 44--58
M. Bierlaire and
M. Thémans and
N. Zufferey A Heuristic for Nonlinear Global
Optimization . . . . . . . . . . . . . . 59--70
Stephen E. Chick and
Jürgen Branke and
Christian Schmidt Sequential sampling to myopically
maximize the expected value of
information . . . . . . . . . . . . . . 71--80
Kaeyoung Shin and
Raghu Pasupathy An algorithm for fast generation of
bivariate Poisson random vectors . . . . 81--92
Oliver Bastert and
Benjamin Hummel and
Sven de Vries A generalized Wedelin heuristic for
integer programming . . . . . . . . . . 93--107
Matteo Fischetti and
Domenico Salvagnin Pruning Moves . . . . . . . . . . . . . 108--119
Barry McCollum and
Andrea Schaerf and
Ben Paechter and
Paul McMullan and
Rhyd Lewis and
Andrew J. Parkes and
Luca Di Gaspero and
Rong Qu and
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 and
Tim Traynor and
Shafiu Jibrin Feasibility and constraint analysis of
sets of linear matrix inequalities . . . 144--153
Emilio Carrizosa and
Belen Martin-Barragan and
Dolores Romero Morales Binarized Support Vector Machines . . . 154--167
Christoph Buchheim and
Angelika Wiegele and
Lanbo Zheng Exact algorithms for the quadratic
linear ordering problem . . . . . . . . 168--177
Anonymous From the Editor . . . . . . . . . . . . 179--179
W. Art Chaovalitwongse and
Chun-An Chou and
Tanya Y. Berger-Wolf and
Bhaskar DasGupta and
Saad Sheikh and
Mary V. Ashley and
Isabel C. Caballero New optimization model and algorithm for
sibling reconstruction from genetic
markers . . . . . . . . . . . . . . . . 180--194
Daniele Catanzaro and
Alessandra Godi and
Martine Labbé A class representative model for pure
parsimony haplotyping . . . . . . . . . 195--209
Daniel Jupiter and
Jessica \cSahuto\uglu and
Vincent VanBuren TreeHugger: A New Test for Enrichment of
Gene Ontology Terms . . . . . . . . . . 210--221
Tobias Fanslau and
Andreas Bortfeldt A tree search algorithm for solving the
container loading problem . . . . . . . 222--235
Sanjeeb Dash and
Marcos Goycoolea and
Oktay Günlük Two-step MIR inequalities for mixed
integer programs . . . . . . . . . . . . 236--249
Jakob Puchinger and
Günther R. Raidl and
Ulrich Pferschy The multidimensional knapsack problem:
structure and algorithms . . . . . . . . 250--265
Matthew S. Maxwell and
Mateo Restrepo and
Shane G. Henderson and
Huseyin Topaloglu Approximate dynamic programming for
ambulance redeployment . . . . . . . . . 266--281
Samir Elhedhli and
Huyu Wu A Lagrangean heuristic for hub-and-spoke
system design with capacity selection
and congestion . . . . . . . . . . . . . 282--296
Stefan Irnich and
Guy Desaulniers and
Jacques Desrosiers and
Ahmed Hadjar Path-reduced costs for eliminating arcs
in routing and scheduling . . . . . . . 297--313
Mike Hewitt and
George L. Nemhauser and
Martin W. P. Savelsbergh Combining exact and heuristic approaches
for the capacitated fixed-charge network
flow problem . . . . . . . . . . . . . . 314--325
Jeffery L. Kennington and
Charles D. Nicholson The Uncapacitated Time-Space
Fixed-Charge Network Flow Problem: An
Empirical Investigation of Procedures
for Arc Capacity Assignment . . . . . . 326--337
Dries R. Goossens and
Rudolf Müller and
Frits C. R. Spieksma Algorithms for recognizing economic
properties in matrix bid combinatorial
auctions . . . . . . . . . . . . . . . . 339--352
David Pardoe and
Peter Stone and
Maytal Saar-Tsechansky and
Tayfun Keskin and
Kerem Tomak Adaptive Auction Mechanism Design and
the Incorporation of Prior Knowledge . . 353--370
Anthony Przybylski and
Xavier Gandibleux and
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 and
Oleg A. Prokopyev Solving the Order-Preserving Submatrix
Problem via Integer Programming . . . . 387--400
Albert E. Fernandes Muritiba and
Manuel Iori and
Enrico Malaguti and
Paolo Toth Algorithms for the bin packing problem
with conflicts . . . . . . . . . . . . . 401--415
M. Arns and
P. Buchholz and
A. Panchenko On the numerical analysis of
inhomogeneous continuous-time Markov
chains . . . . . . . . . . . . . . . . . 416--432
Hans L. Bodlaender and
Albert Hendriks and
Alexander Grigoriev and
Nadejda V. Grigorieva The valve location problem in simple
network topologies . . . . . . . . . . . 433--442
Alexander Erdelyi and
Huseyin Topaloglu A Dynamic Programming Decomposition
Method for Making Overbooking Decisions
Over an Airline Network . . . . . . . . 443--456
Raul Cruz-Cano and
David S. H. Chew and
Kwok-Pui Choi and
Ming-Ying Leung Least-Squares Support Vector Machine
Approach to Viral Replication Origin
Prediction . . . . . . . . . . . . . . . 457--470
Rajeev Kumar and
Ram Gopal and
Robert Garfinkel Freedom of Privacy: Anonymous Data
Collection with Respondent-Defined
Privacy Protection . . . . . . . . . . . 471--481
Hong Wan and
Bruce E. Ankenman and
Barry L. Nelson Improving the efficiency and efficacy of
controlled sequential bifurcation for
simulation factor screening . . . . . . 482--492
Juan Pablo Vielma and
Shabbir Ahmed and
George Nemhauser A note on ``A superior representation
method for piecewise linear functions''
[MR2549129] . . . . . . . . . . . . . . 493--497
John W. Chinneck From the Editor . . . . . . . . . . . . 499--499
Hanif D. Sherali and
Ki-Hwan Bae and
Mohamed Haouari Integrated airline schedule design and
fleet assignment: polyhedral analysis
and Benders' decomposition approach . . 500--513
Andreas Schutt and
Peter J. Stuckey Incremental satisfiability and
implication for UTVPI constraints . . . 514--527
Murat Köksalan and
Banu Soylu Bicriteria $p$-hub location problems and
evolutionary algorithms . . . . . . . . 528--542
Jean-Paul Watson and
Roger J.-B. Wets and
David L. Woodruff Scalable heuristics for a class of
chance-constrained stochastic programs 543--554
Kumar Abhishek and
Sven Leyffer and
Jeff Linderoth FilMINT: an outer approximation-based
solver for convex mixed-integer
nonlinear programs . . . . . . . . . . . 555--567
Shabbir Ahmed and
Ozan Gozbasi and
Martin Savelsbergh and
Ian Crocker and
Tim Fox and
Eduard Schreibmann An automated intensity-modulated
radiation therapy planning system . . . 568--583
M. Gisela Bardossy and
S. Raghavan Dual-based local search for the
connected facility location and related
problems . . . . . . . . . . . . . . . . 584--602
\.Ibrahim Muter and
\cS. \.Ilker Birbil and
Güvenç \cSahin Combination of Metaheuristic and Exact
Algorithms for Solving Set Covering-Type
Optimization Problems . . . . . . . . . 603--619
Brian J. Lunday and
Hanif D. Sherali and
Theodore S. Glickman The nested event tree model with
application to combating terrorism . . . 620--634
Sean Barnes and
Bruce Golden and
Edward Wasil MRSA Transmission Reduction Using
Agent-Based Modeling and Simulation . . 635--646
Anonymous Appreciation to Referees . . . . . . . . 647--650
Anonymous Author Index . . . . . . . . . . . . . . 651--652
Anonymous Key Word Index . . . . . . . . . . . . . 653--654
J. Christopher Beck and
T. K. Feng and
Jean-Paul Watson Combining constraint programming and
local search for job-shop scheduling . . 1--14
S\lawomir B\kak and
Jacek B\la\.zewicz and
Grzegorz Pawlak and
Maciej P\laza and
Edmund K. Burke and
Graham Kendall A Parallel Branch-and-Bound Approach to
the Rectangular Guillotine Strip Cutting
Problem . . . . . . . . . . . . . . . . 15--25
Alberto Caprara and
Adam N. Letchford and
Juan-José Salazar-González Decorous Lower Bounds for Minimum Linear
Arrangement . . . . . . . . . . . . . . 26--40
Ivan Contreras and
Juan A. Díaz and
Elena Fernández Branch and price for large-scale
capacitated hub location problems with
single assignment . . . . . . . . . . . 41--55
S. Raghavan and
Daliborka Stanojevi\'c Branch and price for WDM optical
networks with no bifurcation of flow . . 56--74
Ay\csegül Altìn and
Hande Yaman and
Mustafa Ç. Pìnar The Robust Network Loading Problem Under
Hose Demand Uncertainty: Formulation,
Polyhedral Analysis, and Computations 75--89
Marco A. Boschetti and
Vittorio Maniezzo and
Matteo Roffilli A fully distributed Lagrangean solution
for a peer-to-peer overlay network
design problem . . . . . . . . . . . . . 90--104
Faramroze G. Engineer and
George L. Nemhauser and
Martin W. P. Savelsbergh Dynamic Programming-Based Column
Generation on Time-Expanded Networks:
Application to the Dial-a-Flight Problem 105--119
Maria Garcia de la Banda and
Peter J. Stuckey and
Geoffrey Chu Solving Talent Scheduling with Dynamic
Programming . . . . . . . . . . . . . . 120--137
Zan Huang and
Daniel Dajun Zeng Why Does Collaborative Filtering Work?
Transaction-Based Recommendation Model
Validation and Selection by Analyzing
Bipartite Random Graphs . . . . . . . . 138--152
Qi-Ming He and
Hanqin Zhang and
Jungong Xue Algorithms for Coxianization of
phase-type generators . . . . . . . . . 153--164
Benny Van Houdt and
Johan S. H. van Leeuwaarden Triangular M/G/1-Type and Tree-Like
Quasi-Birth-Death Markov Chains . . . . 165--171
Anonymous From the Editor . . . . . . . . . . . . 173--173
Sam Ransbotham and
Ishwar Murthy and
Sabyasachi Mitra and
Sridhar Narasimhan Sequential Grid Computing: Models and
Computational Experiments . . . . . . . 174--188
Nicole Megow and
Rolf H. Möhring and
Jens Schulz Decision support and optimization in
shutdown and turnaround scheduling . . . 189--204
Ciamac C. Moallemi and
Benjamin Van Roy Resource Allocation via Message Passing 205--219
Sakine Batun and
Brian T. Denton and
Todd R. Huschka and
Andrew J. Schaefer Operating room pooling and parallel
surgery processing under uncertainty . . 220--237
Wolfgang Jank and
Shu Zhang An automated and data-driven bidding
strategy for online auctions . . . . . . 238--253
José Niño-Mora Computing a Classic Index for
Finite-Horizon Bandits . . . . . . . . . 254--267
Juan A. Carrasco An efficient and numerically stable
method for computing bounds for the
interval availability distribution . . . 268--283
J. H. Dulá An Algorithm for Data Envelopment
Analysis . . . . . . . . . . . . . . . . 284--296
Ali Tafazzoli and
James R. Wilson and
Emily K. Lada and
Natalie M. Steiger Performance of Skart: A Skewness- and
Autoregression-Adjusted Batch Means
Procedure for Simulation Analysis . . . 297--314
Chris Groër and
Bruce Golden and
Edward Wasil A Parallel Algorithm for the Vehicle
Routing Problem . . . . . . . . . . . . 315--330
Michele Samorani and
Manuel Laguna and
Robert Kirk DeLisle and
Daniel C. Weaver A Randomized Exhaustive
Propositionalization Approach for
Molecule Classification . . . . . . . . 331--345
Diana M. Negoescu and
Peter I. Frazier and
Warren B. Powell The knowledge-gradient algorithm for
sequencing experiments in drug discovery 346--363
Pierre Brice and
Wei Jiang and
Guohua Wan A cluster-based context-tree model for
multivariate data streams with
applications to anomaly detection . . . 364--376
Piyush Kumar and
E. Alper Yìldìrìm A linearly convergent linear-time
first-order algorithm for support vector
classification with a core set result 377--391
Osman Y. Özaltìn and
Brady Hunsaker and
Andrew J. Schaefer Predicting the Solution Time of
Branch-and-Bound Algorithms for
Mixed-Integer Programs . . . . . . . . . 392--403
Samir Elhedhli and
Lingzi Li and
Mariem Gzara and
Joe Naoum-Sawaya A branch-and-price algorithm for the bin
packing problem with conflicts . . . . . 404--415
Amar K. Narisetty and
Jean-Philippe P. Richard and
George L. Nemhauser Lifted tableaux inequalities for 0-1
mixed-integer programs: a computational
study . . . . . . . . . . . . . . . . . 416--424
Gary J. Koehler Minimal Equivalent Binary Knapsack
Inequalities . . . . . . . . . . . . . . 425--429
Abdullah Konak and
Alice E. Smith Efficient optimization of reliable
two-node connected networks: a
biobjective approach . . . . . . . . . . 430--445
Paola Cappanera and
Maria Grazia Scutell\`a Color-coding algorithms to the balanced
path problem: computational issues . . . 446--459
Daniel Reich and
Leo Lopes Preprocessing stochastic shortest-path
problems with application to PERT
activity networks . . . . . . . . . . . 460--469
Zuo-Jun Max Shen and
Roger Lezhou Zhan and
Jiawei Zhang The reliable facility location problem:
formulations, heuristics, and
approximation algorithms . . . . . . . . 470--482
Jung-Fa Tsai and
Ming-Hua Lin An efficient global approach for
posynomial geometric programming
problems . . . . . . . . . . . . . . . . 483--492
Gijs Rennen and
Edwin R. van Dam and
Dick den Hertog Enhancement of sandwich algorithms for
approximating higher-dimensional convex
Pareto sets . . . . . . . . . . . . . . 493--517
Bogdan Pa\csaniuc and
Robert Garfinkel and
Ion M\uandoiu and
Alex Zelikovsky Optimal Testing of Digital Microfluidic
Biochips . . . . . . . . . . . . . . . . 518--529
François Clautiaux and
Cláudio Alves and
José Valério de Carvalho and
Jürgen Rietz New stabilization procedures for the
cutting stock problem . . . . . . . . . 530--545
Sergio García and
Martine Labbé and
Alfredo Marín Solving Large $p$-Median Problems with a
Radius Formulation . . . . . . . . . . . 546--556
U\ugur Kaplan and
Metin Türkay and
Bülent Karasözen and
Lorenz T. Biegler Optimization of Supply Chain Systems
with Price Elasticity of Demand . . . . 557--568
Issmail Elhallaoui and
Abdelmoutalib Metrane and
Guy Desaulniers and
François Soumis An improved primal simplex algorithm for
degenerate linear programs . . . . . . . 569--577
Amitabh Basu and
Pierre Bonami and
Gérard Cornuéjols and
François Margot Experiments with two-row cuts from
degenerate tableaux . . . . . . . . . . 578--590
A. Y. D. Siem and
D. den Hertog and
A. L. Hoffmann A method for approximating univariate
convex functions using only function
value evaluations . . . . . . . . . . . 591--604
Pia Domschke and
Bjorn Geißler and
Oliver Kolb and
Jens Lang and
Alexander Martin and
Antonio Morsi Combination of nonlinear and linear
optimization of transient gas networks 605--617
Yuping Wang and
Hong Li and
Chuangyin Dang A new evolutionary algorithm for a class
of nonlinear bilevel programming
problems and its global convergence . . 618--629
Ravi Bapna and
Sanjukta Das and
Robert Day and
Robert Garfinkel and
Jan Stallaert A clock-and-offer auction market for
grid resources when bidders face
stochastic computational needs . . . . . 630--647
Anonymous Appreciation to Reviewers . . . . . . . 648--651
Anonymous Author Index . . . . . . . . . . . . . . 652--653
Anonymous Key Word Index . . . . . . . . . . . . . 654--655
Jeff X. Yang and
John H. Drew and
Lawrence M. Leemis Automating Bivariate Transformations . . 1--9
William H. Kaczynski and
Lawrence M. Leemis and
John H. Drew Transient Queueing Analysis . . . . . . 10--28
Armann Ingolfsson and
Ling Tang Efficient and reliable computation of
birth-death process performance measures 29--41
Kaiqi Yu and
Mei-Ling Huang and
Percy H. Brill An algorithm for fitting heavy-tailed
distributions via generalized
hyperexponentials . . . . . . . . . . . 42--52
Ebru Angün and
Jack Kleijnen An asymptotic test of optimality
conditions in multiresponse simulation
optimization . . . . . . . . . . . . . . 53--65
Roberto Rossi and
S. Armagan Tarim and
Ramesh Bollapragada Constraint-based local search for
inventory control under stochastic
demand and lead time . . . . . . . . . . 66--80
Stefano Gualandi and
Federico Malucelli Exact solution of graph coloring
problems via constraint programming and
column generation . . . . . . . . . . . 81--100
Claudia Archetti and
Luca Bertazzi and
Alain Hertz and
M. Grazia Speranza A Hybrid Heuristic for an Inventory
Routing Problem . . . . . . . . . . . . 101--116
Jong-Seok Lee and
Dan Zhu Shilling Attack Detection --- A New
Approach for a Trustworthy Recommender
System . . . . . . . . . . . . . . . . . 117--131
Sanjeeb Dash and
Oktay Günlük and
Andrea Lodi and
Andrea Tramontani A time bucket formulation for the
traveling salesman problem with time
windows . . . . . . . . . . . . . . . . 132--147
Daniel Adelman and
Diego Klabjan Computing near-optimal policies in
generalized joint replenishment . . . . 148--164
Pasquale Avella and
Maurizio Boccia and
Igor Vasilyev Computational testing of a separation
procedure for the knapsack set with a
single continuous variable . . . . . . . 165--171
Brian Keller and
Güzin Bayraksan Disjunctive decomposition for two-stage
stochastic mixed-binary programs with
generalized upper bound constraints . . 172--186
Daniel Delling and
Giacomo Nannicini Core routing on dynamic time-dependent
road networks . . . . . . . . . . . . . 187--201
Peter M. Hahn and
Yi-Rong Zhu and
Monique Guignard and
William L. Hightower and
Matthew J. Saltzman A level-3 reformulation-linearization
technique-based bound for the quadratic
assignment problem . . . . . . . . . . . 202--209
Michele Samorani and
Manuel Laguna Data-mining-driven neighborhood search 210--227
Arnaud Malapert and
Hadrien Cambazard and
Christelle Guéret and
Narendra Jussien and
André Langevin and
Louis-Martin Rousseau An optimal constraint programming
approach to the open-shop problem . . . 228--244
Pavlos Eirinakis and
Dimitrios Magos and
Ioannis Mourtos and
Panayiotis Miliotis Finding all stable pairs and solutions
to the many-to-many stable matching
problem . . . . . . . . . . . . . . . . 245--259
Mehmet C. Demirci and
Andrew J. Schaefer and
H. Edwin Romeijn and
Mark S. Roberts An exact method for balancing efficiency
and equity in the liver allocation
hierarchy . . . . . . . . . . . . . . . 260--275
Daniele Catanzaro and
Martine Labbé and
Raffaele Pesenti and
Juan-José Salazar-González The balanced minimum evolution problem 276--294
Soumyadip Ghosh and
Raghu Pasupathy C-NORTA: a rejection procedure for
sampling from the tail of bivariate
NORTA distributions . . . . . . . . . . 295--310
Zan Huang and
Akhil Kumar A study of quality and accuracy
trade-offs in process mining . . . . . . 311--327
Jonathan Eckstein and
Noam Goldberg An improved branch-and-bound method for
maximum monomial agreement . . . . . . . 328--341
Gerardo Berbeglia and
Jean-François Cordeau and
Gilbert Laporte A hybrid tabu search and constraint
programming algorithm for the dynamic
dial-a-ride problem . . . . . . . . . . 343--355
Roberto Baldacci and
Aristide Mingozzi and
Roberto Roberti New state-space relaxations for solving
the traveling salesman problem with time
windows . . . . . . . . . . . . . . . . 356--371
Yinghui (Catherine) Yang and
Balaji Padmanabhan and
Hongyan Liu and
Xiaoyu Wang Discovery of periodic patterns in
sequence data: a variance-based approach 372--386
Mohammad M. Fazel-Zarandi and
J. Christopher Beck Using logic-based Benders decomposition
to solve the capacity- and
distance-constrained plant location
problem . . . . . . . . . . . . . . . . 387--398
Renata Mansini and
M. Grazia Speranza CORAL: an exact algorithm for the
multidimensional knapsack problem . . . 399--415
Xue Bai and
Ram Gopal and
Manuel Nunez and
Dmitry Zhdanov On the prevention of fraud and privacy
exposure in process information flow . . 416--432
E. C. Sewell and
S. H. Jacobson A branch, bound, and remember algorithm
for the simple assembly line balancing
problem . . . . . . . . . . . . . . . . 433--442
Xiangyong Li and
Y. P. Aneja A branch-and-cut approach for the
minimum-energy broadcasting problem in
wireless networks . . . . . . . . . . . 443--456
Sam D. Allen and
Edmund K. Burke Data structures for higher-dimensional
rectilinear packing . . . . . . . . . . 457--470
Gabriella Dellino and
Jack P. C. Kleijnen and
Carlo Meloni Robust optimization in simulation:
Taguchi and Krige combined . . . . . . . 471--484
Fabrice Talla Nobibon and
Cor A. J. Hurkens and
Roel Leus and
Frits C. R. Spieksma Coloring graphs using two colors while
avoiding monochromatic cycles . . . . . 485--499
Simon A. Spacey and
Wolfram Wiesemann and
Daniel Kuhn and
Wayne Luk Robust software partitioning with
multiple instantiation . . . . . . . . . 500--515
John W. Chinneck From the Editor . . . . . . . . . . . . 517--517
Ehsan Salari and
H. Edwin Romeijn Quantifying the trade-off between IMRT
treatment plan quality and delivery
efficiency using direct aperture
optimization . . . . . . . . . . . . . . 518--533
Bruce Golden and
Zahra Naji-Azimi and
S. Raghavan and
Majid Salari and
Paolo Toth The Generalized Covering Salesman
Problem . . . . . . . . . . . . . . . . 534--553
Nicolas Jozefowiez and
Gilbert Laporte and
Frédéric Semet A generic branch-and-cut algorithm for
multiobjective optimization problems:
application to the multilabel traveling
salesman problem . . . . . . . . . . . . 554--564
John Gunnar Carlsson Dividing a Territory Among Several
Vehicles . . . . . . . . . . . . . . . . 565--577
Faramroze G. Engineer and
George L. Nemhauser and
Martin W. P. Savelsbergh and
Jin-Hwa Song The Fixed-Charge Shortest-Path Problem 578--596
Simon Görtz and
Andreas Klose A simple but usually fast
branch-and-bound algorithm for the
capacitated facility location problem 597--610
Milind Dawande and
Vijay Mookerjee and
Chelliah Sriskandarajah and
Yunxia Zhu Structural search and optimization in
social networks . . . . . . . . . . . . 611--623
Dashi I. Singham and
Lee W. Schruben Finite-sample performance of absolute
precision stopping rules . . . . . . . . 624--635
Lih-Yuan Deng and
Jyh-Jen Horng Shiau and
Henry Horng-Shing Lu Large-order multiple recursive
generators with modulus $ 2^{31} - 1 $ 636--647
Xue Bai A Mathematical Framework for Data
Quality Management in Enterprise Systems 648--664
Warren B. Powell and
Abraham George and
Hugo Simão and
Warren Scott and
Alan Lamont and
Jeffrey Stewart SMART: a stochastic multiscale model for
the analysis of energy resources,
technology, and policy . . . . . . . . . 665--682
Anonymous Appreciation to Reviewers . . . . . . . 683--686
David L. Woodruff Message from the Editor . . . . . . . . 1--1
David R. Morrison and
Jason J. Sauppe and
Sheldon H. Jacobson A network simplex algorithm for the
equal flow problem on a generalized
network . . . . . . . . . . . . . . . . 2--12
Quentin Botton and
Bernard Fortz and
Luis Gouveia and
Michael Poss Benders decomposition for the
hop-constrained survivable network
design problem . . . . . . . . . . . . . 13--26
Wenxing Zhu and
Geng Lin and
M. M. Ali Max-$k$-cut by the discrete dynamic
convexized method . . . . . . . . . . . 27--40
Manuel A. Alba Martínez and
Jean-François Cordeau and
Mauro Dell'Amico and
Manuel Iori A Branch-and-Cut Algorithm for the
Double Traveling Salesman Problem with
Multiple Stacks . . . . . . . . . . . . 41--55
Zdravko I. Botev and
Pierre L'Ecuyer and
Gerardo Rubino and
Richard Simard and
Bruno Tuffin Static network reliability estimation
via generalized splitting . . . . . . . 56--71
François Clautiaux and
Antoine Jouglet and
Aziz Moukrim A new graph-theoretical model for the
guillotine-cutting problem . . . . . . . 72--86
Peter Buchholz and
Miklós Telek Rational automata networks: a
non-Markovian modeling approach . . . . 87--101
Dan Zhang and
Zhaosong Lu Assessing the value of dynamic pricing
in network revenue management . . . . . 102--115
S. Ayca Erdogan and
Brian Denton Dynamic appointment scheduling of a
stochastic server with uncertain demand 116--132
Jie Xu and
Barry L. Nelson and
L. Jeff Hong An adaptive hyperbox algorithm for
high-dimensional discrete optimization
via simulation problems . . . . . . . . 133--146
Tara Rengarajan and
Nedialko Dimitrov and
David P. Morton Convex approximations of a probabilistic
bicriteria model with disruptions . . . 147--160
Yinghui (Catherine) Yang and
Hongyan Liu and
Yuanjue Cai Discovery of online shopping patterns
across websites . . . . . . . . . . . . 161--176
Nilay Tanìk Argon and
Sigrún Andradóttir and
Christos Alexopoulos and
David Goldsman Steady-State Simulation with
Replication-Dependent Initial
Transients: Analysis and Examples . . . 177--191
Aristide Mingozzi and
Roberto Roberti and
Paolo Toth An exact algorithm for the multitrip
vehicle routing problem . . . . . . . . 193--207
Dimitris Bertsimas and
Dan A. Iancu and
Dmitriy Katz A New Local Search Algorithm for Binary
Optimization . . . . . . . . . . . . . . 208--221
Oleksii Mostovyi and
Oleg A. Prokopyev and
Oleg V. Shylo On maximum speedup ratio of restart
algorithm portfolios . . . . . . . . . . 222--229
Kuo-Hao Chang and
L. Jeff Hong and
Hong Wan Stochastic trust-region response-surface
method (STRONG)---a new response-surface
framework for simulation optimization 230--243
Ruslan Sadykov and
François Vanderbeck Bin packing with conflicts: a generic
branch-and-price algorithm . . . . . . . 244--255
Ivana Ljubi\'c and
Stefan Gollowitzer Layered graph approaches to the hop
constrained connected facility location
problem . . . . . . . . . . . . . . . . 256--270
Daniel E. Steffy and
Kati Wolter Valid linear programming bounds for
exact mixed-integer programming . . . . 271--284
Young Myoung Ko and
Natarajan Gautam Critically loaded time-varying
multiserver queues: computational
challenges and approximations . . . . . 285--301
Mike Hewitt and
George Nemhauser and
Martin W. P. Savelsbergh Branch-and-price guided search for
integer programs with an application to
the multicommodity fixed-charge network
flow problem . . . . . . . . . . . . . . 302--316
Shing Chih Tsai Rapid Screening Procedures for Zero-One
Optimization via Simulation . . . . . . 317--331
Defu Zhang and
Lijun Wei and
Stephen C. H. Leung and
Qingshan Chen A Binary Search Heuristic Algorithm
Based on Randomized Local Search for the
Rectangular Strip-Packing Problem . . . 332--345
Yuichi Nagata and
Shigenobu Kobayashi A powerful genetic algorithm using edge
assembly crossover for the traveling
salesman problem . . . . . . . . . . . . 346--363
A. Baykal Hafìzo\uglu and
Esma S. Gel and
Pìnar Keskinocak Expected Tardiness Computations in
Multiclass Priority M/M/c Queues . . . . 364--376
Rasmus Bokrantz and
Anders Forsgren An algorithm for approximating convex
Pareto surfaces based on dual techniques 377--393
David L. Woodruff From the Editor . . . . . . . . . . . . 395--395
David L. Kaufman and
Andrew J. Schaefer Robust Modified Policy Iteration . . . . 396--410
Edmund K. Burke and
Timothy Curtois and
Rong Qu and
Greet Vanden Berghe A Time Predefined Variable Depth Search
for Nurse Rostering . . . . . . . . . . 411--419
Alper Atamtürk and
Laurent Flindt Muller and
David Pisinger Separation and extension of cover
inequalities for conic quadratic
knapsack constraints with generalized
upper bounds . . . . . . . . . . . . . . 420--431
Huifen Chen and
Bruce Schmeiser I-SMOOTH: iteratively smoothing
mean-constrained and nonnegative
piecewise-constant functions . . . . . . 432--445
Edoardo Amaldi and
Kanika Dhyani and
Alberto Ceselli Column generation for the minimum
hyperplanes clustering problem . . . . . 446--460
Marie-Claude Côté and
Bernard Gendron and
Louis-Martin Rousseau Grammar-based column generation for
personalized multi-activity shift
scheduling . . . . . . . . . . . . . . . 461--474
Egon Balas and
Gérard Cornuéjols and
Tamás Kis and
Giacomo Nannicini Combining Lift-and-Project and
Reduce-and-Split . . . . . . . . . . . . 475--487
Boris Defourny and
Damien Ernst and
Louis Wehenkel Scenario trees and policy selection for
multistage stochastic programming using
machine learning . . . . . . . . . . . . 488--501
Yung-Ming Li and
Yong Tan and
Prabuddha De Self-organized formation and evolution
of peer-to-peer networks . . . . . . . . 502--516
Patricia E. N. Lutu and
Andries P. Engelbrecht Base Model Combination Algorithm for
Resolving Tied Predictions for
$K$-Nearest Neighbor OVA Ensemble Models 517--526
Susan R. Hunter and
Raghu Pasupathy Optimal sampling laws for stochastically
constrained simulation optimization on
finite sets . . . . . . . . . . . . . . 527--542
Akhil Kumar and
Wen Yao and
Chao-Hsien Chu Flexible Process Compliance with
Semantic Constraints Using Mixed-Integer
Programming . . . . . . . . . . . . . . 543--559
Alberto Caprara, (deceased) and
Fabio Furini and
Enrico Malaguti Uncommon Dantzig--Wolfe reformulation
for the temporal knapsack problem . . . 560--571
Yu Li and
Jia Shu and
Xi Wang and
Naihua Xiu and
Dachuan Xu and
Jiawei Zhang Approximation algorithms for integrated
distribution network design problems . . 572--584
Jinil Han and
Kyungsik Lee and
Chungmok Lee and
Sungsoo Park Exact algorithms for a bandwidth packing
problem with queueing delay guarantees 585--596
Matthew J. Saltzman Book Reviews . . . . . . . . . . . . . . 597--598
S. Margulies and
J. Ma and
I. V. Hicks The Cunningham--Geelen method in
practice: branch-decompositions and
integer programming . . . . . . . . . . 599--610
Markus Chimani and
Philipp Hungerländer Exact Approaches to Multilevel Vertical
Orderings . . . . . . . . . . . . . . . 611--624
Anna Ye Du and
Sanjukta Das and
R. Ramesh Efficient risk hedging by dynamic
forward pricing: a study in cloud
computing . . . . . . . . . . . . . . . 625--642
Han-Lin Li and
Yao-Huei Huang and
Shu-Cherng Fang A logarithmic method for reducing binary
variables and inequality constraints in
solving task assignment problems . . . . 643--653
Honggang Wang Zigzag search for continuous
multiobjective optimization . . . . . . 654--665
\.Ihsan Yanìko\uglu and
Dick den Hertog Safe Approximations of Ambiguous Chance
Constraints Using Historical Data . . . 666--681
Oleg V. Shylo and
Oleg A. Prokopyev and
Andrew J. Schaefer Stochastic operating room scheduling for
high-volume specialties under block
booking . . . . . . . . . . . . . . . . 682--692
Matteo Fischetti and
Michele Monaci Backdoor Branching . . . . . . . . . . . 693--700
Miguel A. Lejeune and
Gülay Samatlì-Paç Construction of Risk-Averse Enhanced
Index Funds . . . . . . . . . . . . . . 701--719
Robert Aboolian and
Tingting Cui and
Zuo-Jun Max Shen An efficient approach for solving
reliable facility location models . . . 720--729
John Gunnar Carlsson and
Raghuveer Devulapalli Dividing a Territory Among Several
Facilities . . . . . . . . . . . . . . . 730--742
Edmundo de Souza e Silva and
Rosa M. M. Leão and
Raymond Marie Efficient Transient Analysis of
Markovian Models Using a Block Reduction
Approach . . . . . . . . . . . . . . . . 743--757
Walid W. Nasr and
Michael R. Taaffe Fitting the Ph$_t$ /M$_t$ /s/c
Time-Dependent Departure Process for Use
in Tandem Queueing Networks . . . . . . 758--773
Juan A. Carrasco A new general-purpose method for the
computation of the interval availability
distribution . . . . . . . . . . . . . . 774--791
Patricia E. N. Lutu and
Andries P. Engelbrecht Positive-versus-negative classification
for model aggregation in predictive data
mining . . . . . . . . . . . . . . . . . 792--807
Matteo Fischetti and
Domenico Salvagnin Approximating the Split Closure . . . . 808--819
Anonymous Appreciation to Reviewers . . . . . . . 820--822
Oya Ekin Kara\csan and
A. Ridha Mahjoub and
Onur Özkök and
Hande Yaman Survivability in Hierarchical
Telecommunications Networks Under Dual
Homing . . . . . . . . . . . . . . . . . 1--15
Renata Sotirov An efficient semidefinite programming
relaxation for the graph partition
problem . . . . . . . . . . . . . . . . 16--30
Hassan Hijazi and
Pierre Bonami and
Adam Ouorou An outer-inner approximation for
separable mixed-integer nonlinear
programs . . . . . . . . . . . . . . . . 31--44
Yan T. Yang and
Barak Fishbain and
Dorit S. Hochbaum and
Eric B. Norman and
Erik Swanberg The Supervised Normalized Cut Method for
Detecting, Classifying, and Identifying
Special Nuclear Materials . . . . . . . 45--58
Yunan Liu and
Ward Whitt Algorithms for Time-Varying Networks of
Many-Server Fluid Queues . . . . . . . . 59--73
Russell R. Barton and
Barry L. Nelson and
Wei Xie Quantifying input uncertainty via
simulation confidence intervals . . . . 74--87
Claudio Contardo and
Jean-François Cordeau and
Bernard Gendron An exact algorithm based on
cut-and-column generation for the
capacitated location-routing problem . . 88--102
Yossiri Adulyasak and
Jean-François Cordeau and
Raf Jans Formulations and branch-and-cut
algorithms for multivehicle production
and inventory routing problems . . . . . 103--120
Chaoxu Tong and
Huseyin Topaloglu On the approximate linear programming
approach for network revenue management
problems . . . . . . . . . . . . . . . . 121--134
Jia Shu and
Miao Song Dynamic container deployment: two-stage
robust model, complexity, and
computational results . . . . . . . . . 135--149
Woonghee Tim Huh and
Paat Rusmevichientong Online sequential optimization with
biased gradients: theory and
applications to censored demand . . . . 150--159
Onur \vSeref and
Ya-Ju Fan and
Wanpracha Art Chaovalitwongse Mathematical programming formulations
and algorithms for discrete $k$-median
clustering of time-series data . . . . . 160--172
Franklin Djeumou Fomeni and
Adam N. Letchford A dynamic programming heuristic for the
quadratic knapsack problem . . . . . . . 173--182
Matthew J. Robbins and
Sheldon H. Jacobson and
Uday V. Shanbhag and
Banafsheh Behzad The weighted set covering game: a
vaccine pricing model for pediatric
immunization . . . . . . . . . . . . . . 183--198
Guilherme Kunigami and
Pedro J. de Rezende and
Cid C. de Souza and
Tallys Yunes Optimizing the layout of proportional
symbol maps: polyhedra and computation 199--207
Hongyan Liu and
Yinghui (Catherine) Yang and
Zhuohua Chen and
Yong Zheng A tree-based contrast set-mining
approach to detecting group differences 208--221
Santanu S. Dey and
Andrea Lodi and
Andrea Tramontani and
Laurence A. Wolsey On the Practical Strength of Two-Row
Tableau Cuts . . . . . . . . . . . . . . 222--237
Hung-Pin Kao and
Kwei Tang Cost-sensitive decision tree induction
with label-dependent late constraints 238--252
David Bergman and
Andre A. Cire and
Willem-Jan van Hoeve and
J. N. Hooker Optimization Bounds from Binary Decision
Diagrams . . . . . . . . . . . . . . . . 253--268
Athanassios N. Avramidis Constructing discrete unbounded
distributions with Gaussian-copula
dependence and given rank correlation 269--279
John Gunnar Carlsson and
Fan Jia and
Ying Li An approximation algorithm for the
continuous $k$-medians problem in a
convex polygon . . . . . . . . . . . . . 280--289
Chase Rainwater and
Joseph Geunes and
H. Edwin Romeijn Resource-constrained assignment problems
with shared resource consumption and
flexible demand . . . . . . . . . . . . 290--302
Volkan Yazici and
Cevdet Aykanat Constrained min-cut replication for
$K$-way hypergraph partitioning . . . . 303--320
Mohammad Javad Feizollahi and
Igor Averbakh The robust (minmax regret) quadratic
assignment problem with interval flows 321--335
Amitabh Basu and
Jesús A. De Loera and
Mark Junod On Chubanov's Method for Linear
Programming . . . . . . . . . . . . . . 336--350
Gediminas Adomavicius and
YoungOk Kwon Optimization-based approaches for
maximizing aggregate recommendation
diversity . . . . . . . . . . . . . . . 351--369
Vural Aksakalli and
Ibrahim Ari Penalty-based algorithms for the
stochastic obstacle scene problem . . . 370--384
L. Jeff Hong and
Zhaolin Hu and
Liwei Zhang Conditional value-at-risk approximation
to value-at-risk constrained programs: a
remedy via Monte Carlo . . . . . . . . . 385--400
Kalyan Talluri New formulations for choice network
revenue management . . . . . . . . . . . 401--413
Behnam Behdani and
J. Cole Smith An integer-programming-based approach to
the close-enough traveling salesman
problem . . . . . . . . . . . . . . . . 415--432
Abhijeet Ghoshal and
Sumit Sarkar Association rules for recommendations
with multiple items . . . . . . . . . . 433--448
Pierre L'Ecuyer and
Richard Simard On the lattice structure of a special
class of multiple recursive random
number generators . . . . . . . . . . . 449--460
Kaiquan Xu and
Stephen Shaoyi Liao and
Raymond Y. K. Lau and
J. Leon Zhao Effective active learning strategies for
the use of large-margin classifiers in
semantic annotation: an optimal
parameter discovery perspective . . . . 461--483
Michael C. Fu and
Huashuai Qu Regression models augmented with direct
stochastic gradient estimators . . . . . 484--499
Huseyin Onur Mete and
Zelda B. Zabinsky Multiobjective interacting particle
algorithm for global optimization . . . 500--513
Ahmed Ghoniem and
Hanif D. Sherali and
Hojong Baik Enhanced models for a mixed
arrival-departure aircraft sequencing
problem . . . . . . . . . . . . . . . . 514--530
Feng Qiu and
Shabbir Ahmed and
Santanu S. Dey and
Laurence A. Wolsey Covering Linear Programming with
Violations . . . . . . . . . . . . . . . 531--546
Jason J. Sauppe and
Sheldon H. Jacobson and
Edward C. Sewell Complexity and approximation results for
the balance optimization subset
selection model for causal inference in
observational studies . . . . . . . . . 547--566
J. Paul Brooks and
Eva K. Lee Solving a multigroup mixed-integer
programming-based constrained
discrimination model . . . . . . . . . . 567--585
Fang Fang and
Kaushik Dutta and
Anindya Datta Domain Adaptation for Sentiment
Classification in Light of Multiple
Sources . . . . . . . . . . . . . . . . 586--598
Anahita Khojandi and
Lisa M. Maillart and
Oleg A. Prokopyev and
Mark S. Roberts and
Timothy Brown and
William W. Barrington Optimal implantable cardioverter
defibrillator (ICD) generator
replacement . . . . . . . . . . . . . . 599--615
Eunji Lim On convergence rates of convex
regression in multiple dimensions . . . 616--628
Supreet Mandala and
Soundar Kumara and
Kalyan Chatterjee A Game-Theoretic Approach to Graph
Clustering . . . . . . . . . . . . . . . 629--643
Bernard Gendron and
Abilio Lucena and
Alexandre Salles da Cunha and
Luidi Simonetti Benders decomposition, branch-and-cut,
and hybrid algorithms for the minimum
connected dominating set problem . . . . 645--657
Michelle L. Blom and
Christina N. Burt and
Adrian R. Pearce and
Peter J. Stuckey A decomposition-based heuristic for
collaborative scheduling in a network of
open-pit mines . . . . . . . . . . . . . 658--676
Yongxi Cheng and
Ding-Zhu Du and
Yinfeng Xu A Zig-Zag Approach for Competitive Group
Testing . . . . . . . . . . . . . . . . 677--689
Xiaojin Zheng and
Xiaoling Sun and
Duan Li Improving the performance of MIQP
solvers for quadratic programs with
cardinality and minimum threshold
constraints: a semidefinite program
approach . . . . . . . . . . . . . . . . 690--703
David R. Morrison and
Jason J. Sauppe and
Edward C. Sewell and
Sheldon H. Jacobson A wide branching strategy for the graph
coloring problem . . . . . . . . . . . . 704--717
Carleton Coffrin and
Pascal Van Hentenryck A Linear-Programming Approximation of AC
Power Flows . . . . . . . . . . . . . . 718--734
Yongjia Song and
James R. Luedtke and
Simge Küçükyavuz Chance-Constrained Binary Packing
Problems . . . . . . . . . . . . . . . . 735--747
Forbes Burkowski and
Yuen-Lam Cheung and
Henry Wolkowicz Efficient use of semidefinite
programming for selection of rotamers in
protein conformations . . . . . . . . . 748--766
Esra Koca and
Hande Yaman and
M. Selim Aktürk Lot Sizing with Piecewise Concave
Production Costs . . . . . . . . . . . . 767--779
Sanjeeb Dash and
Oktay Günlük and
Juan Pablo Vielma Computational experiments with cross and
crooked cross cuts . . . . . . . . . . . 780--797
Yifei Zhao and
Stein W. Wallace Integrated facility layout design and
flow assignment problem under
uncertainty . . . . . . . . . . . . . . 798--808
Alexander Butsch and
Jörg Kalcsics and
Gilbert Laporte Districting for Arc Routing . . . . . . 809--824
Dimitri J. Papageorgiou and
Ahmet B. Keha and
George L. Nemhauser and
Joel Sokol Two-stage decomposition algorithms for
single product maritime inventory
routing . . . . . . . . . . . . . . . . 825--847
L. Jeff Hong and
Sandeep Juneja and
Jun Luo Estimating sensitivities of portfolio
credit risk using Monte Carlo . . . . . 848--865
Hao Xia and
Milind Dawande and
Vijay Mookerjee Role refinement in access control: model
and analysis . . . . . . . . . . . . . . 866--884
Brent Fisher and
Mohan Chaudhry Computing the distribution for the
number of renewals with bulk arrivals 885--892
Grit Claßen and
Arie M. C. A. Koster and
David Coudert and
Napoleão Nepomuceno Chance-Constrained Optimization of
Reliable Fixed Broadband Wireless
Networks . . . . . . . . . . . . . . . . 893--909
Anonymous Appreciation to Reviewers . . . . . . . 910--914
Eduardo Álvarez-Miranda and
Ivana Ljubi\'c and
S. Raghavan and
Paolo Toth The recoverable robust two-level network
design problem . . . . . . . . . . . . . 1--19
Haibing Lu and
Jaideep Vaidya and
Vijayalakshmi Atluri and
Yingjiu Li Statistical database auditing without
query denial threat . . . . . . . . . . 20--34
Chun-An Chou and
Zhe Liang and
Wanpracha Art Chaovalitwongse and
Tanya Y. Berger-Wolf and
Bhaskar DasGupta and
Saad Sheikh and
Mary V. Ashley and
Isabel C. Caballero Column-generation framework of nonlinear
similarity model for reconstructing
sibling groups . . . . . . . . . . . . . 35--47
Masoud Yaghini and
Mohammad Karimi and
Mohadeseh Rahbar and
Mohammad Hassan Sharifitabar A cutting-plane neighborhood structure
for fixed-charge capacitated
multicommodity network design problem 48--58
Francisco Trespalacios and
Ignacio E. Grossmann Algorithmic approach for improved
mixed-integer reformulations of convex
generalized disjunctive programs . . . . 59--74
E. R. van Dam and
R. Sotirov On Bounding the Bandwidth of Graphs with
Symmetry . . . . . . . . . . . . . . . . 75--88
Giovanni Pantuso and
Kjetil Fagerholt and
Stein W. Wallace Solving hierarchical stochastic
programs: application to the maritime
fleet renewal problem . . . . . . . . . 89--102
Andrei Sleptchenko and
M. Eric Johnson Maintaining secure and reliable
distributed control systems . . . . . . 103--117
Markus Leitner and
Ivana Ljubi\'c and
Markus Sinnl A Computational Study of Exact
Approaches for the Bi-Objective
Prize-Collecting Steiner Tree Problem 118--134
Halil \cSen and
Kerem Bülbül A Strong Preemptive Relaxation for
Weighted Tardiness and
Earliness/Tardiness Problems on
Unrelated Parallel Machines . . . . . . 135--150
Wolfgang Steitz New Heuristic Approaches for the
Bounded-Diameter Minimum Spanning Tree
Problem . . . . . . . . . . . . . . . . 151--163
Anurag Verma and
Austin Buchanan and
Sergiy Butenko Solving the Maximum Clique and Vertex
Coloring Problems on Very Large Sparse
Networks . . . . . . . . . . . . . . . . 164--177
Austin Buchanan and
Je Sang Sung and
Sergiy Butenko and
Eduardo L. Pasiliao An Integer Programming Approach for
Fault-Tolerant Connected Dominating Sets 178--188
Matthew J. Saltzman Book Reviews . . . . . . . . . . . . . . 189--192
Jin Wang and
Michael R. Taaffe Multivariate mixtures of normal
distributions: properties, random vector
generation, fitting, and as models of
market daily changes . . . . . . . . . . 193--203
Si Chen and
Ivana Ljubi\'c and
S. Raghavan The Generalized Regenerator Location
Problem . . . . . . . . . . . . . . . . 204--220
Zhang-Hua Fu and
Jin-Kao Hao Dynamic programming driven memetic
search for the Steiner tree problem with
revenues, budget, and hop constraints 221--237
Miles Lubin and
Iain Dunning Computing in Operations Research Using
Julia . . . . . . . . . . . . . . . . . 238--248
Chungmok Lee and
Minh Pham and
Myong K. Jeong and
Dohyun Kim and
Dennis K. J. Lin and
Wanpracha Art Chavalitwongse A network structural approach to the
link prediction problem . . . . . . . . 249--267
Diarmuid Grimes and
Emmanuel Hebrard Solving variants of the job shop
scheduling problem through
conflict-directed search . . . . . . . . 268--284
Yanwu Yang and
Daniel Zeng and
Yinghui Yang and
Jie Zhang Optimal budget allocation across search
advertising markets . . . . . . . . . . 285--300
Siqian Shen and
Murat Kurt and
Jue Wang Chance-constrained programming models
and approximations for general
stochastic bottleneck spanning tree
problems . . . . . . . . . . . . . . . . 301--316
L. Jeff Hong and
Jun Luo and
Barry L. Nelson Chance Constrained Selection of the Best 317--334
W. Zachary Rayfield and
Paat Rusmevichientong and
Huseyin Topaloglu Approximation methods for pricing
problems under the nested logit model
with price bounds . . . . . . . . . . . 335--357
Panos Parpas and
Berk Ustun and
Mort Webster and
Quang Kha Tran Importance sampling in stochastic
programming: a Markov chain Monte Carlo
approach . . . . . . . . . . . . . . . . 358--377
E. de Klerk and
R. Sotirov and
U. Truetsch A new semidefinite programming
relaxation for the quadratic assignment
problem and its computational
perspectives . . . . . . . . . . . . . . 378--391
Fabio Furini and
Manuel Iori and
Silvano Martello and
Mutsunori Yagiura Heuristic and exact algorithms for the
interval min-max regret knapsack problem 392--405
Radislav Vaisman and
Ofer Strichman and
Ilya Gertsbakh Model counting of monotone conjunctive
normal form formulas with spectra . . . 406--415
Maciej Rysz and
Alexander Vinel and
Pavlo Krokhmal and
Eduardo L. Pasiliao A scenario decomposition algorithm for
stochastic programming problems with a
class of downside risk measures . . . . 416--430
Silvio Alexandre de Araujo and
Bert De Reyck and
Zeger Degraeve and
Ioannis Fragkos and
Raf Jans Period decompositions for the
capacitated lot sizing problem with
setup times . . . . . . . . . . . . . . 431--448
Mihai Bilauca and
Graeme Gange and
Patrick Healy and
Kim Marriott and
Peter Moulder and
Peter J. Stuckey Automatic Minimal-Height Table Layout 449--461
Debabrata Dey and
Atanu Lahiri and
Guoying Zhang Optimal Policies for Security Patch
Management . . . . . . . . . . . . . . . 462--477
Karl Bringmann and
Benjamin Doerr and
Adrian Neumann and
Jakub Sliacan Online checkpointing with improved
worst-case guarantees . . . . . . . . . 478--490
Ohad Perry and
Ward Whitt Achieving rapid recovery in an overload
control for large-scale service systems 491--506
Artur Alves Pessoa and
Michael Poss Robust network design with uncertain
outsourcing cost . . . . . . . . . . . . 507--524
Daniel R. Jiang and
Warren B. Powell Optimal hour-ahead bidding in the
real-time electricity market with
battery storage using approximate
dynamic programming . . . . . . . . . . 525--543
Willem van Jaarsveld and
Alan Scheller-Wolf Optimization of industrial-scale
assemble-to-order systems . . . . . . . 544--560
Raymond Y. K. Lau and
J. Leon Zhao and
Wenping Zhang and
Yi Cai and
Eric W. T. Ngai Learning context-sensitive domain
ontologies from folksonomies: a
cognitively motivated method . . . . . . 561--578
Antoine Sauré and
Jonathan Patrick and
Martin L. Puterman Simulation-based approximate policy
iteration with generalized logistic
functions . . . . . . . . . . . . . . . 579--595
Natashia Boland and
Hadi Charkhgard and
Martin Savelsbergh A Criterion Space Search Algorithm for
Biobjective Mixed Integer Programming:
The Triangle Splitting Method . . . . . 597--618
Xue Bai and
Sudip Bhattacharjee and
Fidan Boylu and
Ram Gopal Growth projections and assortment
planning of commodity products across
multiple stores: a data mining and
optimization approach . . . . . . . . . 619--635
Zhou Xu and
Brian Rodrigues A 3/2-approximation algorithm for the
multiple TSP with a fixed number of
depots . . . . . . . . . . . . . . . . . 636--645
Andrew Ahn and
Martin Haugh Linear programming and the control of
diffusion processes . . . . . . . . . . 646--657
Rafael Martinelli and
Claudio Contardo Exact and heuristic algorithms for
capacitated vehicle routing problems
with quadratic costs structure . . . . . 658--676
Adolfo R. Escobedo and
Erick Moreno-Centeno Roundoff-error-free algorithms for
solving linear systems via Cholesky and
LU factorizations . . . . . . . . . . . 677--689
Gilles Pesant Achieving domain consistency and
counting solutions for dispersion
constraints . . . . . . . . . . . . . . 690--703
Jiangchuan Huang and
Christoph M. Kirsch and
Raja Sengupta Cloud Computing in Space . . . . . . . . 704--717
Daniel Gartner and
Rainer Kolisch and
Daniel B. Neill and
Rema Padman Machine Learning Approaches for Early
DRG Classification and Resource
Allocation . . . . . . . . . . . . . . . 718--734
Natashia Boland and
Hadi Charkhgard and
Martin Savelsbergh A Criterion Space Search Algorithm for
Biobjective Integer Programming: The
Balanced Box Method . . . . . . . . . . 735--754
Serhat Gul and
Brian T. Denton and
John W. Fowler A progressive hedging approach for
surgery planning under uncertainty . . . 755--772
Jérémy Omer and
Samuel Rosat and
Vincent Raymond and
François Soumis Improved primal simplex: a more general
theoretical framework and an extended
experimental analysis . . . . . . . . . 773--787
Thomas Bortfeld and
Jagdish Ramakrishnan and
John N. Tsitsiklis and
Jan Unkelbach Optimization of radiation therapy
fractionation schedules in the presence
of tumor repopulation . . . . . . . . . 788--803
Anonymous Appreciation to Reviewers . . . . . . . 804--808
Anonymous Editorial Board . . . . . . . . . . . . c2--c3
Andre A. Cire and
John N. Hooker and
Tallys Yunes Modeling with metaconstraints and
semantic typing of variables . . . . . . 1--13
Natashia Boland and
Riley Clement and
Hamish Waterer A bucket indexed formulation for
nonpreemptive single machine scheduling
problems . . . . . . . . . . . . . . . . 14--30
Roberto Bagnara and
Matthieu Carlier and
Roberta Gori and
Arnaud Gotlieb Exploiting binary floating-point
representations for constraint
propagation . . . . . . . . . . . . . . 31--46
David Bergman and
Andre A. Cire and
Willem-Jan van Hoeve and
J. N. Hooker Discrete Optimization with Decision
Diagrams . . . . . . . . . . . . . . . . 47--66
David R. Morrison and
Edward C. Sewell and
Sheldon H. Jacobson Solving the pricing problem in a
branch-and-price algorithm for graph
coloring using zero-suppressed binary
decision diagrams . . . . . . . . . . . 67--82
Tony T. Tran and
Arthur Araujo and
J. Christopher Beck Decomposition methods for the parallel
machine scheduling problem with setups 83--95
Vural Aksakalli and
O. Furkan Sahin and
Ibrahim Ari An AO$^*$ Based Exact Algorithm for the
Canadian Traveler Problem . . . . . . . 96--111
Jonathan Eckstein and
Deniz Eskandani and
Jingnan Fan Multilevel optimization modeling for
risk-averse stochastic programming . . . 112--128
Gediminas Adomavicius and
Jingjing Zhang Classification, ranking, and top-K
stability of recommendation algorithms 129--147
Akiyoshi Shioura and
Natalia V. Shakhlevich and
Vitaly A. Strusevich Application of submodular optimization
to single machine scheduling with
controllable processing times subject to
release dates and deadlines . . . . . . 148--161
Joe Naoum-Sawaya and
Christoph Buchheim Robust critical node selection by
Benders decomposition . . . . . . . . . 162--174
Timo Gschwind and
Stefan Irnich Dual inequalities for stabilized column
generation revisited . . . . . . . . . . 175--194
Anonymous Editorial Board . . . . . . . . . . . . c2--c3
Yijie Peng and
Chun-Hung Chen and
Michael C. Fu and
Jian-Qiang Hu Dynamic Sampling Allocation and Design
Selection . . . . . . . . . . . . . . . 195--208
Francisco Trespalacios and
Ignacio E. Grossmann Cutting plane algorithm for convex
generalized disjunctive programs . . . . 209--222
Shaolong Tong and
Guangwu Liu Importance sampling for option Greeks
with discontinuous payoffs . . . . . . . 223--235
Zunqiang Zhang and
Guoqing Chen and
Jin Zhang and
Xunhua Guo and
Qiang Wei Providing consistent opinions from
online reviews: a heuristic stepwise
optimization approach . . . . . . . . . 236--250
Terry James and
Kevin Glazebrook and
Kyle Lin Developing effective service policies
for multiclass queues with abandonment:
asymptotic optimality and approximate
policy improvement . . . . . . . . . . . 251--264
Mauro Passacantando and
Danilo Ardagna and
Anna Savi Service provisioning problem in cloud
and multi-cloud systems . . . . . . . . 265--277
Xin Li and
Kun Chen and
Sherry X. Sun and
Terrance Fung and
Huaiqing Wang and
Daniel D. Zeng A Commonsense Knowledge-Enabled Textual
Analysis Approach for Financial Market
Surveillance . . . . . . . . . . . . . . 278--294
Juan Ma and
Foad Mahdavi Pajouh and
Balabhaskar Balasundaram and
Vladimir Boginski The minimum spanning $k$-core problem
with bounded CVaR under probabilistic
edge failures . . . . . . . . . . . . . 295--307
Ulrich Pferschy and
Joachim Schauer Approximation of the Quadratic Knapsack
Problem . . . . . . . . . . . . . . . . 308--318
Alberto Caprara and
Margarida Carvalho and
Andrea Lodi and
Gerhard J. Woeginger Bilevel Knapsack with Interdiction
Constraints . . . . . . . . . . . . . . 319--333
María I. Restrepo and
Bernard Gendron and
Louis-Martin Rousseau Branch-and-price for personalized
multiactivity tour scheduling . . . . . 334--350
Alexander H. Gose and
Brian T. Denton Sequential bounding methods for
two-stage stochastic programs . . . . . 351--369
Thije van Barneveld The minimum expected penalty relocation
problem for the computation of
compliance tables for ambulance vehicles 370--384
Weini Zhang and
Hamed Rahimian and
Güzin Bayraksan Decomposition algorithms for risk-averse
multistage stochastic programs with
application to water allocation under
uncertainty . . . . . . . . . . . . . . 385--404
Chan Y. Han and
Brian J. Lunday and
Matthew J. Robbins A game theoretic model for the optimal
location of integrated air defense
system missile batteries . . . . . . . . 405--416
Xiaojun Zhu and
Guihai Chen and
Shaojie Tang and
Xiaobing Wu and
Bing Chen Fast approximation algorithm for maximum
lifetime aggregation trees in wireless
sensor networks . . . . . . . . . . . . 417--431
Seyed Hossein Hashemi Doulabi and
Louis-Martin Rousseau and
Gilles Pesant A constraint-programming-based
branch-and-price-and-cut approach for
operating room planning and scheduling 432--448
Ambros M. Gleixner and
Daniel E. Steffy and
Kati Wolter Iterative Refinement for Linear
Programming . . . . . . . . . . . . . . 449--464
Ioannis Fragkos and
Zeger Degraeve and
Bert De Reyck A horizon decomposition approach for the
capacitated lot-sizing problem with
setup times . . . . . . . . . . . . . . 465--482
Gustavo Angulo and
Shabbir Ahmed and
Santanu S. Dey Improving the Integer L-Shaped Method 483--499
Dimitris Bertsimas and
Frans J. C. T. de Ruiter Duality in two-stage adaptive linear
optimization: faster computation and
stronger bounds . . . . . . . . . . . . 500--511
Fang Lu and
John J. Hasenbein and
David P. Morton Modeling and optimization of a spatial
detection system . . . . . . . . . . . . 512--526
Yongjia Song and
Siqian Shen Risk-Averse Shortest Path Interdiction 527--539
Marco A. Boschetti and
Vittorio Maniezzo and
Francesco Strappaveccia Using GPU computing for solving the
two-dimensional guillotine cutting
problem . . . . . . . . . . . . . . . . 540--552
Krzysztof Postek and
Dick den Hertog Multistage adjustable robust
mixed-integer optimization via iterative
splitting of the uncertainty set . . . . 553--574
Ahmed Ghoniem and
Tulay Flamand and
Mohamed Haouari Optimization-based very large-scale
neighborhood search for generalized
assignment problems with
location/allocation considerations . . . 575--588
Ahmed Ghoniem and
Tulay Flamand and
Mohamed Haouari Exact solution methods for a generalized
assignment problem with
location/allocation considerations . . . 589--602
Jianqiang Hu and
Cheng Zhang and
Chenbo Zhu $ (s, S) $ inventory systems with
correlated demands . . . . . . . . . . . 603--611
Ronghuo Zheng and
Tinglong Dai and
Katia Sycara and
Nilanjan Chakraborty Automated multilateral negotiation on
multiple issues with private information 612--628
Xi Chen and
Kyoung-Kuk Kim Efficient VaR and CVaR measurement via
stochastic kriging . . . . . . . . . . . 629--644
Conrado Borraz-Sánchez and
Russell Bent and
Scott Backhaus and
Hassan Hijazi and
Pascal Van Hentenryck Convex Relaxations for Gas Expansion
Planning . . . . . . . . . . . . . . . . 645--656
Sepehr Nemati and
Oleg V. Shylo and
Oleg A. Prokopyev and
Andrew J. Schaefer The surgical patient routing problem: a
central planner approach . . . . . . . . 657--673
Ahmed M. Marzouk and
Erick Moreno-Centeno and
Halit Üster A branch-and-price algorithm for solving
the Hamiltonian $p$-median problem . . . 674--686
Lindong Liu and
Xiangtong Qi and
Zhou Xu Computing near-optimal stable cost
allocations for cooperative games by
Lagrangian relaxation . . . . . . . . . 687--702
Krzysztof Fleszar An exact algorithm for the
two-dimensional stage-unrestricted
guillotine cutting/packing decision
problem . . . . . . . . . . . . . . . . 703--720
Bin Han and
Ilya O. Ryzhov and
Boris Defourny Optimal learning in linear regression
with combinatorial feature selection . . 721--735
Fabio Furini and
Enrico Malaguti and
Dimitri Thomopulos Modeling two-dimensional guillotine
cutting problems via integer programming 736--751
Walton Pereira Coutinho and
Roberto Quirino do Nascimento and
Artur Alves Pessoa and
Anand Subramanian A branch-and-bound algorithm for the
close-enough traveling salesman problem 752--765
Kerem Akartunalì and
Ioannis Fragkos and
Andrew J. Miller and
Tao Wu Local cuts and two-period convex hull
closures for big-bucket lot-sizing
problems . . . . . . . . . . . . . . . . 766--780
Edmund K. Burke and
Yuri Bykov An adaptive flex-deluge approach to
university exam timetabling . . . . . . 781--794
Anonymous Appreciation to Reviewers . . . . . . . 795--799
Jamol Pender Sampling the functional Kolmogorov
forward equations for nonstationary
queueing networks . . . . . . . . . . . 1--17
Dan Zhang and
Larry Weatherford Dynamic pricing for network revenue
management: a new approach and
application in the hotel industry . . . 18--35
Kuo-Ling Huang and
Sanjay Mehrotra Solution of monotone complementarity and
general convex programming problems
using a modified potential reduction
interior point method . . . . . . . . . 36--53
James M. Davis and
Huseyin Topaloglu and
David P. Williamson Pricing problems under the nested logit
model with a quality consistency
constraint . . . . . . . . . . . . . . . 54--76
Merve Bodur and
Sanjeeb Dash and
Oktay Günlük and
James Luedtke Strengthened Benders cuts for stochastic
integer programs with continuous
recourse . . . . . . . . . . . . . . . . 77--91
Il-Horn Hann and
JooHee Oh Combating prerelease piracy: modeling
the effects of antipiracy measures in
P2P networks . . . . . . . . . . . . . . 92--107
Han-Lin Li and
Yao-Huei Huang and
Shu-Cherng Fang Linear reformulation of polynomial
discrete programming for fast
computation . . . . . . . . . . . . . . 108--122
Leonardo Lozano and
J. Cole Smith A backward sampling framework for
interdiction problems with fortification 123--139
A. D. Banik and
M. L. Chaudhry Efficient computational analysis of
stationary probabilities for the
queueing system $ {\rm BMAP} / G / 1 / N
$ with or without vacation(s) . . . . . 140--151
Manish Bansal and
Kiavash Kianfar Planar maximum coverage location problem
with partial coverage and rectangular
demand and service zones . . . . . . . . 152--169
Daniel Porumbel and
François Clautiaux Constraint aggregation in column
generation models for
resource-constrained covering problems 170--184
Alejandro Marcos Alvarez and
Quentin Louveaux and
Louis Wehenkel A machine learning-based approximation
of strong branching . . . . . . . . . . 185--195
Onur \cSeref and
J. Paul Brooks and
Bernice Huang and
Stephen S. Fong Enumeration and Cartesian product
decomposition of alternate optimal
fluxes in cellular metabolism . . . . . 197--210
Ward Romeijnders and
David P. Morton and
Maarten H. van der Vlerk, (deceased) Assessing the quality of convex
approximations for two-stage totally
unimodular integer recourse models . . . 211--231
Feng Li and
Zhi-Long Chen and
Lixin Tang Integrated production, inventory and
delivery problems: complexity and
algorithms . . . . . . . . . . . . . . . 232--250
Erkut Sönmez and
Alan Scheller-Wolf and
Nicola Secomandi An analytical throughput approximation
for closed fork/join networks . . . . . 251--267
Yuanfeng Cai and
Zhengrui Jiang and
Vijay Mookerjee How to deal with liars? Designing
intelligent rule-based expert systems to
increase accuracy or reduce cost . . . . 268--286
Yongzhen Li and
Jia Shu and
Miao Song and
Jiawei Zhang and
Huan Zheng Multisourcing supply network design:
two-stage chance-constrained model,
tractable approximations, and
computational results . . . . . . . . . 287--300
Young Woong Park and
Yan Jiang and
Diego Klabjan and
Loren Williams Algorithms for generalized clusterwise
linear regression . . . . . . . . . . . 301--317
Alain Billionnet and
Sourour Elloumi and
Amélie Lambert and
Angelika Wiegele Using a conic bundle method to
accelerate both phases of a quadratic
convex reformulation . . . . . . . . . . 318--331
Somayeh Moazeni and
Warren B. Powell and
Boris Defourny and
Belgacem Bouzaiene-Ayari Parallel nonstationary direct policy
search for risk-averse stochastic
optimization . . . . . . . . . . . . . . 332--349
Aharon Ben-Tal and
Ruud Brekelmans and
Dick den Hertog and
Jean-Philippe Vial Globalized robust optimization for
nonlinear uncertain inequalities . . . . 350--366
Ira Gerhardt and
Barry L. Nelson and
Michael R. Taaffe Technical Note: The MAP$_t$ /Ph$_t$ /$
\infty $ Queueing System and Multiclass
[MAP$_t$ /Ph$_t$ /$ \infty $]$^K$
Queueing Network . . . . . . . . . . . . 367--376
Claudia Archetti and
Natashia Boland and
M. Grazia Speranza A matheuristic for the multivehicle
inventory routing problem . . . . . . . 377--387
Sanjay Dominik Jena and
Jean-François Cordeau and
Bernard Gendron Lagrangian heuristics for large-scale
dynamic facility location with
generalized modular capacities . . . . . 388--404
\.Ibrahim Muter and
Tevfik Aytekin Incorporating aggregate diversity in
recommender systems using scalable
optimization approaches . . . . . . . . 405--421
Fatemeh Saberian and
Archis Ghate and
Minsun Kim Spatiotemporally optimal fractionation
in radiotherapy . . . . . . . . . . . . 422--437
Shaokun Fan and
Xin Li and
J. Leon Zhao Collaboration Process Pattern Approach
to Improving Teamwork Performance: A
Data Mining-Based Methodology . . . . . 438--456
Andrea Bettinelli and
Valentina Cacchiani and
Enrico Malaguti A branch-and-bound algorithm for the
knapsack problem with conflict graph . . 457--473
Caleb C. Fast and
Illya V. Hicks A branch decomposition algorithm for the
$p$-median problem . . . . . . . . . . . 474--488
Diego Pecin and
Claudio Contardo and
Guy Desaulniers and
Eduardo Uchoa New enhancements for the exact solution
of the vehicle routing problem with time
windows . . . . . . . . . . . . . . . . 489--502
Meghana Deodhar and
Joydeep Ghosh and
Maytal Saar-Tsechansky and
Vineet Keshari Active learning with multiple localized
regression models . . . . . . . . . . . 503--522
Tao Wu and
Kerem Akartunalì and
Raf Jans and
Zhe Liang Progressive selection method for the
coupled lot-sizing and cutting-stock
problem . . . . . . . . . . . . . . . . 523--543
Ricardo Fukasawa and
Laurent Poirrier Numerically safe lower bounds for the
capacitated vehicle routing problem . . 544--557
Vahid Roshanaei and
Curtiss Luong and
Dionne M. Aleman and
David R. Urbach Collaborative Operating Room Planning
and Scheduling . . . . . . . . . . . . . 558--580
Juliane Müller SOCEMO: surrogate optimization of
computationally expensive multiobjective
problems . . . . . . . . . . . . . . . . 581--596
Ashwin Arulselvan and
Mohsen Rezapour and
Wolfgang A. Welz Exact approaches for designing
multifacility buy-at-bulk networks . . . 597--611
Jens Hübner and
Martin Schmidt and
Marc C. Steinbach A distributed interior-point KKT solver
for multistage stochastic optimization 612--630
Bjorn P. Berg and
Brian T. Denton Fast approximation methods for online
scheduling of outpatient procedure
centers . . . . . . . . . . . . . . . . 631--644
Kathryn M. Schumacher and
Amy E. M. Cohn and
Richard Li-Yang Chen Algorithm for the $N$-2
security-constrained unit commitment
problem with transmission switching . . 645--659
Baojun Ma and
Qiang Wei and
Guoqing Chen and
Jin Zhang and
Xunhua Guo Content and structure coverage:
extracting a diverse information subset 660--675
Alexandre Domingues Gonçalves and
Artur Alves Pessoa and
Cristiana Bentes and
Ricardo Farias and
Lúcia Maria de A. Drummond A graphics processing unit algorithm to
solve the quadratic assignment problem
using level-2
reformulation-linearization technique 676--687
Jamol Pender and
Young Myoung Ko Approximations for the queue length
distributions of time-varying
many-server queues . . . . . . . . . . . 688--704
Benjamin C. Shelbourne and
Maria Battarra and
Chris N. Potts The vehicle routing problem with release
and due dates . . . . . . . . . . . . . 705--723
Akiyoshi Shioura and
Natalia V. Shakhlevich and
Vitaly A. Strusevich Machine speed scaling by adapting
methods for convex optimization with
submodular constraints . . . . . . . . . 724--736
Maria Albareda-Sambola and
Elena Fernández and
Francisco Saldanha-da-Gama Heuristic solutions to the facility
location problem with general Bernoulli
demands . . . . . . . . . . . . . . . . 737--753
Yash Puranik and
Nikolaos V. Sahinidis Deletion presolve for accelerating
infeasibility diagnosis in optimization
models . . . . . . . . . . . . . . . . . 754--766
Camilo Ortiz-Astorquiza and
Ivan Contreras and
Gilbert Laporte Formulations and approximation
algorithms for multilevel uncapacitated
facility location . . . . . . . . . . . 767--779
Anonymous Appreciation to Reviewers . . . . . . . 780--783
Qi-Ming He and
Attahiru Sule Alfa Space Reduction for a Class of
Multidimensional Markov Chains: A
Summary and Some Applications . . . . . 1--10
Yuji Shinano and
Stefan Heinz and
Stefan Vigerske and
Michael Winkler FiberSCIP --- A Shared Memory
Parallelization of SCIP . . . . . . . . 11--30
Jianzhe Zhen and
Dick den Hertog Computing the Maximum Volume Inscribed
Ellipsoid of a Polytopic Projection . . 31--42
Betül Ahat and
Tìnaz Ekim and
Z. Caner Ta\cskìn Integer Programming Formulations and
Benders Decomposition for the Maximum
Induced Matching Problem . . . . . . . . 43--56
Wim van Ackooij and
Welington de Oliveira and
Yongjia Song Adaptive Partition-Based Level
Decomposition Methods for Solving
Two-Stage Stochastic Programs with Fixed
Recourse . . . . . . . . . . . . . . . . 57--70
Ni Ma and
Ward Whitt A Rare-Event Simulation Algorithm for
Periodic Single-Server Queues . . . . . 71--89
Yan Deng and
Shabbir Ahmed and
Siqian Shen Parallel Scenario Decomposition of
Risk-Averse $0$--$1$ Stochastic Programs 90--105
Daniel F. Salas and
Warren B. Powell Benchmarking a Scalable Approximate
Dynamic Programming Algorithm for
Stochastic Control of Grid-Level Energy
Storage . . . . . . . . . . . . . . . . 106--123
Lehilton L. C. Pedrosa and
Maxim Sviridenko Integrated Supply Chain Management via
Randomized Rounding . . . . . . . . . . 124--136
Chu-Min Li and
Zhiwen Fang and
Hua Jiang and
Ke Xu Incremental Upper Bound for the Maximum
Clique Problem . . . . . . . . . . . . . 137--153
Enlu Zhou and
Shalabh Bhatnagar Gradient-Based Adaptive Stochastic
Search for Simulation Optimization Over
Continuous Space . . . . . . . . . . . . 154--167
Roberto Cordone and
Pierre Hosteins and
Giovanni Righini A Branch-and-Bound Algorithm for the
Prize-Collecting Single-Machine
Scheduling Problem with Deadlines and
Total Tardiness Minimization . . . . . . 168--180
Song-Hee Kim and
Ward Whitt and
Won Chul Cha A Data-Driven Model of an
Appointment-Generated Arrival Process at
an Outpatient Clinic . . . . . . . . . . 181--199
Robin C. Ball and
Juergen Branke and
Stephan Meisel Optimal Sampling for Simulated Annealing
Under Noise . . . . . . . . . . . . . . 200--215
Zhao Zhang and
Jiao Zhou and
Shaojie Tang and
Xiaohui Huang and
Ding-Zhu Du Computing Minimum $k$-Connected $m$-Fold
Dominating Set in General Graphs . . . . 217--224
Jiao Zhou and
Zhao Zhang and
Shaojie Tang and
Xiaohui Huang and
Ding-Zhu Du Breaking the $ O (\ln n) $ Barrier: An
Enhanced Approximation Algorithm for
Fault-Tolerant Minimum Weight Connected
Dominating Set . . . . . . . . . . . . . 225--235
Tao Wu and
Zhe Liang and
Canrong Zhang Analytics Branching and Selection for
the Capacitated Multi-Item Lot Sizing
Problem with Nonidentical Machines . . . 236--258
Hamidreza Badri and
Ehsan Salari and
Yoichi Watanabe and
Kevin Leder Optimizing Chemoradiotherapy to Target
Metastatic Disease and Tumor Growth . . 259--277
Bing Wang and
Jiaqiao Hu Some Monotonicity Results for Stochastic
Kriging Metamodels in Sequential
Settings . . . . . . . . . . . . . . . . 278--294
Kre\vsimir Mihi\'c and
Kevin Ryan and
Alan Wood Randomized Decomposition Solver with the
Quadratic Assignment Problem as a Case
Study . . . . . . . . . . . . . . . . . 295--308
Björn Geißler and
Antonio Morsi and
Lars Schewe and
Martin Schmidt Solving Highly Detailed Gas Transport
MINLPs: Block Separability and Penalty
Alternating Direction Methods . . . . . 309--323
Nathan Adelgren and
Pietro Belotti and
Akshay Gupte Efficient Storage of Pareto Points in
Biobjective Mixed Integer Programming 324--338
A. Pessoa and
R. Sadykov and
E. Uchoa and
F. Vanderbeck Automation and Combination of
Linear-Programming Based Stabilization
Techniques in Column Generation . . . . 339--360
Oliver Lum and
Bruce Golden and
Edward Wasil An Open-Source Desktop Application for
Generating Arc-Routing Benchmark
Instances . . . . . . . . . . . . . . . 361--370
Osman Y. Özaltìn and
Oleg A. Prokopyev and
Andrew J. Schaefer Optimal Design of the Seasonal Influenza
Vaccine with Manufacturing Autonomy . . 371--387
Jikai Zou and
Shabbir Ahmed and
Xu Andy Sun Partially Adaptive Stochastic
Optimization for Electric Power
Generation Expansion Planning . . . . . 388--401
Markus Leitner and
Ivana Ljubi\'c and
Martin Luipersbeck and
Markus Sinnl A Dual Ascent-Based Branch-and-Bound
Framework for the Prize-Collecting
Steiner Tree and Related Problems . . . 402--420
Allen Holder and
Fred Murphy and
William Pierskalla A Memorial to Harvey J. Greenberg,
Founding Editor of the \booktitleINFORMS
Journal on Computing . . . . . . . . . . 421--423
Christoph Buchheim and
Emiliano Traversi Quadratic Combinatorial Optimization
Using Separable Underestimators . . . . 424--437
Mingzheng Wang and
Zhengrui Jiang and
Yu Zhang and
Haifang Yang $T$-Closeness Slicing: A New
Privacy-Preserving Approach for
Transactional Data Publishing . . . . . 438--453
Xueting Cui and
Xiaoling Sun and
Shushang Zhu and
Rujun Jiang and
Duan Li Portfolio Optimization with
Nonparametric Value at Risk: A Block
Coordinate Descent Method . . . . . . . 454--471
Jamie Fairbrother and
Amanda Turner and
Stein W. Wallace Scenario Generation for Single-Period
Portfolio Selection Problems with Tail
Risk Measures: Coping with High
Dimensions and Integer Variables . . . . 472--491
Huseyin Tunc and
Onur A. Kilic and
S. Armagan Tarim and
Roberto Rossi An Extended Mixed-Integer Programming
Formulation and Dynamic Cut Generation
Approach for the Stochastic Lot-Sizing
Problem . . . . . . . . . . . . . . . . 492--506
Amin Khademi and
Burak Eksioglu Spare Parts Inventory Management with
Substitution-Dependent Reliability . . . 507--521
Igor Averbakh and
Jordi Pereira Lateness Minimization in Pairwise
Connectivity Restoration Problems . . . 522--538
Renaud Chicoisne and
Fernando Ordóñez and
Daniel Espinoza Risk Averse Shortest Paths: A
Computational Study . . . . . . . . . . 539--553
Claudio Gambella and
Joe Naoum-Sawaya and
Bissan Ghaddar The Vehicle Routing Problem with
Floating Targets: Formulation and
Solution Approaches . . . . . . . . . . 554--569
Taghi Khaniyev and
Samir Elhedhli and
Fatih Safa Erenay Structure Detection in Mixed-Integer
Programs . . . . . . . . . . . . . . . . 570--587
Ran Liu and
Xiaolan Xie Physician Staffing for Emergency
Departments with Time-Varying Demand . . 588--607
Iain Dunning and
Swati Gupta and
John Silberholz What Works Best When? A Systematic
Evaluation of Heuristics for Max-Cut and
QUBO . . . . . . . . . . . . . . . . . . 608--624
Tolga Bekta\cs Disjunctive Programming for
Multiobjective Discrete Optimisation . . 625--633
Yingda Song and
Ning Cai and
Steven Kou Computable Error Bounds of Laplace
Inversion for Pricing Asian Options . . 634--645
Jean-François Côté and
Manuel Iori The Meet-in-the-Middle Principle for
Cutting and Packing Problems . . . . . . 646--661
Yuli Zhang and
Zuo-Jun Max Shen and
Shiji Song Exact Algorithms for Distributionally $
\beta $-Robust Machine Scheduling with
Uncertain Processing Times . . . . . . . 662--676
Qi Fan and
Jiaqiao Hu Surrogate-Based Promising Area Search
for Lipschitz Continuous Simulation
Optimization . . . . . . . . . . . . . . 677--693
Ricardo Fukasawa and
Qie He and
Fernando Santos and
Yongjia Song A Joint Vehicle Routing and Speed
Optimization Problem . . . . . . . . . . 694--709
Alberto Ceselli and
Maria Luisa Damiani and
Giovanni Righini and
Diego Valorsi Mathematical Programming Algorithms for
Spatial Cloaking . . . . . . . . . . . . 710--723
Demet Batur and
Lina Wang and
F. Fred Choobineh Methods for System Selection Based on
Sequential Mean--Variance Analysis . . . 724--738
Ben Knueven and
Jim Ostrowski and
Jianhui Wang The Ramping Polytope and Cut Generation
for the Unit Commitment Problem . . . . 739--749
Yan Li and
Kristofer G. Reyes and
Jorge Vazquez-Anderson and
Yingfei Wang and
Lydia M. Contreras and
Warren B. Powell A Knowledge Gradient Policy for
Sequencing Experiments to Identify the
Structure of RNA Molecules Using a
Sparse Additive Belief Model . . . . . . 750--767
Daniel Kowalczyk and
Roel Leus A Branch-and-Price Algorithm for
Parallel Machine Scheduling Using ZDDs
and Generic Branching . . . . . . . . . 768--782
Anonymous Appreciation to Reviewers . . . . . . . 783--786
Alice E. Smith Message from the Editor . . . . . . . . 1--1
Zhen Sun and
Milind Dawande and
Ganesh Janakiraman and
Vijay Mookerjee Data-Driven Decisions for Problems with
an Unspecified Objective Function . . . 2--20
Liujia Hu and
Sigrún Andradóttir An Asymptotically Optimal Set Approach
for Simulation Optimization . . . . . . 21--39
Terrence W. K. Mak and
Pascal Van Hentenryck and
Anatoly Zlotnik and
Russell Bent Dynamic Compressor Optimization in
Natural Gas Pipeline Systems . . . . . . 40--65
Shalinda Adikari and
Kaushik Dutta A New Approach to Real-Time Bidding in
Online Advertisements: Auto Pricing
Strategy . . . . . . . . . . . . . . . . 66--82
Mika Sumida and
Huseyin Topaloglu An Approximation Algorithm for Capacity
Allocation Over a Single Flight Leg with
Fare-Locking . . . . . . . . . . . . . . 83--99
Marleen Balvert and
Dick den Hertog and
Aswin L. Hoffmann Robust Optimization of Dose-Volume
Metrics for Prostate HDR-Brachytherapy
Incorporating Target and OAR Volume
Delineation Uncertainties . . . . . . . 100--114
Aritra Pal and
Hadi Charkhgard A Feasibility Pump and Local Search
Based Heuristic for Bi-Objective Pure
Integer Linear Programming . . . . . . . 115--133
Masoud Chitsaz and
Jean-François Cordeau and
Raf Jans A Unified Decomposition Matheuristic for
Assembly, Production, and Inventory
Routing . . . . . . . . . . . . . . . . 134--152
Xin Wang and
Teodor Gabriel Crainic and
Stein W. Wallace Stochastic Network Design for Planning
Scheduled Transportation Services: The
Value of Deterministic Solutions . . . . 153--170
Markus Leitner and
Ivana Ljubi\'c and
Martin Riedler and
Mario Ruthmair Exact Approaches for Network Design
Problems with Relays . . . . . . . . . . 171--192
Bowen Du and
Wenjun Zhou and
Chuanren Liu and
Yifeng Cui and
Hui Xiong Transit Pattern Detection Using Tensor
Factorization . . . . . . . . . . . . . 193--206
Asim Roy and
Shiban Qureshi and
Kartikeya Pande and
Divitha Nair and
Kartik Gairola and
Pooja Jain and
Suraj Singh and
Kirti Sharma and
Akshay Jagadale and
Yi-Yang Lin and
Shashank Sharma and
Ramya Gotety and
Yuexin Zhang and
Ji Tang and
Tejas Mehta and
Hemanth Sindhanuru and
Nonso Okafor and
Santak Das and
Chidambara N. Gopal and
Srinivasa B. Rudraraju and
Avinash V. Kakarlapudi Performance Comparison of Machine
Learning Platforms . . . . . . . . . . . 207--225
Hao-Chun Lu and
Liming Yao Efficient Convexification Strategy for
Generalized Geometric Programming
Problems . . . . . . . . . . . . . . . . 226--234
Jun Pei and
Zorica Dra\vzi\'c and
Milan Dra\vzi\'c and
Nenad Mladenovi\'c and
Panos M. Pardalos Continuous Variable Neighborhood Search
(C-VNS) for Solving Systems of Nonlinear
Equations . . . . . . . . . . . . . . . 235--250
Ruslan Sadykov and
François Vanderbeck and
Artur Pessoa and
Issam Tahiri and
Eduardo Uchoa Primal Heuristics for Branch and Price:
The Assets of Diving Methods . . . . . . 251--267
Yogesh Kumar Agarwal and
Prahalad Venkateshan New Valid Inequalities for the Optimal
Communication Spanning Tree Problem . . 268--284
Christian Tjandraatmadja and
Willem-Jan van Hoeve Target Cuts from Relaxed Decision
Diagrams . . . . . . . . . . . . . . . . 285--301
Ilbin Lee and
Stewart Curry and
Nicoleta Serban Solving Large Batches of Linear Programs 302--317
Manish Aggarwal and
Ali Fallah Tehrani Modelling Human Decision Behaviour with
Preference Learning . . . . . . . . . . 318--334
Stefan Poikonen and
Bruce Golden and
Edward A. Wasil A Branch-and-Bound Approach to the
Traveling Salesman Problem with a Drone 335--346
Ran Liu and
Michael E. Kuhl and
Yunan Liu and
James R. Wilson Modeling and Simulation of Nonstationary
Non-Poisson Arrival Processes . . . . . 347--366
Alexander Veremyev and
Oleg A. Prokopyev and
Eduardo L. Pasiliao Finding Critical Links for Closeness
Centrality . . . . . . . . . . . . . . . 367--389
Matteo Fischetti and
Ivana Ljubi\'c and
Michele Monaci and
Markus Sinnl Interdiction Games and Monotonicity,
with Application to Knapsack Problems 390--410
Alice E. Smith Note from the Editor . . . . . . . . . . 411--412
Ward Passchyn and
Dirk Briskorn and
Frits C. R. Spieksma No-Wait Scheduling for Locks . . . . . . 413--428
Thierry Petit and
Andrew C. Trapp Enriching Solutions to Combinatorial
Problems via Solution Engineering . . . 429--444
Dimitris Bertsimas and
Omid Nohadani Robust Maximum Likelihood Estimation . . 445--458
Andrew C. Trapp and
Wen Liu and
Soussan Djamasbi Identifying Fixations in Gaze Data via
Inner Density and Optimization . . . . . 459--476
David Bergman An Exact Algorithm for the Quadratic
Multiknapsack Problem with an
Application to Event Seating . . . . . . 477--492
Lixin Tang and
Feng Li and
Zhi-Long Chen Integrated Scheduling of Production and
Two-Stage Delivery of Make-to-Order
Products: Offline and Online Algorithms 493--514
Wu-Lin Chen Computing the Moments of Polling Models
with Batch Poisson Arrivals by Transform
Inversion . . . . . . . . . . . . . . . 515--526
Ian Herszterg and
Marcus Poggi and
Thibaut Vidal Two-Dimensional Phase Unwrapping via
Balanced Spanning Forests . . . . . . . 527--543
Baris Ungun and
Lei Xing and
Stephen Boyd Real-Time Radiation Treatment Planning
with Optimality Guarantees via Cluster
and Bound Methods . . . . . . . . . . . 544--558
Yan Deng and
Siqian Shen and
Brian Denton Chance-Constrained Surgery Planning
Under Conditions of Limited and
Ambiguous Data . . . . . . . . . . . . . 559--575
Yujing Lin and
Barry L. Nelson and
Linda Pei Virtual Statistics in Simulation via k
Nearest Neighbors . . . . . . . . . . . 576--592
Tianhu Deng and
Yong Liang and
Shixuan Zhang and
Jingze Ren and
Shuyi Zheng A Dynamic Programming Approach to Power
Consumption Minimization in Gunbarrel
Natural Gas Networks with Nonidentical
Compressor Units . . . . . . . . . . . . 593--611
Ricardo Fukasawa and
Laurent Poirrier Permutations in the Factorization of
Simplex Bases . . . . . . . . . . . . . 612--632
J. Cole Smith In Memoriam: Shabbir Ahmed (1969--2019) 633--635
Michelle Blom and
Peter J. Stuckey and
Vanessa J. Teague Toward Computing the Margin of Victory
in Single Transferable Vote Elections 636--653
Zhaoxia Guo and
Stein W. Wallace and
Michal Kaut Vehicle Routing with Space- and
Time-Correlated Stochastic Travel Times:
Evaluating the Objective Function . . . 654--670
Louiqa Raschid and
Hassan Sayyadi and
Vagelis Hristidis Learning to Rank in Entity Relationship
Graphs . . . . . . . . . . . . . . . . . 671--688
Juliane Müller and
Marcus Day Surrogate Optimization of
Computationally Expensive Black-Box
Problems with Hidden Constraints . . . . 689--702
Chrysafis Vogiatzis and
Mustafa Can Camur Identification of Essential Proteins
Using Induced Stars in Protein--Protein
Interaction Networks . . . . . . . . . . 703--718
Abderrahmane Abbou and
Viliam Makis Group Maintenance: A Restless Bandits
Approach . . . . . . . . . . . . . . . . 719--731
Andreas Fügener and
Jens O. Brunner Planning for Overtime: The Value of
Shift Extensions in Physician Scheduling 732--744
Wen Shi and
Xi Chen and
Jennifer Shang An Efficient Morris Method-Based
Framework for Simulation Factor
Screening . . . . . . . . . . . . . . . 745--770
Ketan Date and
Rakesh Nagi Level 2 Reformulation Linearization
Technique-Based Parallel Algorithms for
Solving Large Quadratic Assignment
Problems on Graphics Processing Unit
Clusters . . . . . . . . . . . . . . . . 771--789
Sune Lauth Gadegaard and
Lars Relund Nielsen and
Matthias Ehrgott Bi-objective Branch-and-Cut Algorithms
Based on LP Relaxation and Bound Sets 790--804
Sophie N. Parragh and
Fabien Tricoire Branch-and-Bound for Bi-objective
Integer Programming . . . . . . . . . . 805--822
Alvaro Sierra Altamiranda and
Hadi Charkhgard A New Exact Algorithm to Optimize a
Linear Function over the Set of
Efficient Solutions for Biobjective
Mixed Integer Linear Programs . . . . . 823--840
Anonymous Appreciation to Reviewers . . . . . . . 841--845
Alice E. Smith Note from the Editor . . . . . . . . . . 1--2
Gerdus Benad\`e and
John N. Hooker Optimization Bounds from the Branching
Dual . . . . . . . . . . . . . . . . . . 3--15
Tyler Perini and
Natashia Boland and
Diego Pecin and
Martin Savelsbergh A Criterion Space Method for Biobjective
Mixed Integer Programming: The Boxed
Line Method . . . . . . . . . . . . . . 16--39
Wei Xia and
Juan C. Vera and
Luis F. Zuluaga Globally Solving Nonconvex Quadratic
Programs via Linear Integer Programming
Techniques . . . . . . . . . . . . . . . 40--56
Daniel Jornada and
V. Jorge Leon Filtering Algorithms for Biobjective
Mixed Binary Linear Optimization
Problems with a Multiple-Choice
Constraint . . . . . . . . . . . . . . . 57--73
Qinghua Wu and
Yang Wang and
Fred Glover Advanced Tabu Search Algorithms for
Bipartite Boolean Quadratic Programs
Guided by Strategic Oscillation and Path
Relinking . . . . . . . . . . . . . . . 74--89
Daniel Oliveira and
Artur Pessoa An Improved Branch-Cut-and-Price
Algorithm for Parallel Machine
Scheduling Problems . . . . . . . . . . 90--100
Maxence Delorme and
Manuel Iori Enhanced Pseudo-polynomial Formulations
for Bin Packing and Cutting Stock
Problems . . . . . . . . . . . . . . . . 101--119
Okan Arslan and
Ola Jabali and
Gilbert Laporte A Flexible, Natural Formulation for the
Network Design Problem with
Vulnerability Constraints . . . . . . . 120--134
Pierre L'Ecuyer and
Paul Wambergue and
Erwan Bourceret Spectral Analysis of the MIXMAX Random
Number Generators . . . . . . . . . . . 135--144
Ilke Bakir and
Natashia Boland and
Brian Dandurand and
Alan Erera Sampling Scenario Set Partition Dual
Bounds for Multistage Stochastic
Programs . . . . . . . . . . . . . . . . 145--163
Jietao Xie and
Juan Wu Recursive Calculation Model for a
Special Multivariate Normal Probability
of First-Order Stationary Sequence . . . 164--171
Yves Mocquard and
Bruno Sericola and
Emmanuelle Anceaume Probabilistic Analysis of
Rumor-Spreading Time . . . . . . . . . . 172--181
Daehan Won and
Hasan Manzour and
Wanpracha Chaovalitwongse Convex Optimization for Group Feature
Selection in Networked Data . . . . . . 182--198
Anonymous Editorial Board . . . . . . . . . . . . ??
Alice E. Smith Note from the Editor . . . . . . . . . . 199--200
Areesh Mittal and
Can Gokalp and
Grani A. Hanasusanto Robust Quadratic Programming with
Mixed-Integer Uncertainty . . . . . . . 201--218
Hao Hu and
Renata Sotirov On Solving the Quadratic Shortest Path
Problem . . . . . . . . . . . . . . . . 219--233
Sepehr Nemati and
Zeynep G. Icten and
Lisa M. Maillart and
Andrew J. Schaefer Mitigating Information Asymmetry in
Liver Allocation . . . . . . . . . . . . 234--248
Stefan Poikonen and
Bruce Golden The Mothership and Drone Routing Problem 249--262
Margarita P. Castro and
Andre A. Cire and
J. Christopher Beck An MDD-Based Lagrangian Approach to the
Multicommodity Pickup-and-Delivery TSP 263--278
Gerald G. Brown and
W. Matthew Carlyle Solving the Nearly Symmetric All-Pairs
Shortest-Path Problem . . . . . . . . . 279--288
Dilek Günneç and
S. Raghavan and
Rui Zhang Least-Cost Influence Maximization on
Social Networks . . . . . . . . . . . . 289--302
Xiaoye Cheng and
Jingjing Zhang and
Lu (Lucy) Yan Understanding the Impact of Individual
Users' Rating Characteristics on the
Predictive Accuracy of Recommender
Systems . . . . . . . . . . . . . . . . 303--320
Zhiling Guo and
Jin Li and
Ram Ramesh Scalable, Adaptable, and Fast Estimation
of Transient Downtime in Virtual
Infrastructures Using Convex
Decomposition and Sample Path
Randomization . . . . . . . . . . . . . 321--345
Alper Atamtürk and
Carlos Deck and
Hyemin Jeon Successive Quadratic Upper-Bounding for
Discrete Mean-Risk Minimization and
Network Interdiction . . . . . . . . . . 346--355
Guangxin Jiang and
L. Jeff Hong and
Barry L. Nelson Online Risk Monitoring Using Offline
Simulation . . . . . . . . . . . . . . . 356--375
Nanjing Jian and
Shane G. Henderson Estimating the Probability that a
Function Observed with Noise Is Convex 376--389
Zhenyu Cui and
Michael C. Fu and
Jian-Qiang Hu and
Yanchu Liu and
Yijie Peng and
Lingjiong Zhu On the Variance of Single-Run Unbiased
Stochastic Derivative Estimators . . . . 390--407
Dimitris Bertsimas and
Iain Dunning Relative Robust and Adaptive
Optimization . . . . . . . . . . . . . . 408--427
Lijun Wei and
Zhixing Luo and
Roberto Baldacci and
Andrew Lim A New Branch-and-Price-and-Cut Algorithm
for One-Dimensional Bin-Packing Problems 428--443
Raphael Kramer and
Manuel Iori and
Thibaut Vidal Mathematical Models and Search
Algorithms for the Capacitated
$p$-Center Problem . . . . . . . . . . . 444--460
William Pettersson and
Melih Ozlen Multiobjective Integer Programming:
Synergistic Parallel Approaches . . . . 461--472
Tobias Achterberg and
Robert E. Bixby and
Zonghao Gu and
Edward Rothberg and
Dieter Weninger Presolve Reductions in Mixed Integer
Programming . . . . . . . . . . . . . . 473--506
Steffen Rebennack and
Vitaliy Krasko Piecewise Linear Function Fitting via
Mixed-Integer Linear Programming . . . . 507--530
Anonymous Editorial Board . . . . . . . . . . . . ??
Lingxun Kong and
Christos T. Maravelias On the Derivation of Continuous
Piecewise Linear Approximating Functions 531--546
Zheng Zhang and
Brian T. Denton and
Xiaolan Xie Branch and Price for Chance-Constrained
Bin Packing . . . . . . . . . . . . . . 547--564
Joshua Q. Hale and
Helin Zhu and
Enlu Zhou Domination Measure: A New Metric for
Solving Multiobjective Optimization . . 565--581
Samuel Deleplanque and
Martine Labbé and
Diego Ponce and
Justo Puerto A Branch-Price-and-Cut Procedure for the
Discrete Ordered Median Problem . . . . 582--599
Young Woong Park MILP Models for Complex System
Reliability Redundancy Allocation with
Mixed Components . . . . . . . . . . . . 600--619
Shuming Wang and
Yan-Fu Li Distributionally Robust Design for
Redundancy Allocation . . . . . . . . . 620--640
Hoda Atef Yekta and
Robert Day Optimization-based Mechanisms for the
Course Allocation Problem . . . . . . . 641--660
Anirudh Subramanyam and
Panagiotis P. Repoussis and
Chrysanthos E. Gounaris Robust Optimization of a Broad Class of
Heterogeneous Vehicle Routing Problems
Under Demand Uncertainty . . . . . . . . 661--681
Ksenia Bestuzheva and
Hassan Hijazi and
Carleton Coffrin Convex Relaxations for Quadratic On/Off
Constraints and Applications to Optimal
Transmission Switching . . . . . . . . . 682--696
Shixuan Zhang and
Sheng Liu and
Tianhu Deng and
Zuo-Jun Max Shen Transient-State Natural Gas Transmission
in Gunbarrel Pipeline Networks . . . . . 697--713
Fan Zhou and
Kunpeng Zhang and
Shuying Xie and
Xucheng Luo Learning to Correlate Accounts Across
Online Social Networks: an
Embedding-Based Approach . . . . . . . . 714--729
Vladyslav Sokol and
Ante \'Custi\'c and
Abraham P. Punnen and
Binay Bhattacharya Bilinear Assignment Problem: Large
Neighborhoods and Experimental Analysis
of Algorithms . . . . . . . . . . . . . 730--746
Seyedmohammadhossein Hosseinian and
Dalila B. M. M. Fontes and
Sergiy Butenko A Lagrangian Bound on the Clique Number
and an Exact Algorithm for the Maximum
Edge Weight Clique Problem . . . . . . . 747--762
Zhuqi Miao and
Balabhaskar Balasundaram An Ellipsoidal Bounding Scheme for the
Quasi-Clique Number of a Graph . . . . . 763--778
Yaqin Zhou and
Shaojie Tang Differentially Private Distributed
Learning . . . . . . . . . . . . . . . . 779--789
Kai Han and
Yuntian He and
Alex X. Liu and
Shaojie Tang and
He Huang Differentially Private and
Budget-Limited Bandit Learning over
Matroids . . . . . . . . . . . . . . . . 790--804
Kevin Ryan and
Shabbir Ahmed and
Santanu S. Dey and
Deepak Rajan and
Amelia Musselman and
Jean-Paul Watson Optimization-Driven Scenario Grouping 805--821
Egon Balas and
Thiago Serra When Lift-and-Project Cuts Are Different 822--834
Nan Liu and
Yuhang Ma and
Huseyin Topaloglu Assortment Optimization Under the
Multinomial Logit Model with Sequential
Offerings . . . . . . . . . . . . . . . 835--853
Anonymous Editorial Board . . . . . . . . . . . . ??
Alice E. Smith Note from the Editor . . . . . . . . . . 855--856
Bernard Knueven and
James Ostrowski and
Jean-Paul Watson On Mixed-Integer Programming
Formulations for the Unit Commitment
Problem . . . . . . . . . . . . . . . . 857--876
Vishal Ahuja and
John R. Birge An Approximation Approach for
Response-Adaptive Clinical Trial Design 877--894
Hrayer Aprahamian and
Douglas R. Bish and
Ebru K. Bish Optimal Group Testing: Structural
Properties and Robust Solutions, with
Application to Public Health Screening 895--911
Sean L. Barnes and
Miranda Myers and
Clare Rock and
Daniel J. Morgan and
Lisa Pineles and
Kerri A. Thom and
Anthony D. Harris Evaluating a Prediction-Driven Targeting
Strategy for Reducing the Transmission
of Multidrug-Resistant Organisms . . . . 912--929
Ali Ajdari and
Fatemeh Saberian and
Archis Ghate A Theoretical Framework for Learning
Tumor Dose-Response Uncertainty in
Individualized Spatiobiologically
Integrated Radiotherapy . . . . . . . . 930--951
Hamidreza Validi and
Austin Buchanan The Optimal Design of Low-Latency
Virtual Backbones . . . . . . . . . . . 952--967
Geunyeong Byeon and
Pascal Van Hentenryck and
Russell Bent and
Harsha Nagarajan Communication-Constrained Expansion
Planning for Resilient Distribution
Systems . . . . . . . . . . . . . . . . 968--985
Zdravko I. Botev and
Pierre L'Ecuyer Sampling Conditionally on a Rare Event
via Generalized Splitting . . . . . . . 986--995
Qiudan Li and
Daniel Dajun Zeng and
David Jingjun Xu and
Ruoran Liu and
Riheng Yao Understanding and Predicting Users'
Rating Behavior: A Cognitive Perspective 996--1011
Feng Li and
Zhou Xu and
Zhi-Long Chen Production and Transportation
Integration for Commit-to-Delivery Mode
with General Shipping Costs . . . . . . 1012--1029
Francesco Carrabs and
Carmine Cerrone and
Raffaele Cerulli and
Bruce Golden An Adaptive Heuristic Approach to
Compute Upper and Lower Bounds for the
Close-Enough Traveling Salesman Problem 1030--1048
Maurizio Boccia and
Antonio Sforza and
Claudio Sterle Simple Pattern Minimality Problems:
Integer Linear Programming Formulations
and Covering-Based Heuristic Solving
Approaches . . . . . . . . . . . . . . . 1049--1060
Renata Mansini and
Roberto Zanotti A Core-Based Exact Algorithm for the
Multidimensional Multiple Choice
Knapsack Problem . . . . . . . . . . . . 1061--1079
Kyle Cooper and
Susan R. Hunter and
Kalyani Nagaraj Biobjective Simulation Optimization on
Integer Lattices Using the
Epsilon-Constraint Method in a
Retrospective Approximation Framework 1080--1100
Kyle Cooper and
Susan R. Hunter PyMOSO: Software for Multiobjective
Simulation Optimization with R-PERLE and
R-MinRLE . . . . . . . . . . . . . . . . 1101--1108
Ernst Roos and
Dick den Hertog Reducing Conservatism in Robust
Optimization . . . . . . . . . . . . . . 1109--1127
Bo Zeng A Practical Scheme to Compute the
Pessimistic Bilevel Optimization Problem 1128--1142
Juheng Zhang and
Xiaoping Liu and
Xiao-Bai Li Predictive Analytics with Strategically
Missing Data . . . . . . . . . . . . . . 1143--1156
Nir Halman Provably Near-Optimal Approximation
Schemes for Implicit Stochastic and
Sample-Based Dynamic Programs . . . . . 1157--1181
Anonymous Appreciation to Reviewers . . . . . . . 1182--1186
Anonymous Editorial Board . . . . . . . . . . . . ??
Lih-Yuan Deng and
Hongquan Xu A system of high-dimensional, efficient,
long-cycle and portable uniform random
number generators . . . . . . . . . . . 299--309
Lih-Yuan Deng Efficient and portable multiple
recursive generators of large order . . 1--13
Lih-Yuan Deng and
Huajiang Li and
Jyh-Jen Horng Shiau Scalable parallel multiple recursive
generators of large order . . . . . . . 29--37
Lih-Yuan Deng and
Jyh-Jen H. Shiau and
Henry Horng-Shing Lu Efficient Computer Search of Large-Order
Multiple Recursive Pseudo-Random Number
Generators . . . . . . . . . . . . . . . 3228--3237
Alice E. Smith Note from the Editor . . . . . . . . . . 1--1
Phillip R. Jenkins and
Matthew J. Robbins and
Brian J. Lunday Approximate Dynamic Programming for
Military Medical Evacuation Dispatching
Policies . . . . . . . . . . . . . . . . 2--26
Oscar Dowson and
Lea Kapelevich \pkgSDDP.jl: A Julia Package for
Stochastic Dual Dynamic Programming . . 27--33
Timo Lohmann and
Michael R. Bussieck and
Lutz Westermann and
Steffen Rebennack High-Performance Prototyping of
Decomposition Methods in GAMS . . . . . 34--50
Harsha Gangammanavar and
Yifan Liu and
Suvrajeet Sen Stochastic Decomposition for Two-Stage
Stochastic Linear Programs with Random
Cost Coefficients . . . . . . . . . . . 51--71
Satya Tamby and
Daniel Vanderpooten Enumeration of the Nondominated Set of
Multiobjective Discrete Optimization
Problems . . . . . . . . . . . . . . . . 72--85
Wenjun Ni and
Jia Shu and
Miao Song and
Dachuan Xu and
Kaike Zhang A Branch-and-Price Algorithm for
Facility Location with General Facility
Cost Functions . . . . . . . . . . . . . 86--104
Guopeng Song and
Tamás Kis and
Roel Leus Polyhedral Results and Branch-and-Cut
for the Resource Loading Problem . . . . 105--119
Young Woong Park Optimization for $ L_1 $-Norm Error
Fitting via Data Aggregation . . . . . . 120--142
Hossein Hashemi Doulabi and
Patrick Jaillet and
Gilles Pesant and
Louis-Martin Rousseau Exploiting the Structure of Two-Stage
Robust Optimization Models with
Exponential Scenarios . . . . . . . . . 143--162
Xiaojin Zheng and
Yutong Pan and
Zhaolin Hu Perspective Reformulations of
Semicontinuous Quadratically Constrained
Quadratic Programs . . . . . . . . . . . 163--179
Hezhi Luo and
Xiaodong Ding and
Jiming Peng and
Rujun Jiang and
Duan Li Complexity Results and Effective
Algorithms for Worst-Case Linear
Optimization Under Uncertainties . . . . 180--197
Thomas Kleinert and
Martin Schmidt Computing Feasible Points of Bilevel
Problems with a Penalty Alternating
Direction Method . . . . . . . . . . . . 198--215
Ning Cai and
Xuewei Yang A Computational Approach to First
Passage Problems of Reflected
Hyperexponential Jump Diffusion
Processes . . . . . . . . . . . . . . . 216--229
Yijie Peng and
Chun-Hung Chen and
Michael C. Fu and
Jian-Qiang Hu and
Ilya O. Ryzhov Efficient Sampling Allocation Procedures
for Optimal Quantile Selection . . . . . 230--245
Xunhua Guo and
Guoqing Chen and
Cong Wang and
Qiang Wei and
Zunqiang Zhang Calibration of Voting-Based Helpfulness
Measurement for Online Reviews: an
Iterative Bayesian Probability Approach 246--261
Dimitris Bertsimas and
Nishanth Mundru Sparse Convex Regression . . . . . . . . 262--279
Jin Zhang and
Cong Wang and
Guoqing Chen A Review Selection Method for Finding an
Informative Subset from Online Reviews 280--299
Ethem Çanako\uglu and
\.Ibrahim Muter and
Tevfik Aytekin Integrating Individual and Aggregate
Diversity in Top-$N$ Recommendation . . 300--318
Zu-Jun Ma and
Fei Yang and
Ying Dai and
Zuo-Jun Max Shen The Migratory Beekeeping Routing
Problem: Model and an Exact Algorithm 319--335
Haoxiang Yang and
David P. Morton and
Chaithanya Bandi and
Krishnamurthy Dvijotham Robust Optimization for Electricity
Generation . . . . . . . . . . . . . . . 336--351
Jianqiu Huang and
Kai Pan and
Yongpei Guan Multistage Stochastic Power Generation
Scheduling Co-Optimizing Energy and
Ancillary Services . . . . . . . . . . . 352--369
Anulekha Dhara and
Bikramjit Das and
Karthik Natarajan Worst-Case Expected Shortfall with
Univariate and Bivariate Marginals . . . 370--389
Ward Romeijnders and
Krzysztof Postek Piecewise Constant Decision Rules via
Branch-and-Bound Based Scenario
Detection for Integer Adjustable Robust
Optimization . . . . . . . . . . . . . . 390--400
David Bergman and
Leonardo Lozano Decision Diagram Decomposition for
Quadratically Constrained Binary
Optimization . . . . . . . . . . . . . . 401--418
Anonymous Editorial Board . . . . . . . . . . . . ??
Alice E. Smith Note from the Editor . . . . . . . . . . 419--420
Timo Berthold and
Jakob Witzig Conflict Analysis for MINLP . . . . . . 421--435
Dominik Goeke and
Michael Schneider Modeling Single-Picker Routing Problems
in Classical and Modern Warehouses . . . 436--451
Zhixing Luo and
Hu Qin and
T. C. E. Cheng and
Qinghua Wu and
Andrew Lim A Branch-and-Price-and-Cut Algorithm for
the Cable-Routing Problem in Solar Power
Plants . . . . . . . . . . . . . . . . . 452--476
Dirk Briskorn and
Malte Fliedner and
Martin Tschöke Vehicle Sequencing at Transshipment
Terminals with Handover Relations . . . 477--494
Kevin Dalmeijer and
Guy Desaulniers Addressing Orientation Symmetry in the
Time Window Assignment Vehicle Routing
Problem . . . . . . . . . . . . . . . . 495--510
Shan Jiang and
Shu-Cherng Fang and
Qingwei Jin Sparse Solutions by a Quadratically
Constrained $ \ell_q (0 < q < 1) $
Minimization Model . . . . . . . . . . . 511--530
Dzung T. Phan and
Matt Menickelly On the Solution of $ \ell_0$-Constrained
Sparse Inverse Covariance Estimation
Problems . . . . . . . . . . . . . . . . 531--550
Andrés Gómez and
Oleg A. Prokopyev A Mixed-Integer Fractional Optimization
Approach to Best Subset Selection . . . 551--565
Yichen Cheng and
Xinlei Wang and
Yusen Xia Supervised $t$-Distributed Stochastic
Neighbor Embedding for Data
Visualization and Classification . . . . 566--585
Jiapeng Liu and
Mi\losz Kadzi\'nski and
Xiuwu Liao and
Xiaoxin Mao Data-Driven Preference Learning Methods
for Value-Driven Multiple Criteria
Sorting with Interacting Criteria . . . 586--606
Amir Ali Ahmadi and
Jeffrey Zhang Semidefinite Programming and Nash
Equilibria in Bimatrix Games . . . . . . 607--628
A. D. López-Sánchez and
J. Sánchez-Oro and
M. Laguna A New Scatter Search Design for
Multiobjective Combinatorial
Optimization with an Application to
Facility Location . . . . . . . . . . . 629--642
Fatemeh Sarayloo and
Teodor Gabriel Crainic and
Walter Rei A Learning-Based Matheuristic for
Stochastic Multicommodity Network Design 643--656
Demet Batur and
F. Fred Choobineh Selecting the Best Alternative Based on
Its Quantile . . . . . . . . . . . . . . 657--671
Barry L. Nelson and
Alan T. K. Wan and
Guohua Zou and
Xinyu Zhang and
Xi Jiang Reducing Simulation Input-Model Risk via
Input Model Averaging . . . . . . . . . 672--684
Filipe Rodrigues and
Agostinho Agra and
Cristina Requejo and
Erick Delage Lagrangian Duality for Robust Problems
with Decomposable Functions: The Case of
a Robust Inventory Problem . . . . . . . 685--705
Jakob Witzig and
Ambros Gleixner Conflict-Driven Heuristics for Mixed
Integer Programming . . . . . . . . . . 706--720
Amin Hosseininasab and
Willem-Jan van Hoeve Exact Multiple Sequence Alignment by
Synchronized Decision Diagrams . . . . . 721--738
Álinson S. Xavier and
Feng Qiu and
Shabbir Ahmed Learning to Solve Large-Scale
Security-Constrained Unit Commitment
Problems . . . . . . . . . . . . . . . . 739--756
Yan Deng and
Huiwen Jia and
Shabbir Ahmed and
Jon Lee and
Siqian Shen Scenario Grouping and Decomposition
Algorithms for Chance-Constrained
Programs . . . . . . . . . . . . . . . . 757--773
Yingli Ran and
Zhao Zhang and
Shaojie Tang and
Ding-Zhu Du Breaking the $ r_{\rm max} $ Barrier:
Enhanced Approximation Algorithms for
Partial Set Multicover Problem . . . . . 774--784
Alexander S. Estes and
Michael O. Ball Monge Properties, Optimal Greedy
Policies, and Policy Improvement for the
Dynamic Stochastic Transportation
Problem . . . . . . . . . . . . . . . . 785--807
Eyyüb Y. Kìbì\cs and
\.I. Esra Büyüktahtakìn and
Robert G. Haight and
Najmaddin Akhundov and
Kathleen Knight and
Charles E. Flower A Multistage Stochastic Programming
Approach to the Optimal Surveillance and
Control of the Emerald Ash Borer in
Cities . . . . . . . . . . . . . . . . . 808--834
Natashia Boland and
Riley Clement and
Hamish Waterer Corrigendum to ``A Bucket Indexed
Formulation for Nonpreemptive Single
Machine Scheduling Problems,'' INFORMS
Journal on Computing \bf 28(1):14--30,
2016 . . . . . . . . . . . . . . . . . . 835--835
Anonymous Editorial Board . . . . . . . . . . . . ??
Alice E. Smith Note from the Editor . . . . . . . . . . 837--838
Cihan Tugrul Cicek and
Zuo-Jun Max Shen and
Hakan Gultekin and
Bulent Tavli $3$-D Dynamic UAV Base Station Location
Problem . . . . . . . . . . . . . . . . 839--860
Margarida Carvalho and
Xenia Klimentova and
Kristiaan Glorie and
Ana Viana and
Miguel Constantino Robust Models for the Kidney Exchange
Problem . . . . . . . . . . . . . . . . 861--881
Shen Liu and
Hongyan Liu Tagging Items Automatically Based on
Both Content Information and Browsing
Behaviors . . . . . . . . . . . . . . . 882--897
Zhicheng Zhu and
Yisha Xiang and
Bo Zeng Multicomponent Maintenance Optimization:
a Stochastic Programming Approach . . . 898--914
Mark Semelhago and
Barry L. Nelson and
Eunhye Song and
Andreas Wächter Rapid Discrete Optimization via
Simulation with Gaussian Markov Random
Fields . . . . . . . . . . . . . . . . . 915--930
Yasemin Merzifonluoglu and
Joseph Geunes The Risk-Averse Static Stochastic
Knapsack Problem . . . . . . . . . . . . 931--948
Philippe Olivier and
Andrea Lodi and
Gilles Pesant The Quadratic Multiknapsack Problem with
Conflicts and Balance Constraints . . . 949--962
Jean-François Côté and
Mohamed Haouari and
Manuel Iori Combinatorial Benders Decomposition for
the Two-Dimensional Bin Packing Problem 963--978
Yang Wang and
Wei Yang and
Abraham P. Punnen and
Jingbo Tian and
Aihua Yin and
Zhipeng Lü The Rank-One Quadratic Assignment
Problem . . . . . . . . . . . . . . . . 979--996
Edward He and
Natashia Boland and
George Nemhauser and
Martin Savelsbergh Time-Dependent Shortest Path Problems
with Penalties and Limits on Waiting . . 997--1014
Roya Karimi and
Jianqiang Cheng and
Miguel A. Lejeune A Framework for Solving
Chance-Constrained Linear Matrix
Inequality Programs . . . . . . . . . . 1015--1036
Chao Li and
Muhong Zhang and
Kory Hedman Extreme Ray Feasibility Cuts for Unit
Commitment with Uncertainty . . . . . . 1037--1055
Xiaodi Bai and
Jie Sun and
Xiaojin Zheng An Augmented Lagrangian Decomposition
Method for Chance-Constrained
Optimization Problems . . . . . . . . . 1056--1069
Timo Gschwind and
Stefan Irnich and
Fabio Furini and
Roberto Wolfler Calvo A Branch-and-Price Framework for
Decomposing Graphs into Relaxed Cliques 1070--1090
Wenda Zhang and
Jason J. Sauppe and
Sheldon H. Jacobson An Improved Branch-and-Bound Algorithm
for the One-Machine Scheduling Problem
with Delayed Precedence Constraints . . 1091--1102
Miten Mistry and
Dimitrios Letsios and
Gerhard Krennrich and
Robert M. Lee and
Ruth Misener Mixed-Integer Convex Nonlinear
Optimization with Gradient-Boosted Trees
Embedded . . . . . . . . . . . . . . . . 1103--1119
Ran Ji and
Miguel A. Lejeune Data-Driven Optimization of Reward-Risk
Ratio Measures . . . . . . . . . . . . . 1120--1137
Amir Ardestani-Jaafari and
Erick Delage Linearized Robust Counterparts of
Two-Stage Robust Optimization Problems
with Applications in Operations
Management . . . . . . . . . . . . . . . 1138--1161
Nihal Berkta\cs and
Hande Yaman A Branch-and-Bound Algorithm for Team
Formation on Social Networks . . . . . . 1162--1176
Zifeng Zhao and
Peng Shi and
Xiaoping Feng Knowledge Learning of Insurance Risks
Using Dependence Models . . . . . . . . 1177--1196
Zeyang Wu and
Kameng Nip and
Qie He A New Combinatorial Algorithm for
Separable Convex Resource Allocation
with Nested Bound Constraints . . . . . 1197--1212
Jungho Park and
Hadi El-Amine and
Nevin Mutlu An Exact Algorithm for Large-Scale
Continuous Nonlinear Resource Allocation
Problems with Minimax Regret Objectives 1213--1228
Jie Zhang and
Weijun Xie and
Subhash C. Sarin Multiproduct Newsvendor Problem with
Customer-Driven Demand Substitution: a
Stochastic Integer Program Perspective 1229--1244
Debdatta Sinha Roy and
Adriano Masone and
Bruce Golden and
Edward Wasil Modeling and Solving the Intersection
Inspection Rural Postman Problem . . . . 1245--1257
Anonymous Editorial Board . . . . . . . . . . . . ??
Alice E. Smith Note from the Editor . . . . . . . . . . 1259--1261
Frank de Meijer and
Renata Sotirov SDP-Based Bounds for the Quadratic Cycle
Cover Problem via Cutting-Plane
Augmented Lagrangian Methods and
Reinforcement Learning . . . . . . . . . 1262--1276
Nicholas D. Kullman and
Aurelien Froger and
Jorge E. Mendoza and
Justin C. Goodson frvcpy: an Open-Source Solver for the
Fixed Route Vehicle Charging Problem . . 1277--1283
Arne Herzel and
Stefan Ruzika and
Clemens Thielen Approximation Methods for Multiobjective
Optimization Problems: a Survey . . . . 1284--1299
Alexander J. Zolan and
Michael S. Scioletti and
David P. Morton and
Alexandra M. Newman Decomposing Loosely Coupled
Mixed-Integer Programs for Optimal
Microgrid Design . . . . . . . . . . . . 1300--1319
Yuheng Hu Characterizing Social TV Activity Around
Televised Events: a Joint Topic Model
Approach . . . . . . . . . . . . . . . . 1320--1338
Yining Wang and
Yi Wu and
Simon S. Du Near-Linear Time Local Polynomial
Nonparametric Estimation with Box
Kernels . . . . . . . . . . . . . . . . 1339--1353
Yu Yang and
Natashia Boland and
Martin Savelsbergh Multivariable Branching: a $0$--$1$
Knapsack Problem Case Study . . . . . . 1354--1367
Xiaoli Cen and
Yong Xia A New Global Optimization Scheme for
Quadratic Programs with Low-Rank
Nonconvexity . . . . . . . . . . . . . . 1368--1383
Boris Brimkov and
Derek Mikesell and
Illya V. Hicks Improved Computational Approaches and
Heuristics for Zero Forcing . . . . . . 1384--1399
Fan Zhou and
Kunpeng Zhang and
Bangying Wu and
Yi Yang and
Harry Jiannan Wang Unifying Online and Offline Preference
for Social Link Prediction . . . . . . . 1400--1418
Michael Jünger and
Sven Mallach Exact Facetial Odd-Cycle Separation for
Maximum Cut and Binary Quadratic
Optimization . . . . . . . . . . . . . . 1419--1430
Xiaojun Zhu and
Shaojie Tang Exact Algorithms for the Minimum Load
Spanning Tree Problem . . . . . . . . . 1431--1445
Xiaojun Zhu and
Shaojie Tang A Branch-and-Bound Algorithm for
Building Optimal Data Gathering Tree in
Wireless Sensor Networks . . . . . . . . 1446--1460
Ningji Wei and
Jose L. Walteros and
Foad Mahdavi Pajouh Integer Programming Formulations for
Minimum Spanning Tree Interdiction . . . 1461--1480
Colin P. Gillen and
Alexander Veremyev and
Oleg A. Prokopyev and
Eduardo L. Pasiliao Fortification Against Cascade
Propagation Under Uncertainty . . . . . 1481--1499
Haihui Shen and
L. Jeff Hong and
Xiaowei Zhang Ranking and Selection with Covariates
for Personalized Decision Making . . . . 1500--1519
Peter W. Glynn and
Yijie Peng and
Michael C. Fu and
Jian-Qiang Hu Computing Sensitivities for Distortion
Risk Measures . . . . . . . . . . . . . 1520--1532
Antonio J. Conejo and
Nicholas G. Hall and
Daniel Zhuoyu Long and
Runhao Zhang Robust Capacity Planning for Project
Management . . . . . . . . . . . . . . . 1533--1550
Cheng Guo and
Merve Bodur and
Dionne M. Aleman and
David R. Urbach Logic-Based Benders Decomposition and
Binary Decision Diagram Based Approaches
for Stochastic Distributed Operating
Room Scheduling . . . . . . . . . . . . 1551--1569
Juan S. Borrero and
Leonardo Lozano Modeling Defender-Attacker Problems as
Robust Linear Programs with
Mixed-Integer Uncertainty Sets . . . . . 1570--1589
Alfredo Torrico and
Mohit Singh and
Sebastian Pokutta and
Nika Haghtalab and
Joseph (Seffi) Naor and
Nima Anari Structured Robust Submodular
Maximization: Offline and Online
Algorithms . . . . . . . . . . . . . . . 1590--1607
Daniel Zeng and
Yong Liu and
Ping Yan and
Yanwu Yang Location-Aware Real-Time Recommender
Systems for Brick-and-Mortar Retailers 1608--1623
Álinson S. Xavier and
Ricardo Fukasawa and
Laurent Poirrier Multirow Intersection Cuts Based on the
Infinity Norm . . . . . . . . . . . . . 1624--1643
Junlong Zhang and
Osman Y. Özaltìn Bilevel Integer Programs with Stochastic
Right-Hand Sides . . . . . . . . . . . . 1644--1660
Shanshan Wang and
Jinlin Li and
Sanjay Mehrotra Chance-Constrained Multiple Bin Packing
Problem with an Application to Operating
Room Planning . . . . . . . . . . . . . 1661--1677
Anonymous Appreciation to Reviewers . . . . . . . 1678--1684
Anonymous Editorial Board . . . . . . . . . . . . ??
Alice E. Smith Note from the Editor . . . . . . . . . . 1--1
J. Paul Brooks and
Ted Ralphs and
Nicola Secomandi Special Issue of \booktitleINFORMS
Journal on Computing --- Scalable
Reinforcement Learning Algorithms . . . 2--3
Janiele E. S. C. Custodio and
Miguel A. Lejeune Spatiotemporal Data Set for
Out-of-Hospital Cardiac Arrests . . . . 4--10
Dávid Papp and
Sercan Yìldìz \pkgAlfonso: Matlab Package for
Nonsymmetric Conic Optimization . . . . 11--19
Gregor Selinka and
Raik Stolletz and
Thomas I. Maindl Performance Approximation for
Time-Dependent Queues with Generally
Distributed Abandonments . . . . . . . . 20--38
Diego Goldsztajn and
Sem C. Borst and
Johan S. H. van Leeuwaarden and
Debankur Mukherjee and
Philip A. Whiting Self-Learning Threshold-Based Load
Balancing . . . . . . . . . . . . . . . 39--54
Matthias Bentert and
René van Bevern and
André Nichterlein and
Rolf Niedermeier and
Pavel V. Smirnov Parameterized Algorithms for
Power-Efficiently Connecting Wireless
Sensor Networks: Theory and Experiments 55--75
Yannick Kergosien and
Antoine Giret and
Emmanuel Néron and
Gaël Sauvanet An Efficient Label-Correcting Algorithm
for the Multiobjective Shortest Path
Problem . . . . . . . . . . . . . . . . 76--92
Mustafa C. Camur and
Thomas Sharkey and
Chrysafis Vogiatzis The Star Degree Centrality Problem: a
Decomposition Approach . . . . . . . . . 93--112
Ozgur M. Araz and
Mayteé Cruz-Aponte and
Fernando A. Wilson and
Brock W. Hanisch and
Ruth S. Margalit An Analytic Framework for Effective
Public Health Program Design Using
Correctional Facilities . . . . . . . . 113--128
Liping Zhou and
Na Geng and
Zhibin Jiang and
Shan Jiang Integrated Multiresource Capacity
Planning and Multitype Patient
Scheduling . . . . . . . . . . . . . . . 129--149
Hrayer Aprahamian and
Hadi El-Amine Optimal Screening of Populations with
Heterogeneous Risk Profiles Under the
Availability of Multiple Tests . . . . . 150--164
Qiong Zhang and
Amin Khademi and
Yongjia Song Min-Max Optimal Design of Two-Armed
Trials with Side Information . . . . . . 165--182
Kanix Wang and
Walid Hussain and
John R. Birge and
Michael D. Schreiber and
Daniel Adelman A High-Fidelity Model to Predict Length
of Stay in the Neonatal Intensive Care
Unit . . . . . . . . . . . . . . . . . . 183--195
Jianzhe Zhen and
Frans J. C. T. de Ruiter and
Ernst Roos and
Dick den Hertog Robust Optimization for Models with
Uncertain Second-Order Cone and
Semidefinite Programming Constraints . . 196--210
Ahmadreza Marandi and
Aharon Ben-Tal and
Dick den Hertog and
Bertrand Melenberg Extending the Scope of Robust Quadratic
Optimization . . . . . . . . . . . . . . 211--226
Eric Larsen and
Sébastien Lachapelle and
Yoshua Bengio and
Emma Frejinger and
Simon Lacoste-Julien and
Andrea Lodi Predicting Tactical Solutions to
Operational Planning Problems Under
Imperfect Information . . . . . . . . . 227--242
Frauke Liers and
Lars Schewe and
Johannes Thürauf Radius of Robust Feasibility for
Mixed-Integer Problems . . . . . . . . . 243--261
Qinxiao Yu and
Yossiri Adulyasak and
Louis-Martin Rousseau and
Ning Zhu and
Shoufeng Ma Team Orienteering with Time-Varying
Profit . . . . . . . . . . . . . . . . . 262--280
Ben Hermans and
Roel Leus and
Jannik Matuschke Exact and Approximation Algorithms for
the Expanding Search Problem . . . . . . 281--296
Moira MacNeil and
Merve Bodur Integer Programming, Constraint
Programming, and Hybrid Decomposition
Approaches to Discretizable Distance
Geometry Problems . . . . . . . . . . . 297--314
Hassan Zohali and
Bahman Naderi and
Vahid Roshanaei Solving the Type-2 Assembly Line
Balancing with Setups Using Logic-Based
Benders Decomposition . . . . . . . . . 315--332
Erick Delage and
Ahmed Saif The Value of Randomized Solutions in
Mixed-Integer Distributionally Robust
Optimization Problems . . . . . . . . . 333--353
Hossein Hashemi Doulabi and
Shabbir Ahmed and
George Nemhauser State-Variable Modeling for a Class of
Two-Stage Stochastic Optimization
Problems . . . . . . . . . . . . . . . . 354--369
Ziye Tang and
Yang Jiao and
R. Ravi Combinatorial Heuristics for Inventory
Routing Problems . . . . . . . . . . . . 370--384
Tao Wu Predictive Search for Capacitated
Multi-Item Lot Sizing Problems . . . . . 385--406
Yongzhen Li and
Xueping Li and
Jia Shu and
Miao Song and
Kaike Zhang A General Model and Efficient Algorithms
for Reliable Facility Location Problem
Under Uncertain Disruptions . . . . . . 407--426
Thiago Serra and
Teng Huang and
Arvind U. Raghunathan and
David Bergman Template-Based Minor Embedding for
Adiabatic Quantum Optimization . . . . . 427--439
Maximilian Löffler and
Nils Boysen and
Michael Schneider Picker Routing in AGV-Assisted Order
Picking Systems . . . . . . . . . . . . 440--462
Sidhant Misra and
Line Roald and
Yeesian Ng Learning for Constrained Optimization:
Identifying Optimal Active Constraint
Sets . . . . . . . . . . . . . . . . . . 463--480
Shutong Chen and
Weijun Xie On Cluster-Aware Supervised Learning:
Frameworks, Convergent Algorithms, and
Applications . . . . . . . . . . . . . . 481--502
Gediminas Adomavicius and
Yaqiong Wang Improving Reliability Estimation for
Individual Numeric Predictions: a
Machine Learning Approach . . . . . . . 503--521
Yi Yang and
Kunpeng Zhang and
Yangyang Fan Analyzing Firm Reports for Volatility
Prediction: a Knowledge-Driven
Text-Embedding Approach . . . . . . . . 522--540
Zhu Zhang and
Xuan Wei and
Xiaolong Zheng and
Qiudan Li and
Daniel Dajun Zeng Detecting Product Adoption Intentions
via Multiview Deep Learning . . . . . . 541--556
Zhongshun Shi and
Yijie Peng and
Leyuan Shi and
Chun-Hung Chen and
Michael C. Fu Dynamic Sampling Allocation Under Finite
Simulation Budget for Feasibility
Determination . . . . . . . . . . . . . 557--568
Songhao Wang and
Szu Hui Ng and
William Benjamin Haskell A Multilevel Simulation Optimization
Approach for Quantile Functions . . . . 569--585
Ying Zhong and
Shaoxuan Liu and
Jun Luo and
L. Jeff Hong Speeding Up Paulson's Procedure for
Large-Scale Problems Using Parallel
Computing . . . . . . . . . . . . . . . 586--606
Jack P. C. Kleijnen and
Wim C. M. van Beers Statistical Tests for Cross-Validation
of Kriging Models . . . . . . . . . . . 607--621
Qun Meng and
Songhao Wang and
Szu Hui Ng Combined Global and Local Search for
Optimization with Gaussian Process
Models . . . . . . . . . . . . . . . . . 622--637
Yijie Peng and
Li Xiao and
Bernd Heidergott and
L. Jeff Hong and
Henry Lam A New Likelihood Ratio Method for
Training Artificial Neural Networks . . 638--655
Olga Kuryatnikova and
Renata Sotirov and
Juan C. Vera The Maximum $k$-Colorable Subgraph
Problem and Related Problems . . . . . . 656--669
Anonymous Editorial Board . . . . . . . . . . . . ??
Alice E. Smith Note from the Editor . . . . . . . . . . 671--671
Beno\^\it Legat and
Oscar Dowson and
Joaquim Dias Garcia and
Miles Lubin MathOptInterface: a Data Structure for
Mathematical Optimization Problems . . . 672--689
Haoxiang Yang and
Harsha Nagarajan Optimal Power Flow in Distribution
Networks Under $ N - 1 $ Disruptions: a
Multistage Stochastic Programming
Approach . . . . . . . . . . . . . . . . 690--709
S. Raghavan and
Rui Zhang Influence Maximization with Latency
Requirements on Social Networks . . . . 710--728
Nilay Noyan and
Gábor Rudolf and
Miguel Lejeune Distributionally Robust Optimization
Under a Decision-Dependent Ambiguity Set
with Applications to Machine Scheduling
and Humanitarian Logistics . . . . . . . 729--751
Dongwook Shin and
Mark Broadie and
Assaf Zeevi Practical Nonparametric Sampling
Strategies for Quantile-Based Ordinal
Optimization . . . . . . . . . . . . . . 752--768
Junming Liu and
Weiwei Chen and
Jingyuan Yang and
Hui Xiong and
Can Chen Iterative Prediction-and-Optimization
for E-Logistics Distribution Network
Design . . . . . . . . . . . . . . . . . 769--789
Yuheng Hu and
Yili Hong SHEDR: an End-to-End Deep Neural Event
Detection and Recommendation Framework
for Hyperlocal News Using Social Media 790--806
David Bergman and
Teng Huang and
Philip Brooks and
Andrea Lodi and
Arvind U. Raghunathan JANOS: an Integrated Predictive and
Prescriptive Modeling Framework . . . . 807--816
Xinyun Wu and
Zhipeng Lü and
Fred Glover A Fast Vertex Weighting-Based Local
Search for Finding Minimum Connected
Dominating Sets . . . . . . . . . . . . 817--833
Liting Chen and
Sebastian Wandelt and
Weibin Dai and
Xiaoqian Sun Scalable Vertiport Hub Location
Selection for Air Taxi Operations in a
Metropolitan Region . . . . . . . . . . 834--856
Ay\cse N. Arslan and
Boris Detienne Decomposition-Based Approaches for a
Class of Two-Stage Robust Binary
Optimization Problems . . . . . . . . . 857--871
Daniel Rehfeldt and
Thorsten Koch On the Exact Solution of
Prize-Collecting Steiner Tree Problems 872--889
Claudio Contardo and
Jorge A. Sefair A Progressive Approximation Approach for
the Exact Solution of Sparse Large-Scale
Binary Interdiction Games . . . . . . . 890--908
Nathan Adelgren and
Akshay Gupte Branch-and-Bound for Biobjective
Mixed-Integer Linear Programming . . . . 909--933
Gregor Hendel and
Daniel Anderson and
Pierre Le Bodic and
Marc E. Pfetsch Estimating the Size of Branch-and-Bound
Trees . . . . . . . . . . . . . . . . . 934--952
Miao Yu and
Viswanath Nagarajan and
Siqian Shen Improving Column Generation for Vehicle
Routing Problems via Random Coloring and
Parallelization . . . . . . . . . . . . 953--973
John A. Pavlik and
Edward C. Sewell and
Sheldon H. Jacobson Iterative Deepening Dynamically Improved
Bounds Bidirectional Search . . . . . . 974--989
David Bergman and
Merve Bodur and
Carlos Cardonha and
Andre A. Cire Network Models for Multiobjective
Discrete Optimization . . . . . . . . . 990--1005
Stefano Coniglio and
Stefano Gualandi Optimizing over the Closure of Rank
Inequalities with a Small Right-Hand
Side for the Maximum Stable Set Problem
via Bilevel Programming . . . . . . . . 1006--1023
Franco Quezada and
Céline Gicquel and
Safia Kedad-Sidhoum Combining Polyhedral Approaches and
Stochastic Dual Dynamic Integer
Programming for Solving the
Uncapacitated Lot-Sizing Problem Under
Uncertainty . . . . . . . . . . . . . . 1024--1041
John Alasdair Warwicker and
Steffen Rebennack A Comparison of Two Mixed-Integer Linear
Programs for Piecewise Linear Function
Fitting . . . . . . . . . . . . . . . . 1042--1047
Yantong Li and
Jean-François Côté and
Leandro Callegari-Coelho and
Peng Wu Novel Formulations and Logic-Based
Benders Decomposition for the Integrated
Parallel Machine Scheduling and Location
Problem . . . . . . . . . . . . . . . . 1048--1069
Saharnaz Mehrani and
Carlos Cardonha and
David Bergman Models and Algorithms for the
Bin-Packing Problem with Minimum Color
Fragmentation . . . . . . . . . . . . . 1070--1085
Edward Yuhang He and
Natashia Boland and
George Nemhauser and
Martin Savelsbergh Dynamic Discretization Discovery
Algorithms for Time-Dependent Shortest
Path Problems . . . . . . . . . . . . . 1086--1114
Riley Badenbroek and
Etienne de Klerk An Analytic Center Cutting Plane Method
to Determine Complete Positivity of a
Matrix . . . . . . . . . . . . . . . . . 1115--1125
Dewei Zhang and
Yin Liu and
Sam Davanloo Tajbakhsh A First-Order Optimization Algorithm for
Statistical Learning with Hierarchical
Sparsity Structure . . . . . . . . . . . 1126--1140
Luciano Costa and
Claudio Contardo and
Guy Desaulniers and
Julian Yarkony Stabilized Column Generation Via the
Dynamic Separation of Aggregated Rows 1141--1156
Alexander Jungwirth and
Guy Desaulniers and
Markus Frey and
Rainer Kolisch Exact Branch-Price-and-Cut for a
Hospital Therapist Scheduling Problem
with Flexible Service Locations and
Time-Dependent Location Capacity . . . . 1157--1175
Amir Ali Nasrollahzadeh and
Amin Khademi Dynamic Programming for
Response-Adaptive Dose-Finding Clinical
Trials . . . . . . . . . . . . . . . . . 1176--1190
Bart Smeulders and
Valentin Bartier and
Yves Crama and
Frits C. R. Spieksma Recourse in Kidney Exchange Programs . . 1191--1206
Miao Bai and
Robert H. Storer and
Gregory L. Tonkay Surgery Sequencing Coordination with
Recovery Resource Constraints . . . . . 1207--1223
Na Geng and
Xiaolan Xie Managing Advance Admission Requests for
Obstetric Care . . . . . . . . . . . . . 1224--1239
Ali Adibi and
Ehsan Salari Scalable Optimization Methods for
Incorporating Spatiotemporal
Fractionation into Intensity-Modulated
Radiotherapy Planning . . . . . . . . . 1240--1256
Shaojie Tang and
Siyuan Liu and
Xu Han and
Yu Qiao Toward Robust Monitoring of Malicious
Outbreaks . . . . . . . . . . . . . . . 1257--1271
Kaike Zhang and
Xueping Li and
Mingzhou Jin Efficient Solution Methods for a General
$r$-Interdiction Median Problem with
Fortification . . . . . . . . . . . . . 1272--1290
Christoph Helmberg and
Tobias Hofmann and
David Wenzel Periodic Event Scheduling for Automated
Production Systems . . . . . . . . . . . 1291--1304
Anonymous Editorial Board . . . . . . . . . . . . ??
Alice E. Smith Note from the Editor . . . . . . . . . . 1305--1305
Fred W. Glover Unforeseen Consequences of ``Tabu''
Choices --- a Retrospective . . . . . . 1306--1308
Hosseinali Salemi and
Austin Buchanan Solving the Distance-Based Critical Node
Problem . . . . . . . . . . . . . . . . 1309--1326
Sunil Chopra and
Hyunwoo Park and
Sangho Shim Extended Graph Formulation for the
Inequity Aversion Pricing Problem on
Social Networks . . . . . . . . . . . . 1327--1344
S. Raghavan and
Rui Zhang Rapid Influence Maximization on Social
Networks: The Positive Influence
Dominating Set Problem . . . . . . . . . 1345--1365
Kelsey Maass and
Minsun Kim and
Aleksandr Aravkin A Nonconvex Optimization Approach to
IMRT Planning with Dose--Volume
Constraints . . . . . . . . . . . . . . 1366--1386
Martijn H. H. Schoot Uiterkamp and
Marco E. T. Gerards and
Johann L. Hurink On a Reduction for a Class of Resource
Allocation Problems . . . . . . . . . . 1387--1402
Chuangyin Dang and
P. Jean-Jacques Herings and
Peixuan Li An Interior-Point Differentiable
Path-Following Method to Compute
Stationary Equilibria in Stochastic
Games . . . . . . . . . . . . . . . . . 1403--1418
Xiangyi Zhang and
Lu Chen and
Michel Gendreau and
André Langevin Learning-Based Branch-and-Price
Algorithms for the Vehicle Routing
Problem with Time Windows and
Two-Dimensional Loading Constraints . . 1419--1436
Felix Happach and
Lisa Hellerstein and
Thomas Lidbetter A General Framework for Approximating
Min Sum Ordering Problems . . . . . . . 1437--1452
Vahid Mahmoodian and
Iman Dayarian and
Payman Ghasemi Saghand and
Yu Zhang and
Hadi Charkhgard A Criterion Space Branch-and-Cut
Algorithm for Mixed Integer Bilinear
Maximum Multiplicative Programs . . . . 1453--1470
Merve Bodur and
Timothy C. Y. Chan and
Ian Yihang Zhu Inverse Mixed Integer Optimization:
Polyhedral Insights and Trust Region
Methods . . . . . . . . . . . . . . . . 1471--1488
Dimitris Bertsimas and
Ryan Cory-Wright A Scalable Algorithm for Sparse
Portfolio Selection . . . . . . . . . . 1489--1511
Artur Alves Pessoa and
Teobaldo Bulhões and
Vitor Nesello and
Anand Subramanian Exact Approaches for Single Machine
Total Weighted Tardiness Batch
Scheduling . . . . . . . . . . . . . . . 1512--1530
Yiling Zhang and
Jin Dong Building Load Control Using
Distributionally Robust
Chance-Constrained Programs with
Right-Hand Side Uncertainty and the
Risk-Adjustable Variants . . . . . . . . 1531--1547
Tristan Becker and
Maximilian Schiffer and
Grit Walther A General Branch-and-Cut Framework for
Rotating Workforce Scheduling . . . . . 1548--1564
Siyuan Liu and
Shaojie Tang and
Jiangchuan Zheng and
Lionel M. Ni Unsupervised Learning for Human Mobility
Behaviors . . . . . . . . . . . . . . . 1565--1586
Haifeng Xu and
Rasha F. Kashef and
Hans De Sterck and
Geoffrey Sanders Efficient Algebraic Multigrid Methods
for Multilevel Overlapping Coclustering
of User-Item Relationships . . . . . . . 1587--1605
Sanjay Dominik Jena and
Andrea Lodi and
Claudio Sole On the Estimation of Discrete Choice
Models to Capture Irrational Customer
Behaviors . . . . . . . . . . . . . . . 1606--1625
Tong Wang and
Cynthia Rudin Causal Rule Sets for Identifying
Subgroups with Enhanced Treatment
Effects . . . . . . . . . . . . . . . . 1626--1643
Xuan Bi and
Gediminas Adomavicius and
William Li and
Annie Qu Improving Sales Forecasting Accuracy: a
Tensor Factorization Approach with
Demand Awareness . . . . . . . . . . . . 1644--1660
Yicheng Song and
Nachiketa Sahoo and
Shuba Srinivasan and
Chrysanthos Dellarocas Uncovering Characteristic Response Paths
of a Population . . . . . . . . . . . . 1661--1680
Wouter van Eekelen and
Dick den Hertog and
Johan S. H. van Leeuwaarden MAD Dispersion Measure Makes Extremal
Queue Analysis Simple . . . . . . . . . 1681--1692
Amir Rastpour and
Armann Ingolfsson and
Burhaneddin Sandìkçì Algorithms for Queueing Systems with
Reneging and Priorities Modeled as
Quasi-Birth--Death Processes . . . . . . 1693--1710
David J. Eckman and
Shane G. Henderson Posterior-Based Stopping Rules for
Bayesian Ranking-and-Selection
Procedures . . . . . . . . . . . . . . . 1711--1728
Pierre L'Ecuyer and
Florian Puchhammer and
Amal Ben Abdellah Monte Carlo and Quasi--Monte Carlo
Density Estimation via Conditioning . . 1729--1748
Geunyeong Byeon and
Pascal Van Hentenryck Benders Subproblem Decomposition for
Bilevel Problems with Convex Follower 1749--1767
Meysam Cheramin and
Jianqiang Cheng and
Ruiwei Jiang and
Kai Pan Computationally Efficient Approximations
for Distributionally Robust Optimization
Under Moment and Wasserstein Ambiguity 1768--1794
Ricardo M. Lima and
Antonio J. Conejo and
Lo\"\ic Giraldi and
Olivier Le Ma\^\itre and
Ibrahim Hoteit and
Omar M. Knio Risk-Averse Stochastic Programming vs.
Adaptive Robust Optimization: a Virtual
Power Plant Application . . . . . . . . 1795--1818
Kai Pan and
Yongpei Guan Integrated Stochastic Optimal
Self-Scheduling for Two-Settlement
Electricity Markets . . . . . . . . . . 1819--1840
Anonymous Editorial Board . . . . . . . . . . . . ??
Alice E. Smith Note from the Editor . . . . . . . . . . 1841--1841
Lan Peng and
Chase Murray \pkgVeRoViz: a Vehicle Routing
Visualization Toolkit . . . . . . . . . 1842--1848
Zachary Steever and
Chase Murray and
Junsong Yuan and
Mark Karwan and
Marco Lübbecke An Image-Based Approach to Detecting
Structural Similarity Among Mixed
Integer Programs . . . . . . . . . . . . 1849--1870
Alfredo Torrico and
Alejandro Toriello Dynamic Relaxations for Online Bipartite
Matching . . . . . . . . . . . . . . . . 1871--1884
Martin Biel and
Mikael Johansson Efficient Stochastic Programming in
Julia . . . . . . . . . . . . . . . . . 1885--1902
Weiguo Zhang and
Xiaolei He A New Scenario Reduction Method Based on
Higher-Order Moments . . . . . . . . . . 1903--1918
Zhouchun Huang and
Qipeng P. Zheng and
Andrew L. Liu A Nested Cross Decomposition Algorithm
for Power System Capacity Expansion with
Multiscale Uncertainties . . . . . . . . 1919--1939
Hu Tian and
Xiaolong Zheng and
Kang Zhao and
Maggie Wenjing Liu and
Daniel Dajun Zeng Inductive Representation Learning on
Dynamic Stock Co-Movement Graphs for
Stock Predictions . . . . . . . . . . . 1940--1957
Xi Chen and
Yan Liu and
Cheng Zhang Distinguishing Homophily from Peer
Influence Through Network Representation
Learning . . . . . . . . . . . . . . . . 1958--1969
Dilson Lucas Pereira and
Abilio Lucena and
Alexandre Salles da Cunha and
Luidi Simonetti Exact Solution Algorithms for the
Chordless Cycle Problem . . . . . . . . 1970--1986
Marco Casazza and
Alberto Ceselli Exact Algorithms for Maximum Lifetime
Data-Gathering Tree in Wireless Sensor
Networks . . . . . . . . . . . . . . . . 1987--2002
Luis Henrique Pauleti Mendes and
Fábio Luiz Usberti and
Celso Cavellucci The Capacitated and Economic Districting
Problem . . . . . . . . . . . . . . . . 2003--2016
Danielle A. Ripsman and
Thomas G. Purdie and
Timothy C. Y. Chan and
Houra Mahmoudzadeh Robust Direct Aperture Optimization for
Radiation Therapy Treatment Planning . . 2017--2038
Zeyu Liu and
Anahita Khojandi and
Xueping Li and
Akram Mohammed and
Robert L. Davis and
Rishikesan Kamaleswaran A Machine Learning--Enabled Partially
Observable Markov Decision Process
Framework for Early Sepsis Prediction 2039--2057
Vincent Tsz Fai Chow and
Zheng Cui and
Daniel Zhuoyu Long Target-Oriented Distributionally Robust
Optimization and Its Applications to
Surgery Allocation . . . . . . . . . . . 2058--2072
Yifu Chen and
Christos T. Maravelias Variable Bound Tightening and Valid
Constraints for Multiperiod Blending . . 2073--2090
Aras Selvi and
Aharon Ben-Tal and
Ruud Brekelmans and
Dick den Hertog Convex Maximization via Adjustable
Robust Optimization . . . . . . . . . . 2091--2105
Martina Kuchlbauer and
Frauke Liers and
Michael Stingl Adaptive Bundle Methods for Nonlinear
Robust Optimization . . . . . . . . . . 2106--2124
Naomi Graham and
Hao Hu and
Jiyoung Im and
Xinxin Li and
Henry Wolkowicz A Restricted Dual Peaceman--Rachford
Splitting Method for a Strengthened DNN
Relaxation for QAP . . . . . . . . . . . 2125--2143
Veronica Piccialli and
Antonio M. Sudoso and
Angelika Wiegele SOS-SDP: an Exact Solver for Minimum
Sum-of-Squares Clustering . . . . . . . 2144--2162
Endric Daues and
Ulf Friedrich Computing Optimized Path Integrals for
Knapsack Feasibility . . . . . . . . . . 2163--2176
Karim Pérez Martínez and
Yossiri Adulyasak and
Raf Jans Logic-Based Benders Decomposition for
Integrated Process Configuration and
Production Planning Problems . . . . . . 2177--2191
Martin Wölck and
Stephan Meisel Branch-and-Price Approaches for
Real-Time Vehicle Routing with Picking,
Loading, and Soft Time Windows . . . . . 2192--2211
Ay\cse N. Arslan and
Michael Poss and
Marco Silva Min-Sup-Min Robust Combinatorial
Optimization with Few Recourse Solutions 2212--2228
Dimitris Bertsimas and
Bartolomeo Stellato Online Mixed-Integer Optimization in
Milliseconds . . . . . . . . . . . . . . 2229--2248
Orlando Rivera Letelier and
François Clautiaux and
Ruslan Sadykov Bin Packing Problem with Time Lags . . . 2249--2270
Margarita P. Castro and
Andre A. Cire and
J. Christopher Beck Decision Diagrams for Discrete
Optimization: a Survey of Recent
Advances . . . . . . . . . . . . . . . . 2271--2295
Emma S. Johnson and
Santanu Subhas Dey A Scalable Lower Bound for the
Worst-Case Relay Attack Problem on the
Transmission Grid . . . . . . . . . . . 2296--2312
Adil Tahir and
Guy Desaulniers and
Issmail El Hallaoui Integral Column Generation for Set
Partitioning Problems with Side
Constraints . . . . . . . . . . . . . . 2313--2331
Rui Chen and
James Luedtke On Generating Lagrangian Cuts for
Two-Stage Stochastic Integer Programs 2332--2349
Zhaolin Hu and
L. Jeff Hong Robust Simulation with Likelihood-Ratio
Constrained Input Uncertainty . . . . . 2350--2367
Lucy E. Morgan and
Luke Rhodes-Leader and
Russell R. Barton Reducing and Calibrating for Input Model
Bias in Computer Simulation . . . . . . 2368--2382
Anonymous Editorial Board . . . . . . . . . . . . ??
Alice E. Smith Note from the Editor . . . . . . . . . . 2383--2383
Katya Scheinberg Finite Difference Gradient
Approximation: To Randomize or Not? . . 2384--2388
Arden Baxter and
Pinar Keskinocak and
Mohit Singh Heterogeneous Multi-resource Allocation
with Subset Demand Requests . . . . . . 2389--2399
Dimitris Bertsimas and
Michael Lingzhi Li Stochastic Cutting Planes for
Data-Driven Optimization . . . . . . . . 2400--2409
Jianzhe Zhen and
Ahmadreza Marandi and
Danique de Moor and
Dick den Hertog and
Lieven Vandenberghe Disjoint Bilinear Optimization: a
Two-Stage Robust Optimization
Perspective . . . . . . . . . . . . . . 2410--2427
Özgün Elçi and
John Hooker Stochastic Planning and Scheduling with
Logic-Based Benders Decomposition . . . 2428--2442
Qingxin Meng and
Keli Xiao and
Dazhong Shen and
Hengshu Zhu and
Hui Xiong Fine-Grained Job Salary Benchmarking
with a Nonparametric Dirichlet
Process--Based Latent Factor Model . . . 2443--2463
Menghan Liu and
Erik Poppleton and
Giulia Pedrielli and
Petr \vSulc and
Dimitri P. Bertsekas ExpertRNA: a New Framework for RNA
Secondary Structure Prediction . . . . . 2464--2484
Kimia Keshanian and
Daniel Zantedeschi and
Kaushik Dutta Features Selection as a Nash-Bargaining
Solution: Applications in Online
Advertising and Information Systems . . 2485--2501
Jan Gmys Exactly Solving Hard Permutation
Flowshop Scheduling Problems on
Peta-Scale GPU-Accelerated
Supercomputers . . . . . . . . . . . . . 2502--2522
Wei Wu and
Manuel Iori and
Silvano Martello and
Mutsunori Yagiura An Iterated Dual Substitution Approach
for Binary Integer Programming Problems
Under the Min--Max Regret Criterion . . 2523--2539
Martin B. Haugh and
Chun Wang Play Like the Pros? Solving the Game of
Darts as a Dynamic Zero-Sum Game . . . . 2540--2551
Quentin Cappart and
David Bergman and
Louis-Martin Rousseau and
Isabeau Prémont-Schwarz and
Augustin Parjadis Improving Variable Orderings of
Approximate Decision Diagrams Using
Reinforcement Learning . . . . . . . . . 2552--2570
Naga V. C. Gudapati and
Enrico Malaguti and
Michele Monaci Network Design with Service
Requirements: Scaling-up the Size of
Solvable Problems . . . . . . . . . . . 2571--2582
Ramin Moghaddass and
Yongtao Guan Optimal Frameworks for Detecting
Anomalies in Sensor-Intensive
Heterogeneous Networks . . . . . . . . . 2583--2610
Mathieu Besançon and
Alejandro Carderera and
Sebastian Pokutta \pkgFrankWolfe.jl: a High-Performance
and Flexible Toolbox for Frank--Wolfe
Algorithms and Conditional Gradients . . 2611--2620
Amir Ahmadi-Javid and
Pooya Hoseinpour Convexification of Queueing Formulas by
Mixed-Integer Second-Order Cone
Programming: an Application to a
Discrete Location Problem with
Congestion . . . . . . . . . . . . . . . 2621--2633
Kübra Tanìnmì\cs and
Markus Sinnl A Branch-and-Cut Algorithm for
Submodular Interdiction Games . . . . . 2634--2657
Quang Minh Bui and
Bernard Gendron and
Margarida Carvalho A Catalog of Formulations for the
Network Pricing Problem . . . . . . . . 2658--2674
Zhao Zhang and
Wei Liang and
Hongmin W. Du and
Siwen Liu Constant Approximation for the Lifetime
Scheduling Problem of $p$-Percent
Coverage . . . . . . . . . . . . . . . . 2675--2685
Chris Coey and
Lea Kapelevich and
Juan Pablo Vielma Solving Natural Conic Formulations with
Hypatia.jl . . . . . . . . . . . . . . . 2686--2699
Maryam Daryalal and
Merve Bodur Stochastic RWA and Lightpath Rerouting
in WDM Networks . . . . . . . . . . . . 2700--2719
Rishabh Gupta and
Qi Zhang Decomposition and Adaptive Sampling for
Data-Driven Inverse Linear Optimization 2720--2735
Daniel Porumbel Projective Cutting-Planes for Robust
Linear Programming and Cutting Stock
Problems . . . . . . . . . . . . . . . . 2736--2753
Michele Samorani and
Ram Bala and
Rohit Jacob and
Shuhan He A Software Package and Data Set for the
Personal Protective Equipment Matching
Problem During COVID-19 . . . . . . . . 2754--2761
Zemin Zheng and
Jie Zhang and
Yang Li $ L_0 $-Regularized Learning for
High-Dimensional Additive Hazards
Regression . . . . . . . . . . . . . . . 2762--2775
Tianqi Liu and
Francisco Saldanha-da-Gama and
Shuming Wang and
Yuchen Mao Robust Stochastic Facility Location:
Sensitivity Analysis and Exact Solution 2776--2803
Kiho Seo and
Seulgi Joung and
Chungmok Lee and
Sungsoo Park A Closest Benders Cut Selection Scheme
for Accelerating the Benders
Decomposition Algorithm . . . . . . . . 2804--2827
Rahman Khorramfar and
Osman Y. Özaltìn and
Karl G. Kempf and
Reha Uzsoy Managing Product Transitions: a Bilevel
Programming Approach . . . . . . . . . . 2828--2844
Tito Homem-de-Mello and
Qingxia Kong and
Rodrigo Godoy-Barba A Simulation Optimization Approach for
the Appointment Scheduling Problem with
Decision-Dependent Uncertainties . . . . 2845--2865
Anonymous Editorial Board . . . . . . . . . . . . ??
Alice Smith Note from the Editor . . . . . . . . . . 2867--2867
Illya V. Hicks and
Boris Brimkov and
Louis Deaett and
Ruth Haas and
Derek Mikesell and
David Roberson and
Logan Smith Computational and Theoretical Challenges
for Computing the Minimum Rank of a
Graph . . . . . . . . . . . . . . . . . 2868--2872
Phebe Vayanos and
Qing Jin and
George Elissaios ROC++: Robust Optimization in C++ . . . 2873--2888
Jiaqiao Hu and
Yijie Peng and
Gongbo Zhang and
Qi Zhang A Stochastic Approximation Method for
Simulation-Based Quantile Optimization 2889--2907
Yanchao Liu bsnsing: A Decision Tree Induction
Method Based on Recursive Optimal
Boolean Rule Composition . . . . . . . . 2908--2929
L. Jeff Hong and
Guangxin Jiang and
Ying Zhong Solving Large-Scale Fixed-Budget Ranking
and Selection Problems . . . . . . . . . 2930--2949
Jason Rhuggenaath and
Alp Akcay and
Yingqian Zhang and
Uzay Kaymak Setting Reserve Prices in Second-Price
Auctions with Unobserved Bids . . . . . 2950--2967
Carina Moreira Costa and
Dennis Kreber and
Martin Schmidt An Alternating Method for
Cardinality-Constrained Optimization: a
Computational Study for the Best Subset
Selection and Sparse Portfolio Problems 2968--2988
Liwei Zhang and
Yule Zhang and
Jia Wu and
Xiantao Xiao Solving Stochastic Optimization with
Expectation Constraints Efficiently by a
Stochastic Augmented Lagrangian-Type
Algorithm . . . . . . . . . . . . . . . 2989--3006
Nicolau Andrés-Thió and
Mario Andrés Muñoz and
Kate Smith-Miles Bifidelity Surrogate Modelling:
Showcasing the Need for New Test
Instances . . . . . . . . . . . . . . . 3007--3022
Md Saiful Islam and
Md Sarowar Morshed and
Md. Noor-E-Alam A Computational Framework for Solving
Nonlinear Binary Optimization Problems
in Robust Causal Inference . . . . . . . 3023--3041
Alessandro Hill and
Andrea J. Brickey and
Italo Cipriano and
Marcos Goycoolea and
Alexandra Newman Optimization Strategies for
Resource-Constrained Project Scheduling
Problems in Underground Mining . . . . . 3042--3058
Guopeng Song and
Roel Leus Parallel Machine Scheduling Under
Uncertainty: Models and Exact Algorithms 3059--3079
Yuwei Zhou and
Sigrún Andradóttir and
Seong-Hee Kim and
Chuljin Park Finding Feasible Systems for Subjective
Constraints Using Recycled Observations 3080--3095
Shao-Bo Lin and
Shaojie Tang and
Yao Wang and
Di Wang Toward Efficient Ensemble Learning with
Structure Constraints: Convergent
Algorithms and Applications . . . . . . 3096--3116
Marianna De Santis and
Sven de Vries and
Martin Schmidt and
Lukas Winkel A Penalty Branch-and-Bound Method for
Mixed Binary Linear Complementarity
Problems . . . . . . . . . . . . . . . . 3117--3133
Olivier Lalonde and
Jean-François Côté and
Bernard Gendron A Branch-and-Price Algorithm for the
Multiple Knapsack Problem . . . . . . . 3134--3150
Simon Thevenin and
Yossiri Adulyasak and
Jean-François Cordeau Stochastic Dual Dynamic Programming for
Multiechelon Lot Sizing with Component
Substitution . . . . . . . . . . . . . . 3151--3169
Gordon B. Hazen Augmenting Markov Cohort Analysis to
Compute (Co)Variances: Implications for
Strength of Cost-Effectiveness . . . . . 3170--3180
Yajun Lu and
Hosseinali Salemi and
Balabhaskar Balasundaram and
Austin Buchanan On Fault-Tolerant Low-Diameter Clusters
in Graphs . . . . . . . . . . . . . . . 3181--3199
Aharon Ben-Tal and
Ernst Roos An Algorithm for Maximizing a Convex
Function Based on Its Minimum . . . . . 3200--3214
Qinxiao Yu and
Chun Cheng and
Ning Zhu Robust Team Orienteering Problem with
Decreasing Profits . . . . . . . . . . . 3215--3233
Jiateng Yin and
Lixing Yang and
Andrea D'Ariano and
Tao Tang and
Ziyou Gao Integrated Backup Rolling Stock
Allocation and Timetable Rescheduling
with Uncertain Time-Variant Passenger
Demand Under Disruptive Events . . . . . 3234--3258
Ronilo Ragodos and
Tong Wang Disjunctive Rule Lists . . . . . . . . . 3259--3276
Shaojie Tang Robust Adaptive Submodular Maximization 3277--3291
Gonzalo Lera-Romero and
Juan José Miranda Bront and
Francisco J. Soulignac Dynamic Programming for the
Time-Dependent Traveling Salesman
Problem with Time Windows . . . . . . . 3292--3308
Kai Pan and
Ming Zhao and
Chung-Lun Li and
Feng Qiu A Polyhedral Study on Fuel-Constrained
Unit Commitment . . . . . . . . . . . . 3309--3324
Pitchaya Wiratchotisatian and
Hoda Atef Yekta and
Andrew C. Trapp Stability Representations of Many-to-One
Matching Problems: an Integer
Optimization Approach . . . . . . . . . 3325--3343
Anonymous Appreciation to Reviewers . . . . . . . 3344--3350
Anonymous Editorial Board . . . . . . . . . . . . ??
Alice Smith Note from the Editor . . . . . . . . . . 1--1
Claudio Contardo and
Andrea Lodi and
Andrea Tramontani Cutting Planes from the Branch-and-Bound
Tree: Challenges and Opportunities . . . 2--4
John Patrick Lalor and
Pedro Rodriguez \pkgpy-irt: a Scalable Item Response
Theory Library for Python . . . . . . . 5--13
Yiming Liu and
Yang Yu and
Yu Zhang and
Roberto Baldacci and
Jiafu Tang and
Xinggang Luo and
Wei Sun Branch-Cut-and-Price for the
Time-Dependent Green Vehicle Routing
Problem with Time Windows . . . . . . . 14--30
Jiliu Li and
Zhixing Luo and
Roberto Baldacci and
Hu Qin and
Zhou Xu A New Exact Algorithm for
Single-Commodity Vehicle Routing with
Split Pickups and Deliveries . . . . . . 31--49
Katrin Heßler and
Stefan Irnich Partial Dominance in
Branch-Price-and-Cut for the Basic
Multicompartment Vehicle-Routing Problem 50--65
Hua Zheng and
Wei Xie and
Ilya O. Ryzhov and
Dongming Xie Policy Optimization in Dynamic Bayesian
Network Hybrid Models of
Biomanufacturing Processes . . . . . . . 66--82
Mehdi Ansari and
Juan S. Borrero and
Leonardo Lozano Robust Minimum-Cost Flow Problems Under
Multiple Ripple Effect Disruptions . . . 83--103
Yanhang Zhang and
Junxian Zhu and
Jin Zhu and
Xueqin Wang A Splicing Approach to Best Subset of
Groups Selection . . . . . . . . . . . . 104--119
Michael D. Moskal II and
Erdi Dasdemir and
Rajan Batta Unmanned Aerial Vehicle Information
Collection Missions with Uncertain
Characteristics . . . . . . . . . . . . 120--137
Xiao Han and
Leye Wang and
Weiguo Fan Cost-Effective Social Media Influencer
Marketing . . . . . . . . . . . . . . . 138--157
Zhen-Yu Chen and
Zhi-Ping Fan and
Minghe Sun Machine Learning Methods for Data-Driven
Demand Estimation and Assortment
Planning Considering Cross-Selling and
Substitutions . . . . . . . . . . . . . 158--177
Ming Zhao and
Nickolas Freeman and
Kai Pan Robust Sourcing Under Multilevel Supply
Risks: Analysis of Random Yield and
Capacity . . . . . . . . . . . . . . . . 178--195
Tan Wang and
L. Jeff Hong Large-Scale Inventory Optimization: a
Recurrent Neural Networks-Inspired
Simulation Approach . . . . . . . . . . 196--215
Utsav Sadana and
Erick Delage The Value of Randomized Strategies in
Distributionally Robust Risk-Averse
Network Interdiction Problems . . . . . 216--232
Sunil Chopra and
Feng Qiu and
Sangho Shim Parallel Power System Restoration . . . 233--247
Oylum \cSeker and
Mucahit Cevik and
Merve Bodur and
Young Lee and
Mark Ruschin A Multiobjective Approach for Sector
Duration Optimization in Stereotactic
Radiosurgery Treatment Planning . . . . 248--264
Anonymous Editorial Board . . . . . . . . . . . . ??
Alice E. Smith Note from the Editor . . . . . . . . . . 265--265
Ojas Parekh Synergies Between Operations Research
and Quantum Information Science . . . . 266--273
Mercedes Pelegrín and
Martina Cerulli Aircraft Conflict Resolution: a
Benchmark Generator . . . . . . . . . . 274--285
Ashkan Eshghi and
Ram D. Gopal and
Hooman Hidaji and
Raymond A. Patterson Now You See It, Now You Don't:
Obfuscation of Online Third-Party
Information Sharing . . . . . . . . . . 286--303
David Bergman and
Carlos Cardonha and
Jason Imbrogno and
Leonardo Lozano Optimizing the Expected Maximum of Two
Linear Functions Defined on a
Multivariate Gaussian Distribution . . . 304--317
Wenyu Wang and
Christine A. Shoemaker Reference Vector Assisted Candidate
Search with Aggregated Surrogate for
Computationally Expensive Many Objective
Optimization Problems . . . . . . . . . 318--334
Didier Henrion and
Felix Kirschner and
Etienne De Klerk and
Milan Korda and
Jean-Bernard Lasserre and
Victor Magron Revisiting Semidefinite Programming
Approaches to Options Pricing:
Complexity and Computational
Perspectives . . . . . . . . . . . . . . 335--349
David J. Eckman and
Shane G. Henderson and
Sara Shashaani Diagnostic Tools for Evaluating and
Comparing Simulation-Optimization
Algorithms . . . . . . . . . . . . . . . 350--367
Zhongzhu Chen and
Marcia Fampa and
Jon Lee On Computing with Some Convex
Relaxations for the Maximum-Entropy
Sampling Problem . . . . . . . . . . . . 368--385
Cheng Li and
Siyang Gao and
Jianzhong Du Convergence Analysis of Stochastic
Kriging-Assisted Simulation with Random
Covariates . . . . . . . . . . . . . . . 386--402
Silviya Valeva and
Guodong Pang and
Andrew J. Schaefer and
Gilles Clermont Acuity-Based Allocation of
ICU-Downstream Beds with Flexible
Staffing . . . . . . . . . . . . . . . . 403--422
Y. N. Hoogendoorn and
R. Spliet An Improved Integer $L$-Shaped Method
for the Vehicle Routing Problem with
Stochastic Demands . . . . . . . . . . . 423--439
Arindam Ray and
Wolfgang Jank and
Kaushik Dutta and
Matthew Mullarkey An LSTM$^+$ Model for Managing
Epidemics: Using Population Mobility and
Vulnerability for Forecasting COVID-19
Hospital Admissions . . . . . . . . . . 440--457
Kevin-Martin Aigner and
Robert Burlacu and
Frauke Liers and
Alexander Martin Solving AC Optimal Power Flow with
Discrete Decisions to Global Optimality 458--474
Mathijs Barkel and
Maxence Delorme Arcflow Formulations and Constraint
Generation Frameworks for the Two Bar
Charts Packing Problem . . . . . . . . . 475--494
David J. Eckman and
Shane G. Henderson and
Sara Shashaani SimOpt: a Testbed for
Simulation-Optimization Experiments . . 495--508
Jose S. Rodriguez and
Robert B. Parker and
Carl D. Laird and
Bethany L. Nicholson and
John D. Siirola and
Michael L. Bynum Scalable Parallel Nonlinear Optimization
with PyNumero and Parapint . . . . . . . 509--517
Anonymous Editorial Board . . . . . . . . . . . . ??
Alice E. Smith Note from the Editor . . . . . . . . . . 519--520
Carleton Coffrin and
Elisabeth Lobe and
Giacomo Nannicini and
Ojas Parekh Special Issue of \booktitleINFORMS
Journal on Computing --- Quantum
Computing and Operations Research . . . 521--522
Martin Bichler and
Nils Kohring and
Stefan Heidekrüger Learning Equilibria in Asymmetric
Auction Games . . . . . . . . . . . . . 523--542
Alberto Santini and
Michael Schneider and
Thibaut Vidal and
Daniele Vigo Decomposition Strategies for Vehicle
Routing Heuristics . . . . . . . . . . . 543--559
Devansh Jalota and
Dario Paccagnan and
Maximilian Schiffer and
Marco Pavone Online Routing Over Parallel Networks:
Deterministic Limits and Data-driven
Enhancements . . . . . . . . . . . . . . 560--577
Marin Bougeret and
Jérémy Omer and
Michael Poss Optimization Problems in Graphs with
Locational Uncertainty . . . . . . . . . 578--592
Maryam Daryalal and
Hamed Pouya and
Marc Antoine DeSantis Network Migration Problem: a Hybrid
Logic-Based Benders Decomposition
Approach . . . . . . . . . . . . . . . . 593--613
Yaxuan Ran and
Jiani Liu and
Yishi Zhang Integrating Users' Contextual
Engagements with Their General
Preferences: An Interpretable Followee
Recommendation Method . . . . . . . . . 614--632
Jingxu Xu and
Zeyu Zheng Gradient-Based Simulation Optimization
Algorithms via Multi-Resolution System
Approximations . . . . . . . . . . . . . 633--651
Keliang Wang and
Leonardo Lozano and
Carlos Cardonha and
David Bergman Optimizing over an Ensemble of Trained
Neural Networks . . . . . . . . . . . . 652--674
Guanshen Wang and
Yichen Cheng and
Yusen Xia and
Qiang Ling and
Xinlei Wang A Bayesian Semisupervised Approach to
Keyword Extraction with Only Positive
and Unlabeled Data . . . . . . . . . . . 675--691
Sebastian Kraul and
Markus Seizinger and
Jens O. Brunner Machine Learning-Supported Prediction of
Dual Variables for the Cutting Stock
Problem with an Application in
Stabilized Column Generation . . . . . . 692--709
Anonymous Editorial Board . . . . . . . . . . . . ??
Alice E. Smith Note from the Editor . . . . . . . . . . 711--712
Anonymous Call for Papers --- \booktitleINFORMS
Journal on Computing: Special Issue on
Responsible AI and Data Science for
Social Good . . . . . . . . . . . . . . 713--716
Zhi Chen and
Peng Xiong RSOME in Python: An Open-Source Package
for Robust Stochastic Optimization Made
Easy . . . . . . . . . . . . . . . . . . 717--724
Xiangjing Lai and
Jin-Kao Hao and
Renbin Xiao and
Fred Glover Perturbation-Based Thresholding Search
for Packing Equal Circles and Spheres 725--746
Hongke Zhao and
Chuang Zhao and
Xi Zhang and
Nanlin Liu and
Hengshu Zhu and
Qi Liu and
Hui Xiong An Ensemble Learning Approach with
Gradient Resampling for Class-Imbalance
Problems . . . . . . . . . . . . . . . . 747--763
Jiapeng Liu and
Mi\losz Kadzi\'nski and
Xiuwu Liao Modeling Contingent Decision Behavior: A
Bayesian Nonparametric
Preference-Learning Approach . . . . . . 764--785
Xiao-Jun Wang and
Tao Liu and
Weiguo Fan TGVx: Dynamic Personalized POI Deep
Recommendation Model . . . . . . . . . . 786--796
Can Wu and
Ying Cui and
Donghui Li and
Defeng Sun Convex and Nonconvex Risk-Based Linear
Regression at Scale . . . . . . . . . . 797--816
Bahman Naderi and
Rubén Ruiz and
Vahid Roshanaei Mixed-Integer Programming vs. Constraint
Programming for Shop Scheduling
Problems: New Results and Outlook . . . 817--843
Tu San Pham and
Antoine Legrain and
Patrick De Causmaecker and
Louis-Martin Rousseau A Prediction-Based Approach for Online
Dynamic Appointment Scheduling: A Case
Study in Radiotherapy Treatment . . . . 844--868
Marvin Severitt and
Paul Manns Efficient Solution of Discrete
Subproblems Arising in Integer Optimal
Control with Total Variation
Regularization . . . . . . . . . . . . . 869--885
Wei Zhang and
Kai Wang and
Alexandre Jacquillat and
Shuaian Wang Optimized Scenario Reduction: Solving
Large-Scale Stochastic Programs with
Quality Guarantees . . . . . . . . . . . 886--908
Anonymous Editorial Board . . . . . . . . . . . . ??
Alice E. Smith Note from the Editor . . . . . . . . . . 909--909
Alexey A. Bochkarev and
J. Cole Smith On Aligning Non-Order-Associated Binary
Decision Diagrams . . . . . . . . . . . 910--928
Arden Baxter and
Pinar Keskinocak and
Mohit Singh Heterogeneous Multi-resource Planning
and Allocation Under Stochastic Demand 929--951
Dimitris Bertsimas and
Michael Lingzhi Li Interpretable Matrix Completion: a
Discrete Optimization Approach . . . . . 952--965
Víctor Blanco and
Elena Fernández and
Yolanda Hinojosa Hub Location with Protection Under
Interhub Link Failures . . . . . . . . . 966--985
Jin Xiao and
Yuhang Tian and
Yanlin Jia and
Xiaoyi Jiang and
Lean Yu and
Shouyang Wang Black-Box Attack-Based Security
Evaluation Framework for Credit Card
Fraud Detection Models . . . . . . . . . 986--1001
Haolin Ruan and
Zhi Chen and
Chin Pang Ho Adjustable Distributionally Robust
Optimization with Infinitely Constrained
Ambiguity Sets . . . . . . . . . . . . . 1002--1023
Bissan Ghaddar and
Ignacio Gómez-Casares and
Julio González-Díaz and
Brais González-Rodríguez and
Beatriz Pateiro-López and
Sofía Rodríguez-Ballesteros Learning for Spatial Branching: an
Algorithm Selection Approach . . . . . . 1024--1043
Canhong Wen and
Zhenduo Li and
Ruipeng Dong and
Yijin Ni and
Wenliang Pan Simultaneous Dimension Reduction and
Variable Selection for Multinomial
Logistic Regression . . . . . . . . . . 1044--1060
Filippo Zanetti and
Jacek Gondzio An Interior Point--Inspired Algorithm
for Linear Programs Arising in Discrete
Optimal Transport . . . . . . . . . . . 1061--1078
Christoph Hertrich and
Martin Skutella Provably Good Solutions to the Knapsack
Problem via Neural Networks of Bounded
Size . . . . . . . . . . . . . . . . . . 1079--1097
Junming Liu and
Mingfei Teng and
Weiwei Chen and
Hui Xiong A Cost-Effective Sequential Route
Recommender System for Taxi Drivers . . 1098--1119
Feng Liu and
Zhi Chen and
Shuming Wang Globalized Distributionally Robust
Counterpart . . . . . . . . . . . . . . 1120--1142
Gabriele Dragotto and
Rosario Scatamacchia The Zero Regrets Algorithm: Optimizing
over Pure Nash Equilibria via Integer
Programming . . . . . . . . . . . . . . 1143--1160
Arnab Bhattacharya and
Jeffrey P. Kharoufeh and
Bo Zeng A Nonconvex Regularization Scheme for
the Stochastic Dual Dynamic Programming
Algorithm . . . . . . . . . . . . . . . 1161--1178
Xiaofan Lai and
Liang Xu and
Zhou Xu and
Yang Du An Approximation Algorithm for $k$-Depot
Split Delivery Vehicle Routing Problem 1179--1194
Steven Lamontagne and
Margarida Carvalho and
Emma Frejinger and
Bernard Gendron and
Miguel F. Anjos and
Ribal Atallah Optimising Electric Vehicle Charging
Station Placement Using Advanced
Discrete Choice Models . . . . . . . . . 1195--1213
Anonymous Editorial Board . . . . . . . . . . . . ??
Alice E. Smith Note from the Editor . . . . . . . . . . 1215--1217
Xiaotie Chen and
David L. Woodruff Software for Data-Based Stochastic
Programming Using Bootstrap Estimation 1218--1224
Dimitris Bertsimas and
Cheol Woo Kim A Prescriptive Machine Learning Approach
to Mixed-Integer Convex Optimization . . 1225--1241
Anirudh Kishore Bhoopalam and
Niels Agatz and
Rob Zuidwijk Platoon Optimization Based on Truck
Pairs . . . . . . . . . . . . . . . . . 1242--1260
Gongbo Zhang and
Yijie Peng and
Jianghua Zhang and
Enlu Zhou Asymptotically Optimal Sampling Policy
for Selecting Top-$m$ Alternatives . . . 1261--1285
Yuchen Luo and
Bruce Golden and
Rui Zhang The Hot Spot Coverage Patrol Problem:
Formulations and Solution Approaches . . 1286--1307
Lucas Böttcher and
Thomas Asikis and
Ioannis Fragkos Control of Dual-Sourcing Inventory
Systems Using Recurrent Neural Networks 1308--1328
Ambros Gleixner and
Leona Gottwald and
Alexander Hoen PaPILO: A Parallel Presolving Library
for Integer and Linear Optimization with
Multiprecision Support . . . . . . . . . 1329--1341
Akshit Goyal and
Yiling Zhang and
Chuan He Decision Rule Approaches for Pessimistic
Bilevel Linear Programs Under Moment
Ambiguity with Facility Location
Applications . . . . . . . . . . . . . . 1342--1360
Yue Zhao and
Zhi Chen and
Zhenzhen Zhang Distributionally Robust
Chance-Constrained $p$-Hub Center
Problem . . . . . . . . . . . . . . . . 1361--1382
Jongeun Kim and
Sven Leyffer and
Prasanna Balaprakash Learning Symbolic Expressions:
Mixed-Integer Formulations, Cuts, and
Heuristics . . . . . . . . . . . . . . . 1383--1403
Matthias Walter Recognizing Series-Parallel Matrices in
Linear Time . . . . . . . . . . . . . . 1404--1418
Hamed Fahimi and
Claude-Guy Quimper Overload-Checking and Edge-Finding for
Robust Cumulative Scheduling . . . . . . 1419--1438
Wilco van den Heuvel and
Semra A\ugralì and
Z. Caner Ta\cskìn A Decomposition Algorithm for Single and
Multiobjective Integrated Market
Selection and Production Planning . . . 1439--1453
Álvaro Porras and
Concepción Domínguez and
Juan Miguel Morales and
Salvador Pineda Tight and Compact Sample Average
Approximation for Joint
Chance-Constrained Problems with
Applications to Optimal Power Flow . . . 1454--1469
Hark-Chin Hwang and
Wilco van den Heuvel and
Albert P. M. Wagelmans Multilevel Lot-Sizing with Inventory
Bounds . . . . . . . . . . . . . . . . . 1470--1490
Canhong Wen and
Xueqin Wang and
Aijun Zhang $ \ell_0 $ Trend Filtering . . . . . . . 1491--1510
Steffen Eibelshäuser and
Victor Klockmann and
David Poensgen and
Alicia von Schenk The Logarithmic Stochastic Tracing
Procedure: a Homotopy Method to Compute
Stationary Equilibria of Stochastic
Games . . . . . . . . . . . . . . . . . 1511--1526
Anonymous Appreciation to Reviewers, 2023 . . . . 1527--1532
Anonymous Editorial Board . . . . . . . . . . . . ??
Alice E. Smith Note from the Editor . . . . . . . . . . 1--2
Stefan Bock and
Nils Boysen Routing Replenishment Workers: The Prize
Collecting Traveling Salesman Problem in
Scattered Storage Warehouses . . . . . . 3--20
Carla Michini and
Peter Ohmann and
Ben Liblit and
Jeff Linderoth A Set-Covering Approach to Customized
Coverage Instrumentation . . . . . . . . 21--38
Yangming Zhou and
Jiaqi Li and
Jin-Kao Hao and
Fred Glover Detecting Critical Nodes in Sparse
Graphs via ``Reduce--Solve--Combine''
Memetic Search . . . . . . . . . . . . . 39--60
Izuwa Ahanor and
Hugh Medal and
Andrew C. Trapp DiversiTree: A New Method to Efficiently
Compute Diverse Sets of Near-Optimal
Solutions to Mixed-Integer Optimization
Problems . . . . . . . . . . . . . . . . 61--77
Henri Lefebvre and
Enrico Malaguti and
Michele Monaci Adjustable Robust Optimization with
Discrete Uncertainty . . . . . . . . . . 78--96
Yongchun Li and
Marcia Fampa and
Jon Lee and
Feng Qiu and
Weijun Xie and
Rui Yao $D$-Optimal Data Fusion: Exact and
Approximation Algorithms . . . . . . . . 97--120
Yeu-Shiang Huang and
Chih-Chiang Fang and
Chun-Hsuan Chou and
Tzu-Liang (Bill) Tseng A Study on Optimal Release Schedule for
Multiversion Software . . . . . . . . . 121--140
Roberto Baldacci and
Stefano Coniglio and
Jean-François Cordeau and
Fabio Furini A Numerically Exact Algorithm for the
Bin-Packing Problem . . . . . . . . . . 141--162
Tianyi Li and
Munther A. Dahleh Automation of Strategic Data
Prioritization in System Model
Calibration: Sensor Placement . . . . . 163--184
Yikai Yan and
Chaoyue Niu and
Yucheng Ding and
Zhenzhe Zheng and
Shaojie Tang and
Qinya Li and
Fan Wu and
Chengfei Lyu and
Yanghe Feng and
Guihai Chen Federated Optimization Under
Intermittent Client Availability . . . . 185--202
Eric Larsen and
Emma Frejinger and
Bernard Gendron and
Andrea Lodi Fast Continuous and Integer L-Shaped
Heuristics Through Supervised Learning 203--223
Nicola Bianchessi and
Timo Gschwind and
Stefan Irnich Resource-Window Reduction by Reduced
Costs in Path-Based Formulations for
Routing and Scheduling Problems . . . . 224--244
Adolfo R. Escobedo Exact Matrix Factorization Updates for
Nonlinear Programming . . . . . . . . . 245--265
Yajuan Li and
Zachary T. Kaplan and
Marvin K. Nakayama Monte Carlo Methods for Economic Capital 266--284
Nicolas Forget and
Sophie N. Parragh Enhancing Branch-and-Bound for
Multiobjective $0$--$1$ Programming . . 285--304
Anonymous Editorial Board . . . . . . . . . . . . ??
Alice E. Smith Note from the Editor . . . . . . . . . . 305--307
Yangming Zhou and
Jin-Kao Hao and
Zhen Li Heuristic Search for Rank Aggregation
with Application to Label Ranking . . . 308--326
Joaquim Dias Garcia and
Guilherme Bodin and
Alexandre Street BilevelJuMP.jl: Modeling and Solving
Bilevel Optimization Problems in Julia 327--335
Arvind U. Raghunathan and
David Bergman and
John N. Hooker and
Thiago Serra and
Shingo Kobori Seamless Multimodal Transportation
Scheduling . . . . . . . . . . . . . . . 336--358
Shaojie Tang and
Jing Yuan Group Equality in Adaptive Submodular
Maximization . . . . . . . . . . . . . . 359--376
Yiyin Cao and
Yin Chen and
Chuangyin Dang A Differentiable Path-Following Method
with a Compact Formulation to Compute
Proper Equilibria . . . . . . . . . . . 377--396
Richard Krug and
Günter Leugering and
Alexander Martin and
Martin Schmidt and
Dieter Weninger A Consensus-Based Alternating Direction
Method for Mixed-Integer and
PDE-Constrained Gas Transport Problems 397--416
Lennart Sinjorgo and
Renata Sotirov On Solving MAX-SAT Using Sum of Squares 417--433
Temitayo Ajayi and
Seyedmohammadhossein Hosseinian and
Andrew J. Schaefer and
Clifton D. Fuller Combination Chemotherapy Optimization
with Discrete Dosing . . . . . . . . . . 434--455
Mathieu Besançon and
Joaquim Dias Garcia and
Beno\^\it Legat and
Akshay Sharma Flexible Differentiable Optimization via
Model Transformations . . . . . . . . . 456--478
Markus Leitner and
Andrea Lodi and
Roberto Roberti and
Claudio Sole An Exact Method for (Constrained)
Assortment Optimization Problems with
Product Costs . . . . . . . . . . . . . 479--494
Yi Tan and
Prakash P. Shenoy and
Ben Sherwood and
Catherine Shenoy and
Melinda Gaddy and
Mary E. Oehlert Bayesian Network Models for PTSD
Screening in Veterans . . . . . . . . . 495--509
Yaoyao Zhang and
Chaojie Zhu and
Shaojie Tang and
Yingli Ran and
Ding-Zhu Du and
Zhao Zhang Evolutionary Algorithm on General Cover
with Theoretically Guaranteed
Approximation Ratio . . . . . . . . . . 510--525
Xiangyi Fan and
Grani A. Hanasusanto A Decision Rule Approach for Two-Stage
Data-Driven Distributionally Robust
Optimization Problems with Random
Recourse . . . . . . . . . . . . . . . . 526--542
Defeng Sun and
Lixin Tang and
Roberto Baldacci and
Zihan Chen A Decomposition Method for the
Group-Based Quay Crane Scheduling
Problem . . . . . . . . . . . . . . . . 543--570
Hao Lin and
Guannan Liu and
Junjie Wu and
J. Leon Zhao Deterring the Gray Market: Product
Diversion Detection via Learning
Disentangled Representations of
Multivariate Time Series . . . . . . . . 571--586
Jiajun Xu and
Suvrajeet Sen Ensemble Variance Reduction Methods for
Stochastic Mixed-Integer Programming and
their Application to the Stochastic
Facility Location Problem . . . . . . . 587--599
Russell Bent and
Byron Tasseff and
Carleton Coffrin InfrastructureModels: Composable
Multi-infrastructure Optimization in
Julia . . . . . . . . . . . . . . . . . 600--615
Alireza Aghasi and
Arun Rai and
Yusen Xia A Deep Learning and Image Processing
Pipeline for Object Characterization in
Firm Operations . . . . . . . . . . . . 616--634
Lindong Liu and
Xiangtong Qi and
Zhou Xu Stabilizing Grand Cooperation via Cost
Adjustment: an Inverse Optimization
Approach . . . . . . . . . . . . . . . . 635--656
Pietro D'Alessandro and
Manlio Gaudioso and
Giovanni Giallombardo and
Giovanna Miglionico The Descent--Ascent Algorithm for DC
Programming . . . . . . . . . . . . . . 657--671
Zacharie Ales and
Céline Engelbeen and
Rosa Figueiredo Correlation Clustering Problem Under
Mediation . . . . . . . . . . . . . . . 672--689
Wei Xu and
Jie Tang and
Ka Fai Cedric Yiu and
Jian Wen Peng An Efficient Global Optimal Method for
Cardinality Constrained Portfolio
Optimization . . . . . . . . . . . . . . 690--704
Anonymous Editorial Board . . . . . . . . . . . . ??
Alice E. Smith Note from the Editor . . . . . . . . . . 705--707
Atefeh Rajabalizadeh and
Danial Davarnia Solving a Class of Cut-Generating Linear
Programs via Machine Learning . . . . . 708--722
Marleen Balvert Iterative Rule Extension for Logic
Analysis of Data: an MILP-Based
Heuristic to Derive Interpretable Binary
Classifiers from Large Data Sets . . . . 723--741
Jindong Qin and
Pan Zheng and
Xiaojun Wang Product Redesign and Innovation Based on
Online Reviews: a Multistage Combined
Search Method . . . . . . . . . . . . . 742--765
Opher Baron and
Dmitry Krass and
Arik Senderovich and
Eliran Sherzer Supervised ML for Solving the GI/GI/1
Queue . . . . . . . . . . . . . . . . . 766--786
Mehdi Behroozi Largest Volume Inscribed Rectangles in
Convex Sets Defined by Finite Number of
Inequalities . . . . . . . . . . . . . . 787--819
Yongzheng Dai and
Chen Chen Sparsity-Exploiting Distributed
Projections onto a Simplex . . . . . . . 820--835
Danny Hermelin and
Hendrik Molter and
Dvir Shabtay Minimizing the Weighted Number of Tardy
Jobs via (max,+)-Convolutions . . . . . 836--848
Shanshan Wang and
Erick Delage A Column Generation Scheme for
Distributionally Robust Multi-Item
Newsvendor Problems . . . . . . . . . . 849--867
Jasper van Doornmalen and
Christopher Hojny Efficient Propagation Techniques for
Handling Cyclic Symmetries in Binary
Programs . . . . . . . . . . . . . . . . 868--883
Xiaoyi Gu and
Santanu S. Dey and
Jean-Philippe P. Richard Solving Sparse Separable Bilinear
Programs Using Lifted Bilinear Cover
Inequalities . . . . . . . . . . . . . . 884--899
Beno\^\it Loger and
Alexandre Dolgui and
Fabien Lehuédé and
Guillaume Massonnet Approximate Kernel Learning Uncertainty
Set for Robust Combinatorial
Optimization . . . . . . . . . . . . . . 900--917
Ankit Bansal and
Jean-Philippe Richard and
Bjorn P. Berg and
Yu-Li Huang A Sequential Follower Refinement
Algorithm for Robust Surgery Scheduling 918--937
Anonymous Editorial Board . . . . . . . . . . . . ??
Alice E. Smith Note from the Editor . . . . . . . . . . 939--940
Nicholas D. Kullman and
Jorge E. Mendoza and
Ted K. Ralphs Introduction to the Special Section on
Software Tools for Vehicle Routing . . . 941--942
Niels A. Wouda and
Leon Lan and
Wouter Kool PyVRP: a High-Performance VRP Solver
Package . . . . . . . . . . . . . . . . 943--955
Najib Errami and
Eduardo Queiroga and
Ruslan Sadykov and
Eduardo Uchoa VRPSolverEasy: a Python Library for the
Exact Solution of a Rich Vehicle Routing
Problem . . . . . . . . . . . . . . . . 956--965
Patrick S. Klein and
Maximilian Schiffer RoutingBlocks: an Open-Source Python
Package for Vehicle Routing Problems
with Intermediate Stops . . . . . . . . 966--973
Vinícius R. Máximo and
Jean-François Cordeau and
Mariá C. V. Nascimento AILS-II: an Adaptive Iterated Local
Search Heuristic for the Large-Scale
Capacitated Vehicle Routing Problem . . 974--986
Hyeonah Kim and
Jinkyoo Park and
Changhyun Kwon A Neural Separation Algorithm for the
Rounded Capacity Inequalities . . . . . 987--1005
Fan You and
Thomas Vossen An Approximate Dynamic Programming
Approach to Dynamic Stochastic Matching 1006--1022
Eunhye Song and
Henry Lam and
Russell R. Barton A Shrinkage Approach to Improve Direct
Bootstrap Resampling Under Input
Uncertainty . . . . . . . . . . . . . . 1023--1039
Byron Tasseff and
Russell Bent and
Carleton Coffrin and
Clayton Barrows and
Devon Sigler and
Jonathan Stickel and
Ahmed S. Zamzam and
Yang Liu and
Pascal Van Hentenryck Polyhedral Relaxations for Optimal Pump
Scheduling of Potable Water Distribution
Networks . . . . . . . . . . . . . . . . 1040--1063
Marcos Blufstein and
Gonzalo Lera-Romero and
Francisco J. Soulignac Decremental State-Space Relaxations for
the Basic Traveling Salesman Problem
with a Drone . . . . . . . . . . . . . . 1064--1083
Diego Cattaruzza and
Martine Labbé and
Matteo Petris and
Marius Roland and
Martin Schmidt Exact and Heuristic Solution Techniques
for Mixed-Integer Quantile Minimization
Problems . . . . . . . . . . . . . . . . 1084--1107
Antoine Legrain and
Jérémy Omer A Dedicated Pricing Algorithm to Solve a
Large Family of Nurse Scheduling
Problems with Branch-and-Price . . . . . 1108--1128
Nagisa Sugishita and
Andreas Grothey and
Ken McKinnon Use of Machine Learning Models to
Warmstart Column Generation for Unit
Commitment . . . . . . . . . . . . . . . 1129--1146
Anonymous Editorial Board . . . . . . . . . . . . ??
Alice E. Smith Note from the Editor . . . . . . . . . . 1147--1149
Christian Schmitt and
Bismark Singh Quadratic Optimization Models for
Balancing Preferential Access and
Fairness: Formulations and Optimality
Conditions . . . . . . . . . . . . . . . 1150--1167
Guangxin Jiang and
L. Jeff Hong and
Haihui Shen Real-Time Derivative Pricing and Hedging
with Consistent Metamodels . . . . . . . 1168--1189
Hongmin W. Du and
Yingfan L. Du and
Zhao Zhang Adaptive Influence Maximization:
Adaptability via Nonadaptability . . . . 1190--1200
Shuming Wang and
Jun Li and
Marcus Ang and
Tsan Sheng Ng Appointment Scheduling with Delay
Tolerance Heterogeneity . . . . . . . . 1201--1224
Yu-Wei Li and
Gui-Hua Lin and
Xide Zhu Solving Bilevel Programs Based on
Lower-Level Mond--Weir Duality . . . . . 1225--1241
Xiaoping Liu and
Xiao-Bai Li Cost-Effective Acquisition of
First-Party Data for Business Analytics 1242--1260
Amin Dehghanian and
Yujia Xie and
Nicoleta Serban Identifying Socially Optimal Equilibria
Using Combinatorial Properties of Nash
Equilibria in Bimatrix Games . . . . . . 1261--1286
Tao Wu Exact Method for Production Hub Location 1287--1315
Donato Maragno and
Jannis Kurtz and
Tabea E. Röber and
Rob Goedhart and
\cS. \.Ilker Birbil and
Dick den Hertog Finding Regions of Counterfactual
Explanations via Robust Optimization . . 1316--1334
Bahar Cennet Okumu\cso\uglu and
Beste Basciftci and
Burak Kocuk An Integrated Predictive Maintenance and
Operations Scheduling Framework for
Power Systems Under Failure Uncertainty 1335--1358
Anonymous Editorial Board . . . . . . . . . . . . ??
Anonymous Note from the Editor . . . . . . . . . . 1359--1361
Michael Kahr and
Markus Leitner and
Ivana Ljubi\'c The Impact of Passive Social Media
Viewers in Influence Maximization . . . 1362--1381
Chenbo Shi and
Mohsen Emadikhiav and
Leonardo Lozano and
David Bergman Constraint Learning to Define Trust
Regions in Optimization over Pre-Trained
Predictive Models . . . . . . . . . . . 1382--1399
Zhu (Drew) Zhang and
Jie Yuan and
Amulya Gupta Let the Laser Beam Connect the Dots:
Forecasting and Narrating Stock Market
Volatility . . . . . . . . . . . . . . . 1400--1416
Katrin Heßler and
Stefan Irnich Exact Solution of the Single-Picker
Routing Problem with Scattered Storage 1417--1435
Yun Hui Lin and
Qingyun Tian and
Yanlu Zhao Unified Framework for Choice-Based
Facility Location Problem . . . . . . . 1436--1458
Hongzhao Guan and
Beste Basciftci and
Pascal Van Hentenryck Path-Based Formulations for the Design
of On-demand Multimodal Transit Systems
with Adoption Awareness . . . . . . . . 1459--1480
Guo Liang and
Kun Zhang and
Jun Luo A FAST Method for Nested Estimation . . 1481--1500
Mahdis Bayani and
Borzou Rostami and
Yossiri Adulyasak and
Louis-Martin Rousseau A Dual Bounding Framework Through Cost
Splitting for Binary Quadratic
Optimization . . . . . . . . . . . . . . 1501--1521
Vianney Coppé and
Xavier Gillard and
Pierre Schaus Decision Diagram-Based Branch-and-Bound
with Caching for Dominance and
Suboptimality Detection . . . . . . . . 1522--1542
Ça\ugìl Koçyi\ugit and
Daniel Kuhn and
Napat Rujeerapaiboon Regret Minimization and Separation in
Multi-Bidder, Multi-Item Auctions . . . 1543--1561
Álinson Santos Xavier and
Santanu Subhas Dey and
Feng Qiu Decomposable Formulation of Transmission
Constraints for Decentralized Power
Systems Optimization . . . . . . . . . . 1562--1578
Katrin Halbig and
Lukas Hümbs and
Florian Rösel and
Lars Schewe and
Dieter Weninger Computing Optimality Certificates for
Convex Mixed-Integer Nonlinear Problems 1579--1610
Tianyu Wang and
Yasong Feng Convergence Rates of Zeroth Order
Gradient Descent for \{\{Lojasiewicz
Functions . . . . . . . . . . . . . . . 1611--1633
Jiachen Zhang and
Youcef Magnouche and
Pierre Bauguion and
Sebastien Martin and
J. Christopher Beck Computing Bipath Multicommodity Flows
with Constraint Programming--Based
Branch-and-Price-and-Cut . . . . . . . . 1634--1653
Stefan Lendl and
Ulrich Pferschy and
Elena Rener Rescheduling with New Orders Under
Bounded Disruption . . . . . . . . . . . 1654--1675
Christian Artigues and
Emmanuel Hébrard and
Alain Quilliot and
Hél\`ene Toussaint The Continuous Time-Resource Trade-off
Scheduling Problem with Time Windows . . 1676--1695
Daniel Kowalczyk and
Roel Leus and
Christopher Hojny and
Stefan Ròpke A Flow-Based Formulation for Parallel
Machine Scheduling Using Decision
Diagrams . . . . . . . . . . . . . . . . 1696--1714
Zachary Steever and
Kyle Hunt and
Mark Karwan and
Junsong Yuan and
Chase C. Murray A Graph-Based Approach for Relating
Integer Programs . . . . . . . . . . . . 1715--1736
Christian Füllner and
Peter Kirst and
Hendrik Otto and
Steffen Rebennack Feasibility Verification and Upper Bound
Computation in Global Minimization Using
Approximate Active Index Sets . . . . . 1737--1756
Anonymous Editorial Board . . . . . . . . . . . . ??