1757 | -- | 1758 | Rajan Batta. Foreword |
1759 | -- | 1770 | Orhan Karasakal. Air defense missile-target allocation models for a naval task group |
1771 | -- | 1788 | Corbin G. Koepke, Andrew P. Armacost, Cynthia Barnhart, Stephan E. Kolitz. An integer programming approach to support the US Air Force s air mobility network |
1789 | -- | 1812 | Trevor I. Laine, Kenneth W. Bauer Jr.. A mathematical framework to optimize ATR systems with non-declarations and sensor fusion |
1813 | -- | 1828 | Vijay K. Shetty, Moises Sudit, Rakesh Nagi. Priority-based assignment and routing of a fleet of unmanned combat aerial vehicles |
1829 | -- | 1843 | R. A. Hahn, Alexandra M. Newman. Scheduling United States Coast Guard helicopter deployment and maintenance at Clearwater Air Station, Florida |
1844 | -- | 1864 | John F. Raffensperger, Linus Schrage. Scheduling training for a tank battalion: How to measure readiness |
1865 | -- | 1873 | Richard K. Bullock, Richard F. Deckro, Jeffery D. Weir. Methodology for competitive strategy development |
1874 | -- | 1885 | Jonathan P. Caulkins, Dieter Grass, Gustav Feichtinger, Gernot Tragler. Optimizing counter-terror operations: Should one fight fire with fire or water ? |
1886 | -- | 1904 | Yupo Chan, Jean M. Mahan, James W. Chrissis, David A. Drake, Dong Wang. Hierarchical maximal-coverage location-allocation: Case of generalized search-and-rescue |
1905 | -- | 1923 | Maria Paola Scaparra, Richard L. Church. A bilevel mixed-integer program for critical infrastructure protection planning |
1924 | -- | 1943 | Pavel Albores, Duncan Shaw. Government preparedness: Using simulation to prepare for a terrorist attack |
1944 | -- | 1962 | Guillermo Owen, Gordon H. McCormick. Finding a moving fugitive. A game theoretic representation of search |
1963 | -- | 1981 | Victor F. Cavalcante, Cid C. de Souza, Abilio Lucena. A Relax-and-Cut algorithm for the set partitioning problem |
1982 | -- | 1998 | Aníbal Alberto Vilcapoma Ignacio, Virgílio José Martins Ferreira Filho, Roberto Diéguez Galvão. Lower and upper bounds for a two-level hierarchical location problem in computer networks |
1999 | -- | 2017 | Nees Jan van Eck, Michiel C. van Wezel. Application of reinforcement learning to the game of Othello |
2018 | -- | 2033 | Reha Uzsoy, Juan Diego Velásquez. Heuristics for minimizing maximum lateness on a single machine with family-dependent set-up times |
2034 | -- | 2048 | Fumiaki Taniguchi, Takeo Yamada, Seiji Kataoka. Heuristic and exact algorithms for the max-min optimization of the multi-scenario knapsack problem |
2049 | -- | 2070 | Mohammed S. Zahrani, Martin J. Loomes, James A. Malcolm, Abu Zafer M. Dayem Ullah, Kathleen Steinhöfel, Andreas Alexander Albrecht. Genetic local search for multicast routing with pre-processing by logarithmic simulated annealing |
2071 | -- | 2078 | Daniel Oron. Single machine scheduling with simple linear deterioration to minimize total absolute deviation of completion times |
2079 | -- | 2092 | Andreas Klose. Algorithms for solving the single-sink fixed-charge transportation problem |
2093 | -- | 2102 | Tiravat Assavapokee, Matthew J. Realff, Jane C. Ammons, I-Hsuan Hong. Scenario relaxation algorithm for finite scenario-based min-max regret and min-max relative regret robust optimization |
2103 | -- | 2113 | Isabel Correia, Luís Gouveia, Francisco Saldanha-da-Gama. Solving the variable size bin packing problem with discretized formulations |
2114 | -- | 2128 | Horacio Hideki Yanasse, Daniel Massaru Katsurayama. An enumeration scheme to generate constrained exact checkerboard patterns |