default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 97
Volume 97, Numbers 1-2, July 2003
- Jørgen Tind:
Preface. 1 - Susanne Albers:
Online algorithms: a survey. 3-26 - Kurt M. Anstreicher:
Recent advances in the solution of quadratic assignment problems. 27-42 - Sanjeev Arora:
Approximation schemes for NP-hard geometric optimization problems: a survey. 43-69 - Francis Clarke:
Necessary conditions in optimal control: a new approach. 71-89 - David L. Applegate, Robert E. Bixby, Vasek Chvátal, William J. Cook:
Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems. 91-153 - Adrian S. Lewis:
The mathematics of eigenvalue optimization. 155-176 - Zhi-Quan Luo:
Applications of convex optimization in signal processing and digital communication. 177-207 - Renato D. C. Monteiro:
First- and second-order methods for semidefinite programming. 209-244 - Stephen M. Robinson:
Variational conditions with smooth constraints: structure and analysis. 245-265 - Mikael Rönnqvist:
Optimization in forestry. 267-284 - Rüdiger Schultz:
Stochastic programming with integer variables. 285-309 - Peter W. Shor:
Capacities of quantum channels and how to find them. 311-335 - Miklós Simonovits:
How to compute the volume in high dimension? 337-374 - Daniel A. Spielman, Shang-Hua Teng:
Smoothed analysis of termination of linear programming algorithms. 375-404 - Maria Chudnovsky, Neil Robertson, Paul D. Seymour, Robin Thomas:
Progress on perfect graphs. 405-422 - Laurence A. Wolsey:
Strong formulations for mixed integer programs: valid inequalities and extended formulations. 423-447
Volume 97, Number 3, August 2003
- Hiroshi Konno, Takashi Tsuchiya:
Preface. 449-450 - David Avis, Jun Umemoto:
Stronger linear programming relaxations of max-cut. 451-469 - Leonid Faybusovich, Takashi Tsuchiya:
Primal-dual algorithms and infinite-dimensional Jordan algebras of finite rank. 471-493 - Donald Goldfarb, Garud Iyengar:
Robust convex quadratically constrained programs. 495-515 - Atsuko Ikegami, Akira Niwa:
A subproblem-centric model and approach to the nurse scheduling problem. 517-541 - Shinji Imahori, Mutsunori Yagiura, Toshihide Ibaraki:
Local search algorithms for the rectangle packing problem with general spatial costs. 543-569 - Hiroshi Konno, Rei Yamamoto:
Minimal concave cost rebalance of a portfolio to the efficient frontier. 571-585 - Zhi-Quan Luo, Jun Lu:
On blind source separation using mutual information criterion. 587-603 - M. J. D. Powell:
On trust region methods for unconstrained minimization without derivatives. 605-623
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-04 22:09 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:
