New Trends in Mathematical Programming

Steven Vajda 1901-1995; J. Krarup. The Fermat-Weber Problem and the Lagrangian Duality Theory; C. Antoni A. Dalena. Longest Fragment First Algorithms for Data Compression; J. Békési et al. Linear Operators and Stochastic Dominance; E. Castagnoli. Some Properties of Dini-Derivatives of Quasiconvex Functions; J. -P. Crouzeix. Necessary Conditions for Two-Function Minimax Inequalities; F. Forgó I. Joó. Fitting Circles and Spheres to Coordinate Measuring Machine Data; S. I. Gass et al. On Minty Variational Principle; F. Giannessi. Single-Facility Location Problems with Arbitrary Weights; G. Jalal J. Krarup. On Testing SLP Codes with SLP-IOR; P. Kall J. Mayer. On Primal-Dual Path-Following Algorithms for Semidefinite Programming; E. de Klerk et al. A Piecewise Linear Dual Procedure in Mixed Integer Programming; I. Maros. Geometrical Solution of Weighted Fermat Problem About Triangles; M. Martelli. Separation and Regularity in the Image Space; G. Mastroeni M. Pappalardo. Dynamic Models and Generalized Equilibrium Problems; A. Maugeri. Ordering Heuristics in Interior Point LP Methods; C. Mészáros. A Tabu Based Pattern Search Method for the Distance Geometry Problem; P. M. Pardalos Xin Liu. Programming Under Probabilistic Constraint with Discrete Random Variable; A. Prékopa et al. Variable Metric Methods Along Geodetics; T. Rapcsák. Criteria for Generalized Monotonicity; S. Schaible. On the K - Out - of - R - From - N : F System with Unequal Element Probabilities; T. Szántai A. Habib. A Common Root of Three Minimization Problems; B. Uhrin. Language: English