### MP - 2022 - volume 192 论文列表

###### Volume 192, Number 1, March 2022
Weighted Triangle-free 2-matching Problem with Edge-disjoint Forbidden Triangles. Graph coloring with decision diagrams. Stochastic makespan minimization in structured set systems. Popular branchings and their dual certificates. Extended formulations for stable set polytopes of graphs without two disjoint odd cycles. Sparse representation of vectors in lattices and semigroups. A fast $(2 + \frac{2}{7})$-approximation algorithm for capacitated cycle covering. Single source unsplittable flows with arc-wise lower and upper bounds. Tight approximation bounds for maximum multi-coverage. Flexible Graph Connectivity. Persistency of linear programming relaxations for the stable set problem. Packing under convex quadratic constraints. Fair colorful k-center clustering. About the complexity of two-stage stochastic IPs. Constructing lattice-free gradient polyhedra in dimension two. The integrality number of an integer program. Maximal quadratic-free sets. Continuous facility location on graphs. Algorithms for flows over time with scheduling costs. On a generalization of the Chvátal-Gomory closure. Sparse graphs and an augmentation problem. On generalized surrogate duality in mixed-integer nonlinear programming. Ideal formulations for constrained convex optimization problems with indicator variables. Correction to: Idealness of k-wise intersecting families. Idealness of k-wise intersecting families. A technique for obtaining true approximations for k-center with covering constraints. Special Issue: Integer Programming and Combinatorial Optimization (IPCO) 2020.