The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Journals in DBLP

Math. Program.
1991, volume: 52, number:

  1. Takeo Kawashiro, Fumihiro Yamasawa, Yasumasa Okada, Hirosuke Kobayashi, Kunio Tanabe
    Uneven distribution of ventilation-perfusion ratios in lungs estimated by a modified Newton method. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:52, n:, pp:1-9 [Journal]
  2. C. E. Pedreira, V. B. Vila
    Optimal schedule for cancer chemotherapy. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:52, n:, pp:11-17 [Journal]
  3. M. Tamura, Y. Kobayashi
    Application of sequential quadratic programming software program to an actual problem. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:52, n:, pp:19-27 [Journal]
  4. Katsunori Tani, Shuji Tsukiyama, Shoji Shinoda, Isao Shirakawa
    On area-efficient drawings of rectangular duals for VLSI floor-plan. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:52, n:, pp:29-43 [Journal]
  5. Claus Thorp Hansen, Kaj Madsen, Hans Bruun Nielsen
    Optimization of pipe networks. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:52, n:, pp:45-58 [Journal]
  6. Bjørn Nygreen
    Branch and bound with estimation based on pseudo-shadow-prices. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:52, n:, pp:59-69 [Journal]
  7. Fumiko Seo
    Utilization of mathematical programming for public systems: An application to effective formation of integrated regional information networks. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:52, n:, pp:71-98 [Journal]
  8. Takeshi Koshizuka, Osamu Kurita
    Approximate formulas of average distances associated with regions and their applications to location problems. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:52, n:, pp:99-123 [Journal]
  9. Tsutomu Suzuki, Yasushi Asami, Atsuyuki Okabe
    Sequential location-allocation of public facilities in one- and two-dimensional space: Comparison of several policies. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:52, n:, pp:125-146 [Journal]
  10. Jati K. Sengupta
    The influence curve approach in data envelopment analysis. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:52, n:, pp:147-166 [Journal]
  11. Garth P. McCormick, Ariela Sofer
    Optimization with unary functions. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:52, n:, pp:167-178 [Journal]
  12. Franz Aurenhammer
    Using Gale transforms in computational geometry. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:52, n:, pp:179-190 [Journal]
  13. Jean-Pierre Crouzeix, Jacques A. Ferland
    Algorithms for generalized fractional programming. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:52, n:, pp:191-207 [Journal]
  14. Clovis C. Gonzaga
    Interior point algorithms for linear programming with inequality constraints. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:52, n:, pp:209-225 [Journal]
  15. Pierre Hansen, Brigitte Jaumard, Shi-Hui Lu
    An analytical approach to global optimization. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:52, n:, pp:227-254 [Journal]
  16. Pierre Hansen, Marcus Poggi de Aragão, Celso C. Ribeiro
    Hyperbolic 0-1 programming and query optimization in information retrieval. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:52, n:, pp:255-263 [Journal]
  17. Alfredo N. Iusem, Alvaro R. De Pierro
    On the convergence of Han's method for convex programming with quadratic objective. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:52, n:, pp:265-284 [Journal]
  18. Krzysztof C. Kiwiel
    Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:52, n:, pp:285-302 [Journal]
  19. Philippe Michelon, Nelson Maculan
    Lagrangean decomposition for integer nonlinear programming with linear constraints. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:52, n:, pp:303-313 [Journal]
  20. Manfred Padberg, Ting-Yi Sung
    An analytical comparison of different formulations of the travelling salesman problem. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:52, n:, pp:315-357 [Journal]
  21. M. V. F. Pereira, L. M. V. G. Pinto
    Multi-stage stochastic optimization applied to energy planning. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:52, n:, pp:359-375 [Journal]
  22. Takashi Tsuchiya
    Global convergence of the affine scaling methods for degenerate linear programming problems. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:52, n:, pp:377-404 [Journal]
  23. Yinyu Ye
    Comparative analysis of affine scaling algorithms based on simplifying assumptions. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:52, n:, pp:405-414 [Journal]
  24. Clovis C. Gonzaga
    On lower bound updates in primal potential reduction methods for linear programming. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:52, n:, pp:415-428 [Journal]
  25. Kurt M. Anstreicher
    A combined phase I-phase II scaled potential algorithm for linear programming. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:52, n:, pp:429-439 [Journal]
  26. Robert M. Freund
    A potential-function reduction algorithm for solving a linear program directly from an infeasible "warm start". [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:52, n:, pp:441-466 [Journal]
  27. Vera V. Kovacevic-Vujcic
    Improving the rate of convergence of interior point methods for linear programming. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:52, n:, pp:467-479 [Journal]
  28. Dick den Hertog, Cees Roos
    A survey of search directions in interior point methods for linear programming. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:52, n:, pp:481-509 [Journal]
  29. Masao Iri
    Integrability of vector and multivector fields associated with interior point methods for linear programming. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:52, n:, pp:511-525 [Journal]
  30. G. Sonnevend, Josef Stoer, G. Zhao
    On the complexity of following the central path of linear programs by linear extrapolation II. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:52, n:, pp:527-553 [Journal]
  31. Narendra Karmarkar, K. G. Ramakrishnan
    Computational results of an interior point algorithm for large scale linear programming. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:52, n:, pp:555-586 [Journal]
  32. Shinji Mizuno, Michael J. Todd
    An O(n3L) adaptive path following algorithm for a linear complementarity problem. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:52, n:, pp:587-595 [Journal]
  33. Narendra Karmarkar, Mauricio G. C. Resende, K. G. Ramakrishnan
    An interior point algorithm to solve computationally difficult set covering problems. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:52, n:, pp:597-618 [Journal]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002