Journal: Comp. Opt. and Appl.

Volume 33, Issue 2-3

115 -- 156Paulo J. S. Silva, Jonathan Eckstein. Double-Regularization Proximal Methods, with Complementarity Applications
157 -- 185Maziar Salahi, Tamás Terlaky, Guoqing Zhang. The Complexity of Self-Regular Proximity Based Infeasible IPMs
187 -- 208Hong-Xuan Huang, Panos M. Pardalos, Oleg A. Prokopyev. Lower Bound Improvement and Forcing Rule for Quadratic Binary Programming
209 -- 228Christian Meyer, Arnd Rösch, Fredi Tröltzsch. Optimal Control of PDEs with Regularized Pointwise State Constraints
229 -- 247E. Alper Yildirim, Xiaofei Fan-Orzechowski. On Extracting Maximum Stable Sets in Perfect Graphs Using Lovász's Theta Function
249 -- 270W. L. Hare. Functions and Sets of Smooth Substructure: Relationships and Examples
271 -- 285Mhand Hifi, M. Michrafy, Abdelkader Sbihi. A Reactive Local Search-Based Algorithm for the Multiple-Choice Multi-Dimensional Knapsack Problem
287 -- 301Yaodong Cui, Ling Huang. Dynamic Programming Algorithms for Generating Optimal Strip Layouts
303 -- 318Patrizia Beraldi, Gianpaolo Ghiani, Antonio Grieco, Emanuela Guerriero. Fix and Relax Heuristic for a Stochastic Lot-Sizing Problem
319 -- 332Dmitry I. Belov, Ronald D. Armstrong. A Constraint Programming Approach to Extract the Maximum Number of Non-Overlapping Test Forms
333 -- 347Xian Liu. A Class of Augmented Filled Functions
349 -- 364Wieslawa T. Obuchowska. On Generalizations of the Frank-Wolfe Theorem to Convex and Quasi-Convex Programmes

Volume 33, Issue 1

5 -- 6William W. Hager. Editorial
7 -- 49Walter Murray, Uday V. Shanbhag. A Local Relaxation Approach for the Siting of Electrical Substations
51 -- 71Kartik Krishnan, John E. Mitchell. A Semidefinite Programming Based Polyhedral Cut and Price Approach for the Maxcut Problem
73 -- 88Y. H. Dai, X. Q. Yang. A New Gradient Method with an Optimal Stepsize Property
89 -- 109Xiaojiao Tong, Liqun Qi, Yu-Fei Yang. The Lagrangian Globalization Method for Nonsmooth Constrained Equations