![](https://dblp.uni-trier.de./img/logo.320x120.png)
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
default search action
Computational Optimization and Applications, Volume 20
Volume 20, Number 1, October 2001
- Yuh-Jye Lee
, O. L. Mangasarian:
SSVM: A Smooth Support Vector Machine for Classification. 5-22 - Bernd Schandl, Kathrin Klamroth, Margaret M. Wiecek:
Norm-Based Approximation in Bicriteria Programming. 23-42 - Jun-ya Gotoh, Hiroshi Konno:
Maximization of the Ratio of Two Convex Quadratic Functions over a Polytope. 43-60 - Thomas F. Coleman, Arun Verma:
A Preconditioned Conjugate Gradient Approach to Linear Equality Constrained Minimization. 61-72 - Diego Klabjan, Ellis L. Johnson, George L. Nemhauser, Eric Gelman, Srini Ramaswamy:
Solving Large Airline Crew Scheduling Problems: Random Pairing Generation and Strong Branching. 73-91 - Hans D. Mittelmann:
Verification of Second-Order Sufficient Optimality Conditions for Semilinear Elliptic and Parabolic Control Problems. 93-110
Volume 20, Number 2, November 2001
- Takahito Kuno:
A Finite Branch-and-Bound Algorithm for Linear Multiplicative Programming. 119-135 - Michel Vasquez, Jin-Kao Hao
:
A "Logic-Constrained" Knapsack Formulation and a Tabu Algorithm for the Daily Photograph Scheduling of an Earth Observation Satellite. 137-157 - Jonathan H. Owen, Sanjay Mehrotra:
Experimental Results on Using General Disjunctions in Branch-and-Bound for General-Integer Linear Programs. 159-170 - Erling D. Andersen:
Certificates of Primal or Dual Infeasibility in Linear Programming. 171-183 - Marcus Randall
, David Abramson
:
A General Meta-Heuristic Based Solver for Combinatorial Optimisation Problems. 185-210 - John Basel, Thomas R. Willemain:
Random Tours in the Traveling Salesman Problem: Analysis and Application. 211-217
Volume 20, Number 3, December 2001
- Léonard Bacaud, Claude Lemaréchal, Arnaud Renaud, Claudia A. Sagastizábal
:
Bundle Methods in Stochastic Optimal Power Management: A Disaggregated Approach Using Preconditioners. 227-244 - Michael Hintermüller
:
A Proximal Bundle Method Based on Approximate Subgradients. 245-266 - Song Xu:
Smoothing Method for Minimax Problems. 267-279 - Arne Andersson, Fredrik Ygge:
Efficient Resource Allocation with Non-Concave Objective Functions. 281-298 - Leticia Velázquez, George N. Phillips Jr., Richard A. Tapia, Yin Zhang:
Selective Search for Global Optimization of Zero or Small Residual Least-Squares Problems: A Numerical Study. 299-315 - Patrice Marcotte, Daoli Zhu:
A Cutting Plane Method for Solving Quasimonotone Variational Inequalities. 317-324
![](https://dblp.uni-trier.de./img/cog.dark.24x24.png)
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.