researchr
explore
Tags
Journals
Conferences
Authors
Profiles
Groups
calendar
New Conferences
Events
Deadlines
search
search
You are not signed in
Sign in
Sign up
External Links
Journal: Comp. Opt. and Appl.
Home
Index
Info
Volume
Volume
19
, Issue
3
243
--
272
Thomas F. Coleman
,
Yuying Li
,
Adrian Mariano
.
Segmentation of Pulmonary Nodule Images Using 1-Norm Minimization
273
--
296
P. Spellucci
.
A Modified Rank One Update Which Converges Q-Superlinearly
297
--
317
Guanghui Liu
,
Lixing Han
.
A Study of the Dennis-Wolkowicz Method on Convex Functions
319
--
335
Ahmed Roubi
.
Some Properties of Methods of Centers
337
--
345
Issam A. R. Moghrabi
.
Metric-Based Parameterizations for Multi-Step Unconstrained Optimization
Volume
19
, Issue
2
127
--
144
Marcelo C. Medeiros
,
Mauricio G. C. Resende
,
Alvaro Veiga
.
Piecewise Linear Time Series Estimation with GRASP
145
--
164
Alexander J. Robertson
.
A Set of Greedy Randomized Adaptive Local Search Procedure (GRASP) Implementations for the Multidimensional Assignment Problem
165
--
178
Manuel Laguna
,
Rafael MartÃ
.
A GRASP for Coloring Sparse Graphs
179
--
208
Andreas Alexander Albrecht
,
S. K. Cheung
,
Kwong-Sak Leung
,
Chak-Kuen Wong
.
On the Convergence of Inhomogeneous Markov Chains Approximating Equilibrium Placements of Flexible Objects
209
--
234
Frank GuangSheng Zhang
,
Emanuel Melachrinoudis
.
The Maximin-Maxisum Network Location Problem
Volume
19
, Issue
1
5
--
29
Jacek Gondzio
,
Robert Sarkissian
,
Jean-Philippe Vial
.
Parallel Implementation of a Central Decomposition Method for Solving Large-Scale Planning Problems
31
--
53
Jean-Pierre Dussault
,
Abdellatif Elafia
.
On the Superlinear Convergence Order of the Logarithmic Barrier Algorithm
55
--
77
Hanif D. Sherali
,
Gyunghyun Choi
,
Zafar Ansari
.
Limited Memory Space Dilation and Reduction Algorithms
79
--
105
Mituhiro Fukuda
,
Masakazu Kojima
.
Branch-and-Cut Algorithms for the Bilinear Matrix Inequality Eigenvalue Problem
107
--
120
Ravindra S. Gajulapalli
,
Leon S. Lasdon
.
Computational Experience with a Safeguarded Barrier Algorithm for Sparse Nonlinear Programming