On integrality ratios for asymmetric TSP in the Sherali–Adams hierarchy

JOURNAL ARTICLE published September 2016 in Mathematical Programming

Authors: Joseph Cheriyan | Zhihan Gao | Konstantinos Georgiou | Sahil Singla

Editorial policy

JOURNAL ARTICLE published December 1975 in Mathematical Programming

Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem

JOURNAL ARTICLE published November 2018 in Mathematical Programming

Authors: Mourad Baïou | Francisco Barahona

JOURNAL ARTICLE published 1995 in Mathematical Programming

On extremal points of quasiconvex functions

JOURNAL ARTICLE published September 1985 in Mathematical Programming

Authors: P. Dombi

Disjunctive programming and relaxations of polyhedra

JOURNAL ARTICLE published April 2014 in Mathematical Programming

Authors: Michele Conforti | Alberto Del Pia

Hamiltonian path and symmetric travelling salesman polytopes

JOURNAL ARTICLE published January 1993 in Mathematical Programming

Authors: Maurice Queyranne | Yaoguang Wang

JOURNAL ARTICLE published 1995 in Mathematical Programming

Online submodular maximization: beating 1/2 made simple

JOURNAL ARTICLE published September 2020 in Mathematical Programming

Research funded by Israel Science Foundation (2233/19) | United States - Israel Binational Science Foundation (2018352) | Israel Science Foundation (1357/16,1337/16)

Authors: Niv Buchbinder | Moran Feldman | Yuval Filmus | Mohit Garg

Linear convergence of an alternating polar decomposition method for low rank orthogonal tensor approximations

JOURNAL ARTICLE published May 2023 in Mathematical Programming

Research funded by National Key Research and Development Program (2018YFA0306702,2020YFA0712300) | National Natural Science Foundation of China (11771328) | Natural Science Foundation of Zhejiang Province (LD19A010002) | National Natural Science Foundation of China (11801548,11688101) | CAS Project for Young Scientists in Basic Research (YSBR-008)

Authors: Shenglong Hu | Ke Ye

Beyond symmetry: best submatrix selection for the sparse truncated SVD

JOURNAL ARTICLE published 21 December 2023 in Mathematical Programming

Research funded by Directorate for Engineering (2246414) | Directorate for Computer and Information Science and Engineering (2246417)

Authors: Yongchun Li | Weijun Xie

The bilinear assignment problem: complexity and polynomially solvable special cases

JOURNAL ARTICLE published November 2017 in Mathematical Programming

Authors: Ante Ćustić | Vladyslav Sokol | Abraham P. Punnen | Binay Bhattacharya

Exact formulas for the proximal/regular/limiting normal cone of the second-order cone complementarity set

JOURNAL ARTICLE published March 2017 in Mathematical Programming

Authors: Jane J. Ye | Jinchuan Zhou

Improved complexities of conditional gradient-type methods with applications to robust matrix recovery problems

JOURNAL ARTICLE published March 2021 in Mathematical Programming

Authors: Dan Garber | Atara Kaplan | Shoham Sabach

Aggregation bounds in stochastic linear programming

JOURNAL ARTICLE published January 1985 in Mathematical Programming

Authors: John R. Birge

A Lagrange–Newton algorithm for sparse nonlinear programming

JOURNAL ARTICLE published September 2022 in Mathematical Programming

Research funded by National Natural Science Foundation of China (11771038,11971052) | Natural Science Foundation of Beijing Municipality (Z190002) | National Natural Science Foundation of China (12011530155)

Authors: Chen Zhao | Naihua Xiu | Houduo Qi | Ziyan Luo

JOURNAL ARTICLE published 1997 in Mathematical Programming

The Mathematical Programming Society

JOURNAL ARTICLE published December 1979 in Mathematical Programming

The Mathematical Programming Society

JOURNAL ARTICLE published December 1979 in Mathematical Programming

JOURNAL ARTICLE published 1998 in Mathematical Programming