![](https://dblp.uni-trier.de./img/logo.320x120.png)
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
default search action
Mathematical Programming, Volume 166
Volume 166, Numbers 1-2, November 2017
- Adam Kurpisz
, Samuli Leppänen, Monaldo Mastrolilli
:
An unbounded Sum-of-Squares hierarchy integrality gap for a polynomially solvable problem. 1-17 - Ming Zhao, Kai Huang, Bo Zeng:
A polyhedral study on chance constrained program with random right-hand side. 19-64 - Sergey A. Timoshin
:
Existence and relaxation for subdifferential inclusions with unbounded perturbation. 65-85 - Javier Peña
, Negar Soheili:
Solving Conic Systems via Projection and Rescaling. 87-111 - Sho Suda, Hajime Tanaka
, Norihide Tokushige
:
A semidefinite programming approach to a cross-intersection problem with measures. 113-130 - Dongdong Ge, Rongchuan He, Simai He
:
An improved algorithm for the L2 - Lp minimization problem. 131-158 - Immanuel M. Bomze
, Jianqiang Cheng, Peter J. C. Dickinson, Abdel Lisser
:
A fresh CP look at mixed-binary QPs: new formulations and relaxations. 159-184 - Ante Custic
, Vladyslav Sokol, Abraham P. Punnen, Binay Bhattacharya:
The bilinear assignment problem: complexity and polynomially solvable special cases. 185-205 - Hongcheng Liu, Tao Yao
, Runze Li
, Yinyu Ye:
Folded concave penalized sparse linear regression: sparsity, statistical performance, and algorithmic theory for local solutions. 207-240 - Yiming Wang, Austin Buchanan, Sergiy Butenko:
On imposing connectivity constraints in integer programs. 241-271 - Moritz Firsching:
Realizability and inscribability for simplicial polytopes via nonlinear optimization. 273-295 - Maksim V. Dolgopolik
:
Existence of augmented Lagrange multipliers: reduction to exact penalty functions and localization principle. 297-326 - Samuel Rosat, Issmail Elhallaoui, François Soumis, Andrea Lodi:
Integral simplex using decomposition with primal cutting planes. 327-367 - Pierre Le Bodic
, George L. Nemhauser:
An abstract model for branching and its application to mixed integer programming. 369-405 - Pierre Le Bodic
, George L. Nemhauser:
Erratum to: An abstract model for branching and its application to mixed integer programming. 407
![](https://dblp.uni-trier.de./img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.