default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 115
Volume 115, Number 1, September 2008
- Nobuo Yamashita:
Sparse quasi-Newton updates with positive definite matrix completion. 1-30 - Immanuel M. Bomze
, Marco Locatelli, Fabio Tardella:
New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability. 31-64 - Daya Ram Gaur, Ramesh Krishnamurti, Rajeev Kohli:
The capacitated max k -cut problem. 65-72 - Ming Zhao, Ismael R. de Farias Jr.:
The mixing-MIR set with divisible capacities. 73-103 - Renato D. C. Monteiro, Takashi Tsuchiya:
A strong bound on the integral of the central path curvature and its relationship with the iteration-complexity of primal-dual path-following LP algorithms. 105-149 - Gideon Weiss:
A simplex based algorithm to solve separated continuous linear programs. 151-198
Volume 115, Number 2, October 2008
- Paul Armand, Joël Benoist:
A local convergence property of primal-dual methods for nonlinear programming. 199-222 - Kenjiro Takazawa:
A weighted even factor algorithm. 223-237 - Chek Beng Chua:
Analyticity of weighted central paths and error bounds for semidefinite programming. 239-271 - Jesús A. De Loera, Raymond Hemmecke, Matthias Köppe, Robert Weismantel:
FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension. 273-290 - Gianpaolo Oriolo, Gautier Stauffer:
Clique-circulants and the stable set polytope of fuzzy circular interval graphs. 291-317 - Haw-ren Fang, Dianne P. O'Leary:
Modified Cholesky algorithms: a catalog with new approaches. 319-349 - Roberto Baldacci, Nicos Christofides, Aristide Mingozzi:
An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts. 351-385 - Sanjeeb Dash, Oktay Günlük:
On the strength of Gomory mixed-integer cuts as group cuts. 387-407
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.
last updated on 2025-12-09 23:26 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
