default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputational Optimization and Applications, Volume 33
Volume 33, Number 1, January 2006
- William W. Hager:
Editorial. 5-6 - Walter Murray, Uday V. Shanbhag:
A Local Relaxation Approach for the Siting of Electrical Substations. 7-49 - Kartik Krishnan, John E. Mitchell:
A Semidefinite Programming Based Polyhedral Cut and Price Approach for the Maxcut Problem. 51-71 - Y. H. Dai, X. Q. Yang:
A New Gradient Method with an Optimal Stepsize Property. 73-88 - Xiaojiao Tong, Liqun Qi
, Yu-Fei Yang:
The Lagrangian Globalization Method for Nonsmooth Constrained Equations. 89-109
Volume 33, Numbers 2-3, March 2006
- Paulo J. S. Silva, Jonathan Eckstein:
Double-Regularization Proximal Methods, with Complementarity Applications. 115-156 - Maziar Salahi, Tamás Terlaky, Guoqing Zhang:
The Complexity of Self-Regular Proximity Based Infeasible IPMs. 157-185 - Hong-Xuan Huang, Panos M. Pardalos, Oleg A. Prokopyev:
Lower Bound Improvement and Forcing Rule for Quadratic Binary Programming. 187-208 - Christian Meyer, Arnd Rösch, Fredi Tröltzsch:
Optimal Control of PDEs with Regularized Pointwise State Constraints. 209-228 - E. Alper Yildirim, Xiaofei Fan-Orzechowski:
On Extracting Maximum Stable Sets in Perfect Graphs Using Lovász's Theta Function. 229-247 - Warren L. Hare:
Functions and Sets of Smooth Substructure: Relationships and Examples. 249-270 - Mhand Hifi, M. Michrafy, Abdelkader Sbihi:
A Reactive Local Search-Based Algorithm for the Multiple-Choice Multi-Dimensional Knapsack Problem. 271-285 - Yaodong Cui, Ling Huang:
Dynamic Programming Algorithms for Generating Optimal Strip Layouts. 287-301 - Patrizia Beraldi, Gianpaolo Ghiani, Antonio Grieco, Emanuela Guerriero:
Fix and Relax Heuristic for a Stochastic Lot-Sizing Problem. 303-318 - Dmitry I. Belov, Ronald D. Armstrong:
A Constraint Programming Approach to Extract the Maximum Number of Non-Overlapping Test Forms. 319-332 - Xian Liu:
A Class of Augmented Filled Functions. 333-347 - Wieslawa T. Obuchowska:
On Generalizations of the Frank-Wolfe Theorem to Convex and Quasi-Convex Programmes. 349-364
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 2024-11-21 20:30 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:
