default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputational Optimization and Applications, Volume 27
Volume 27, Number 1, January 2004
- Harold P. Benson:
On the Construction of Convex and Concave Envelope Formulas for Bilinear and Fractional Functions on Quadrilaterals. 5-22 - Linping Sun:
Updating the Self-Scaling Symmetric Rank One Algorithm with Limited Memory for Large-Scale Unconstrained Optimization. 23-29 - Sahib S. Mardanov, Knyaz Sh. Mamedov:
Disaggregation of Diophantine Equation with Boolean Variables. 31-36 - Wieslawa T. Obuchowska:
On the Minimizing Trajectory of Convex Functions with Unbounded Level Sets. 37-52 - Andreas Alexander Albrecht, Chak-Kuen Wong:
Approximation of Boolean Functions by Local Search. 53-82 - J. L. Alejandre, Ana Allueva, Jose Miguel Gonzalez:
A General Alternative Procedure for Solving Negative Degree of Difficulty Problems in Geometric Programming. 83-93 - Mrinmoy Hota, Madhumangal Pal, Tapan Kumar Pal:
Optimal Sequential and Parallel Algorithms to Compute All Cut Vertices on Trapezoid Graphs. 95-113
Volume 27, Number 2, February 2004
- Bernard Fortz
, Martine Labbé:
Two-Connected Networks with Rings of Bounded Cardinality. 123-148 - Krzysztof Walkowiak:
A Branch and Bound Algorithm for Primary Routes Assignment in Survivable Connection Oriented Networks. 149-171 - Volker Stix:
Finding All Maximal Cliques in Dynamic Graphs. 173-186 - Torbjörn Larsson, Di Yuan:
An Augmented Lagrangian Algorithm for Large Scale Multicommodity Routing. 187-215
Volume 27, Number 3, March 2004
- Xiaojun Chen, Masao Fukushima:
A Smoothing Method for a Mathematical Program with P-Matrix Linear Complementarity Constraints. 223-246 - Bingsheng He, Xiaoming Yuan, Jason J. Z. Zhang:
Comparison of Two Kinds of Prediction-Correction Methods for Monotone Variational Inequalities. 247-267 - Guanglu Zhou, Kim-Chuan Toh, Gongyun Zhao:
Convergence Analysis of an Infeasible Interior Point Algorithm Based on a Regularized Central Path for Linear Complementarity Problems. 269-283 - Song Xu:
A Non-Interior Path Following Method for Convex Quadratic Programming Problems with Bound Constraints. 285-303 - Jianzhong Zhang, Xiaoguang Yang, Mao-cheng Cai:
A Network Improvement Problem Under Different Norms. 305-319
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-05-17 00:02 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
