569 | -- | 574 | Elias J. Willemse, Johan W. Joubert. Splitting procedures for the Mixed Capacitated Arc Routing Problem under Time restrictions with Intermediate Facilities |
575 | -- | 577 | Xiaoxi Li, Sylvain Sorin. Uniform value for recursive games with compact action sets |
578 | -- | 586 | Chi Seng Pun, Chi Chung Siu, Hoi Ying Wong. Non-zero-sum reinsurance games subject to ambiguous correlations |
587 | -- | 591 | Ehud Lehrer, Eilon Solan, Omri N. Solan. The value functions of Markov decision processes |
592 | -- | 597 | Xiaoya Xu, Zhaotong Lian, Xin Li, Pengfei Guo. A Hotelling queue model with probabilistic service |
598 | -- | 601 | Begoña Subiza, José-Manuel Giménez-Gómez, Josep E. Peris. Folk solution for simple minimum cost spanning tree problems |
602 | -- | 606 | Ward Whitt. A Poisson limit for the departure process from a queue with many busy servers |
607 | -- | 611 | Emilio Barucci, Daniele Marazzina. Asset management, High Water Mark and flow of funds |
612 | -- | 617 | Vashist Avadhanula, Jalaj Bhandari, Vineet Goyal, Assaf Zeevi. On the tightness of an LP relaxation for rational optimization and its applications |
618 | -- | 621 | Jony Rojas Rojas, Francisco Sánchez-Sánchez. On the inverse problem for a subclass of linear, symmetric and efficient values of cooperative TU games |
622 | -- | 624 | Andreas Dellnitz. RTS-mavericks in data envelopment analysis |
625 | -- | 629 | Mark Zuckerberg. Geometric proofs for convex hull defining formulations |
630 | -- | 634 | Sushant Sachdeva, Nisheeth K. Vishnoi. The mixing time of the Dikin walk in a polytope - A simple proof |
635 | -- | 639 | Stephan Artmann, Friedrich Eisenbrand, Christoph Glanzer, Timm Oertel, Santosh Vempala, Robert Weismantel. A note on non-degenerate integer programs with small sub-determinants |
640 | -- | 644 | Vikas Vikram Singh, Oualid Jouini, Abdel Lisser. Existence of Nash equilibrium for chance-constrained games |
645 | -- | 648 | Akaki Mamageishvili, Paolo Penna. Tighter bounds on the inefficiency ratio of stable equilibria in load balancing games |
649 | -- | 654 | Rishiraj Bhattacharyya. Complexity of the Unconstrained Traveling Tournament Problem |
655 | -- | 657 | Mohan L. Chaudhry, James J. Kim. Analytically simple and computationally efficient solution to GI/Geom/1 queues involving heavy-tailed distributions |
658 | -- | 662 | Miao Zhang, Ping Chen. Mean-variance portfolio selection with regime switching under shorting prohibition |
663 | -- | 665 | Alexander Shapiro, Kerem Ugurlu. Decomposability and time consistency of risk averse multistage programs |
666 | -- | 671 | Opher Baron, Yoav Kerner. A queueing approach to a multi class M/G/1 make-to-stock with backlog |
672 | -- | 675 | Matteo Brunelli. On the conjoint estimation of inconsistency and intransitivity of pairwise comparisons |
676 | -- | 679 | Martin Skutella. A 2.542-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective |
680 | -- | 686 | Justina Gianatti, Laura S. Aragone, Pablo A. Lotito, Lisandro A. Parente. Solving minimax control problems via nonsmooth optimization |
687 | -- | 691 | Jia Liu, Abdel Lisser, Zhiping Chen. Stochastic geometric optimization with joint probabilistic constraints |
692 | -- | 695 | Jung Woo Baek, Ho Woo Lee, Soohan Ahn, Yun Han Bae. Exact time-dependent solutions for the M/D/1 queue |