197 | -- | 200 | Qiao Wang, Cheng Lu 0007, Zhibin Deng, Jichang Dong. A simplified completely positive reformulation for binary quadratic programs |
201 | -- | 205 | Lukasz Kruk. Instability of LRTF multiclass queueing networks |
206 | -- | 211 | Jun Deng, Hua Zong, Yun Wang. Static replication of impermanent loss for concentrated liquidity provision in decentralised markets |
212 | -- | 219 | Pieter Jacob Storm, Sem C. Borst. Diffusion-level universality of many-server systems with concurrent service |
220 | -- | 225 | Marten Maack. Online load balancing on uniform machines with limited migration |
226 | -- | 233 | Zhi Chen, Daniel Kuhn, Wolfram Wiesemann. On approximations of data-driven chance constrained programs over Wasserstein balls |
234 | -- | 241 | Maxence Delorme, David F. Manlove, Tom Smeets. Half-cycle: A new formulation for modelling kidney exchange problems |
242 | -- | 247 | Matteo Lapucci, Pierluigi Mansueto. Improved front steepest descent for multi-objective optimization |
248 | -- | 254 | Özden Engin Çakici, Itir Z. Karaesmen. Bidding to procure supply in newsvendor networks |
255 | -- | 258 | Martin Skutella. A note on the quickest minimum cost transshipment problem |
259 | -- | 265 | Francesco Giordano. A note on social learning in non-atomic routing games |
266 | -- | 269 | Alexandros A. Voudouris. Tight distortion bounds for distributed metric voting on a line |
270 | -- | 277 | Victor Cohen, Axel Parmentier. Future memories are not needed for large classes of POMDPs |
278 | -- | 284 | Rubono Setiawan, Salmah, Irwan Endrayanto, Indarsih. n-person noncooperative supermodular multiobjective games |
285 | -- | 288 | Dirk Briskorn, Gerhard J. Woeginger. Hardness of flow time minimization in a crossdock with a single door and asymmetric handover relations |
289 | -- | 295 | Logan Grout, Joseph Cheriyan, Bundit Laekhanukit. On a partition LP relaxation for min-cost 2-node connected spanning subgraphs |
296 | -- | 303 | Qingwei Jin, Yi Wu, Yinlian Zeng, Lianmin Zhang. Population monotonic allocation schemes for the two-period economic lot-sizing games |
304 | -- | 307 | Homa Hosseinzadeh Ranjbar, Mehdi Feizi. Random assignments with uniform preferences: An impossibility result |
308 | -- | 311 | Yiwei Wang, Nian Yang. Asymptotics for the survival probability of time-inhomogeneous diffusion processes |
312 | -- | 314 | Tinghan Ye, David B. Shmoys. A min-max theorem for the minimum fleet-size problem |
315 | -- | 321 | Tian Xia, Jia Liu, Abdel Lisser. Distributionally robust chance constrained games under Wasserstein ball |
322 | -- | 325 | Lonnie Turpin. Service staffing with delay probabilities |
326 | -- | 331 | David Van Bulck, Dries R. Goossens. First-break-heuristically-schedule: Constructing highly-constrained sports timetables |
332 | -- | 337 | Bernardo Freitas Paulo da Costa, Vincent Leclère. Dual SDDP for risk-averse multistage stochastic programs |
338 | -- | 345 | Sripad K. Devalkar, Ganesh Janakiraman, Sridhar Seshadri. Dual sourcing systems: An asymptotic result for the cost of optimal tailored base-surge (TBS) policy |
346 | -- | 352 | Dan Pirjol, Lingjiong Zhu. Asymptotics for the Laplace transform of the time integral of the geometric Brownian motion |
353 | -- | 356 | Orestes Bueno, John Edwin Cotrina, Yboon García. Generalized ordinal Nash games: Variational approach |
357 | -- | 363 | Jong Gwang Kim. A new Lagrangian-based first-order method for nonconvex constrained optimization |
364 | -- | 369 | Katsuhisa Ouchi, Hiroyuki Masuyama. A geometric convergence formula for the level-increment-truncation approximation of M/G/1-type Markov chains |
370 | -- | 377 | Shimai Su, Elena M. Parilina. Can partial cooperation between developed and developing countries be stable? |