Mathematical Programming
, Volume 115
Volume 115, Number 1, September 2008
Nobuo Yamashita
:
Sparse quasi-Newton updates with positive definite matrix completion.
1-30
Electronic Edition
(link)
BibTeX
Immanuel M. Bomze
,
Marco Locatelli
,
Fabio Tardella
:
New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability.
31-64
Electronic Edition
(link)
BibTeX
Daya Ram Gaur
,
Ramesh Krishnamurti
,
Rajeev Kohli
:
The capacitated max
k
-cut problem.
65-72
Electronic Edition
(link)
BibTeX
M. Zhao
,
I. R. de Farias
:
The mixing-MIR set with divisible capacities.
73-103
Electronic Edition
(link)
BibTeX
Renato D. C. Monteiro
,
Takashi Tsuchiya
:
A strong bound on the integral of the central path curvature and its relationship with the iteration-complexity of primal-dual path-following LP algorithms.
105-149
Electronic Edition
(link)
BibTeX
Gideon Weiss
:
A simplex based algorithm to solve separated continuous linear programs.
151-198
Electronic Edition
(link)
BibTeX
Copyright ©
Wed Jun 4 19:16:28 2008 by
Michael Ley
(
ley@uni-trier.de
)