The DOI matches its Crossref record.
Optimization Theory of Large Systems
Abstract
Important text examines most significant algorithms for optimizing large systems and clarifying relations between optimization procedures. Much data appear as charts and graphs and will be highly valuable to readers in selecting a method and estimating computer time and cost in problem-solving. Initial chapter on linear and nonlinear programming presents all necessary background for subjects covered in rest of book. Second chapter illustrates how large-scale mathematical programs arise from real-world problems. Appendixes. List of Symbols.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Boyd, S. (2010) · now publishers, Inc. eBooks · doi:10.1561/9781601984616 · Cited by 12,677
Future paths for integer programming and links to artificial intelligence
Glover, F. (1986) · Computers & Operations Research · doi:10.1016/0305-0548(86)90048-1 · Cited by 4,181
Parikh, N., & Boyd, S. (2014) · Foundations and Trends® in Optimization · doi:10.1561/2400000003 · Cited by 4,102
Branch-and-price: column generation for solving huge integer programs
Barnhart, C., Johnson, E. L., Nemhauser, G. L., Savelsbergh, M. W. P., & Vance, P. H. (1998) · Operations Research · doi:10.1287/opre.46.3.316 · Cited by 2,219
A tutorial on decomposition methods for network utility maximization
Palomar, D. P., & Chiang, M. (2006) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2006.879350 · Cited by 1,647
Validation of subgradient optimization
Held, M., Wolfe, P., & Crowder, H. P. (1974) · Mathematical Programming · doi:10.1007/bf01580223 · Cited by 1,362
K-Means-Type Algorithms: A Generalized Convergence Theorem and Characterization of Local Optimality
Selim, S. Z., & Ismail, M. A. (1984) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1984.4767478 · Cited by 1,212
Multidisciplinary Design Optimization: A Survey of Architectures
Martins, J. R. R. A., & Lambe, A. B. (2013) · AIAA Journal · doi:10.2514/1.j051895 · Cited by 1,111
Selected Topics in Column Generation
Lübbecke, M. E., & Desrosiers, J. (2005) · Operations Research · doi:10.1287/opre.1050.0234 · Cited by 1,102
Multidisciplinary aerospace design optimization: survey of recent developments
Sobieszczanski-Sobieski, J., & Haftka, R. T. (1997) · Structural Optimization · doi:10.1007/bf01197554 · Cited by 1,052
Routing and scheduling of vehicles and crews
Raff, S. (1983) · Computers & Operations Research · doi:10.1016/0305-0548(83)90030-8 · Cited by 867
Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
Magnanti, T. L., & Wong, R. T. (1981) · Operations Research · doi:10.1287/opre.29.3.464 · Cited by 731
Optimization Concepts and Applications in Engineering
Belegundu, A. D., & Chandrupatla, T. R. (2011) · Cambridge University Press eBooks · doi:10.1017/cbo9780511975905 · Cited by 555
Principles of optimal design-modeling and computation
(1989) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(89)90173-0 · Cited by 544
Tseng, P. (1991) · SIAM Journal on Control and Optimization · doi:10.1137/0329006 · Cited by 467
Trajectory planning for Bertha — A local, continuous method
Ziegler, J., Bender, P., Dang, T., & Stiller, C. (2014) · 2014 IEEE Intelligent Vehicles Symposium Proceedings · doi:10.1109/ivs.2014.6856581 · Cited by 443
A New Method for Unit Commitment at Electricite De France
Merlin, A., & Sandrin, P. (1983) · IEEE Transactions on Power Apparatus and Systems · doi:10.1109/tpas.1983.318063 · Cited by 419
Multidisciplinary aerospace design optimization - Survey of recent developments
Sobieszczanski-Sobieski, J., & Haftka, R. (1996) · 34th Aerospace Sciences Meeting and Exhibit · doi:10.2514/6.1996-711 · Cited by 417
A proximal-based decomposition method for convex minimization problems
Chen, G., & Teboulle, M. (1994) · Mathematical Programming · doi:10.1007/bf01582566 · Cited by 392
Chapter 2 Time constrained routing and scheduling
Desrosiers, J., Dumas, Y., Solomon, M. M., & Soumis, F. (1995) · Handbooks in Operations Research and Management Science · doi:10.1016/s0927-0507(05)80106-9 · Cited by 374
Desrosiers, J., & Lübbecke, M. E. (2006) · Column Generation · doi:10.1007/0-387-25486-2_1 · Cited by 363
A modification of karmarkar's linear programming algorithm
Vanderbei, R. J., Meketon, M. S., & Freedman, B. A. (1986) · Algorithmica · doi:10.1007/bf01840454 · Cited by 357
Integer Programming Algorithms: A Framework and State-of-the-Art Survey
Geoffrion, A. M., & Marsten, R. E. (1972) · Management Science · doi:10.1287/mnsc.18.9.465 · Cited by 350
Bertsekas, D. P. (1976) · Automatica · doi:10.1016/0005-1098(76)90077-7 · Cited by 347
MIMO Transceiver Design via Majorization Theory
Palomar, D. P., & Jiang, Y. (2007) · Foundations and Trends in Communications and Information Theory · doi:10.1561/0100000018 · Cited by 320
Tosserams, S., Etman, L. F. P., Papalambros, P. Y., & Rooda, J. E. (2006) · Structural and Multidisciplinary Optimization · doi:10.1007/s00158-005-0579-0 · Cited by 312
Alternative Distributed Algorithms for Network Utility Maximization: Framework and Applications
Palomar, D. P., & Chiang, M. (2007) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2007.910665 · Cited by 294
Joung, J., & Sayed, A. H. (2010) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2009.2038668 · Cited by 292
Relaxations of Weakly Coupled Stochastic Dynamic Programs
Adelman, D., & Mersereau, A. J. (2008) · Operations Research · doi:10.1287/opre.1070.0445 · Cited by 198
Three Methods for Optimizing the Capacities of an Electrical Transmission Network
Balducchi, J. F., Cohen, G., Dodu, J. C., Hertz, A., Goursat, M., Quadrat, J. P., & Viot, M. (1981) · IFAC Proceedings Volumes · doi:10.1016/s1474-6670(17)63908-9 · Cited by 1
Metadata
- Authors
- Lasdon, L. S., & Tabak, D.
- Venue
- IEEE Transactions on Systems, Man, and Cybernetics
- Published
- 1971-07
- Volume
- SMC-1
- Issue
- 3
- Pages
- 300-301
- ISSN
- 0018-9472 (ISSN-L)
- 2168-2909
- OpenAlex
- W1481747975
- Cited by
- 1,677
- References
- 0
- FWCI
- 30.90
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.