Volume 52,
1991
- Takeo Kawashiro, Fumihiro Yamasawa, Yasumasa Okada, Hirosuke Kobayashi, Kunio Tanabe:
Uneven distribution of ventilation-perfusion ratios in lungs estimated by a modified Newton method.
1-9 BibTeX
- C. E. Pedreira, V. B. Vila:
Optimal schedule for cancer chemotherapy.
11-17 BibTeX
- M. Tamura, Y. Kobayashi:
Application of sequential quadratic programming software program to an actual problem.
19-27 BibTeX
- Katsunori Tani, Shuji Tsukiyama, Shoji Shinoda, Isao Shirakawa:
On area-efficient drawings of rectangular duals for VLSI floor-plan.
29-43 BibTeX
- Claus Thorp Hansen, Kaj Madsen, Hans Bruun Nielsen:
Optimization of pipe networks.
45-58 BibTeX
- Bjørn Nygreen:
Branch and bound with estimation based on pseudo-shadow-prices.
59-69 BibTeX
- Fumiko Seo:
Utilization of mathematical programming for public systems: An application to effective formation of integrated regional information networks.
71-98 BibTeX
- Takeshi Koshizuka, Osamu Kurita:
Approximate formulas of average distances associated with regions and their applications to location problems.
99-123 BibTeX
- Tsutomu Suzuki, Yasushi Asami, Atsuyuki Okabe:
Sequential location-allocation of public facilities in one- and two-dimensional space: Comparison of several policies.
125-146 BibTeX
- Jati K. Sengupta:
The influence curve approach in data envelopment analysis.
147-166 BibTeX
- Garth P. McCormick, Ariela Sofer:
Optimization with unary functions.
167-178 BibTeX
- Franz Aurenhammer:
Using Gale transforms in computational geometry.
179-190 BibTeX
- Jean-Pierre Crouzeix, Jacques A. Ferland:
Algorithms for generalized fractional programming.
191-207 BibTeX
- Clovis C. Gonzaga:
Interior point algorithms for linear programming with inequality constraints.
209-225 BibTeX
- Pierre Hansen, Brigitte Jaumard, Shi-Hui Lu:
An analytical approach to global optimization.
227-254 BibTeX
- Pierre Hansen, Marcus Poggi de Aragão, Celso C. Ribeiro:
Hyperbolic 0-1 programming and query optimization in information retrieval.
255-263 BibTeX
- Alfredo N. Iusem, Alvaro R. De Pierro:
On the convergence of Han's method for convex programming with quadratic objective.
265-284 BibTeX
- Krzysztof C. Kiwiel:
Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization.
285-302 BibTeX
- Philippe Michelon, Nelson Maculan:
Lagrangean decomposition for integer nonlinear programming with linear constraints.
303-313 BibTeX
- Manfred Padberg, Ting-Yi Sung:
An analytical comparison of different formulations of the travelling salesman problem.
315-357 BibTeX
- M. V. F. Pereira, L. M. V. G. Pinto:
Multi-stage stochastic optimization applied to energy planning.
359-375 BibTeX
- Takashi Tsuchiya:
Global convergence of the affine scaling methods for degenerate linear programming problems.
377-404 BibTeX
- Yinyu Ye:
Comparative analysis of affine scaling algorithms based on simplifying assumptions.
405-414 BibTeX
- Clovis C. Gonzaga:
On lower bound updates in primal potential reduction methods for linear programming.
415-428 BibTeX
- Kurt M. Anstreicher:
A combined phase I-phase II scaled potential algorithm for linear programming.
429-439 BibTeX
- Robert M. Freund:
A potential-function reduction algorithm for solving a linear program directly from an infeasible "warm start".
441-466 BibTeX
- Vera V. Kovacevic-Vujcic:
Improving the rate of convergence of interior point methods for linear programming.
467-479 BibTeX
- Dick den Hertog, Cees Roos:
A survey of search directions in interior point methods for linear programming.
481-509 BibTeX
- Masao Iri:
Integrability of vector and multivector fields associated with interior point methods for linear programming.
511-525 BibTeX
- G. Sonnevend, Josef Stoer, G. Zhao:
On the complexity of following the central path of linear programs by linear extrapolation II.
527-553 BibTeX
- Narendra Karmarkar, K. G. Ramakrishnan:
Computational results of an interior point algorithm for large scale linear programming.
555-586 BibTeX
- Shinji Mizuno, Michael J. Todd:
An O(n3L) adaptive path following algorithm for a linear complementarity problem.
587-595 BibTeX
- Narendra Karmarkar, Mauricio G. C. Resende, K. G. Ramakrishnan:
An interior point algorithm to solve computationally difficult set covering problems.
597-618 BibTeX
Copyright © Sun May 17 00:14:00 2009
by Michael Ley (ley@uni-trier.de)
