Journal: Math. Program.

Volume 166, Issue 1-2

1 -- 17Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli. An unbounded Sum-of-Squares hierarchy integrality gap for a polynomially solvable problem
19 -- 64Ming Zhao, Kai Huang, Bo Zeng. A polyhedral study on chance constrained program with random right-hand side
65 -- 85Sergey A. Timoshin. Existence and relaxation for subdifferential inclusions with unbounded perturbation
87 -- 111Javier Peña, Negar Soheili. Solving Conic Systems via Projection and Rescaling
113 -- 130Sho Suda, Hajime Tanaka, Norihide Tokushige. A semidefinite programming approach to a cross-intersection problem with measures
131 -- 158Dongdong Ge, Rongchuan He, Simai He. p minimization problem
159 -- 184Immanuel M. Bomze, Jianqiang Cheng, Peter J. C. Dickinson, Abdel Lisser. A fresh CP look at mixed-binary QPs: new formulations and relaxations
185 -- 205Ante Custic, Vladyslav Sokol, Abraham P. Punnen, Binay Bhattacharya. The bilinear assignment problem: complexity and polynomially solvable special cases
207 -- 240Hongcheng Liu, Tao Yao, Runze Li, Yinyu Ye. Folded concave penalized sparse linear regression: sparsity, statistical performance, and algorithmic theory for local solutions
241 -- 271Yiming Wang, Austin Buchanan, Sergiy Butenko. On imposing connectivity constraints in integer programs
273 -- 295Moritz Firsching. Realizability and inscribability for simplicial polytopes via nonlinear optimization
297 -- 326Maksim V. Dolgopolik. Existence of augmented Lagrange multipliers: reduction to exact penalty functions and localization principle
327 -- 367Samuel Rosat, Issmail Elhallaoui, François Soumis, Andrea Lodi 0001. Integral simplex using decomposition with primal cutting planes
369 -- 405Pierre Le Bodic, George L. Nemhauser. An abstract model for branching and its application to mixed integer programming
407 -- 0Pierre Le Bodic, George L. Nemhauser. Erratum to: An abstract model for branching and its application to mixed integer programming