Encyclopedia of Optimization 2009

A

• Emilio Spedicato:
  ABS Algorithms for Linear Equations and Linear Least Squares. 1-7
  
• Emilio Spedicato, Zunquan Xia, Liwei Zhang:
  ABS Algorithms for Optimization. 7-13
  
• Oliver Stein:
  Adaptive Convexification in Semi-Infinite Optimization. 13-19
  
• James M. Calvin:
  Adaptive Global Search. 19-21
  
• Ruth Pachter, Zhiqiang Wang:
  Adaptive Simulated Annealing and its Application to Protein Folding. 21-26
  
• Leonidas S. Pitsoulis:
  Affine Sets and Functions. 26
  
• Gang Yu, Benjamin G. Thengvall:
  Airline Optimization. 26-30
  
• Tibor Csendes:
  Algorithmic Improvements Using a Heuristic Parameter, Reject Index for Interval Optimization. 30-33
  
• Eva K. Lee, Kapil Gupta:
  Algorithms for Genomic Analysis. 33-54
  
• Claude G. Diderich, Marc Gengler:
  Alignment Problem. 54-61
  
• Petr Vopenka, Katerina Trlifajová:
  Alternative Set Theory. 73-77
  
• Riho Lepp:
  Approximation of Extremum Problems with Probability Functionals. 77-83
  
• Tamás Szántai:
  Approximation of Multivariate Probability Integrals. 83-90
  
• Melvyn Sim:
  Approximations to Robust Conic Optimization Problems. 90-96
  
• Petros Xanthopoulos:
  Archimedes and the Foundations of Industrial Engineering. 96-98
  
• Kosmidou Kyriaki, Constantin Zopounidis:
  Asset Liability Management Decision Support System. 98-106
  
• Dimitris Alevras:
  Assignment and Matching. 106-108
  
• L. J. Hubert, Phipps Arabie:
  Assignment Methods in Clustering. 108-114
  
• Pavlo A. Krokhmal:
  Asymptotic Properties of Random Multidimensional Assignment Problem. 114-123
  
• Ioannis P. Androulakis:
  Asynchronous Distributed Optimization Algorithms. 123-128
  
• Dimitri P. Bertsekas:
  Auction Algorithms. 128-132
  
• Laurence C. Dixon:
  Automatic Differentiation: Calculation of Newton Steps. 137-142
  
• Laurence C. Dixon:
  Automatic Differentiation: Calculation of the Hessian. 133-137
  
• Dan Kalman:
  Automatic Differentiation: Geometry of Satellites and Tracking Stations. 142-153
  
• Masao Iri, Koichi Kubota:
  Automatic Differentiation: Introduction, History and Rounding Error Estimation. 153-159
  
• Christian H. Bischof, Paul D. Hovland:
  Automatic Differentiation: Parallel Computation. 159-165
  
• Louis B. Rall, George F. Corliss:
  Automatic Differentiation: Point and Interval. 165-170
  
• James B. Walters, George F. Corliss:
  Automatic Differentiation: Point and Interval Taylor Operators. 170-176
  
• Herbert Fischer:
  Automatic Differentiation: Root Problem and Branch Problem. 176-181
  

B

• Jonas Mockus:
  Bayesian Global Optimization. 183-187
  
• Alla R. Kammerdiner:
  Bayesian Networks. 187-196
  
• Allen Holder:
  Beam Selection in Radiotherapy Treatment Design. 196-202
  
• Hossein Mohebi:
  Best Approximation in Ordered Normed Linear Spaces. 202-218
  
• Jacques Teghem:
  Bi-Objective Assignment Problem. 288-293
  
• Herminia I. Calvete, Carmen Galé:
  Bilevel Fractional Programming. 218-221
  
• Jonathan F. Bard:
  Bilevel Linear Programming. 221-224
  
• Jonathan F. Bard:
  Bilevel Linear Programming: Complexity, Equivalence to Minmax, Concave Programs. 225-228
  
• Marianthi G. Ierapetritou:
  Bilevel Optimization: Feasibility Test and Flexibility Index. 228-239
  
• Patrice Marcotte, Gilles Savard:
  Bilevel Programming. 239-241
  
• Patrice Marcotte, Gilles Savard:
  Bilevel Programming: Applications. 241-243
  
• Zeynep H. Gümüs, Kemal Sahin, Amy Ciric:
  Bilevel Programming: Applications in Engineering. 243-248
  
• Viswanathan Visweswaran:
  Bilevel Programming: Global Optimization. 255-260
  
• Stephan Dempe:
  Bilevel Programming: Implicit Function Approach. 260-266
  
• Luís N. Vicente:
  Bilevel Programming: Introduction, History and Overview. 266-269
  
• Sanjo Zlobec:
  Bilevel Programming: Optimality Conditions and Duality. 274-279
  
• Efstratios N. Pistikopoulos, Nuno P. Faísca, Pedro M. Saraiva, Berç Rustem:
  Bilevel Programming Framework for Enterprise-Wide Process Networks Under Uncertainty. 248-255
  
• Jonathan F. Bard:
  Bilevel Programming in Management. 269-274
  
• Artyom G. Nahapetyan:
  Bilinear Programming. 279-282
  
• Artyom G. Nahapetyan:
  Bilinear Programming: Applications in the Supply Chain Management. 282-288
  
• Leonidas S. Pitsoulis:
  Biquadratic Assignment Problem. 293-294
  
• Graham Wood:
  Bisection Global Optimization Methods. 294-297
  
• Ladislav J. Kohout:
  Boolean and Fuzzy Relations. 297-311
  
• Alexander Zelikovsky:
  Bottleneck Steiner Tree Problems. 311-313
  
• Rein Luus:
  Boundary Condition Iteration BCI. 313-318
  
• George F. Corliss, Louis B. Rall:
  Bounding Derivative Ranges. 318-325
  
• Vivek Dua, Efstratios N. Pistikopoulos:
  Bounds and Solution Vector Estimates for Parametric NLPS. 325-328
  
• Martin W. P. Savelsbergh:
  Branch and Price: Integer Programming with Column Generation. 328-332
  
• Illya V. Hicks:
  Branchwidth and Branch Decompositions. 332-339
  
• Clayton W. Commander:
  Broadcast Scheduling Problem. 339-345
  
• Vassilios S. Vassiliadis, Raúl Conejeros:
  Broyden Family of Methods and the BFGS Update. 345-346
  

C

• Stefan Voß:
  Capacitated Minimum Spanning Trees. 347-357
  
• Gabriele E. Danninger-Uchida:
  Carathéodory Theorem. 358-359
  
• Nicolas Hadjisavvas, Panos M. Pardalos:
  Carathéodory, Constantine. 357-358
  
• Ladislav J. Kohout:
  Checklist Paradigm Semantics for Fuzzy Logics. 359-369
  
• Shabbir Ahmed, Nikolaos V. Sahinidis:
  Chemical Process Planning. 369-374
  
• Caroline N. Haddad:
  Cholesky Factorization. 374-377
  
• Richard A. Brualdi:
  Combinatorial Matrix Analysis. 377-382
  
• Naoki Katoh:
  Combinatorial Optimization Algorithms in Resource Allocation Problems. 382-387
  
• Xiaotie Deng:
  Combinatorial Optimization Games. 387-391
  
• Don A. Grundel, David Jeffcoat:
  Combinatorial Test Problems and Problem Generators. 391-394
  
• Rainer E. Burkard:
  Communication Network Assignment Problem. 394-396
  
• Tammy Drezner:
  Competitive Facility Location. 396-401
  
• Xiaotie Deng:
  Competitive Ratio for Portfolio Management. 401-405
  
• Claudio Cifarelli, Laura Di Giacomo, Giacomo Patrizi:
  Complementarity Algorithms in Pattern Recognition. 405-413
  
• Josef Kallrath:
  Complexity and Large-Scale Least Squares Problems. 435-447
  
• Harry B. Hunt III:
  Complexity Classes in Optimization. 413-419
  
• Katta G. Murty:
  Complexity of Degeneracy. 419-425
  
• Andreas Griewank:
  Complexity of Gradients, Jacobians, and Hessians. 425-435
  
• Stephen A. Vavasis:
  Complexity Theory. 447-451
  
• Stephen A. Vavasis:
  Complexity Theory: Quadratic Programming. 451-454
  
• V. Jeyakumar:
  Composite Nonsmooth Optimization. 454-457
  
• Hamilton Emmons, Sanatan Rai:
  Computational Complexity Theory. 457-462
  
• Harold P. Benson:
  Concave Programming. 462-466
  
• J. L. Nazareth:
  Conjugate-Gradient Methods. 466-470
  
• Wei Xie, Nikolaos V. Sahinidis:
  Contact Map Overlap Maximization Problem, CMO. 470-475
  
• Adil M. Bagirov:
  Continuous Approximations to Subdifferentials. 475-482
  
• János D. Pintér:
  Continuous Global Optimization: Applications. 482-486
  
• János D. Pintér:
  Continuous Global Optimization: Models, Algorithms and Software. 486-493
  
• Oliver Stein:
  Continuous Reformulations of Discrete-Continuous Optimization Problems. 493-501
  
• Ismail Capar, Burak Eksioglu:
  Continuous Review Inventory Models: (Q, R) Policy. 501-505
  
• C. T. Kelley:
  Contraction-Mapping. 505-509
  
• Rein Luus:
  Control Vector Iteration CVI. 509-513
  
• Shmuel Onn:
  Convex Discrete Optimization. 513-550
  
• Yasutoshi Yajima:
  Convex Envelopes in Optimization Problems. 550-551
  
• Claudia A. Sagastizábal:
  Convex Max-Functions. 555-558
  
• Siriphong Lawphongpanich:
  Convex-Simplex Algorithm. 558-561
  
• Sanjo Zlobec:
  Convexifiable Functions, Characterization of. 551-555
  
• Immanuel M. Bomze:
  Copositive Optimization. 561-564
  
• Stanislav Busygin:
  Copositive Programming. 564-567
  
• Michael Patriksson:
  Cost Approximation Algorithms. 567-578
  
• Constantin Zopounidis, Michael Doumpos:
  Credit Rating and Optimization Methods. 578-584
  
• Tamás Terlaky:
  Criss-Cross Pivoting Rules. 584-590
  
• Hoang Tuy:
  Cutting Plane Methods for Global Optimization. 590-594
  
• András Prékopa, Csaba I. Fábián:
  Cutting-Stock Problem. 594-595
  
• Vassilios S. Vassiliadis, Raúl Conejeros:
  Cyclic Coordinate Method. 595-596
  

D

• Hoang Tuy:
  D.C. Programming. 607-612
  
• R. De Leone:
  Data Envelopment Analysis. 597-600
  
• David L. Olson:
  Data Mining. 600-607
  
• Ho Ki Fung, Christodoulos A. Floudas:
  De Novo Protein Design Using Flexible Templates. 638-643
  
• Ho Ki Fung, Christodoulos A. Floudas:
  De Novo Protein DesignUsing Rigid Templates. 643-648
  
• Constantin Zopounidis, Michael Doumpos:
  Decision Support Systems with Multiple Criteria. 612-619
  
• Panos Parpas, Berç Rustem:
  Decomposition Algorithms for the Solution of Multistage Mean-Variance Optimization Problems. 619-627
  
• Hoang Tuy:
  Decomposition in Global Optimization. 627-630
  
• Jørgen Tind:
  Decomposition Principle of Linear Programming. 630-632
  
• Viswanathan Visweswaran:
  Decomposition Techniques for MILP: Lagrangian Relaxation. 632-638
  
• Adil M. Bagirov:
  Derivative-Free Methods for Non-smooth Optimization. 648-655
  
• Georg Ch. Pflug:
  Derivatives of Markov Processes and Their Simulation. 655-658
  
• Stan Uryasev:
  Derivatives of Probability and Integral Functions: General Theory and Examples. 658-663
  
• Georg Ch. Pflug:
  Derivatives of Probability Measures. 663-666
  
• Konstantinos I. Kouramas, Vassilis Sakizlis, Efstratios N. Pistikopoulos:
  Design of Robust Model-Based Controllers via Parametric Programming. 677-687
  
• Doyle Knight:
  Design Optimization in Computational Fluid Dynamics. 666-677
  
• Meng Piao Tan, Christodoulos A. Floudas:
  Determining the Optimal Number of Clusters. 687-694
  
• Ya-Ju Fan, Wanpracha Art Chaovalitwongse:
  Deterministic and Probabilistic Optimization Models for Data Classification. 694-702
  
• Maurizio Bruglieri, Pierluigi Maponi, Maria Cristina Recchioni, Francesco Zirilli:
  Differential Equations and Global Optimization. 702-710
  
• Vladimir F. Demyanov:
  Dini and Hadamard Derivatives in Optimization. 710-716
  
• Donald R. Jones:
  Direct Global Optimization Algorithm. 725-735
  
• Rein Luus:
  Direct Search Luus-Jaakola Optimization Procedure. 735-739
  
• Thomas Erlebach, Klaus Jansen, Christos Kaklamanis, Giuseppe Persiano:
  Directed Tree Networks. 716-725
  
• Marcel Mongeau:
  Discontinuous Optimization. 739-744
  
• Georg Ch. Pflug:
  Discrete Stochastic Optimization. 751-753
  
• Kurt Marti:
  Discretely Distributed Stochastic Programs: Descent Directions and Efficient Points. 744-751
  
• Eva K. Lee, Tsung-Lin Wu:
  Disease Diagnosis: Optimization-Based Methods. 753-784
  
• Hanif D. Sherali:
  Disjunctive Programming. 784-787
  
• R. Rajgaria, Scott R. McAllister, Christodoulos A. Floudas:
  Distance Dependent Protein Force Field via Linear Optimization. 787-792
  
• Gregory Gutin:
  Domination Analysis in Combinatorial Optimization. 792-802
  
• Henry Wolkowicz:
  Duality for Semidefinite Programming. 811-814
  
• Panos Parpas, Berç Rustem:
  Duality Gaps in Nonconvex Optimization. 802-805
  
• Sabine Pickenhain:
  Duality in Optimal Control with First Order Differential Equations. 805-811
  
• David Yang Gao:
  Duality Theory: Biduality in Nonconvex Optimization. 814-818
  
• David Yang Gao:
  Duality Theory: Monoduality in Convex Optimization. 818-822
  
• David Yang Gao:
  Duality Theory: Triduality in Global Optimization. 822-828
  
• Ernesto G. Birgin, Marcos Raydan:
  Dykstra's Algorithm and Robust Stopping Criteria. 828-833
  
• Ioannis P. Androulakis:
  Dynamic Programming: Average Cost Per Stage Problems. 833-837
  
• William R. Esposito:
  Dynamic Programming: Continuous-time Optimal Control. 844-846
  
• Ioannis P. Androulakis:
  Dynamic Programming: Discounted Problems. 846-850
  
• Ioannis P. Androulakis:
  Dynamic Programming: Infinite Horizon Problems, Overview. 850-853
  
• Ioannis P. Androulakis:
  Dynamic Programming: Inventory Control. 853-856
  
• Rein Luus:
  Dynamic Programming: Optimal Control Applications. 862-869
  
• Ioannis P. Androulakis:
  Dynamic Programming: Stochastic Shortest Path Problems. 869-873
  
• Ioannis P. Androulakis:
  Dynamic Programming: Undiscounted Problems. 873-876
  
• Joseph C. Dunn:
  Dynamic Programming and Newton's Method in Unconstrained Optimal Control. 856-862
  
• L. J. Hubert, Phipps Arabie, Jacqueline J. Meulman:
  Dynamic Programming in Clustering. 837-844
  
• Anna Nagurney:
  Dynamic Traffic Networks. 876-883
  

E

• Sandra Duni Eksioglu, Burak Eksioglu:
  Economic Lot-Sizing Problem. 883-887
  
• Henning Behnke:
  Eigenvalue Enclosures for Ordinary Differential Equations. 887-890
  
• Steffen Rebennack:
  Ellipsoid Method. 890-899
  
• Fatemeh Sayyady, Sandra Duni Eksioglu:
  Emergency Evacuation, Optimization Modeling. 899-907
  
• Shu-Cherng Fang, Jacob H.-S. Tsao:
  Entropy Optimization: Interior Point Methods. 907-912
  
• William R. Esposito, Christodoulos A. Floudas:
  Entropy Optimization: Parameter Estimation. 912-916
  
• Shu-Cherng Fang, Jacob H.-S. Tsao:
  Entropy Optimization: Shannon Measure of Entropy and its Properties. 916-921
  
• Anders Forsgren:
  Equality-Constrained Nonlinear Programming: KKT Necessary Optimality Conditions. 921-923
  
• Anna Nagurney:
  Equilibrium Networks. 923-927
  
• George Isac:
  Equivalence Between Nonlinear Complementarity Problem and Fixed Point Problem. 927-931
  
• Qing Chen, Evangelos Triantaphyllou:
  Estimating Data for Multicriteria Decision Making Problems: Optimization Techniques. 931-940
  
• J. MacGregor Smith:
  Evacuation Networks. 940-950
  
• Daniel Kobler:
  Evolutionary Algorithms in Combinatorial Optimization. 950-959
  
• Claus Still, Tapio Westerlund:
  Extended Cutting Plane Algorithm. 959-966
  
• Allen Holder:
  Extension of the Fundamental Theorem of Linear Programming. 966-969
  
• Riho Lepp:
  Extremum Problems with Probability Functions: Kernel Type Solution Methods. 969-973
  

F

• Les R. Foulds, Horst W. Hamacher:
  Facilities Layout Problems. 975-979
  
• Kaj Holmberg:
  Facility Location Problems with Spatial Interaction. 982-989
  
• Margaret L. Brandeau:
  Facility Location with Externalities. 979-982
  
• Kaj Holmberg:
  Facility Location with Staircase Costs. 989-995
  
• Kees Roos:
  Farkas Lemma. 995-998
  
• V. Jeyakumar:
  Farkas Lemma: Generalizations. 998-1001
  
• André L. Tits:
  Feasible Sequential Quadratic Programming. 1001-1005
  
• Paola Festa, Panos M. Pardalos, Mauricio G. C. Resende:
  Feedback Set Problems. 1005-1016
  
• Patrick L. Combettes:
  Fejér Monotonicity in Convex Optimization. 1016-1024
  
• Constantin Zopounidis:
  Financial Applications of Multicriteria Analysis. 1024-1035
  
• Anna Nagurney:
  Financial Equilibrium. 1035-1040
  
• John M. Mulvey, Bala Shetty:
  Financial Optimization. 1040-1047
  
• Ladislav J. Kohout:
  Finite Complete Systems of Many-valued Logic Algebras. 1047-1055
  
• Diethard Klatte:
  First Order Constraint Qualifications. 1055-1060
  
• Magdalene Marinaki:
  Flow Shop Scheduling Problem. 1060-1068
  
• Ulrike Leopold-Wildburger, Otwin Becker, Martin Kuehrer:
  Forecasting. 1068-1074
  
• Leonid Khachiyan:
  Fourier-Motzkin Elimination Method. 1074-1077
  
• Tomasz Radzik:
  Fractional Combinatorial Optimization. 1077-1080
  
• Hans Frenk, Siegfried Schaible:
  Fractional Programming. 1080-1091
  
• Oleg A. Prokopyev:
  Fractional Zero-One Programming. 1091-1094
  
• Siriphong Lawphongpanich:
  Frank-Wolfe Algorithm. 1094-1097
  
• Robert Murphey:
  Frequency Assignment Problem. 1097-1101
  
• Helmut Maier:
  Fundamental Theorem of Algebra. 1101-1102
  
• Roman Slowinski:
  Fuzzy Multi-objective Linear Programming. 1102-1112
  

G

• Zhenya Jia, Marianthi G. Ierapetritou:
  Gasoline Blending and Distribution Scheduling: An MILP Model. 1113-1127
  
• Dukwon Kim:
  Gauss, Carl Friedrich. 1127-1129
  
• William R. Esposito, Christodoulos A. Floudas:
  Gauss-Newton Method: Least Squares, Relation to Newton's Method. 1129-1134
  
• Meng Piao Tan, Christodoulos A. Floudas:
  Gene Clustering: A Novel Decomposition-Based Clustering Approach: Global Optimum Search with Enhanced Positioning. 1134-1145
  
• George A. Anastassiou:
  General Moment Optimization Problems. 1244-1252
  
• Richard W. Eglese, Adam N. Letchford:
  General Routing Problem. 1252-1254
  
• Laura Di Giacomo:
  Generalizations of Interior Point Methods for the Linear Complementarity Problem. 1145-1153
  
• O. Erhun Kundakcioglu, Saed Alizamir:
  Generalized Assignment Problem. 1153-1162
  
• Christodoulos A. Floudas:
  Generalized Benders Decomposition. 1162-1175
  
• Alberto Cambini, Laura Martein:
  Generalized Concavity in Multi-objective Optimization. 1175-1180
  
• Ignacio E. Grossmann:
  Generalized Disjunctive Programming. 1180-1183
  
• Mario R. Guarracino, Salvatore Cuciniello, Davide Feminiano:
  Generalized Eigenvalue Proximal Support Vector Machine Problem. 1183-1185
  
• Han-Lin Li, Jung-Fa Tsai:
  Generalized Geometric Programming: Mixed Continuous and Discrete Free Variables. 1185-1193
  
• Nicolas Hadjisavvas, Siegfried Schaible:
  Generalized Monotone Multivalued Maps. 1193-1197
  
• Nicolas Hadjisavvas, Siegfried Schaible:
  Generalized Monotone Single Valued Maps. 1197-1202
  
• Nicolas Hadjisavvas, Siegfried Schaible:
  Generalized Monotonicity: Applications to Variational Inequalities and Equilibrium Problems. 1202-1209
  
• Jeffery L. Kennington, Karen R. Lewis:
  Generalized Networks. 1209-1214
  
• Michael M. Kostreva:
  Generalized Nonlinear Complementarity Problem. 1214-1215
  
• S. Leyffer:
  Generalized Outer Approximation. 1215-1223
  
• Wenbin Liu:
  Generalized Primal-relaxed Dual Approach. 1223-1226
  
• Oliver Stein:
  Generalized Semi-infinite Programming: Optimality Conditions. 1227-1233
  
• Chengxian Xu:
  Generalized Total Least Squares. 1233-1238
  
• Barbara Panicucci:
  Generalized Variational Inequalities: A Brief Review. 1238-1244
  
• Richard S. Judson:
  Genetic Algorithms. 1254-1257
  
• Richard S. Judson:
  Genetic Algorithms for Protein Structure Prediction. 1257-1260
  
• Yanjun Wang:
  Geometric Programming. 1260-1268
  
• Erika J. Short, Oleg V. Shylo:
  Global Equilibrium Search. 1268-1272
  
• Mark A. Stadtherr:
  Global Optimization: Application to Phase Equilibrium Problems. 1286-1291
  
• Adil M. Bagirov, Gleb Beliakov:
  Global Optimization: Cutting Angle Method. 1304-1311
  
• Alex M. Rubinov:
  Global Optimization: Envelope Representation. 1311-1316
  
• Hong-Xuan Huang:
  Global Optimization: Filled Function Methods. 1316-1323
  
• Chrysanthos E. Gounaris, Christodoulos A. Floudas:
  Global Optimization: Functional Forms. 1323-1328
  
• Chrysanthos E. Gounaris, Christodoulos A. Floudas:
  Global Optimization: g-alphaBB Approach. 1328-1333
  
• Zelda B. Zabinsky:
  Global Optimization: Hit and Run Methods. 1342-1346
  
• Julius Zilinskas, Ian David Lockhart Bogle:
  Global Optimization: Interval Analysis and Balanced Interval Arithmetic. 1346-1350
  
• Chrysanthos E. Gounaris, Christodoulos A. Floudas:
  Global Optimization: p-alphaBB Approach. 1370-1376
  
• Chrysanthos E. Gounaris, Christodoulos A. Floudas:
  Global Optimization: Tight Convex Underestimators. 1411-1418
  
• Panos Parpas, Berç Rustem:
  Global Optimization Algorithms for Financial Planning Problems. 1277-1282
  
• Antanas Zilinskas:
  Global Optimization Based on Statistical Models. 1291-1294
  
• S. T. Harding, Christodoulos A. Floudas:
  Global Optimization in Batch Design Under Uncertainty. 1294-1299
  
• Dimitri Pourbaix:
  Global Optimization in Binary Star Astronomy. 1299-1304
  
• Costas D. Maranas:
  Global Optimization in Generalized Geometric Programming. 1333-1337
  
• Costas D. Maranas:
  Global Optimization in Lennard-Jones and Morse Clusters. 1350-1354
  
• Hoang Tuy:
  Global Optimization in Location Problems. 1354-1359
  
• Takahito Kuno:
  Global Optimization in Multiplicative Programming. 1366-1370
  
• Conor M. McDonald:
  Global Optimization in Phase and Chemical Reaction Equilibrium. 1376-1383
  
• Daniel R. Ripoll, Adam Liwo, Harold A. Scheraga:
  Global Optimization in Protein Folding. 1392-1411
  
• János D. Pintér:
  Global Optimization in the Analysis and Management of Environmental Systems. 1282-1286
  
• Costas D. Maranas:
  Global Optimization in Weber's Problem with Attraction and Repulsion. 1423-1427
  
• William W. Edmonson, Wen H. Lee:
  Global Optimization Methods for Harmonic Retrieval. 1359-1364
  
• Nguyen V. Thoai:
  Global Optimization Methods for Systems of Nonlinear Equations. 1364-1366
  
• Juan M. Zamora, Ignacio E. Grossmann:
  Global Optimization of Heat Exchanger Networks. 1337-1342
  
• Claire S. Adjiman, R. F. Oulton:
  Global Optimization of Planar Multilayered Dielectric Structures. 1383-1392
  
• Roman G. Strongin:
  Global Optimization Using Space Filling. 1418-1423
  
• Scott R. McAllister, R. Rajgaria, Christodoulos A. Floudas:
  Global Pairwise Protein Sequence Alignment via Mixed-Integer Linear Optimization. 1427-1434
  
• Burak Eksioglu:
  Global Supply Chain Models. 1434-1437
  
• Angelo Lucia:
  Global Terrain Methods. 1437-1444
  
• Layne T. Watson:
  Globally Convergent Homotopy Methods. 1272-1277
  
• Jue Xue:
  Graph Coloring. 1444-1448
  
• Mauricio G. C. Resende, Celso C. Ribeiro:
  Graph Planarization. 1448-1453
  
• Anthony Man-Cho So, Yinyu Ye:
  Graph Realization via Semidefinite Programming. 1453-1460
  
• Mauricio G. C. Resende:
  Greedy Randomized Adaptive Search Procedures. 1460-1469
  
• Per Olov Lindberg, Lars Svensson:
  Gröbner Bases for Polynomial Equations. 1469-1471
  

H

• William R. Esposito:
  Hamilton-Jacobi-Bellman Equation. 1473-1476
  
• Euripidis Mistakidis, Georgios E. Stavroulakis:
  Hemivariational Inequalities: Applications in Mechanics. 1476-1483
  
• Daniel Goeleven, Dumitru Motreanu:
  Hemivariational Inequalities: Eigenvalue Problems. 1483-1488
  
• Zdzislaw Naniewicz:
  Hemivariational Inequalities: Static Problems. 1488-1498
  
• Yannis Marinakis:
  Heuristic and Metaheuristic Algorithms for the Traveling Salesman Problem. 1498-1506
  
• Alexander Reinefeld:
  Heuristic Search. 1506-1508
  
• Marcello Pelillo:
  Heuristics for Maximum Clique and Independent Set. 1508-1520
  
• Urszula Ledzewicz, Heinz Schättler:
  High-order Maximum Principle for Abnormal Extremals. 1520-1527
  
• Urszula Ledzewicz, Heinz Schättler:
  High-order Necessary Conditions for Optimality for Abnormal Points. 1527-1534
  
• Victor Korotkikh:
  Hilbert's Thirteenth Problem. 1534-1538
  
• Ding-Zhu Du, Panos M. Pardalos, Weili Wu:
  History of Optimization. 1538-1542
  
• Erling D. Andersen:
  Homogeneous Selfdual Methods for Linear Programming. 1542-1545
  
• Peter Orlik:
  Hyperplane Arrangements. 1545-1547
  
• Panos M. Pardalos:
  Hyperplane Arrangements in Optimization. 1547-1548
  

I

• André Bardow, Wolfgang Marquardt:
  Identification Methods for Reaction Kinetics and Transport. 1549-1556
  
• Alexander Kaplan, Rainer Tichatschke:
  Ill-posed Variational Problems. 1556-1561
  
• Franco Giannessi:
  Image Space Approach to Optimization. 1561-1567
  
• Michael V. Solodov:
  Implicit Lagrangian. 1567-1571
  
• Hossein Mohebi:
  Increasing and Convex-Along-Rays Functions on Topological Vector Spaces. 1571-1576
  
• Hossein Mohebi:
  Increasing and Positively Homogeneous Functions on Topological Vector Spaces. 1576-1586
  
• Walter Murray:
  Inequality-constrained Nonlinear Optimization. 1586-1591
  
• Vetle I. Torvik, Evangelos Triantaphyllou:
  Inference of Monotone Boolean Functions. 1591-1598
  
• Dean A. Carlson, Alain Haurie:
  Infinite Horizon Control and Dynamic Games. 1598-1603
  
• J. F. Traub, Arthur G. Werschulz:
  Information-based Complexity and Information-based Optimization. 1603-1608
  
• Panos M. Pardalos, Yasutoshi Yajima:
  Integer Linear Complementary Problem. 1608-1610
  
• Meeyoung Cha, Wanpracha Art Chaovalitwongse, Zhe Liang, Jennifer Yates, Aman Shaikh, Sue B. Moon:
  Integer Linear Programs for Routing and Protection Problems in Optical Networks. 1610-1617
  
• Egon Balas:
  Integer Programming. 1617-1624
  
• Rekha R. Thomas:
  Integer Programming: Algebraic Methods. 1624-1634
  
• Eva K. Lee, John E. Mitchell:
  Integer Programming: Branch and Bound Methods. 1634-1643
  
• John E. Mitchell:
  Integer Programming: Branch and Cut Algorithms. 1643-1650
  
• John E. Mitchell:
  Integer Programming: Cutting Plane Algorithms. 1650-1657
  
• John N. Hooker:
  Integer Programming: Lagrangian Relaxation. 1667-1673
  
• John N. Hooker:
  Integer Programming Duality. 1657-1667
  
• Metin Türkay, Ugur Kaplan:
  Integrated Planning and Scheduling. 1673-1679
  
• Levent Tunçel:
  Interior Point Methods for Semidefinite Programming. 1679-1683
  
• Mark A. Stadtherr:
  Interval Analysis: Application to Chemical Engineering Design Problems. 1683-1685
  
• Ramon E. Moore:
  Interval Analysis: Differential Equations. 1685-1689
  
• David Hertz:
  Interval Analysis: Eigenvalue Bounds of Interval Matrices. 1689-1696
  
• R. Baker Kearfott:
  Interval Analysis: Intermediate Terms. 1696-1699
  
• R. Baker Kearfott:
  Interval Analysis: Nondifferentiable Problems. 1699-1702
  
• Anthony P. Leclerc:
  Interval Analysis: Parallel Methods for Global Optimization. 1709-1717
  
• Tibor Csendes:
  Interval Analysis: Subdivision Directions in Interval Branch and Bound Methods. 1717-1721
  
• Ramon E. Moore:
  Interval Analysis: Systems of Nonlinear Equations. 1721-1727
  
• R. Baker Kearfott:
  Interval Analysis: Unconstrained and Constrained Optimization. 1727-1730
  
• R. Baker Kearfott:
  Interval Analysis: Verifying Feasibility. 1730-1733
  
• Youdong Lin, Mark A. Stadtherr:
  Interval Analysis for Optimization of Dynamical Systems. 1702-1709
  
• Frédéric Benhamou:
  Interval Constraints. 1733-1736
  
• R. Baker Kearfott:
  Interval Fixed Point Theory. 1736-1739
  
• Helmut Ratschek, Jon G. Rokne:
  Interval Global Optimization. 1739-1757
  
• C. Jansson:
  Interval Linear Systems. 1757-1763
  
• R. Baker Kearfott:
  Interval Newton Methods. 1763-1766
  
• Sandra Duni Eksioglu:
  Inventory Management in Supply Chains. 1766-1770
  
• B. D. Craven:
  Invexity and its Applications. 1770-1774
  
• Valentina de Simone, Marina Marino, Gerardo Toraldo:
  Isotonic Regression Problems. 1774-1777
  

J

• H. K. Kesavan:
  Jaynes' Maximum Entropy Principle. 1779-1782
  
• Peter Brucker:
  Job-shop Scheduling Problem. 1782-1788
  

K

• Panos M. Pardalos:
  Kantorovich, Leonid Vitalyevich. 1789-1790
  
• Victor Korotkikh:
  Kolmogorov Complexity. 1790-1794
  
• Gabriele E. Danninger-Uchida:
  Krein-Milman Theorem. 1794
  
• Panos M. Pardalos:
  Kuhn-Tucker Optimality Conditions. 1794-1797
  

L

• François V. Louveaux, John R. Birge:
  L-shaped Method for Two-stage Stochastic Programs with Recourse. 1943-1945
  
• Kazuo Murota:
  L-convex Functions and M-convex Functions. 1838-1845
  
• Tania Maia Querido, Dukwon Kim:
  Lagrange, Joseph-Louis. 1799-1800
  
• Alex M. Rubinov, Xiaoqi Yang:
  Lagrange-Type Functions. 1800-1805
  
• Donald W. Hearn, Timothy J. Lowe:
  Lagrangian Duality: BASICS. 1805-1813
  
• Marc Teboulle:
  Lagrangian Multipliers Methods for Convex Programming. 1813-1818
  
• Panos Parpas, Berç Rustem:
  Laplace Method and Applications to Optimization Problems. 1818-1822
  
• Laura Palagi:
  Large Scale Trust Region Problems. 1822-1831
  
• Massimo Roma:
  Large Scale Unconstrained Optimization. 1831-1838
  
• Panos M. Pardalos:
  LCP: Pardalos-Rosen Mixed Integer Formulation. 1845-1847
  
• Claude Brezinski, Ana C. Matos:
  Least Squares Orthogonal Polynomials. 1851-1856
  
• Åke Björck:
  Least Squares Problems. 1856-1866
  
• Tamás Terlaky:
  Least-index Anticycling Rules. 1847-1851
  
• Sandra Duni Eksioglu:
  Leibniz, Gottfried Wilhelm. 1866-1868
  
• Michael M. Kostreva:
  Lemke Method. 1868-1870
  
• Tamás Terlaky:
  Lexicographic Pivoting Rules. 1870-1873
  
• Richard W. Cottle:
  Linear Complementarity Problem. 1873-1878
  
• Kees Roos:
  Linear Optimization: Theorems of the Alternative. 1878-1881
  
• Paola Festa:
  Linear Ordering Problem. 1881-1883
  
• Panos M. Pardalos:
  Linear Programming. 1883-1886
  
• Kurt M. Anstreicher:
  Linear Programming: Interior Point Methods. 1886-1889
  
• Kurt M. Anstreicher:
  Linear Programming: Karmarkar Projective Algorithm. 1889-1891
  
• Konstantinos Paparrizos, Nikolaos Samaras, Dimitrios Zissopoulos:
  Linear Programming: Klee-Minty Examples. 1891-1897
  
• Paul A. Rubin:
  Linear Programming Models for Classification. 1897-1901
  
• Leonidas S. Pitsoulis:
  Linear Space. 1901-1902
  
• Vasant A. Ubhaya:
  Lipschitzian Operators in Best Approximation by Bounded or Continuous Functions. 1902-1905
  
• Ananth Grama, Vipin Kumar:
  Load Balancing for Parallel Optimization Techniques. 1905-1911
  
• Joseph C. Dunn:
  Local Attractors for Gradient-related Descent Iterations. 1911-1919
  
• Yannis Marinakis:
  Location Routing Problem. 1919-1925
  
• András Prékopa:
  Logconcave Measures, Logconvexity. 1925-1926
  
• András Prékopa:
  Logconcavity of Discrete Distributions. 1926-1928
  
• Ignacio E. Grossmann:
  Logic-Based Outer Approximation. 1928-1931
  
• Stanislav Busygin:
  Lovász Number. 1931-1937
  
• Youdong Lin, Mark A. Stadtherr:
  LP Strategy for Interval-Newton Method in Deterministic Global Optimization. 1937-1943
  

M

• Marielle Christiansen, Kjetil Fagerholt:
  Maritime Inventory Routing Problems. 1947-1955
  
• Ioannis P. Androulakis, Wanpracha Art Chaovalitwongse:
  Mathematical Programming for Data Mining. 1955-1959
  
• Laura Di Giacomo:
  Mathematical Programming Methods in Supply Chain Management. 1959-1967
  
• Monique Laurent:
  Matrix Completion Problems. 1967-1975
  
• Paola Festa:
  Matroids. 1975-1981
  
• Michel Minoux, P. Mavrocordatos:
  Maximum Constraint Satisfaction: Relaxations and Upper Bounds. 1981-1991
  
• Clayton W. Commander:
  Maximum Cut Problem, MAX-CUT. 1991-1999