Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 90
Volume 90, Number 1, March 2001
- Krzysztof C. Kiwiel:
Convergence and efficiency of subgradient methods for quasiconvex minimization. 1-25 - David Avis, Antoine Deza:
On the solitaire cone and its relationship to multi-commodity flows. 27-57 - Michael J. Todd, Levent Tunçel, Yinyu Ye:
Characterizations, bounds, and probabilistic analysis of two complexity measures for linear programming problems. 59-69 - Stephen J. Wright:
On the convergence of the Newton/log-barrier method. 71-100 - Yinyu Ye:
A .699-approximation algorithm for Max-Bisection. 101-111 - Garth P. McCormick, Christoph Witzgall:
Logarithmic SUMT limits in convex programming. 113-145 - Pierre Chardaire:
The core and nucleolus of games: A note on a paper by Göthe-Lundgren et al. 147-151 - K. A. Ariyawansa, William C. Davidon, K. D. McKennon:
On a characterization of convexity-preserving maps, Davidon's collinear scalings and Karmarkar's projective transformations. 153-168 - Reha H. Tütüncü:
Quadratic convergence of potential-reduction methods for degenerate problems. 169-203
Volume 90, Number 2, April 2001
- Jos F. Sturm, Shuzhong Zhang:
On sensitivity of central solutions in semidefinite programming. 205-227 - E. Alper Yildirim
, Michael J. Todd:
Sensitivity analysis in linear programming and semidefinite programming using interior-point methods. 229-261 - Igor Averbakh:
On the complexity of a class of combinatorial optimization problems with uncertainty. 263-272 - Anna Galluccio, Martin Loebl, Jan Vondrák:
Optimization via enumeration: a new algorithm for the Max Cut Problem. 273-290 - Angel Corberán, Adam N. Letchford, José María Sanchis:
A cutting plane algorithm for the General Routing Problem. 291-316 - James V. Burke, Michael L. Overton:
Variational analysis of non-Lipschitz spectral functions. 317-351 - Satoru Iwata, Kazuo Murota:
Combinatorial relaxation algorithm for mixed polynomial matrices. 353-371 - Stéphane Alarie, Charles Audet, Brigitte Jaumard, Gilles Savard:
Concavity cuts for disjoint bilinear programming. 373-398
Volume 90, Number 3, May 2001
- Claude Lemaréchal, Arnaud Renaud:
A geometric study of duality gaps, with applications. 399-427 - Oktay Günlük, Yves Pochet:
Mixing mixed-integer inequalities. 429-457 - Stephen J. Wright:
On reduced convex QP formulations of monotone LCPs. 459-473 - Norbert Ascheuer, Matteo Fischetti, Martin Grötschel:
Solving the Asymmetric Travelling Salesman Problem with time windows by branch-and-cut. 475-506 - Gongyun Zhao:
A Log-Barrier method with Benders decomposition for solving two-stage stochastic linear programs. 507-536 - Eduardo Uchoa, Marcus Poggi de Aragão:
Vertex-Disjoint Packing of Two Steiner Trees: polyhedra and branch-and-cut. 537-557 - Yehuda Vardi, Cun-Hui Zhang:
A modified Weiszfeld algorithm for the Fermat-Weber location problem. 559-566
a service of 
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-04-22 21:02 CEST 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:
