default search action
Mathematical Programming, Volume 128
Volume 128, Numbers 1-2, June 2011
- Xiaojun Chen
, Shuhuang Xiang
Implicit solution function of P0 and Z matrix linear complementarity constraints. 1-18 - Ricardo Fukasawa
On the exact separation of mixed integer knapsack cuts. 19-41 - Júlia Pap:
Recognizing conic TDI systems is hard. 43-48 - Juan Pablo Vielma, George L. Nemhauser:
Modeling disjunctive constraints with a logarithmic number of binary variables and constraints. 49-72 - Lifeng Chen, Donald Goldfarb:
An interior-point piecewise linear penalty method for nonlinear programming. 73-122 - Luis Eduardo Neves Gouveia
Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs. 123-148 - Shabbir Ahmed
Maximizing a class of submodular utility functions. 149-169 - Wenhui Zhao, Marc E. Posner:
A large class of facets for the K-median polytope. 171-203 - Matteo Fischetti, Andrea Lodi, Andrea Tramontani:
On the separation of disjunctive cuts. 205-230 - Martin K. Bernauer, Roland Griesse:
A robustification approach in unconstrained quadratic optimization. 231-252 - Wenbao Ai, Yongwei Huang
New results on Hermitian matrix rank-one decomposition. 253-283 - Catarina P. Avelino
Combining and scaling descent and negative curvature directions. 285-319 - Shiqian Ma, Donald Goldfarb, Lifeng Chen:
Fixed point and Bregman iterative methods for matrix rank minimization. 321-353 - André Berger, Vincenzo Bonifaci
Budgeted matching and budgeted matroid intersection via the gasoline puzzle. 355-372 - Justo Puerto
On the structure of the solution set for the single facility location problem with average distances. 373-401 - Miroslav Karamanov, Gérard Cornuéjols:
Branching on general disjunctions. 403-436 - Daniele Depetrini, Marco Locatelli
Approximation of linear fractional-multiplicative problems. 437-443
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 2024-12-26 00:56 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: