| 565 | -- | 569 | Shabbir Ahmed. A scenario decomposition algorithm for 0-1 stochastic programs |
| 570 | -- | 575 | Caroline Jagtenberg, Uwe Schwiegelshohn, Marc Uetz. Analysis of Smith's rule in stochastic machine scheduling |
| 576 | -- | 580 | Daya Ram Gaur, Apurva Mudgal, Rishi Ranjan Singh. Routing vehicles to minimize fuel consumption |
| 581 | -- | 585 | L. D. Servi. Analyzing social media data having discontinuous underlying dynamics |
| 586 | -- | 591 | Guo-ji Tang, Nan-Jing Huang. An inexact proximal point algorithm for maximal monotone vector fields on Hadamard manifolds |
| 592 | -- | 596 | Denis Cornaz, V. H. Nguyen. Kőnig's edge-colouring theorem for all graphs |
| 597 | -- | 601 | Jianqiang Cheng, Abdel Lisser. A completely positive representation of 0-1 linear programs with joint probabilistic constraints |
| 602 | -- | 606 | Eduardo Conde. A minmax regret median problem on a tree under uncertain locations of the demand points |
| 607 | -- | 610 | Nicolas Lebert, Frédéric Meunier, Quentin Carbonneaux. mm-cake and three-player two-cake divisions |
| 611 | -- | 614 | Timo Berthold. Measuring the impact of primal heuristics |
| 615 | -- | 617 | Zhihan Gao. ts-t path graph Traveling Salesman Problem |
| 618 | -- | 621 | Michael Pinedo, Josh Reed. The "least flexible job first" rule in scheduling and in queueing |
| 622 | -- | 626 | Gabriela Tavares, Panos Parpas. On the information-based complexity of stochastic programming |
| 627 | -- | 632 | Srikrishna Sridhar, Jeff Linderoth, James Luedtke. Locally ideal formulations for piecewise linear functions with indicator variables |
| 633 | -- | 635 | Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger. Uniqueness in quadratic and hyperbolic 0-1 programming problems |
| 636 | -- | 638 | A. Y. Golubin. On Pareto optimality conditions in the case of two-dimension non-convex utility space |
| 639 | -- | 643 | Adam Kasperski, Pawel Zielinski. Bottleneck combinatorial optimization problems with uncertain costs and the OWA criterion |
| 644 | -- | 649 | Mauro Castelli, Stefano Beretta, Leonardo Vanneschi. A hybrid genetic algorithm for the repetition free longest common subsequence problem |
| 650 | -- | 653 | Yunshu Gao, Ding Ma. Disjoint cycles with different length in 4-arc-dominated digraphs |
| 654 | -- | 658 | Sercan Yildiz, Juan Pablo Vielma. Incremental and encoding formulations for Mixed Integer Programming |
| 659 | -- | 663 | Vahid Sarhangian, Baris Balcioglu. A first passage time problem for spectrally positive Lévy processes and its application to a dynamic priority queue |
| 664 | -- | 669 | Lauri Häme, Harri Hakula. Routing by ranking: A link analysis method for the constrained dial-a-ride problem |
| 670 | -- | 674 | Chung-Yee Lee, Xi Li. Economic lot sizing: The capacity reservation model |
| 675 | -- | 678 | F. Javier Martínez-de-Albéniz, Carles Rafels, Neus Ybern. A procedure to compute the nucleolus of the assignment game |
| 679 | -- | 684 | Yan Shu, Sunil Chopra, Ellis L. Johnson, Sangho Shim. Binary group facets with complete support and non-binary coefficients |
| 685 | -- | 689 | Cristina Bazgan, Sonia Toubaline, Daniel Vanderpooten. Critical edges for the assignment problem: Complexity and exact resolution |
| 690 | -- | 693 | Peng Zhao, Ping-Shing Chan, Long Li, Hon Keung Tony Ng. On allocation of redundancies in two-component series systems |
| 694 | -- | 700 | Sean W. Jewell, Yang Li, Traian A. Pirvu. Non-linear equity portfolio variance reduction under a mean-variance framework - A delta-gamma approach |
| 701 | -- | 705 | Anja Fischer, Frank Fischer. Complete description for the spanning tree problem with one linearised quadratic term |
| 706 | -- | 709 | Jun Wang, Feng Chen. Feedback saddle point solution of counterterror measures and economic growth game |
| 710 | -- | 714 | Igor Averbakh, Mehmet Baysan. Approximation algorithm for the on-line multi-customer two-level supply chain scheduling problem |
| 715 | -- | 718 | Anh Ninh, András Prékopa. The discrete moment problem with fractional moments |
| 719 | -- | 725 | Jian Li, Xiaowei Xu. Optimality of (s, S)-policies in a dynamic pricing model with replenishment opportunities: A sample path approach |
| 726 | -- | 729 | Thomas DuBois, Georges Allaert, Frank Witlox. Determining the fill rate for a periodic review inventory policy with capacitated replenishments, lost sales and zero lead time |
| 730 | -- | 736 | Jose Blanchet, Michel Mandjes. Asymptotics of the area under the graph of a Lévy-driven workload process |