default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 42
Volume 42, Numbers 1-3, April 1988
- William R. Pulleyblank:
Editorial. 1 - M. J. D. Powell:
Martin Beale memorial symposium. 3 - George B. Dantzig, Patrick H. McAllister, John C. Stone:
Formulating an objective for an economy. 11-32 - Kenneth C. Bowen:
A mathematician's journey through operational research. 33-40 - Peter J. Green:
Regression, curvature and weighted least squares. 41-51 - Brian D. Ripley:
Uses and abuses of statistical simulation. 53-68 - John A. Tomlin:
Special ordered sets and an application to gas supply operations planning. 69-84 - Alex Orden:
Model assessment objectives in or. 85-97 - B. R. R. Butler:
Applications of or in the oil industry. 99-112 - Laureano F. Escudero
:
S3 sets. An extension of the Beale-Tomlin special ordered sets. 113-123 - Tomas Gal, Hermann-Josef Kruse, Peter Zörnig:
Survey of solved and open problems in the degeneracy phenomenon. 125-133 - Bob Hattersley, Julia Wilson:
A dual approach to primal degeneracy. 135-145 - David Kennedy:
Some branch and bound techniques for nonlinear optimization. 147-157 - Bjørn Nygreen:
European assembly constituencies for wales - comparing of methods for solving a political districting problem. 159-169 - M. J. D. Powell:
An algorithm for maximizing entropy subject to simple bounds. 171-180 - Barbara M. Smith:
Impacs - A bus crew scheduling system using integer programming. 181-187 - J. Sullivan:
The application of Mathematical Programming methods to oil and gas field development planning. 189-200 - Dimitri P. Bertsekas, Jonathan Eckstein:
Dual coordinate step methods for linear network flow problems. 203-243 - Arie de Bruin, Alexander H. G. Rinnooy Kan, Harry W. J. M. Trienekens:
A simulation tool for the performance evaluation of parallel branch and bound algorithms. 245-271 - Richard H. Byrd, Robert B. Schnabel, Gerald A. Shultz:
Parallel quasi-Newton methods for unconstrained optimization. 273-306 - Yair Censor:
Parallel application of block-iterative methods in medical imaging and radiation therapy. 307-325 - Rong-Jaye Chen, Robert R. Meyer:
Parallel optimization for traffic assignment. 327-345 - Renato De Leone, Olvi L. Mangasarian:
Asynchronous parallel successive overrelaxation for the symmetric linear complementarity problem. 347-361 - H. Fischer, Klaus Ritter:
An asynchronous parallel newton method. 363-374 - Lucio Grandinetti, Domenico Conforti:
Numerical comparisons of nonlinear programming algorithms on serial and vector processors using automatic differentiation. 375-389 - James K. Ho, Tak C. Lee, R. P. Sundarraj:
Decomposition of linear programs using parallel computation. 391-405 - Jong-Shi Pang, Jiann-Min Yang:
Parallel Newton methods for the nonlinear complementarity problem. 407-420 - Andrew T. Phillips, J. Ben Rosen:
A parallel algorithm for constrained concave quadratic global minimization. 421-448 - Stavros A. Zenios, John M. Mulvey:
Vectorization and multitasking of nonlinear network programming algorithms. 449-470 - Carl Brezovec, Gérard Cornuéjols, Fred W. Glover:
A matroid algorithm and its application to the efficient solution of two optimization problems on graphs. 471-487 - András Frank, Éva Tardos:
Generalized polymatroids and submodular flows. 489-563 - Satoru Fujishige:
Optimization over the polyhedron determined by a submodular function on a co-intersecting family. 565-577 - Liqun Qi:
Directed submodularity, ditroids and directed submodular flows. 579-599
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 2026-07-15 00:52 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
