<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet type="text/xsl" href="https://ddd.uab.cat/css/oai2.xsl.v1.0" ?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
<responseDate>2026-09-18T07:20:27Z</responseDate><request verb="ListRecords" set="scholar" metadataPrefix="oai_dc">http://ddd.uab.cat/oai2d</request><ListRecords>
<record><header><identifier>oai:ddd.uab.cat:54</identifier><datestamp>2026-08-05T08:12:52Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>A Gaussian upper bound for Gaussian multi-stage stochastic linear programs</dc:title>
  <dc:creator>Schweitzer, Eithan</dc:creator>
  <dc:creator>Avriel, Mordecai</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Stochastic programming</dc:subject>
  <dc:subject>Semidefinite programming</dc:subject>
  <dc:subject>Multi-stage linear programs</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 77, Num. 1 (04 1997), p. 1-21</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/54</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:54</dc:identifier>
  <dc:identifier>urn:articleid:00255610v77n1</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>This paper deals with two-stage and multi-stage stochastic programs in which the right-hand sides of the constraints are Gaussian random variables. Such problems are of interest since the use of Gaussian estimators of random variables is widespread. We introduce algorithms to find upper bounds on the optimal value of two-stage and multi-stage stochastic (minimization) programs with Gaussian right-hand sides. The upper bounds are obtained by solving deterministic mathematical programming problems with dimensions that do not depend on the sample space size. The algorithm for the two-stage problem involves the solution of a deterministic linear program and a simple semidefinite program. The algorithm for the multi-stage problem involves the solution of a quadratically constrained convex programming problem.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:55</identifier><datestamp>2026-08-05T08:12:51Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>Nonlinear rescaling and proximal-like methods in convex optimization</dc:title>
  <dc:creator>Polyak, Roman</dc:creator>
  <dc:creator>Teboulle, Marc</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Convex optimization</dc:subject>
  <dc:subject>Nonlinear rescaling</dc:subject>
  <dc:subject>Modified barrier functions</dc:subject>
  <dc:subject>Augmented Lagrangians</dc:subject>
  <dc:subject>Proximal methods</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 76, Num. 2 (02 1997), p. 265-284</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/55</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:55</dc:identifier>
  <dc:identifier>urn:articleid:00255610v76n2p265</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>The nonlinear rescaling principle (NRP) consists of transforming the objective function and/or the constraints of a given constrained optimization problem into another problem which is equivalent to the original one in the sense that their optimal set of solutions coincides. A nonlinear transformation parameterized by a positive scalar parameter and based on a smooth scaling function is used to transform the constraints. The methods based on NRP consist of sequential unconstrained minimization of the classical Lagrangian for the equivalent problem, followed by an explicit formula updating the Lagrange multipliers. We first show that the NRP leads naturally to proximal methods with an entropy-like kernel, which is defined by the conjugate of the scaling function, and establish that the two methods are dually equivalent for convex constrained minimization problems. We then study the convergence properties of the nonlinear rescaling algorithm and the corresponding entropy-like proximal methods for convex constrained optimization problems. Special cases of the nonlinear rescaling algorithm are presented. In particular a new class of exponential penalty-modified barrier functions methods is introduced.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:56</identifier><datestamp>2026-08-05T08:12:51Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>Potential-reduction methods in mathematical programming</dc:title>
  <dc:creator>Todd, Michael J.</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Linear programming</dc:subject>
  <dc:subject>Potential functions</dc:subject>
  <dc:subject>Interior-point methods</dc:subject>
  <dc:subject>Self-concordant barriers</dc:subject>
  <dc:subject>Self-scaled barriers</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 76, Num. 1 (01 1997), p. 3-45</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/56</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:56</dc:identifier>
  <dc:identifier>urn:articleid:00255610v76n1p3</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>We provide a survey of interior-point methods for linear programming and its extensions that are based on reducing a suitable potential function at each iteration. We give a fairly complete overview of potential-reduction methods for linear programming, focusing on the possibility of taking long steps and the properties of the barrier function that are necessary for the analysis. We then describe briefly how the methods and results can be extended to certain convex programming problems, following the approach of Nesterov and Todd. We conclude with some open problems.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:57</identifier><datestamp>2026-08-05T08:12:51Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>Long-step strategies in interior-point primal-dual methods</dc:title>
  <dc:creator>Nesterov, Yu</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Nonlinear programming</dc:subject>
  <dc:subject>Conic problem</dc:subject>
  <dc:subject>Interior-point methods</dc:subject>
  <dc:subject>Self-concordant barrier</dc:subject>
  <dc:subject>Path-following methods</dc:subject>
  <dc:subject>Potential-reduction methods</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 76, Num. 1 (01 1997), p. 47-94</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/57</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:57</dc:identifier>
  <dc:identifier>urn:articleid:00255610v76n1p47</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>In this paper we analyze from a unique point of view the behavior of path-following and primal-dual potential reduction methods on nonlinear conic problems. We demonstrate that most interior-point methods with O(V~n ln(1/(Epsilon))) efficiency estimate can be considered as different strategies of minimizing a convex primal-dual potential function in an extended primal-dual space. Their efficiency estimate is a direct consequence of large local norm of the gradient of the potential function along a central path. It is shown that the neighborhood of this path is a region of the fastest decrease of the potential. Therefore the long-step path-following methods are, in a sense, the best potential-reduction strategies. We present three examples of such long-step strategies. We prove also an efficiency estimate for a pure primal-dual potential reduction method, which can be considered as an implementation of a penalty strategy based on a functional proximity measure. Using the convex primal dual potential, we prove efficiency estimates for Karmarkar-type and Dikin-type methods as applied to a homogeneous reformulation of the initial primal-dual problem.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:58</identifier><datestamp>2026-08-05T08:12:51Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>Fast convergence of the simplified largest step path following algorithm</dc:title>
  <dc:creator>Gonzaga, Clovis C.</dc:creator>
  <dc:creator>Bonnans, J. Frédéric</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Linear complementarity problem</dc:subject>
  <dc:subject>Primal-dual interior-point algorithm</dc:subject>
  <dc:subject>Convergence of algorithms</dc:subject>
  <dc:subject>Simplified Newton method</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 76, Num. 1 (01 1997), p. 95-115</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/58</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:58</dc:identifier>
  <dc:identifier>urn:articleid:00255610v76n1p95</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>Each master iteration of a simplified Newton algorithm for solving a system of equations starts by computing the Jacobian matrix and then uses this matrix in the computation of p Newton steps: the first of these steps is exact, and the other are called "simplified".In this paper we apply this approach to a large step path following algorithm for monotone linear complementarity problems. The resulting method generates sequences of objective values (duality gaps) that converge to zero with Q-order p + 1 in the number of master iterations, and with a complexity of O(V~nL) iterations.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:59</identifier><datestamp>2026-08-05T08:12:51Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>Improved complexity using higher-order correctors for primal-dual Dikin affine scaling</dc:title>
  <dc:creator>Jansen, Benjamin</dc:creator>
  <dc:creator>Roos, C.</dc:creator>
  <dc:creator>Terlaky, Tamás</dc:creator>
  <dc:creator>Ye, Y.</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Linear programming</dc:subject>
  <dc:subject>Interior-point algorithm</dc:subject>
  <dc:subject>Affine scaling</dc:subject>
  <dc:subject>Complexity</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 76, Num. 1 (01 1997), p. 117-130</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/59</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:59</dc:identifier>
  <dc:identifier>urn:articleid:00255610v76n1p117</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>In this paper we show that the primal-dual Dikin affine scaling algorithm for linear programming of Jansen, Roos and Terlaky enhances an asymptotical O(V~nL) complexity by using corrector steps. We also show that the result remains valid when the method is applied to positive semi-definite linear complementarity problems.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:60</identifier><datestamp>2026-08-05T08:12:51Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>Solving nonlinear multicommodity flow problems by the analytic center cutting plane method</dc:title>
  <dc:creator>Goffin, J.-L.</dc:creator>
  <dc:creator>Gondzio, Jacek</dc:creator>
  <dc:creator>Sarkissian, R.</dc:creator>
  <dc:creator>Vial, J.-P.</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Àlgebra</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 76, Num. 1 (01 1997), p. 131-154</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/60</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:60</dc:identifier>
  <dc:identifier>urn:articleid:00255610v76n1p131</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>The paper deals with nonlinear multicommodity flow problems with convex costs. A decomposition method is proposed to solve them. The approach applies a potential reduction algorithm to solve the master problem approximately and a column generation technique to define a sequence of primal linear programming problems. Each subproblem consists of finding a minimum cost flow between an origin and a destination node in an uncapacited network. It is thus formulated as a shortest path problem and solved with Dijkstra's d-heap algorithm. An implementation is described that takes full advantage of the supersparsity of the network in the linear algebra operations. Computational results show the efficiency of this approach on well-known nondifferentiable problems and also large scale randomly generated problems (up to 1000 arcs and 5000 commodities).</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:61</identifier><datestamp>2026-08-05T08:12:51Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>An infeasible interior-point algorithm for solving primal and dual geometric programs</dc:title>
  <dc:creator>Kortanek, K. O.</dc:creator>
  <dc:creator>Xiaojie, Xu</dc:creator>
  <dc:creator>Yinyu, Ye</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Geometric programming</dc:subject>
  <dc:subject>Convex analysis</dc:subject>
  <dc:subject>Infeasible primal-dual algorithm</dc:subject>
  <dc:subject>Duality</dc:subject>
  <dc:subject>Subfeasible solutions</dc:subject>
  <dc:subject>Numerical implementation</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 76, Num. 1 (01 1997), p. 155-181</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/61</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:61</dc:identifier>
  <dc:identifier>urn:articleid:00255610v76n1p155</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>In this paper an algorithm is presented for solving the classical posynomial geometric programming dual pair of problems simultaneously. The approach is by means of a primal-dual infeasible algorithm developed simultaneously for (i) the dual geometric program after logarithmic transformation of its objective function, and (ii) its Lagrangian dual program. Under rather general assumptions, the mechanism defines a primal-dual infeasible path from a specially constructed, perturbed Karush-Kuhn-Tucker system. Subfeasible solutions, as described by Duffin in 1956, are generated for each program whose primal and dual objective function values converge to the respective primal and dual program values. The basic technique is one of a predictor-corrector type involving Newton's method applied to the perturbed KKT system, coupled with effective techniques for choosing iterate directions and step lengths. We also discuss implementation issues and some sparse matrix factorizations that take advantage of the very special structure of the Hessian matrix of the logarithmically transformed dual objective function. Our computational results on 19 of the most challenging GP problems found in the literature are encouraging. The performance indicates that the algorithm is effective regardless of the degree of difficulty, which is a generally accepted measure in geometric programming.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:62</identifier><datestamp>2026-08-05T08:12:51Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>A QMR-based interior-point algorithm for solving linear programs</dc:title>
  <dc:creator>Freund, Roland W.</dc:creator>
  <dc:creator>Jarre, Florian</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Linear program</dc:subject>
  <dc:subject>Interior-point method</dc:subject>
  <dc:subject>Symmetric indefinite linear system</dc:subject>
  <dc:subject>Quasi-minimal residual iteration</dc:subject>
  <dc:subject>Indefinite preconditioner</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 76, Num. 1 (01 1997), p. 183-210</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/62</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:62</dc:identifier>
  <dc:identifier>urn:articleid:00255610v76n1p183</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>A new approach for the implementation of interior-point methods for solving linear programs is proposed. Its main feature is the iterative solution of the symmetric, but highly indefinite 2 × 2-block systems of linear equations that arise within the interior-point algorithm. These linear systems are solved by a symmetric variant of the quasi-minimal residual (QMR) algorithm, which is an iterative solver for general linear systems. The symmetric QMR algorithm can be combined with indefinite preconditioners, which is crucial for the efficient solution of highly indefinite linear systems, yet it still fully exploits the symmetry of the linear systems to be solved. To support the use of the symmetric QMR iteration, a novel stable reduction of the original unsymmetric 3 × 3-block systems to symmetric 2 × 2-block systems is introduced, and a measure for a low relative accuracy for the solution of these linear systems within the interior-point algorithm is proposed. Some indefinite preconditioners are discussed. Finally, we report results of a few preliminary numerical experiments to illustrate the features of the new approach.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:63</identifier><datestamp>2026-08-05T08:12:51Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>On homogeneous and self-dual algorithms for LCP</dc:title>
  <dc:creator>Yinyu, Ye</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Linear complementarity problem</dc:subject>
  <dc:subject>Homogeneous and self-dual model</dc:subject>
  <dc:subject>Infeasible-starting algorithm</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 76, Num. 1 (01 1997), p. 211-221</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/63</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:63</dc:identifier>
  <dc:identifier>urn:articleid:00255610v76n1p211</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>We present some generalizations of a homogeneous and self-dual linear programming (LP) algorithm to solving the monotone linear complementarity problem (LCP). Again, while it achieves the best known interior-point iteration complexity, the algorithm does not need to use any "big-M" number, and it detects LCP infeasibility by generating a certificate. To our knowledge, this is the first interior-point and infeasible-starting algorithm for the LCP with these desired features..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:64</identifier><datestamp>2026-08-05T08:12:51Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>Volumetric path following algorithms for linear programming</dc:title>
  <dc:creator>Anstreicher, Kurt M.</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Linear programming</dc:subject>
  <dc:subject>Path following</dc:subject>
  <dc:subject>Volumetric barrier</dc:subject>
  <dc:subject>Self-concordancy</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 76, Num. 1 (01 1997), p. 245-263</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/64</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:64</dc:identifier>
  <dc:identifier>urn:articleid:00255610v76n1p245</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>We consider the construction of small step path following algorithms using volumetric, and mixed volumetric-logarithmic, barriers. We establish quadratic convergence of a volumetric centering measure using pure Newton steps, enabling us to use relatively standard proof techniques for several subsequently needed results. Using a mixed volumetric-logarithmic barrier we obtain an O(n^1/4m^1/4L) iteration algorithm for linear programs with n variables and m inequality constraints, providing an alternative derivation for results first obtained by Vaidya and Atkinson. In addition, we show that the same iteration complexity can be attained while holding the work per iteration to O(n^2m), as opposed to O(nm^2), operations, by avoiding use of the true Hessian of the volumetric barrier. Our analysis also provides a simplified proof of self-concordancy of the volumetric and mixed volumetric-logarithmic barriers, originally due to Nesterov and Nemirovskii..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:65</identifier><datestamp>2026-08-05T08:12:51Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>A capacity scaling algorithm for convex cost submodular flows</dc:title>
  <dc:creator>Iwata, Satoru</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Submodular flow</dc:subject>
  <dc:subject>Polynomial algorithm</dc:subject>
  <dc:subject>Convex optimization</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 76, Num. 2 (02 1997), p. 299-308</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/65</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:65</dc:identifier>
  <dc:identifier>urn:articleid:00255610v76n2p299</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>This paper presents a scaling scheme for submodular functions. A small but strictly submodular function is added before scaling so that the resulting functions should be submodular. This scaling scheme leads to a weakly polynomial algorithm to solve minimum cost integral submodular flow problems with separable convex cost functions, provided that an oracle for exchange capacities is available..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:66</identifier><datestamp>2026-08-05T08:12:50Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>The largest step path following algorithm for monotone linear complementarity problems</dc:title>
  <dc:creator>Gonzaga, Clovis C.</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Linear complementarity problem</dc:subject>
  <dc:subject>Primal-dual interior-point algorithm</dc:subject>
  <dc:subject>Convergence of algorithms</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 76, Num. 2 (02 1997), p. 309-332</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/66</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:66</dc:identifier>
  <dc:identifier>urn:articleid:00255610v76n2p309</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>Path-following algorithms take at each iteration a Newton step for approaching a point on the central path, in such a way that all the iterates remain in a given neighborhood of that path. This paper studies the case in which each iteration uses a pure Newton step with the largest possible reduction in complementarity measure (duality gap).This algorithm is known to converge superlinearly in objective values. We show that with the addition of a computationally trivial safeguard it achieves Q-quadratic convergence, and show that this behaviour cannot be proved by usual techniques for the original method..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:67</identifier><datestamp>2026-08-05T08:12:50Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>Fractional and integral colourings</dc:title>
  <dc:creator>Kilakos, K.</dc:creator>
  <dc:creator>Marcotte, O.</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Graph colouring</dc:subject>
  <dc:subject>Chromatic number</dc:subject>
  <dc:subject>Stable set</dc:subject>
  <dc:subject>Integer rounding</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 76, Num. 2 (02 1997), p. 333-347</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/67</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:67</dc:identifier>
  <dc:identifier>urn:articleid:00255610v76n2p333</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:68</identifier><datestamp>2026-08-05T08:12:50Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>On the degree and separability of nonconvexity and applications to optimization problems</dc:title>
  <dc:creator>Thach, Phan Thien</dc:creator>
  <dc:creator>Konno, Hiroshi</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Generalized convexity</dc:subject>
  <dc:subject>Duality</dc:subject>
  <dc:subject>Optimization</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 77, Num. 1 (04 1997), p. 23-47</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/68</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:68</dc:identifier>
  <dc:identifier>urn:articleid:00255610v77n1p23</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>We study qualitative indications for d.c. representations of closed sets in and functions on Hilbert spaces. The first indication is an index of nonconvexity which can be regarded as a measure for the degree of nonconvexity. We show that a closed set is weakly closed if this indication is finite. Using this result we can prove the solvability of nonconvex minimization problems. By duality a minimization problem on a feasible set in which this indication is low, can be reduced to a quasi-concave minimization over a convex set in a low-dimensional space. The second indication is the separability which can be incorporated in solving dual problems. Both the index of nonconvexity and the separability can be characteristics to "good" d.c. representations. For practical computation we present a notion of clouds which enables us to obtain a good d.c. representation for a class of nonconvex sets. Using a generalized Caratheodory's theorem we present various applications of clouds..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:69</identifier><datestamp>2026-08-05T08:12:50Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>Computational Nonsmooth Optimization</dc:title>
  <dc:creator>Qi, Liqun</dc:creator>
  <dc:creator>Ruszczynski, Andrzej</dc:creator>
  <dc:creator>Womersley, Robert</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Anàlisi matemàtica</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 76, Num. 3 (03 1997), p. 351-352</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/69</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:69</dc:identifier>
  <dc:identifier>urn:articleid:00255610v76n3p351</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:70</identifier><datestamp>2026-08-05T08:12:50Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>Constraint aggregation principle in convex optimization</dc:title>
  <dc:creator>Ermoliev, Yuri M.</dc:creator>
  <dc:creator>Kryazhimskii, Arkadii V.</dc:creator>
  <dc:creator>Ruszczynski, Andrzej</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Nonsmooth optimization</dc:subject>
  <dc:subject>Surrogate constraints</dc:subject>
  <dc:subject>Subgradient methods</dc:subject>
  <dc:subject>Decomposition</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 76, Num. 3 (03 1997), p. 353-372</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/70</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:70</dc:identifier>
  <dc:identifier>urn:articleid:00255610v76n3p353</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>A general constraint aggregation technique is proposed for convex optimization problems. At each iteration a set of convex inequalities and linear equations is replaced by a single surrogate inequality formed as a linear combination of the original constraints. After solving the simplified subproblem, new aggregation coefficients are calculated and the iteration continues. This general aggregation principle is incorporated into a number of specific algorithms. Convergence of the new methods is proved and speed of convergence analyzed. Next, dual interpretation of the method is provided and application to decomposable problems is discussed. Finally, a numerical illustration is given..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:71</identifier><datestamp>2026-08-05T08:12:50Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>Separating plane algorithms for convex optimization</dc:title>
  <dc:creator>Nurminski, Evgeni A.</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Convex optimization</dc:subject>
  <dc:subject>Separating plane algorithms</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 76, Num. 3 (03 1997), p. 373-391</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/71</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:71</dc:identifier>
  <dc:identifier>urn:articleid:00255610v76n3p373</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>The equivalent formulation of a convex optimization problem is the computation of a value of a conjugate function at the origin. The latter can be achieved by approximation of the epigraph of the conjugate function around the origin and gradual refinement of the approximation. This yields a generic algorithm of convex optimization which transforms into some well-known techniques when certain strategies of approximation are employed. It also suggests new algorithmic approaches with promising computational experience and provides a uniform treatment of constrained and unconstrained optimization..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:72</identifier><datestamp>2026-08-05T08:12:50Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>Variable metric bundle methods : From conceptual to implementable forms</dc:title>
  <dc:creator>Lemaréchal, Claude</dc:creator>
  <dc:creator>Sagastizábal, Claudia</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Convex optimization</dc:subject>
  <dc:subject>Proximal point</dc:subject>
  <dc:subject>Bundle method</dc:subject>
  <dc:subject>Quasi-Newton</dc:subject>
  <dc:subject>Primary 65K05</dc:subject>
  <dc:subject>Secondary 90C30</dc:subject>
  <dc:subject>52A41</dc:subject>
  <dc:subject>90C25</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 76, Num. 3 (03 1997), p. 393-410</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/72</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:72</dc:identifier>
  <dc:identifier>urn:articleid:00255610v76n3p393</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>To minimize a convex function, we combine Moreau-Yosida regularizations, quasi-Newton matrices and bundling mechanisms. First we develop conceptual forms using "reversal" quasi-Newton formulae and we state their global and local convergence. Then, to produce implementable versions, we incorporate a bundle strategy together with a "curve-search". No convergence results are given for the implementable versions; however some numerical illustrations show their good behaviour even for large-scale problems..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:73</identifier><datestamp>2026-08-05T08:12:50Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>A preconditioning proximal Newton method for nondifferentiable convex optimization</dc:title>
  <dc:creator>Qi, Liqun</dc:creator>
  <dc:creator>Chen, Xiaojun</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Nondifferentiable convex optimization</dc:subject>
  <dc:subject>Proximal point</dc:subject>
  <dc:subject>Superlinear convergence</dc:subject>
  <dc:subject>Newton's method</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 76, Num. 3 (03 1997), p. 411-429</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/73</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:73</dc:identifier>
  <dc:identifier>urn:articleid:00255610v76n3p411</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>We propose a proximal Newton method for solving nondifferentiable convex optimization. This method combines the generalized Newton method with Rockafellar's proximal point algorithm. At each step, the proximal point is found approximately and the regularization matrix is preconditioned to overcome inexactness of this approximation. We show that such a preconditioning is possible within some accuracy and the second-order differentiability properties of the Moreau-Yosida regularization are invariant with respect to this preconditioning. Based upon these, superlinear convergence is established under a semismoothness condition..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:74</identifier><datestamp>2026-08-05T08:12:50Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>A trust region method for minimization of nonsmooth functions with linear constraints</dc:title>
  <dc:creator>Martínez, José Mario</dc:creator>
  <dc:creator>Moretti, Antonio Carlos</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Trust regions</dc:subject>
  <dc:subject>Nonsmooth functions</dc:subject>
  <dc:subject>Constrained optimization</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 76, Num. 3 (03 1997), p. 431-449</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/74</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:74</dc:identifier>
  <dc:identifier>urn:articleid:00255610v76n3p431</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>We introduce a trust region algorithm for minimization of nonsmooth functions with linear constraints. At each iteration, the objective function is approximated by a model function that satisfies a set of assumptions stated recently by Qi and Sun in the context of unconstrained nonsmooth optimization. The trust region iteration begins with the resolution of an "easy problem", as in recent works of Martínez and Santos and Friedlander, Martínez and Santos, for smooth constrained optimization. In practical implementations we use the infinity norm for defining the trust region, which fits well with the domain of the problem. We prove global convergence and report numerical experiments related to a parameter estimation problem..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:75</identifier><datestamp>2026-08-05T08:12:50Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>On piecewise quadratic Newton and trust region problems</dc:title>
  <dc:creator>Sun, J.</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Newton's method</dc:subject>
  <dc:subject>Nonsmooth optimization</dc:subject>
  <dc:subject>Piecewise quadratic programming</dc:subject>
  <dc:subject>Trust region problems</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 76, Num. 3 (03 1997), p. 451-467</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/75</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:75</dc:identifier>
  <dc:identifier>urn:articleid:00255610v76n3p451</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>Some recent algorithms for nonsmooth optimization require solutions to certain piecewise quadratic programming subproblems. Two types of subproblems are considered in this paper. The first type seeks the minimization of a continuously differentiable and strictly convex piecewise quadratic function subject to linear equality constraints. We prove that a nonsmooth version of Newton's method is globally and finitely convergent in this case. The second type involves the minimization of a possibly nonconvex and nondifferentiable piecewise quadratic function over a Euclidean ball. Characterizations of the global minimizer are studied under various conditions. The results extend a classical result on the trust region problem..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:76</identifier><datestamp>2026-08-05T08:12:50Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>Modified Newton methods for solving a semismooth reformulation of monotone complementary problems</dc:title>
  <dc:creator>Yamashita, Nobuo</dc:creator>
  <dc:creator>Fukushima, Masao</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Nonlinear complementarity problems</dc:subject>
  <dc:subject>Merit functions</dc:subject>
  <dc:subject>Generalized Newton method</dc:subject>
  <dc:subject>Semismooth functions</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 76, Num. 3 (03 1997), p. 469-491</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/76</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:76</dc:identifier>
  <dc:identifier>urn:articleid:00255610v76n3p469</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>In this paper, we propose a Newton-type method for solving a semismooth reformulation of monotone complementarity problems. In this method, a direction-finding subproblem, which is a system of linear equations, is uniquely solvable at each iteration. Moreover, the obtained search direction always affords a direction of sufficient decrease for the merit function defined as the squared residual for the semismooth equation equivalent to the complementarity problem. We show that the algorithm is globally convergent under some mild assumptions. Next, by slightly modifying the direction-finding problem, we propose another Newton-type method, which may be considered a restricted version of the first algorithm. We show that this algorithm has a superlinear, or possibly quadratic, rate of convergence under suitable assumptions. Finally, some numerical results are presented..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:77</identifier><datestamp>2026-08-05T08:12:50Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>A nonsmooth inexact Newton method for the solution of large-scale nonlinear complementarity problems</dc:title>
  <dc:creator>Facchinei, Francisco</dc:creator>
  <dc:creator>Kanzow, Christian</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Nonlinear complementarity problems</dc:subject>
  <dc:subject>Nonsmooth equations</dc:subject>
  <dc:subject>Inexact Newton methods</dc:subject>
  <dc:subject>Large-scale problems</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 76, Num. 3 (03 1997), p. 493-512</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/77</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:77</dc:identifier>
  <dc:identifier>urn:articleid:00255610v76n3p493</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>A new algorithm for the solution of large-scale nonlinear complementarity problems is introduced. The algorithm is based on a nonsmooth equation reformulation of the complementarity problem and on an inexact Levenberg-Marquardt-type algorithm for its solution. Under mild assumptions, and requiring only the approximate solution of a linear system at each iteration, the algorithm is shown to be both globally and superlinearly convergent, even on degenerate problems. Numerical results for problems with up to 10 000 variables are presented..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:78</identifier><datestamp>2026-08-05T08:12:50Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>Solution of monotone complementarity problems with locally Lipschitzian functions</dc:title>
  <dc:creator>Fischer, Andreas</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Complementarity problem</dc:subject>
  <dc:subject>Locally Lipschitzian function</dc:subject>
  <dc:subject>Monotone function</dc:subject>
  <dc:subject>Semismooth function</dc:subject>
  <dc:subject>Descent method</dc:subject>
  <dc:subject>Generalized Newton method</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 76, Num. 3 (03 1997), p. 513-532</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/78</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:78</dc:identifier>
  <dc:identifier>urn:articleid:00255610v76n3p513</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>The paper deals with complementarity problems CP(F), where the underlying function F is assumed to be locally Lipschitzian. Based on a special equivalent reformulation of CP(F) as a system of equations (Phi)(x) = 0 or as the problem of minimizing the merit function (psi) =1/2 ^ 2_2, we extend results which hold for sufficiently smooth functions F to the nonsmooth case.In particular, if F is monotone in a neighborhood of x, it is proved that 0 (E) ð(psi)(x) is necessary and sufficient for x to be a solution of CP(F). Moreover, for monotone functions F, a simple derivative-free algorithm that reduces (psi) is shown to possess global convergence properties. Finally the local behaviour of a generalized Newton method is analyzed. To this end, the result by Mifflin that the composition of semismooth functions is again semismooth is extended to p-order semismooth functions. Under a suitable regularity condition and if F is p-order semismooth the generalized Newton method is shown to be locally well defined and superlinearly convergent with the order of 1 + p.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:79</identifier><datestamp>2026-08-05T08:12:50Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>QPCOMP : A quadratic programming based solver for mixed complementarity problems</dc:title>
  <dc:creator>Billups, Stephen C.</dc:creator>
  <dc:creator>Ferris, Michael C.</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Complementarity problems</dc:subject>
  <dc:subject>Variational inequalities</dc:subject>
  <dc:subject>Proximal perturbations</dc:subject>
  <dc:subject>Pseudomonotonicity</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 76, Num. 3 (03 1997), p. 533-562</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/79</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:79</dc:identifier>
  <dc:identifier>urn:articleid:00255610v76n3p533</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>QPCOMP is an extremely robust algorithm for solving mixed nonlinear complementarity problems that has fast local convergence behavior. Based in part on the NE/SQP method of Pang and Gabriel, this algorithm represents a significant advance in robustness at no cost in efficiency. In particular, the algorithm is shown to solve any solvable Lipschitz continuous, continuously differentiable, pseudo-monotone mixed nonlinear complementarity problem. QPCOMP also extends the NE/SQP method for the nonlinear complementarity problem to the more general mixed nonlinear complementarity problem. Computational results are provided, which demonstrate the effectiveness of the algorithm..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:80</identifier><datestamp>2026-08-05T08:12:50Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>Implementation of a continuation method for normal maps</dc:title>
  <dc:creator>Sellami, Hichem</dc:creator>
  <dc:creator>Robinson, Stephen M.</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Variational inequality</dc:subject>
  <dc:subject>Generalized equation</dc:subject>
  <dc:subject>Normal map</dc:subject>
  <dc:subject>Continuation method</dc:subject>
  <dc:subject>Homotopy method</dc:subject>
  <dc:subject>Path-following</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 76, Num. 3 (03 1997), p. 563-578</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/80</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:80</dc:identifier>
  <dc:identifier>urn:articleid:00255610v76n3p563</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>This paper presents an implementation of a nonsmooth continuation method of which the idea was originally put forward by Alexander et al. We show how the method can be computationally implemented and present numerical results for variational inequality problems in up to 96 variables..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:81</identifier><datestamp>2026-08-05T08:12:50Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>Parametrizations of Kojima's system and relations to penalty and barrier functions</dc:title>
  <dc:creator>Kummer, Bernd</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Optimality condition</dc:subject>
  <dc:subject>Kojima's system</dc:subject>
  <dc:subject>Homotopy</dc:subject>
  <dc:subject>Nonsmooth equation</dc:subject>
  <dc:subject>Solvability</dc:subject>
  <dc:subject>Lipschitz-continuity</dc:subject>
  <dc:subject>Penalty and barrier function</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 76, Num. 3 (03 1997), p. 579-592</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/81</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:81</dc:identifier>
  <dc:identifier>urn:articleid:00255610v76n3p579</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>We investigate two homotopies that perturb Kojima's system for describing critical points of a nonlinear optimization problem in finite dimension. Each of them characterizes stationary points of a usual penalty and a new "barrier" function. The latter is a continuous deformation of the objective, symmetric to the penalty from a formal point of view. Stationary points of these functions appear as perturbed critical points and vice versa. This permits new interpretations of the related solution methods and allows estimates of the solutions by using implicit function theorems for Lipschitzian equations..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:82</identifier><datestamp>2026-08-05T08:12:49Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>Sensitivity analysis of composite piecewise smooth equations</dc:title>
  <dc:creator>Ralph, Daniel</dc:creator>
  <dc:creator>Scholtes, Stefan</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Sensitivity</dc:subject>
  <dc:subject>Composite</dc:subject>
  <dc:subject>Nonsmooth</dc:subject>
  <dc:subject>Piecewise affine</dc:subject>
  <dc:subject>Piecewise smooth</dc:subject>
  <dc:subject>Implicit function</dc:subject>
  <dc:subject>Lipschitzian homeomorphism</dc:subject>
  <dc:subject>Coherent orientation</dc:subject>
  <dc:subject>Complementarity problem</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 76, Num. 3 (03 1997), p. 593-612</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/82</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:82</dc:identifier>
  <dc:identifier>urn:articleid:00255610v76n3p593</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>This paper is a contribution to the sensitivity analysis of piecewise smooth equations. A piecewise smooth function is a Lipschitzian homeomorphism near a given point if and only if it is coherently oriented and has an invertible B-derivative at this point. We emphasise the role of functions of the type f = g ° h where g is piecewise smooth and h is smooth and present verifiable conditions which ensure that the function f = g ° h is a Lipschitzian homeomorphism near a given point for every h sufficiently close to h with respect to the C^1-topology..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:83</identifier><datestamp>2026-08-05T08:12:49Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>On the 0/1 knapsack polytope</dc:title>
  <dc:creator>Weismantel, Robert</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Complete description</dc:subject>
  <dc:subject>Facets</dc:subject>
  <dc:subject>Knapsack polytope</dc:subject>
  <dc:subject>Knapsack problem</dc:subject>
  <dc:subject>Pseudo polynomial time</dc:subject>
  <dc:subject>Separation</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 77, Num. 1 (04 1997), p. 49-68</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/83</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:83</dc:identifier>
  <dc:identifier>urn:articleid:00255610v77n1p49</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>This paper deals with the 0/1 knapsack polytope. In particular, we introduce the class of weight inequalities. This class of inequalities is needed to describe the knapsack polyhedron when the weights of the items lie in certain intervals. A generalization of weight inequalities yields the so-called "weight-reduction principle" and the class of extended weight inequalities. The latter class of inequalities includes minimal cover and (1, k)-configuration inequalities. The properties of lifted minimal cover inequalities are extended to this general class of inequalities..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:84</identifier><datestamp>2026-08-05T08:12:49Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>Non-monotone trust-region algorithms for nonlinear optimization subject to convex constraints</dc:title>
  <dc:creator>Toint, Philippe L.</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Non-monotone algorithms</dc:subject>
  <dc:subject>Trust regions</dc:subject>
  <dc:subject>Convex constraints</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 77, Num. 1 (04 1997), p. 69-94</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/84</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:84</dc:identifier>
  <dc:identifier>urn:articleid:00255610v77n1p69</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>This paper presents two new trust-region methods for solving nonlinear optimization problems over convex feasible domains. These methods are distinguished by the fact that they do not enforce strict monotonicity of the objective function values at successive iterates. The algorithms are proved to be convergent to critical points of the problem from any starting point. Extensive numerical experiments show that this approach is competitive with the LANCELOT package..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:85</identifier><datestamp>2026-08-05T08:12:49Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>On the worst case complexity of potential reduction algorithms for linear programming</dc:title>
  <dc:creator>Bertsimas, Dimitris</dc:creator>
  <dc:creator>Xiaodong, Luo</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Interior point methods</dc:subject>
  <dc:subject>Lower bounds on complexity</dc:subject>
  <dc:subject>Potential reduction algorithms</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 77, Num. 3 (06 1997), p. 321-333</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/85</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:85</dc:identifier>
  <dc:identifier>urn:articleid:00255610v77n3p321</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>There are several classes of interior point algorithms that solve linear programming problems in O(V~nL) iterations. Among them, several potential reduction algorithms combine both theoretical (O(V~nL) iterations) and practical efficiency as they allow the flexibility of line searches in the potential function, and thus can lead to practical implementations. It is a significant open question whether interior point algorithms can lead to better complexity bounds. In the present paper we give some negative answers to this question for the class of potential reduction algorithms. We show that, even if we allow line searches in the potential function, and even for problems that have network structure, the bound O(V~nL) is tight for several potential reduction algorithms, i.e., there is a class of examples with network structure, in which the algorithms need at least (Omega) (V~nL) iterations to find an optimal solution..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:86</identifier><datestamp>2026-08-05T08:12:49Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>Two generalizations of Dykstra's cyclic projections algorithm</dc:title>
  <dc:creator>Hundal, Hein</dc:creator>
  <dc:creator>Deutsch, Frank</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Dykstra's algorithm</dc:subject>
  <dc:subject>Cyclic projections</dc:subject>
  <dc:subject>Successive approximation</dc:subject>
  <dc:subject>Convex feasibility</dc:subject>
  <dc:subject>Alternating projections</dc:subject>
  <dc:subject>Best approximation</dc:subject>
  <dc:subject>Hildreth's algorithm</dc:subject>
  <dc:subject>Finite element method</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 77, Num. 3 (06 1997), p. 335-355</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/86</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:86</dc:identifier>
  <dc:identifier>urn:articleid:00255610v77n3p335</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>Dykstra's cyclic projections algorithm allows one to compute best approximations to any pointx in a Hilbert space from the intersection C = (intersection)^r_1 C_i of a finite number of closed convex sets C_i, by reducing it to a sequence of best approximation problems from the individual sets C_i. Here we present two generalizations of this algorithm. First we allow the number of sets C_i to be infinite rather than finite; secondly, we allow a random, rather than cyclic, ordering of the sets C_i..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:87</identifier><datestamp>2026-08-05T08:12:49Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>Variation of cost functions in integer programming</dc:title>
  <dc:creator>Sturmfels, Bernd</dc:creator>
  <dc:creator>Thomas, Rekha R.</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Programació (Matemàtica)</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 77, Num. 3 (06 1997), p. 357-387</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/87</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:87</dc:identifier>
  <dc:identifier>urn:articleid:00255610v77n3p357</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>We study the problem of minimizing c · x subject to A · x = b, x &gt;= 0 and x integral, for a fixed matrix A. Two cost functions c and c' are considered equivalent if they give the same optimal solutions for each b. We construct a polytope St(A) whose normal cones are the equivalence classes. Explicit inequality presentations of these cones are given by the reduced Gröbner bases associated with A. The union of the reduced Gröbner bases as c varies (called the universal Gröbner basis) consists precisely of the edge directions of St(A). We present geometric algorithms for computing St(A), the Graver basis, and the universal Gröbner basis..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:88</identifier><datestamp>2026-08-05T08:12:49Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>A dual-active-set algorithm for positive semi-definite quadratic programming</dc:title>
  <dc:creator>Boland, N. L.</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Quadratic programming</dc:subject>
  <dc:subject>Positive semi-definite</dc:subject>
  <dc:subject>Convex optimization</dc:subject>
  <dc:subject>Active-set method</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 78, Num. 1 (07 1997), p. 1-27</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/88</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:88</dc:identifier>
  <dc:identifier>urn:articleid:00255610v78n1</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>Because of the many important applications of quadratic programming, fast and efficient methods for solving quadratic programming problems are valued. Goldfarb and Idnani (1983) describe one such method. Well known to be efficient and numerically stable, the Goldfarb and Idnani method suffers only from the restriction that in its original form it cannot be applied to problems which are positive semi-definite rather than positive definite. In this paper, we present a generalization of the Goldfarb and Idnani method to the positive semi-definite case and prove finite termination of the generalized algorithm. In our generalization, we preserve the spirit of the Goldfarb and Idnani method, and extend their numerically stable implementation in a natural way..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:89</identifier><datestamp>2026-08-05T08:12:49Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>Wheel inequalities for stable set polytopes</dc:title>
  <dc:creator>Cheng, Eddie</dc:creator>
  <dc:creator>Cunningham, William H.</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Matemàtica</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 77, Num. 3 (06 1997), p. 389-421</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/89</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:89</dc:identifier>
  <dc:identifier>urn:articleid:00255610v77n3p389</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>We introduce new classes of valid inequalities, called wheel inequalities, for the stable set polytope P_G of a graph G. Each "wheel configuration" gives rise to two such inequalities. The simplest wheel configuration is an "odd" subdivision W of a wheel, and for these we give necessary and sufficient conditions for the wheel inequality to be facet-inducing for P_W. Generalizations arise by allowing subdivision paths to intersect, and by replacing the "hub" of the wheel by a clique. The separation problem for these inequalities can be solved in polynomial time..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:90</identifier><datestamp>2026-08-05T08:12:49Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>Equilibrium programming using proximal-like algorithms</dc:title>
  <dc:creator>Flå, Sjur Didrik</dc:creator>
  <dc:creator>Antipin, Anatoly S.</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Equilibrium problems</dc:subject>
  <dc:subject>Convex programming</dc:subject>
  <dc:subject>Saddle problems</dc:subject>
  <dc:subject>Non-cooperative games</dc:subject>
  <dc:subject>Variational inequalities</dc:subject>
  <dc:subject>Quasi-monotonicity</dc:subject>
  <dc:subject>Proximal point algorithms</dc:subject>
  <dc:subject>Bregman distances</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 78, Num. 1 (07 1997), p. 29-41</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/90</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:90</dc:identifier>
  <dc:identifier>urn:articleid:00255610v78n1p29</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>We compute constrained equilibria satisfying an optimality condition. Important examples include convex programming, saddle problems, noncooperative games, and variational inequalities. Under a monotonicity hypothesis we show that equilibrium solutions can be found via iterative convex minimization. In the main algorithm each stage of computation requires two proximal steps, possibly using Bregman functions. One step serves to predict the next point; the other helps to correct the new prediction. To enhance practical applicability we tolerate numerical errors..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:91</identifier><datestamp>2026-08-05T08:12:49Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>Fast deterministic approximation for the multicommodity flow problem</dc:title>
  <dc:creator>Radzik, Tomasz</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Network flow</dc:subject>
  <dc:subject>Multicommodity flow</dc:subject>
  <dc:subject>Concurrent flow</dc:subject>
  <dc:subject>Approximate solution</dc:subject>
  <dc:subject>Network optimization</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 78, Num. 1 (07 1997), p. 43-58</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/91</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:91</dc:identifier>
  <dc:identifier>urn:articleid:00255610v78n1p43</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>In this paper we consider an optimization version of the multicommodity flow problem which is known as the maximum concurrent flow problem. We show that an approximate solution to this problem can be computed deterministically using O (k((Epsilon)^-2 + log k) log n) 1-commodity minimum-cost flow computations, where k is the number of commodities, n is the number of nodes, and (Epsilon) is the desired precision. We obtain this bound by proving that in the randomized algorithm developed by Leighton et al. (1995) the random selection of commodities can be replaced by the deterministic round-robin without increasing the total running time. Our bound significantly improves the previously known deterministic upper bounds and matches the best known randomized upper bound for the approximation concurrent flow problem..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:92</identifier><datestamp>2026-08-05T08:12:49Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>On the monotonization of polyhedra</dc:title>
  <dc:creator>Balas, Egon</dc:creator>
  <dc:creator>Fischetti, Matteo</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Polyhedral combinatorics</dc:subject>
  <dc:subject>Monotone polyhedra</dc:subject>
  <dc:subject>Submissive</dc:subject>
  <dc:subject>Dominant</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 78, Num. 1 (07 1997), p. 59-84</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/92</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:92</dc:identifier>
  <dc:identifier>urn:articleid:00255610v78n1p59</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>In polyhedral combinatorics one often has to analyze the facial structure of less than full dimensional polyhedra. The presence of implicit or explicit equations in the linear system defining such a polyhedron leads to technical difficulties when analyzing its facial structure. It is therefore customary to approach the study of such a polytope P through the study of one of its (full dimensional) relaxations (monotonizations) known as the submissive and the dominant of P. Finding sufficient conditions for an inequality that induces a facet of the submissive or the dominant of a polyhedron to also induce a facet of the polyhedron itself has been posed in the literature as an important research problem. Our paper goes a long way towards solving this problem. We address the problem in the framework of a generalized monotonization of a polyhedron P, g-mon (P), that subsumes both the submissive and the dominant, and give a sufficient condition for an inequality that defines a facet of g-mon(P) to define a facet of P. For the important cases of the traveling salesman (TS) polytope in both its symmetric and asymmetric variants, and of the linear ordering polytope, we give sufficient conditions trivially easy to verify, for a facet of the monotone completion to define a facet of the original polytope itself..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:93</identifier><datestamp>2026-08-05T08:12:49Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>Pseudomonotone variational inequality problems : Existence of solutions</dc:title>
  <dc:creator>Crouzeix, Jean-Pierre</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Variational inequality problems</dc:subject>
  <dc:subject>Existence of solutions</dc:subject>
  <dc:subject>Linear complementarity</dc:subject>
  <dc:subject>Pseudomonotone operators</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 78, Num. 3 (09 1997), p. 305-314</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/93</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:93</dc:identifier>
  <dc:identifier>urn:articleid:00255610v78n3p305</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>Necessary and sufficient conditions for the set of solutions of a pseudomonotone variational inequality problem to be nonempty and compact are given..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:94</identifier><datestamp>2026-08-05T08:12:48Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>Complexity analysis of the analytic center cutting plane method that uses multiple cuts</dc:title>
  <dc:creator>Ye, Yinyu</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Convex feasibility problem</dc:subject>
  <dc:subject>Analytic center</dc:subject>
  <dc:subject>Potential reduction</dc:subject>
  <dc:subject>Column generation</dc:subject>
  <dc:subject>Cutting planes</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 78, Num. 1 (07 1997), p. 85-104</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/94</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:94</dc:identifier>
  <dc:identifier>urn:articleid:00255610v78n1p85</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>We analyze the complexity of the analytic center cutting plane or column generation algorithm for solving general convex problems defined by a separation oracle. The oracle is called at the analytic center of a polytope, which contains a solution set and is given by the intersection of the linear inequalities previously generated from the oracle. If the center is not in the solution set, separating hyperplanes will be placed through the center to shrink the containing polytope. While the complexity result has been recently established for the algorithm when one cutting plane is placed in each iteration, the result remains open when multiple cuts are added. Moreover, adding multiple cuts actually is a key to practical effectiveness in solving many problems and it presents theoretical difficulties in analyzing cutting plane methods. In this paper, we show that the analytic center cutting plane algorithm, with multiple cuts added in each iteration, still is a fully polynomial approximation algorithm..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:95</identifier><datestamp>2026-08-05T08:12:48Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems</dc:title>
  <dc:creator>Jansen, Benjamin</dc:creator>
  <dc:creator>Roos, Kees</dc:creator>
  <dc:creator>Terlaky, Tamás</dc:creator>
  <dc:creator>Yoshise, Akiko</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Complementarity problems</dc:subject>
  <dc:subject>Interior point methods</dc:subject>
  <dc:subject>Primal-dual affine scaling methods</dc:subject>
  <dc:subject>Smoothness conditions</dc:subject>
  <dc:subject>Polynomial-time convergence</dc:subject>
  <dc:subject>Global convergence</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 78, Num. 3 (09 1997), p. 315-345</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/95</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:95</dc:identifier>
  <dc:identifier>urn:articleid:00255610v78n3p315</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>This paper provides an analysis of the polynomiality of primal-dual interior point algorithms for nonlinear complementarity problems using a wide neighborhood. A condition for the smoothness of the mapping is used, which is related to Zhu's scaled Lipschitz condition, but is also applicable to mappings that are not monotone. We show that a family of primal-dual affine scaling algorithms generates an approximate solution (given a precision (Epsilon)) of the nonlinear complementarity problem in a finite number of iterations whose order is a polynomial of n, ln(1/(Epsilon)) and a condition number. If the mapping is linear then the results in this paper coincide with the ones in Jansen et al., SIAM Journal on Optimization 7 (1997) 126-140..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:96</identifier><datestamp>2026-08-05T08:12:48Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>Equivalence of variational inequality problems to unconstrained minimization</dc:title>
  <dc:creator>Peng, Ji-Ming</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Variational inequality problem</dc:subject>
  <dc:subject>Complementarity problem</dc:subject>
  <dc:subject>Unconstrained optimization</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 78, Num. 3 (09 1997), p. 347-355</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/96</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:96</dc:identifier>
  <dc:identifier>urn:articleid:00255610v78n3p347</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>In this paper we propose a class of merit functions for variational inequality problems (VI). Through these merit functions, the variational inequality problem is cast as unconstrained minimization problem. We estimate the growth rate of these merit functions and give conditions under which the stationary points of these functions are the solutions of VI..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:97</identifier><datestamp>2026-08-05T08:12:48Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>Tradeoff directions in multiobjective optimization problems</dc:title>
  <dc:creator>Henig, Mordechai I.</dc:creator>
  <dc:creator>Buchanan, John T.</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Multiple objective programming</dc:subject>
  <dc:subject>Tradeoff directions</dc:subject>
  <dc:subject>Pareto optimal</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 78, Num. 3 (09 1997), p. 357-374</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/97</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:97</dc:identifier>
  <dc:identifier>urn:articleid:00255610v78n3p357</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>Multiobjective optimization problems (MOP) typically have conflicting objectives wherein a gain in one objective is at the expense of another. Tradeoff directions, which measure the change in some objectives relative to changes in others, provide important information as to the best direction of improvement from the current solution. In this paper we present a general definition of tradeoffs as a cone of directions and provide a general method of calculating tradeoffs at every Pareto optimal point of a convex MOP. This extends current definitions of tradeoffs which assume certain conditions on the feasible set and the objective functions. Two comprehensive numerical examples are provided to illustrate the tradeoff directions and the methods used to calculate them..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:98</identifier><datestamp>2026-08-05T08:12:48Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>Complementarity and nondegeneracy in semidefinite programming</dc:title>
  <dc:creator>Alizadeh, Farid</dc:creator>
  <dc:creator>Haeberly, Jean-Pierre A.</dc:creator>
  <dc:creator>Overton, Michael L.</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Programació (Matemàtica)</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 77, Num. 2 (05 1997), p. 111-128</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/98</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:98</dc:identifier>
  <dc:identifier>urn:articleid:00255610v77n2p111</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>Primal and dual nondegeneracy conditions are defined for semidefinite programming. Given the existence of primal and dual solutions, it is shown that primal nondegeneracy implies a unique dual solution and that dual nondegeneracy implies a unique primal solution. The converses hold if strict complementarity is assumed. Primal and dual nondegeneracy assumptions do not imply strict complementarity, as they do in LP. The primal and dual nondegeneracy assumptions imply a range of possible ranks for primal and dual solutions X and Z. This is in contrast with LP where nondegeneracy assumptions exactly determine the number of variables which are zero. It is shown that primal and dual nondegeneracy and strict complementarity all hold generically. Numerical experiments suggest probability distributions for the ranks of X and Z which are consistent with the nondegeneracy conditions..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:99</identifier><datestamp>2026-08-05T08:12:48Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>A semidefinite framework for trust region subproblems with applications to large scale minimization</dc:title>
  <dc:creator>Rendl, Franz</dc:creator>
  <dc:creator>Wolkowicz, Henry</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Trust region subproblems</dc:subject>
  <dc:subject>Parametric programming</dc:subject>
  <dc:subject>Semidefinite programming</dc:subject>
  <dc:subject>Min-max eigenvalue problems</dc:subject>
  <dc:subject>Large scale minimization</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 77, Num. 2 (05 1997), p. 273-299</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/99</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:99</dc:identifier>
  <dc:identifier>urn:articleid:00255610v77n2p273</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>Primal-dual pairs of semidefinite programs provide a general framework for the theory and algorithms for the trust region subproblem (TRS). This latter problem consists in minimizing a general quadratic function subject to a convex quadratic constraint and, therefore, it is a generalization of the minimum eigenvalue problem. The importance of (TRS) is due to the fact that it provides the step in trust region minimization algorithms. The semidefinite framework is studied as an interesting instance of semidefinite programming as well as a tool for viewing known algorithms and deriving new algorithms for (TRS). In particular, a dual simplex type method is studied that solves (TRS) as a parametric eigenvalue problem. This method uses the Lanczos algorithm for the smallest eigenvalue as a black box. Therefore, the essential cost of the algorithm is the matrix-vector multiplication and, thus, sparsity can be exploited. A primal simplex type method provides steps for the so-called hard case. Extensive numerical tests for large sparse problems are discussed. These tests show that the cost of the algorithm is 1 + (alpha)(n) times the cost of finding a minimum eigenvalue using the Lanczos algorithm, where 0 &lt; (alpha)(n) &lt; 1 is a fraction which decreases as the dimension increases..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:100</identifier><datestamp>2026-08-05T08:12:48Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>First and second order analysis of nonlinear semidefinite programs</dc:title>
  <dc:creator>Shapiro, Alexander</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Semidefinite programming</dc:subject>
  <dc:subject>Cone constraints</dc:subject>
  <dc:subject>Convex programming</dc:subject>
  <dc:subject>Duality</dc:subject>
  <dc:subject>Second-order optimality conditions</dc:subject>
  <dc:subject>Tangent cones</dc:subject>
  <dc:subject>Optimal value function</dc:subject>
  <dc:subject>Sensitivity analysis</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 77, Num. 2 (05 1997), p. 301-320</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/100</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:100</dc:identifier>
  <dc:identifier>urn:articleid:00255610v77n2p301</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>In this paper we study nonlinear semidefinite programming problems. Convexity, duality and first-order optimality conditions for such problems are presented. A second-order analysis is also given. Second-order necessary and sufficient optimality conditions are derived. Finally, sensitivity analysis of such programs is discussed..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:101</identifier><datestamp>2026-08-05T08:12:48Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>An exact duality theory for semidefinite programming and its complexity implications</dc:title>
  <dc:creator>Ramana, Motakuri V.</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Semidefinite programming</dc:subject>
  <dc:subject>Strong duality</dc:subject>
  <dc:subject>Complexity classes</dc:subject>
  <dc:subject>Theorems of the alternative</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 77, Num. 2 (05 1997), p. 129-162</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/101</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:101</dc:identifier>
  <dc:identifier>urn:articleid:00255610v77n2p129</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>In this paper, an exact dual is derived for Semidefinite Programming (SDP), for which strong duality properties hold without any regularity assumptions. Its main features are: (i) The new dual is an explicit semidefinite program with polynomially many variables and polynomial size coefficient bitlengths. (ii) If the primal is feasible, then it is bounded if and only if the dual is feasible. (iii) When the primal is feasible and bounded, then its optimum value equals that of the dual, or in other words, there is no duality gap. Further, the dual attains this common optimum value. (iv) It yields a precise theorem of the alternative for semidefinite inequality systems, i.e. a characterization of the infeasibility of a semidefinite inequality in terms of the feasibility of another polynomial size semidefinite inequality.The standard duality for linear programming satisfies all of the above features, but no such explicit gap-free dual program of polynomial size was previously known for SDP, without Slater-like conditions being assumed. The dual is then applied to derive certain complexity results for SDP. The decision problem of Semidefinite Feasibility (SDFP), which asks to determine if a given semidefinite inequality system is feasible, is the central problem of interest. he complexity of SDFP is unknown, but we show the following: (i) In the Turing machine model, the membership or nonmembership of SDFP in NP and Co-NP is simultaneous; hence SDFP is not NP-Complete unless NP = Co-NP. (ii) In the real number model of Blum, Shub and Smale, SDFP is in NPBigCo-NP..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:102</identifier><datestamp>2026-08-05T08:12:48Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>The long-step method of analytic centers for fractional problems</dc:title>
  <dc:creator>Nemirovski, A.</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Fractional programming</dc:subject>
  <dc:subject>Generalized eigenvalue problem</dc:subject>
  <dc:subject>Interior point methods</dc:subject>
  <dc:subject>Analytic centers</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 77, Num. 2 (05 1997), p. 191-224</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/102</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:102</dc:identifier>
  <dc:identifier>urn:articleid:00255610v77n2p191</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>We develop a long-step surface-following version of the method of analytic centers for the fractional-linear problem min {t_0 t_0B(x) - A(x) (is in) H,B (x) (is in) K, x (is in) G}, where H is a closed convex domain, K is a convex cone contained in the recessive cone of H, G is a convex domain and B(·), A(·) are affine mappings. Tracing a two-dimensional surface of analytic centers rather than the usual path of centers allows to skip the initial "centering" phase of the path-following scheme. The proposed long-step policy of tracing the surface fits the best known overall polynomial-time complexity bounds for the method and, at the same time, seems to be more attractive computationally than the short-step policy, which was previously the only one giving good complexity bounds.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:103</identifier><datestamp>2026-08-05T08:12:48Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>Connections between semidefinite relaxations of the max-cut and stable set problems</dc:title>
  <dc:creator>Laurent, Monique</dc:creator>
  <dc:creator>Poljak, Svatopluk</dc:creator>
  <dc:creator>Rendl, Franz</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Max-cut problem</dc:subject>
  <dc:subject>Stable set problem</dc:subject>
  <dc:subject>Semidefinite relaxations</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 77, Num. 2 (05 1997), p. 225-246</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/103</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:103</dc:identifier>
  <dc:identifier>urn:articleid:00255610v77n2p225</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>We describe links between a recently introduced semidefinite relaxation for the max-cut problem and the well known semidefinite relaxation for the stable set problem underlying the Lovász's theta function. It turns out that the connection between the convex bodies defining the semidefinite relaxations mimics the connection existing between the corresponding polyhedra. We also show how the semidefinite relaxations can be combined with the classical linear relaxations in order to obtain tighter relaxations..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:104</identifier><datestamp>2026-08-05T08:12:48Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>The Projective Method for solving linear matrix inequalities</dc:title>
  <dc:creator>Gahinet, Pascal</dc:creator>
  <dc:creator>Nemirovski, Arkadi</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Linear matrix inequalities</dc:subject>
  <dc:subject>Semidefinite programming</dc:subject>
  <dc:subject>Interior point methods</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 77, Num. 2 (05 1997), p. 163-190</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/104</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:104</dc:identifier>
  <dc:identifier>urn:articleid:00255610v77n2p163</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>Numerous problems in control and systems theory can be formulated in terms of linear matrix inequalities (LMI). Since solving an LMI amounts to a convex optimization problem, such formulations are known to be numerically tractable. However, the interest in LMI-based design techniques has really surged with the introduction of efficient interior-point methods for solving LMIs with a polynomial-time complexity. This paper describes one particular method called the Projective Method. Simple geometrical arguments are used to clarify the strategy and convergence mechanism of the Projective algorithm. A complexity analysis is provided, and applications to two generic LMI problems (feasibility and linear objective minimization) are discussed..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:105</identifier><datestamp>2026-08-05T08:12:48Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>A cone programming approach to the bilinear matrix inequality problem and its geometry</dc:title>
  <dc:creator>Mesbahi, Mehran</dc:creator>
  <dc:creator>Papavassilopoulos, George P.</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Bilinear matrix inequalities</dc:subject>
  <dc:subject>Linear complementarity problem over cones</dc:subject>
  <dc:subject>Linear programming over cones</dc:subject>
  <dc:subject>Robust control</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 77, Num. 2 (05 1997), p. 247-272</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/105</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:105</dc:identifier>
  <dc:identifier>urn:articleid:00255610v77n2p247</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>We discuss an approach for solving the Bilinear Matrix Inequality (BMI) based on its connections with certain problems defined over matrix cones. These problems are, among others, the cone generalization of the linear programming (LP) and the linear complementarity problem (LCP) (referred to as the Cone-LP and the Cone-LCP, respectively). Specifically, we show that solving a given BMI is equivalent to examining the solution set of a suitably constructed Cone-LP or Cone-LCP. This approach facilitates our understanding of the geometry of the BMI and opens up new avenues for the development of the computational procedures for its solution..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:106</identifier><datestamp>2026-08-05T08:12:47Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>A globally convergent version of the Polak-Ribière conjugate gradient method</dc:title>
  <dc:creator>Grippo, L.</dc:creator>
  <dc:creator>Lucidi, S.</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Unconstrained optimization</dc:subject>
  <dc:subject>Conjugate gradient method</dc:subject>
  <dc:subject>Polak-Ribière method</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 78, Num. 3 (09 1997), p. 375-391</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/106</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:106</dc:identifier>
  <dc:identifier>urn:articleid:00255610v78n3p375</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>In this paper we propose a new line search algorithm that ensures global convergence of the Polak-Ribière conjugate gradient method for the unconstrained minimization of nonconvex differentiable functions. In particular, we show that with this line search every limit point produced by the Polak-Ribière iteration is a stationary point of the objective function. Moreover, we define adaptive rules for the choice of the parameters in a way that the first stationary point along a search direction can be eventually accepted when the algorithm is converging to a minimum point with positive definite Hessian matrix. Under strong convexity assumptions, the known global convergence results can be reobtained as a special case. From a computational point of view, we may expect that an algorithm incorporating the step-size acceptance rules proposed here will retain the same good features of the Polak-Ribière method, while avoiding pathological situations..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:107</identifier><datestamp>2026-08-05T08:12:47Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>Semidefinite Programming</dc:title>
  <dc:creator>Overton, Michael L.</dc:creator>
  <dc:creator>Wolkowicz, Henry</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Programació (Matemàtica)</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 77, Num. 2 (05 1997), p. 105-109</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/107</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:107</dc:identifier>
  <dc:identifier>urn:articleid:00255610v77n2p105</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:109</identifier><datestamp>2026-08-05T08:12:47Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>Network Optimization : Algorithms and Applications</dc:title>
  <dc:creator>Gallo, Giorgio</dc:creator>
  <dc:creator>Grigoriadis, M. D.</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Matemàtica</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 78, Num. 2 (08 1997), p. 105-108</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/109</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:109</dc:identifier>
  <dc:identifier>urn:articleid:00255610v78n2p105</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:110</identifier><datestamp>2026-08-05T08:12:47Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>A polynomial time primal network simplex algorithm for minimum cost flows</dc:title>
  <dc:creator>Orlin, James B.</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Minimum cost flows</dc:subject>
  <dc:subject>Network simplex</dc:subject>
  <dc:subject>Polynomial time</dc:subject>
  <dc:subject>Simplex algorithm</dc:subject>
  <dc:subject>Premultipliers</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 78, Num. 2 (08 1997), p. 109-129</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/110</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:110</dc:identifier>
  <dc:identifier>urn:articleid:00255610v78n2p109</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>Developing a polynomial time primal network simplex algorithm for the minimum cost flow problem has been a long standing open problem. In this paper, we develop one such algorithm that runs in O(min(n^2m log nC, n^2m^2 log n)) time, where n is the number of nodes in the network, m is the number of arcs, and C denotes the maximum absolute arc costs if arc costs are integer and (infin) otherwise. We first introduce a pseudopolynomial variant of the network simplex algorithm called the "premultiplier algorithm". We then develop a cost-scaling version of the premultiplier algorithm that solves the minimum cost flow problem in O(min(nm log nC, nm^2 log n)) pivots. With certain simple data structures, the average time per pivot can be shown to be O(n). We also show that the diameter of the network polytope is O(nm log n)..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:111</identifier><datestamp>2026-08-05T08:12:47Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>A new strongly polynomial dual network simplex algorithm</dc:title>
  <dc:creator>Armstrong, Ronald D.</dc:creator>
  <dc:creator>Jin, Zhiying</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Dual simplex algorithm</dc:subject>
  <dc:subject>Minimum cost network flow problem</dc:subject>
  <dc:subject>Network simplex algorithm</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 78, Num. 2 (08 1997), p. 131-148</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/111</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:111</dc:identifier>
  <dc:identifier>urn:articleid:00255610v78n2p131</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>This paper presents a new dual network simplex algorithm for the minimum cost network flow problem. The algorithm works directly on the original capacitated network and runs in O(mn(m + n log n) log n) time for the network with n nodes and m arcs. This complexity is better than the complexity of Orlin, Plotkin and Tardos' (1993) dual network simplex algorithm by a factor of m/n..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:112</identifier><datestamp>2026-08-05T08:12:47Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>A new pivot selection rule for the network simplex algorithm</dc:title>
  <dc:creator>Sokkalingam, P. T.</dc:creator>
  <dc:creator>Sharma, Prabha</dc:creator>
  <dc:creator>Ahuja, Ravindra K.</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Networks</dc:subject>
  <dc:subject>Simplex algorithm</dc:subject>
  <dc:subject>Minimum cost flow problem</dc:subject>
  <dc:subject>Assignment problem</dc:subject>
  <dc:subject>Shortest path problem</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 78, Num. 2 (08 1997), p. 149-158</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/112</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:112</dc:identifier>
  <dc:identifier>urn:articleid:00255610v78n2p149</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>We present a new network simplex pivot selection rule, which we call the minimum ratio pivot rule, and analyze the worst-case complexity of the resulting network simplex algorithm. We consider networks with n nodes, m arcs, integral arc capacities and integral supplies/demands of nodes. We define a {0, 1}-valued penalty for each arc of the network. The minimum ratio pivot rule is to select that eligible arc as the entering arc whose addition to the basis creates a cycle with the minimum cost-to-penalty ratio. We show that the so-defined primal network simplex algorithm solves minimum cost flow problem within O(n(Delta)) pivots and in O((Delta)(m + n log n)) time, where (Delta) is any upper bound on the sum of all arc flows in every feasible flow. For assignment and shortest path problems, our algorithm runs in O(n^2) pivots and O(nm + n^2 log n) time..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:113</identifier><datestamp>2026-08-05T08:12:47Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>On strongly polynomial dual simplex algorithms for the maximum flow problem</dc:title>
  <dc:creator>Goldfarb, Donald</dc:creator>
  <dc:creator>Wei, Chen</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Dual simplex method</dc:subject>
  <dc:subject>Maximum flow</dc:subject>
  <dc:subject>Parametric maximum flow</dc:subject>
  <dc:subject>Preflow</dc:subject>
  <dc:subject>Pseudoaugmenting path</dc:subject>
  <dc:subject>Strongly polynomial</dc:subject>
  <dc:subject>Valid distance labels</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 78, Num. 2 (08 1997), p. 159-168</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/113</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:113</dc:identifier>
  <dc:identifier>urn:articleid:00255610v78n2p159</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>Several pivot rules for the dual network simplex algorithm that enable it to solve a maximum flow problem on an n-node, m-arc network in at most 2nm pivots and O(n^2m) time are presented. These rules are based on the concept of a preflow and depend upon the use of node labels which are either the lengths of a shortest pseudoaugmenting path from those nodes to the sink node or valid underestimates of those lengths. Extended versions of our algorithms are shown to solve an important class of parametric maximum flow problems with no increase in the worst-case pivot and time bounds of these algorithms..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:114</identifier><datestamp>2026-08-05T08:12:47Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm</dc:title>
  <dc:creator>Tarjan, Robert E.</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Matemàtica</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 78, Num. 2 (08 1997), p. 169-177</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/114</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:114</dc:identifier>
  <dc:identifier>urn:articleid:00255610v78n2p169</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>The dynamic tree is an abstract data type that allows the maintenance of a collection of trees subject to joining by adding edges (linking) and splitting by deleting edges (cutting), while at the same time allowing reporting of certain combinations of vertex or edge values. For many applications of dynamic trees, values must be combined along paths. For other applications, values must be combined over entire trees. For the latter situation, an idea used originally in parallel graph algorithms, to represent trees by Euler tours, leads to a simple implementation with a time of O(log n) per tree operation, where n is the number of tree vertices. We apply this representation to the implementation of two versions of the network simplex algorithm, resulting in a time of O(log n) per pivot, where n is the number of vertices in the problem network..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:115</identifier><datestamp>2026-08-05T08:12:47Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>The Steiner tree packing problem in VLSI design</dc:title>
  <dc:creator>Grötschel, Martin</dc:creator>
  <dc:creator>Martin, Alexander</dc:creator>
  <dc:creator>Weismantel, Robert</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Steiner tree packing</dc:subject>
  <dc:subject>Routing in VLSI design</dc:subject>
  <dc:subject>Switchbox routing</dc:subject>
  <dc:subject>Cutting plane algorithm</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 78, Num. 2 (08 1997), p. 265-281</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/115</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:115</dc:identifier>
  <dc:identifier>urn:articleid:00255610v78n2p265</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>In this paper we describe several versions of the routing problem arising in VLSI design and indicate how the Steiner tree packing problem can be used to model these problems mathematically. We focus on switchbox routing problems and provide integer programming formulations for routing in the knock-knee and in the Manhattan model. We give a brief sketch of cutting plane algorithms that we developed and implemented for these two models. We report on computational experiments using standard test instances. Our codes are able to determine optimum solutions in most cases, and in particular, we can show that some of the instances have no feasible solution if Manhattan routing is used instead of knock-knee routing..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:116</identifier><datestamp>2026-08-05T08:12:46Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>A branch-and-cut algorithm for the equicut problem</dc:title>
  <dc:creator>Brunetta, Lorenzo</dc:creator>
  <dc:creator>Conforti, Michel</dc:creator>
  <dc:creator>Rinaldi, Giovanni</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Equicut</dc:subject>
  <dc:subject>Max-cut</dc:subject>
  <dc:subject>Polyhedral theory</dc:subject>
  <dc:subject>Cutting-plane algorithm</dc:subject>
  <dc:subject>Heuristic algorithm</dc:subject>
  <dc:subject>Branch-and-cut</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 78, Num. 2 (08 1997), p. 243-263</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/116</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:116</dc:identifier>
  <dc:identifier>urn:articleid:00255610v78n2p243</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>We describe an algorithm for solving the equicut problem on complete graphs. The core of the algorithm is a cutting-plane procedure that exploits a subset of the linear inequalities defining the convex hull of the incidence vectors of the edge sets that define an equicut. The cuts are generated by several separation procedures that will be described in the paper. Whenever the cutting-plane procedure does not terminate with an optimal solution, the algorithm uses a branch-and-cut strategy. We also describe the implementation of the algorithm and the interface with the LP solver. Finally, we report on computational results on dense instances with sizes up to 100 nodes..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:117</identifier><datestamp>2026-08-05T08:12:46Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>Multiflows and disjoint paths of minimum total cost</dc:title>
  <dc:creator>Karzanov, Alexander V.</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Multicommodity flow</dc:subject>
  <dc:subject>Disjoint paths</dc:subject>
  <dc:subject>Dominant</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 78, Num. 2 (08 1997), p. 219-242</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/117</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:117</dc:identifier>
  <dc:identifier>urn:articleid:00255610v78n2p219</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>In this paper we discuss a number of recent and earlier results in the field of combinatorial optimization that concerns problems on minimum cost multiflows (multicommodity flows) and edge-disjoint paths. More precisely, we deal with an undirected network N consisting of a supply graph G, a commodity graph H and nonnegative integer-valued functions of capacities and costs of edges of G, and consider the problems of minimizing the total cost among (i) all maximum multiflows, and (ii) all maximum integer multiflows.For problem (i), we discuss the denominators behavior in terms of H. The main result is that if H is complete (i.e. flows between any two terminals are allowed) then (i) has a half-integer optimal solution. Moreover, there are polynomial algorithms to find such a solution. For problem (ii), we give an explicit combinatorial minimax relation in case of H complete. This generalizes a minimax relation, due to Mader and, independently, Lomonosov, for the maximum number of edge-disjoint paths whose ends belong to a prescribed subset of nodes of a graph. Also there exists a polynomial algorithm when the capacities are all-unit.The minimax relation for (ii) with H complete allows to describe the dominant for the set of (T, d)-joins (extending the notion of T-join) and the dominant for the set of maximum multi-joins of a graph. Also other relevant results are reviewed and open questions are raised..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:118</identifier><datestamp>2026-08-05T08:12:46Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>Flows on hypergraphs</dc:title>
  <dc:creator>Cambini, Riccardo</dc:creator>
  <dc:creator>Gallo, Giorgio</dc:creator>
  <dc:creator>Scutellà, Maria Grazia</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Flows</dc:subject>
  <dc:subject>Leontief flows</dc:subject>
  <dc:subject>Hypergraphs</dc:subject>
  <dc:subject>Simplex algorithm</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 78, Num. 2 (08 1997), p. 195-217</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/118</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:118</dc:identifier>
  <dc:identifier>urn:articleid:00255610v78n2p195</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>We consider the capacitated minimum cost flow problem on directed hypergraphs. We define spanning hypertrees so generalizing the spanning tree of a standard graph, and show that, like in the standard and in the generalized minimum cost flow problems, a correspondence exists between bases and spanning hypertrees. Then, we show that, like for the network simplex algorithms for the standard and for the generalized minimum cost flow problems, most of the computations performed at each pivot operation have direct hypergraph interpretations..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:119</identifier><datestamp>2026-08-05T08:12:46Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>How to compute least infeasible flows</dc:title>
  <dc:creator>McCormick, S. Thomas</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Network flows</dc:subject>
  <dc:subject>Min-cost flow</dc:subject>
  <dc:subject>Cut canceling</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 78, Num. 2 (08 1997), p. 179-194</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/119</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:119</dc:identifier>
  <dc:identifier>urn:articleid:00255610v78n2p179</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>It is well-known how to use maximum flow to decide when a flow problem with demands, lower bounds, and upper bounds is infeasible. Less well-known is how to compute a flow that is least infeasible. This paper considers many possible ways to define "least infeasible" and shows how to compute optimal flows for each definition. For each definition it also gives a dual characterization in terms of cuts, a polynomial routine for recognizing that type of least infeasible flow, and relates that definition to dual cut canceling min-cost flow network algorithms..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:120</identifier><datestamp>2026-08-05T08:12:46Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>Minimum-perimeter domain assignment</dc:title>
  <dc:creator>Yackel, Jonathan</dc:creator>
  <dc:creator>Meyer, Robert R.</dc:creator>
  <dc:creator>Christou, Ioannis</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Matemàtica</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 78, Num. 2 (08 1997), p. 283-303</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/120</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:120</dc:identifier>
  <dc:identifier>urn:articleid:00255610v78n2p283</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>For certain classes of problems defined over two-dimensional domains with grid structure, optimization problems involving the assignment of grid cells to processors present a nonlinear network model for the problem of partitioning tasks among processors so as to minimize interprocessor communication. Minimizing interprocessor communication in this context is shown to be equivalent to tiling the domain so as to minimize total tile perimeter, where each tile corresponds to the collection of tasks assigned to some processor. A tight lower bound on the perimeter of a tile as a function of its area is developed. We then show how to generate minimum-perimeter tiles. By using assignments corresponding to near-rectangular minimum-perimeter tiles, closed form solutions are developed for certain classes of domains. We conclude with computational results with parallel high-level genetic algorithms that have produced good (and sometimes provably optimal) solutions for very large perimeter minimization problems..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:121</identifier><datestamp>2026-08-05T08:12:46Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>A note on the existence of the Alizadeh-Haeberly-Overton direction for semidefinite programming</dc:title>
  <dc:creator>Monteiro, Renato D. C.</dc:creator>
  <dc:creator>Zanjácomo, Paulo R.</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Semidefinite programming</dc:subject>
  <dc:subject>Primal-dual search directions</dc:subject>
  <dc:subject>Interior-point methods</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 78, Num. 3 (09 1997), p. 393-396</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/121</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:121</dc:identifier>
  <dc:identifier>urn:articleid:00255610v78n3p393</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>This note establishes a new sufficient condition for the existence and uniqueness of the Alizadeh-Haeberly-Overton direction for semidefinite programming..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:122</identifier><datestamp>2026-08-05T08:12:46Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>Free material optimization via mathematical programming</dc:title>
  <dc:creator>Zowe, Jochem</dc:creator>
  <dc:creator>Kocvara, Michal</dc:creator>
  <dc:creator>Bendsøe, Martin P.</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Structural optimization</dc:subject>
  <dc:subject>Optimal design</dc:subject>
  <dc:subject>Topology optimization</dc:subject>
  <dc:subject>Interior-point methods</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 79, Num. 1-3 (October 1997), p. 445-466</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/122</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:122</dc:identifier>
  <dc:identifier>urn:articleid:00255610v79n1-3p445</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>This paper deals with a central question of structural optimization which is formulated as the problem of finding the stiffest structure which can be made when both the distribution of material as well as the material itself can be freely varied. We consider a general multi-load formulation and include the possibility of unilateral contact. The emphasis of the presentation is on numerical procedures for this type of problem, and we show that the problems after discretization can be rewritten as mathematical programming problems of special form. We propose iterative optimization algorithms based on penalty-barrier methods and interior-point methods and show a broad range of numerical examples that demonstrates the efficiency of our approach..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:123</identifier><datestamp>2026-08-05T08:12:46Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>Efficiently solvable special cases of hard combinatorial optimization problems</dc:title>
  <dc:creator>Burkard, Rainer E.</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Travelling salesman problem</dc:subject>
  <dc:subject>Quadratic assignment problem</dc:subject>
  <dc:subject>Steiner tree problem</dc:subject>
  <dc:subject>Special case</dc:subject>
  <dc:subject>Polynomially solvable case</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 79, Num. 1-3 (October 1997), p. 55-69</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/123</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:123</dc:identifier>
  <dc:identifier>urn:articleid:00255610v79n1-3p55</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>We survey some recent advances in the field of polynomially solvable special cases of hard combinatorial optimization problems like the travelling salesman problem, quadratic assignment problems and Steiner tree problems. Such special cases can be found by considering special cost structures, the geometry of the problem, the special topology of the underlying graph structure or by analyzing special algorithms. In particular we stress the importance of recognition algorithms. We comment on open problems in this area and outline some lines for future research in this field..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:124</identifier><datestamp>2026-08-05T08:12:46Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>Decomposition methods in stochastic programming</dc:title>
  <dc:creator>Ruszczynski, Andrzej</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Stochastic programming</dc:subject>
  <dc:subject>Decomposition</dc:subject>
  <dc:subject>Primal methods</dc:subject>
  <dc:subject>Dual methods</dc:subject>
  <dc:subject>Stochastic methods</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 79, Num. 1-3 (October 1997), p. 333-353</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/124</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:124</dc:identifier>
  <dc:identifier>urn:articleid:00255610v79n1-3p333</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>Stochastic programming problems have very large dimension and characteristic structures which are tractable by decomposition. We review basic ideas of cutting plane methods, augmented Lagrangian and splitting methods, and stochastic decomposition methods for convex polyhedral multi-stage stochastic programming problems..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:125</identifier><datestamp>2026-08-05T08:12:46Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>Error bounds in mathematical programming</dc:title>
  <dc:creator>Pang, Jong-Shi</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Error bounds</dc:subject>
  <dc:subject>Inequality systems</dc:subject>
  <dc:subject>Complementarity problems</dc:subject>
  <dc:subject>Variational inequalities</dc:subject>
  <dc:subject>Metric regularity</dc:subject>
  <dc:subject>Penalty function</dc:subject>
  <dc:subject>Convergence of algorithms</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 79, Num. 1-3 (October 1997), p. 299-332</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/125</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:125</dc:identifier>
  <dc:identifier>urn:articleid:00255610v79n1-3p299</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>Originated from the practical implementation and numerical considerations of iterative methods for solving mathematical programs, the study of error bounds has grown and proliferated in many interesting areas within mathematical programming. This paper gives a comprehensive, state-of-the-art survey of the extensive theory and rich applications of error bounds for inequality and optimization systems and solution sets of equilibrium problems..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:126</identifier><datestamp>2026-08-05T08:12:46Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>Cuts, matrix completions and graph rigidity</dc:title>
  <dc:creator>Laurent, Monique</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Cut</dc:subject>
  <dc:subject>Positive semidefinite matrix</dc:subject>
  <dc:subject>Euclidean distance matrix</dc:subject>
  <dc:subject>Matrix completion</dc:subject>
  <dc:subject>Metric polyhedron</dc:subject>
  <dc:subject>Graph rigidity</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 79, Num. 1-3 (October 1997), p. 255-283</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/126</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:126</dc:identifier>
  <dc:identifier>urn:articleid:00255610v79n1-3p255</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>This paper brings together several topics arising in distinct areas: polyhedral combinatorics, in particular, cut and metric polyhedra; matrix theory and semidefinite programming, in particular, completion problems for positive semidefinite matrices and Euclidean distance matrices; distance geometry and structural topology, in particular, graph realization and rigidity problems.Cuts and metrics provide the unifying theme. Indeed, cuts can be encoded as positive semidefinite matrices (this fact underlies the approximative algorithm for max-cut of Goemans and Williamson) and both positive semidefinite and Euclidean distance matrices yield points of the cut polytope or cone, after applying the functions 1/(pi) arccos(.) or V¯. When fixing the dimension in the Euclidean distance matrix completion problem, we find the graph realization problem and the related question of unicity of realization, which leads to the question of graph rigidity.Our main objective here is to present in a unified setting a number of results and questions concerning matrix completion, graph realization and rigidity problems. These problems contain indeed very interesting questions relevant to mathematical programming and we believe that research in this area could yield to cross-fertilization between the various fields involved..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:127</identifier><datestamp>2026-08-05T08:12:45Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>Interactions between nonlinear programming and modeling systems</dc:title>
  <dc:creator>Drud, Arne Stolbjerg</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Modeling systems</dc:subject>
  <dc:subject>Nonlinear programming</dc:subject>
  <dc:subject>Model definition</dc:subject>
  <dc:subject>Preprocessing</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 79, Num. 1-3 (October 1997), p. 99-123</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/127</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:127</dc:identifier>
  <dc:identifier>urn:articleid:00255610v79n1-3p99</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>Modeling systems are very important for bringing mathematical programming software to non-expert users, but few nonlinear programming algorithms are today linked to a modeling system. The paper discussed the advantages of linking modeling systems with nonlinear programming. Traditional algorithms can be linked using black-box function and derivatives evaluation routines for local optimization. Methods for generating this information are discussed. More sophisticated algorithms can get access to almost any type of information: interval evaluations and constraint restructuring for detailed preprocessing, second order information for sequential quadratic programming and interior point methods, and monotonicity and convex relaxations for global optimization. Some of the sophisticated information is available today; the rest can be generated on demand..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:128</identifier><datestamp>2026-08-05T08:12:45Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>Exploiting sparsity in primal-dual interior-point methods for semidefinite programming</dc:title>
  <dc:creator>Fujisawa, Katsuki</dc:creator>
  <dc:creator>Kojima, Masakazu</dc:creator>
  <dc:creator>Nakata, Kazuhide</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Interior-point methods</dc:subject>
  <dc:subject>Semidefinite programming</dc:subject>
  <dc:subject>Sparsity</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 79, Num. 1-3 (October 1997), p. 235-253</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/128</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:128</dc:identifier>
  <dc:identifier>urn:articleid:00255610v79n1-3p235</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>The Helmberg-Rendl-Vanderbei-Wolkowicz/Kojima-Shindoh-Hara/Monteiro and Nesterov-Todd search directions have been used in many primal-dual interior-point methods for semidefinite programs. This paper proposes an efficient method for computing the two directions when the semidefinite program to be solved is large scale and sparse..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:129</identifier><datestamp>2026-08-05T08:12:45Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>Measure concentration in optimization</dc:title>
  <dc:creator>Barvinok, Alexander</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Measure concentration</dc:subject>
  <dc:subject>Combinatorial optimization</dc:subject>
  <dc:subject>Semidefinite programming</dc:subject>
  <dc:subject>Monte-Carlo integration and counting</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 79, Num. 1-3 (October 1997), p. 33-53</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/129</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:129</dc:identifier>
  <dc:identifier>urn:articleid:00255610v79n1-3p33</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>We discuss some consequences of the measure concentration phenomenon for optimization and computational problems. Topics include average case analysis in optimization, efficient approximate counting, computation of mixed discriminants and permanents, and semidefinite relaxation in quadratic programming..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:130</identifier><datestamp>2026-08-05T08:12:45Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>Logical analysis of numerical data</dc:title>
  <dc:creator>Boros, Endre</dc:creator>
  <dc:creator>Hammer, Peter L.</dc:creator>
  <dc:creator>Ibaraki, Toshihide</dc:creator>
  <dc:creator>Kogan, Alexander</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Data analysis</dc:subject>
  <dc:subject>Boolean functions</dc:subject>
  <dc:subject>Machine learning</dc:subject>
  <dc:subject>Binarization</dc:subject>
  <dc:subject>Set covering</dc:subject>
  <dc:subject>Monotonicity</dc:subject>
  <dc:subject>Thresholdness</dc:subject>
  <dc:subject>Computational complexity</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 79, Num. 1-3 (October 1997), p. 163-190</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/130</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:130</dc:identifier>
  <dc:identifier>urn:articleid:00255610v79n1-3p163</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>"Logical analysis of data" (LAD) is a methodology developed since the late eighties, aimed at discovering hidden structural information in data sets. LAD was originally developed for analyzing binary data by using the theory of partially defined Boolean functions. An extension of LAD for the analysis of numerical data sets is achieved through the process of "binarization" consisting in the replacement of each numerical variable by binary "indicator" variables, each showing whether the value of the original variable is above or below a certain level. Binarization was successfully applied to the analysis of a variety of real life data sets. This paper develops the theoretical foundations of the binarization process studying the combinatorial optimization problems related to the minimization of the number of binary variables. To provide an algorithmic framework for the practical solution of such problems, we construct compact linear integer programming formulations of them. We develop polynomial time algorithms for some of these minization problems, and prove NP-hardness of others..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:131</identifier><datestamp>2026-08-05T08:12:45Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>Semidefinite programming in combinatorial optimization</dc:title>
  <dc:creator>Goemans, Michel X.</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Semidefinite programming</dc:subject>
  <dc:subject>Combinatorial optimization</dc:subject>
  <dc:subject>Stable set</dc:subject>
  <dc:subject>Maximum cut</dc:subject>
  <dc:subject>Coding theory</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 79, Num. 1-3 (October 1997), p. 143-161</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/131</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:131</dc:identifier>
  <dc:identifier>urn:articleid:00255610v79n1-3p143</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>We discuss the use of semidefinite programming for combinatorial optimization problems. The main topics covered include (i) the Lovász theta function and its applications to stable sets, perfect graphs, and coding theory, (ii) the automatic generation of strong valid inequalities, (iii) the maximum cut problem and related problems, and (iv) the embedding of finite metric spaces and its relationship to the sparsest cut problem..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:132</identifier><datestamp>2026-08-05T08:12:45Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>Discrete optimization in public rail transport</dc:title>
  <dc:creator>Bussieck, Michael R.</dc:creator>
  <dc:creator>Winter, Thomas</dc:creator>
  <dc:creator>Zimmermann, Uwe T.</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Combinatorial optimization</dc:subject>
  <dc:subject>Mixed integer programming</dc:subject>
  <dc:subject>Transportation</dc:subject>
  <dc:subject>Logistics</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 79, Num. 1-3 (October 1997), p. 415-444</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/132</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:132</dc:identifier>
  <dc:identifier>urn:articleid:00255610v79n1-3p415</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>Many problems arising in traffic planning can be modelled and solved using discrete optimization. We will focus on recent developments which were applied to large scale real world instances.Most railroad companies apply a hierarchically structured planning process. Starting with the definition of the underlying network used for transport one has to decide which infrastructural improvements are necessary. Usually, the rail system is periodically scheduled. A fundamental base of the schedule are the lines connecting several stations with a fixed frequency. Possible objectives for the construction of the line plan may be the minimization of the total cost or the maximization of the passenger's comfort satisfying certain regulations. After the lines of the system are fixed, the train schedule can be determined. A criterion for the quality of a schedule is the total transit time of the passengers including the waiting time which should be minimized satisfying some operational constraints. For each trip of the schedule a train consisting of a locomotive and some carriages is needed for service. The assignment of rolling stock to schedule trips has to satisfy operational requirements. A comprehensible objective is to minimize the total cost. After all strategic and tactical planning the schedule has to be realized. Several external influences, for example delayed trains, force the dispatcher to recompute parts of the schedule on-line..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:133</identifier><datestamp>2026-08-05T08:12:44Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>How to deal with the unbounded in optimization : Theory and algorithms</dc:title>
  <dc:creator>Auslender, A.</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Convex and linear programming</dc:subject>
  <dc:subject>Convex analysis</dc:subject>
  <dc:subject>Recession functions</dc:subject>
  <dc:subject>Existence of optimal solutions</dc:subject>
  <dc:subject>Penalty and barrier methods</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 79, Num. 1-3 (October 1997), p. 3-18</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/133</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:133</dc:identifier>
  <dc:identifier>urn:articleid:00255610v79n1-3p3</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>The aim of this survey is to show how the unbounded arises in optimization problems and how it leads to fundamental notions which are not only useful for proving theoretical results such as convergence of algorithms and the existence of optimal solutions, but also for constructing new methods..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:134</identifier><datestamp>2026-08-05T08:12:44Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>Recent progress in unconstrained nonlinear optimization without derivatives</dc:title>
  <dc:creator>Conn, A. R.</dc:creator>
  <dc:creator>Scheinberg, K.</dc:creator>
  <dc:creator>Toint, Ph. L.</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Nonlinear optimization</dc:subject>
  <dc:subject>Derivative-free methods</dc:subject>
  <dc:subject>Unconstrained problems</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 79, Num. 1-3 (October 1997), p. 397-414</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/134</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:134</dc:identifier>
  <dc:identifier>urn:articleid:00255610v79n1-3p397</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>We present an introduction to a new class of derivative free methods for unconstrained optimization. We start by discussing the motivation for such methods and why they are in high demand by practitioners. We then review the past developments in this field, before introducing the features that characterize the newer algorithms. In the context of a trust region framework, we focus on techniques that ensure a suitable "geometric quality" of the considered models. We then outline the class of algorithms based on these techniques, as well as their respective merits. We finally conclude the paper with a discussion of open questions and perspectives..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:135</identifier><datestamp>2026-08-05T08:12:44Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>Interior-point methods : An old and new approach to nonlinear programming</dc:title>
  <dc:creator>Nesterov, Yu</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Interior point methods</dc:subject>
  <dc:subject>Convex programming</dc:subject>
  <dc:subject>Complexity</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 79, Num. 1-3 (October 1997), p. 285-297</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/135</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:135</dc:identifier>
  <dc:identifier>urn:articleid:00255610v79n1-3p285</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>In this paper we discuss the main concepts of structural optimization, a field of nonlinear programming, which was formed by the intensive development of modern interior-point schemes..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:136</identifier><datestamp>2026-08-05T08:12:43Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>A modified lift-and-project procedure</dc:title>
  <dc:creator>Balas, Egon</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Lifting</dc:subject>
  <dc:subject>Projection</dc:subject>
  <dc:subject>Convexification</dc:subject>
  <dc:subject>Disjunctive programming</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 79, Num. 1-3 (October 1997), p. 19-31</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/136</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:136</dc:identifier>
  <dc:identifier>urn:articleid:00255610v79n1-3p19</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>In recent years the lift-and-project approach has been used successfully within a branch-and-cut framework to solve large, difficult pure and mixed 0-1 programs that have resisted solution efforts by pure branch and bound codes. The approach uses a linear description in a higher dimensional space of the convex hull of the disjunctive set created by imposing one or several 0-1 conditions. By solving a linear program derived from this higher dimensional representation - the cut generating linear program (CGLP) - the standard lift-and-project procedure obtains a deepest cut in a well defined sense. We propose a modification of CGLP that allows us to generate not just one deepest cut, but a class of cuts with desirable properties, each at the cost of one extra pivot in the optimal tableau of the modified CGLP..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:137</identifier><datestamp>2026-08-05T08:12:43Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>Algorithms for railway crew management</dc:title>
  <dc:creator>Caprara, Alberto</dc:creator>
  <dc:creator>Fischetti, Matteo</dc:creator>
  <dc:creator>Toth, Paolo</dc:creator>
  <dc:creator>Vigo, Daniele</dc:creator>
  <dc:creator>Guida, Pier Luigi</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Crew management</dc:subject>
  <dc:subject>Railway optimization</dc:subject>
  <dc:subject>Algorithms</dc:subject>
  <dc:subject>Crew scheduling and rostering</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 79, Num. 1-3 (October 1997), p. 125-141</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/137</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:137</dc:identifier>
  <dc:identifier>urn:articleid:00255610v79n1-3p125</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>Crew management is concerned with building the work schedules of crews needed to cover a planned timetable. This is a well-known problem in Operations Research and has been historically associated with airlines and mass-transit companies. More recently, railway applications have also come on the scene, especially in Europe. In practice, the overall crew management problem is decomposed into two subproblems, called crew scheduling and crew rostering. In this paper, we give an outline of different ways of modeling the two subproblems and possible solution methods. Two main solution approaches are illustrated for real-world applications. In particular we discuss in some detail the solution techniques currently adopted at the Italian railway company, Ferrovie dello Stato SpA, for solving crew scheduling and rostering problems..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:138</identifier><datestamp>2026-08-05T08:12:43Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>Test sets for integer programs</dc:title>
  <dc:creator>Scarf, Herbert E.</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Test sets</dc:subject>
  <dc:subject>Integer programming</dc:subject>
  <dc:subject>Simplicial complexes</dc:subject>
  <dc:subject>Groebner bases</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 79, Num. 1-3 (October 1997), p. 355-368</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/138</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:138</dc:identifier>
  <dc:identifier>urn:articleid:00255610v79n1-3p355</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>In this paper I discuss various properties of the simplicial complex of maximal lattice free bodies associated with a matrix A. If the matrix satisfies some mild conditions, and is generic, the edges of the complex form the minimal test set for the family of integer programs obtained by selecting a particular row of A as the objective function, and using the remaining rows to impose constraints on the integer variables..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:139</identifier><datestamp>2026-08-05T08:12:42Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>Cluster analysis and mathematical programming</dc:title>
  <dc:creator>Hansen, Pierre</dc:creator>
  <dc:creator>Jaumard, Brigitte</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Cluster analysis</dc:subject>
  <dc:subject>Hierarchy</dc:subject>
  <dc:subject>Partition</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 79, Num. 1-3 (October 1997), p. 191-215</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/139</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:139</dc:identifier>
  <dc:identifier>urn:articleid:00255610v79n1-3p191</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>Given a set of entities, Cluster Analysis aims at finding subsets, called clusters, which are homogeneous and/or well separated. As many types of clustering and criteria for homogeneity or separation are of interest, this is a vast field. A survey is given from a mathematical programming viewpoint. Steps of a clustering study, types of clustering and criteria are discussed. Then algorithms for hierarchical, partitioning, sequential, and additive clustering are studied. Emphasis is on solution methods, i.e., dynamic programming, graph theoretical algorithms, branch-and-bound, cutting planes, column generation and heuristics..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:140</identifier><datestamp>2026-08-05T08:12:42Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>Two applications of the Divide&amp;Conquer principle in the molecular sciences</dc:title>
  <dc:creator>Brinkmann, G.</dc:creator>
  <dc:creator>Dress, A. W. M.</dc:creator>
  <dc:creator>Perrey, S. W.</dc:creator>
  <dc:creator>Stoye, J.</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Divide&amp;Conquer</dc:subject>
  <dc:subject>Structure enumeration</dc:subject>
  <dc:subject>Fullerenes</dc:subject>
  <dc:subject>Multiple sequence allignment</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 79, Num. 1-3 (October 1997), p. 71-97</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/140</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:140</dc:identifier>
  <dc:identifier>urn:articleid:00255610v79n1-3p71</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>In this paper, two problems from the molecular sciences are addressed: the enumeration of fullerene-type isomers and the alignment of biosequences. We report on two algorithms dealing with these problems both of which are based on the well-known and widely used Divide&amp;Conquer principle. In other words, our algorithms attack the original problems by associating with them an appropriate number of much simpler problems whose solutions can be "glued together" to yield solutions of the original, rather complex tasks. The considerable improvements achieved this way exemplify that the present day molecular sciences offer many worthwhile opportunities for the effective use of fundamental algorithmic principles and architectures..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:141</identifier><datestamp>2026-08-05T08:12:42Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>Linear programming, the simplex algorithm and simple polytopes</dc:title>
  <dc:creator>Kalai, Gil</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Simplex algorithm</dc:subject>
  <dc:subject>Randomized pivot rule complexity</dc:subject>
  <dc:subject>Combinatorial theory of simple polytopes</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 79, Num. 1-3 (October 1997), p. 217-233</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/141</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:141</dc:identifier>
  <dc:identifier>urn:articleid:00255610v79n1-3p217</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>In the first part of the paper we survey some far-reaching applications of the basic facts of linear programming to the combinatorial theory of simple polytopes. In the second part we discuss some recent developments concerning the simplex algorithm. We describe subexponential randomized pivot rules and upper bounds on the diameter of graphs of polytopes..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:142</identifier><datestamp>2026-08-05T08:12:41Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>Criss-cross methods : A fresh view on pivot algorithms</dc:title>
  <dc:creator>Fukuda, Komei</dc:creator>
  <dc:creator>Terlaky, Tamás</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Linear programming</dc:subject>
  <dc:subject>Quadratic programming</dc:subject>
  <dc:subject>Linear complementarity problems</dc:subject>
  <dc:subject>Oriented matroids</dc:subject>
  <dc:subject>Pivot rules</dc:subject>
  <dc:subject>Criss-cross method</dc:subject>
  <dc:subject>Cycling</dc:subject>
  <dc:subject>Recursion</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 79, Num. 1-3 (October 1997), p. 369-395</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/142</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:142</dc:identifier>
  <dc:identifier>urn:articleid:00255610v79n1-3p369</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>Criss-cross methods are pivot algorithms that solve linear programming problems in one phase starting with any basic solution. The first finite criss-cross method was invented by Chang, Terlaky and Wang independently. Unlike the simplex method that follows a monotonic edge path on the feasible region, the trace of a criss-cross method is neither monotonic (with respect to the objective function) nor feasibility preserving. The main purpose of this paper is to present mathematical ideas and proof techniques behind finite criss-cross pivot methods. A recent result on the existence of a short admissible pivot path to an optimal basis is given, indicating shortest pivot paths from any basis might be indeed short for criss-cross type algorithms. The origins and the history of criss-cross methods are also touched upon..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:143</identifier><datestamp>2026-08-05T08:12:41Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>On finding an envy-free Pareto-optimal division</dc:title>
  <dc:creator>Reijnierse, J. H.</dc:creator>
  <dc:creator>Potters, J. A. M.</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1998</dc:date>
  <dc:subject>Envy-freeness</dc:subject>
  <dc:subject>Pareto-optimality</dc:subject>
  <dc:subject>Walras equilibrium</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 83, Num. 2 (October 1998), p. 291-311</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/143</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:143</dc:identifier>
  <dc:identifier>urn:articleid:00255610v83n2p291</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>This paper describes an algorithm to find an ((alpha))envy-free Pareto-optimal division in the case of a finite number of homogeneous infinitely divisible goods and linear utility functions. It is used to find an allocation in the classical cake division problem that is almost Pareto-optimal and (alpha)-envy-free..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:144</identifier><datestamp>2026-08-05T08:12:41Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>Theoretical and numerical investigation of the D-gap function for box constrained variational inequalities</dc:title>
  <dc:creator>Kanzow, Christian</dc:creator>
  <dc:creator>Fukushima, Masao</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1998</dc:date>
  <dc:subject>Variational inequality problem</dc:subject>
  <dc:subject>Complementarity problem</dc:subject>
  <dc:subject>Optimization reformulation</dc:subject>
  <dc:subject>D-gap function</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 83, Num. 1 (09 1998), p. 55-87</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/144</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:144</dc:identifier>
  <dc:identifier>urn:articleid:00255610v83n1p55</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>The D-gap function, recently introduced by Peng and further studied by Yamashita et al., allows a smooth unconstrained minimization reformulation of the general variational inequality problem. This paper is concerned with the D-gap function for variational inequality problems over a box or, equivalently, mixed complementarily problems. The purpose of this paper is twofold. First we investigate theoretical properties in depth of the D-gap function, such as the optimality of stationary points, bounded level sets, global error bounds and generalized Hessians. Next we present a nonsmooth Gauss-Newton type algorithm for minimizing the D-gap function, and report extensive numerical results for the whole set of problems in the MCPLIB test problem collection..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:145</identifier><datestamp>2026-08-05T08:12:40Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>Lectures on Mathematical Programming ismp97</dc:title>
  <dc:creator>Liebling, T. M.</dc:creator>
  <dc:creator>de Werra, D.</dc:creator>
  <dc:type>Editorial</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Programació (Matemàtica)</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 79, Num. 1-3 (October 1997), p. 1-2</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/145</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:145</dc:identifier>
  <dc:identifier>urn:articleid:00255610v79n1-3</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:146</identifier><datestamp>2026-08-05T08:12:40Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>Warm start of the primal-dual method applied in the cutting-plane scheme</dc:title>
  <dc:creator>Gondzio, Jacek</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1998</dc:date>
  <dc:subject>Warm start</dc:subject>
  <dc:subject>Primal-dual algorithm</dc:subject>
  <dc:subject>Cutting-plane methods</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 83, Num. 1 (09 1998), p. 125-143</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/146</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:146</dc:identifier>
  <dc:identifier>urn:articleid:00255610v83n1p125</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>A practical warm-start procedure is described for the infeasible primal-dual interior-point method (IPM) employed to solve the restricted master problem within the cutting-plane method. In contrast to the theoretical developments in this field, the approach presented in this paper does not make the unrealistic assumption that the new cuts are shallow. Moreover, it treats systematically the case when a large number of cuts are added at one time. The technique proposed in this paper has been implemented in the context of HOPDM, the state of the art, yet public domain, interior-point code. Numerical results confirm a high degree of efficiency of this approach: regardless of the number of cuts added at one time (can be thousands in the largest examples) and regardless of the depth of the new cuts, reoptimizations are usually done with a few additional iterations..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:147</identifier><datestamp>2026-08-05T08:12:40Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>A cellation of the Grassmann manifold</dc:title>
  <dc:creator>Eaves, B. Curtis</dc:creator>
  <dc:creator>Schmedders, Karl H.</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1998</dc:date>
  <dc:subject>Grassmann manifold</dc:subject>
  <dc:subject>Covering</dc:subject>
  <dc:subject>Cellation</dc:subject>
  <dc:subject>Equilibria in incomplete asset markets</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 83, Num. 2 (October 1998), p. 253-262</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/147</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:147</dc:identifier>
  <dc:identifier>urn:articleid:00255610v83n2p253</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>Motivated by the computation of equilibria in economic models with incomplete asset markets, a cellation of the Grassmann manifold is constructed by restricting a common atlas. The Grassmann manifold of m-planes in n-dimensional space is shown to be a union of n choose m congruent m(n - m)-dimensional topological disks whose interiors are disjoint..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:148</identifier><datestamp>2026-08-05T08:12:40Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>Generalized semi-infinite optimization : a first order optimality condition and examples</dc:title>
  <dc:creator>Jongen, Hubertus Th</dc:creator>
  <dc:creator>Rückmann, Jan-J.</dc:creator>
  <dc:creator>Stein, O.</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1998</dc:date>
  <dc:subject>Generalized semi-infinite optimization problem</dc:subject>
  <dc:subject>First order necessary optimality condition</dc:subject>
  <dc:subject>Fritz John condition</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 83, Num. 1 (09 1998), p. 145-158</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/148</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:148</dc:identifier>
  <dc:identifier>urn:articleid:00255610v83n1p145</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:149</identifier><datestamp>2026-08-05T08:12:40Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>The nucleon of cooperative games and an algorithm for matching games</dc:title>
  <dc:creator>Faigle, Ulrich</dc:creator>
  <dc:creator>Kern, Walter</dc:creator>
  <dc:creator>Fekete, Sándor P.</dc:creator>
  <dc:creator>Hochstättler, Winfried</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1998</dc:date>
  <dc:subject>Cooperative game</dc:subject>
  <dc:subject>Core</dc:subject>
  <dc:subject>Nucleolus</dc:subject>
  <dc:subject>Nucleon</dc:subject>
  <dc:subject>Matching</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 83, Num. 2 (October 1998), p. 195-211</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/149</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:149</dc:identifier>
  <dc:identifier>urn:articleid:00255610v83n2p195</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>The nucleon is introduced as a new allocation concept for non-negative cooperative n-person transferable utility games. The nucleon may be viewed as the multiplicative analogue of Schmeidler's nucleolus. It is shown that the nucleon of (not necessarily bipartite) matching games can be computed in polynomial time..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:150</identifier><datestamp>2026-08-05T08:12:40Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>A variable-penalty alternating directions method for convex optimization</dc:title>
  <dc:creator>Kontogiorgis, Spyridon</dc:creator>
  <dc:creator>Meyer, Robert R.</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1998</dc:date>
  <dc:subject>Alternating direction methods</dc:subject>
  <dc:subject>Decomposition</dc:subject>
  <dc:subject>Parallel computing</dc:subject>
  <dc:subject>Block angular programs</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 83, Num. 1 (09 1998), p. 29-53</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/150</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:150</dc:identifier>
  <dc:identifier>urn:articleid:00255610v83n1p29</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>We study a generalized version of the method of alternating directions as applied to the minimization of the sum of two convex functions subject to linear constraints. The method consists of solving consecutively in each iteration two optimization problems which contain in the objective function both Lagrangian and proximal terms. The minimizers determine the new proximal terms and a simple update of the Lagrangian terms follows. We prove a convergence theorem which extends existing results by relaxing the assumption of uniqueness of minimizers. Another novelty is that we allow penalty matrices, and these may vary per iteration. This can be beneficial in applications, since it allows additional tuning of the method to the problem and can lead to faster convergence relative to fixed penalties. As an application, we derive a decomposition scheme for block angular optimization and present computational results on a class of dual block angular problems..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:151</identifier><datestamp>2026-08-05T08:12:40Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>Approximate iterations in Bregman-function-based proximal algorithms</dc:title>
  <dc:creator>Eckstein, Jonathan</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1998</dc:date>
  <dc:subject>Proximal algorithms</dc:subject>
  <dc:subject>Bregman functions</dc:subject>
  <dc:subject>Monotone operators</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 83, Num. 1 (09 1998), p. 113-123</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/151</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:151</dc:identifier>
  <dc:identifier>urn:articleid:00255610v83n1p113</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>This paper establishes convergence of generalized Bregman-function-based proximal point algorithms when the iterates are computed only approximately. The problem being solved is modeled as a general maximal monotone operator, and need not reduce to minimization of a function. The accuracy conditions on the iterates resemble those required for the classical "linear" proximal point algorithm, but are slightly stronger; they should be easier to verify or enforce in practice than conditions given in earlier analyses of approximate generalized proximal methods. Subjects to these practically enforceable accuracy restrictions, convergence is obtained under the same conditions currently established for exact Bregman-function-based proximal methods..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:152</identifier><datestamp>2026-08-05T08:12:40Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>On proving existence of feasible points in equality constrained optimization problems</dc:title>
  <dc:creator>Kearfott, R. Baker</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1998</dc:date>
  <dc:subject>Constrained global optimization</dc:subject>
  <dc:subject>Verified computations</dc:subject>
  <dc:subject>Interval computations</dc:subject>
  <dc:subject>Bound constraints</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 83, Num. 1 (09 1998), p. 89-100</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/152</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:152</dc:identifier>
  <dc:identifier>urn:articleid:00255610v83n1p89</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>Various algorithms can compute approximate feasible points or approximate solutions to equality and bound constrained optimization problems. In exhaustive search algorithms for global optimizers and other contexts, it is of interest to construct bounds around such approximate feasible points, then to verify (computationally but rigorously) that an actual feasible point exists within these bounds. Hansen and others have proposed techniques for proving the existence of feasible points within given bounds, but practical implementations have not, to our knowledge, previously been described. Various alternatives are possible in such an implementation, and details must be carefully considered. Also, in addition to Hansen's technique for handling the underdetermined case, it is important to handle the overdetermined case, when the approximate feasible point corresponds to a point with many active bound constraints. The basic ideas, along with experimental results from an actual implementation, are summarized here..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:153</identifier><datestamp>2026-08-05T08:12:39Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>A bundle-Newton method for nonsmooth unconstrained minimization</dc:title>
  <dc:creator>Luksan, Ladislav</dc:creator>
  <dc:creator>Vlcek, Jan</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1998</dc:date>
  <dc:subject>Nondifferentiable minimization</dc:subject>
  <dc:subject>Numerical methods</dc:subject>
  <dc:subject>Quadratic approximation</dc:subject>
  <dc:subject>Global convergence</dc:subject>
  <dc:subject>Superlinear convergence</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 83, Num. 3 (November 1998), p. 373-391</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/153</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:153</dc:identifier>
  <dc:identifier>urn:articleid:00255610v83n3p373</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>An algorithm based on a combination of the polyhedral and quadratic approximation is given for finding stationary points for unconstrained minimization problems with locally Lipschitz problem functions that are not necessarily convex or differentiable. Global convergence of the algorithm is established. Under additional assumptions, it is shown that the algorithm generates Newton iterations and that the convergence is superlinear. Some encouraging numerical experience is reported..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:154</identifier><datestamp>2026-08-05T08:12:39Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>Condition measures and properties of the central trajectory of a linear program</dc:title>
  <dc:creator>Nunez, Manuel A.</dc:creator>
  <dc:creator>Freund, Robert M.</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1998</dc:date>
  <dc:subject>Linear Programming</dc:subject>
  <dc:subject>Condition measures</dc:subject>
  <dc:subject>Central trajectory</dc:subject>
  <dc:subject>Analytic center</dc:subject>
  <dc:subject>Interior-point methods</dc:subject>
  <dc:subject>Approximate data</dc:subject>
  <dc:subject>Approximate solutions</dc:subject>
  <dc:subject>Perturbation theory</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 83, Num. 1 (09 1998), p. 1-28</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/154</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:154</dc:identifier>
  <dc:identifier>urn:articleid:00255610v83n1</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>Given a data instance d = (A, b, c) of a linear program, we show that certain properties of solutions along the central trajectory of the linear program are inherently related to the condition number C(d) of the data instance d = (A, b, c), where C(d) is a scale-invariant reciprocal of a closely-related measure (rho)(d) called the "distance to ill-posedness". (The distance to ill-posedness essentially measures how close the data instance d = (A, b, c) is to being primal or dual infeasible.) We present lower and upper bounds on sizes of optimal solutions along the central trajectory, and on rates of change of solutions along the central trajectory, as either the barrier parameter µ or the data d = (A, b, c) of the linear program is changed. These bounds are all linear or polynomial functions of certain natural parameters associated with the linear program, namely the condition number C(d), the distance to ill-posedness (rho)(d), the norm of the data d and the dimensions m and n.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:155</identifier><datestamp>2026-08-05T08:12:39Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>Worst-case analyses, linear programming and the bin-packing problem</dc:title>
  <dc:creator>Chan, Lap Mui Ann</dc:creator>
  <dc:creator>Simchi-Levi, David</dc:creator>
  <dc:creator>Bramel, Julien</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1998</dc:date>
  <dc:subject>Absolute performance ratio</dc:subject>
  <dc:subject>Bin-packing</dc:subject>
  <dc:subject>Linear programming</dc:subject>
  <dc:subject>Best-fit decreasing</dc:subject>
  <dc:subject>First-fit decreasing</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 83, Num. 2 (October 1998), p. 213-227</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/155</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:155</dc:identifier>
  <dc:identifier>urn:articleid:00255610v83n2p213</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>In this paper we consider the familiar bin-packing problem and its associated set-partitioning formulation. We show that the optimal solution to the bin-packing problem can be no larger than 4/3 Z _LP where Z_LP is the optimal solution value of the linear programming relaxation of the set-partitioning formulation. An example is provided to show that the bound is tight. A by-product of our analysis is a new worst-case bound on the performance of the well studied First Fit Decreasing and Best Fit Decreasing heuristics.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:156</identifier><datestamp>2026-08-05T08:12:39Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>Plant location with minimum inventory</dc:title>
  <dc:creator>Barahona, Francisco</dc:creator>
  <dc:creator>Jensen, David</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1998</dc:date>
  <dc:subject>Plant location</dc:subject>
  <dc:subject>Minimum cut</dc:subject>
  <dc:subject>Dantzig-Wolfe decomposition</dc:subject>
  <dc:subject>Subgradient optimization</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 83, Num. 1 (09 1998), p. 101-111</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/156</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:156</dc:identifier>
  <dc:identifier>urn:articleid:00255610v83n1p101</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>We present an integer programming model for plant location with inventory costs. The linear programming relaxation has been solved by Dantzig-Wolfe decomposition. In this case the subproblems reduce to the minimum cut problem. We have used subgradient optimization to accelerate the convergence of the D-W algorithm. We present our experience with problems arising in the design of a distribution network for computer spare parts. In most cases, from a fractional solution we were able to derive integer solutions within 4% of optimality..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:157</identifier><datestamp>2026-08-05T08:12:39Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>Duality theorem for a generalized Fermat-Weber problem</dc:title>
  <dc:creator>Kaplan, Wilfred</dc:creator>
  <dc:creator>Yang, Wei H.</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Fermat-Weber problem</dc:subject>
  <dc:subject>Facility location</dc:subject>
  <dc:subject>Optimization</dc:subject>
  <dc:subject>Duality</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 76, Num. 2 (02 1997), p. 285-297</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/157</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:157</dc:identifier>
  <dc:identifier>urn:articleid:00255610v76n2p285</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>The classical Fermat-Weber problem is to minimize the sum of the distances from a point in a plane to k given points in the plane. This problem was generalized by Witzgall to n-dimensional space and to allow for a general norm, not necessarily symmetric; he found a dual for this problem. The authors generalize this result further by proving a duality theorem which includes as special cases a great variety of choices of norms in the terms of the Fermat-Weber sum. The theorem is proved by applying a general duality theorem of Rockafellar. As applications, a dual is found for the multi-facility location problem and a nonlinear dual is obtained for a linear programming problem with a priori bounds for the variables. When the norms concerned are continuously differentiable, formulas are obtained for retrieving the solution for each primal problem from the solution of its dual..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:158</identifier><datestamp>2026-08-05T08:12:39Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>Nominations for 1997 Elections</dc:title>
  <dc:creator>Dennis, J.</dc:creator>
  <dc:type>Altres</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:relation>Mathematical programming ; Vol. 77, Num. 1 (04 1997), p. 95</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/158</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:158</dc:identifier>
  <dc:identifier>urn:articleid:00255610v77n1p95</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:161</identifier><datestamp>2026-08-05T08:12:38Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>Predictor-corrector algorithm for solving P_* (k)-matrix LCP from arbitrary positive starting points</dc:title>
  <dc:creator>Potra, Florian A.</dc:creator>
  <dc:creator>Rongqin, Sheng</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Linear complementarity problems</dc:subject>
  <dc:subject>P_*-matrices</dc:subject>
  <dc:subject>Interior-point algorithm</dc:subject>
  <dc:subject>Superlinear convergence</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 76, Num. 1 (01 1997), p. 223-244</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/161</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:161</dc:identifier>
  <dc:identifier>urn:articleid:00255610v76n1p223</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>A new predictor-corrector algorithm is proposed for solving P_*(k)-matrix linear complementarity problems. If the problem is solvable, then the algorithm converges from an arbitrary positive starting point (x^0, s^0). The computational complexity of the algorithm depends on the quality of the starting point. If the starting point is feasible or close to being feasible, it has O((1 + k) V~n/(rho)_0L)-iteration complexity, where (rho)_0 is the ratio of the smallest and average coordinate of X^0s^0. With appropriate initialization, a modified version of the algorithm terminates in O((1 + k)^2 (n/(rho)_0)L) steps either by finding a solution or by determining that the problem has no solution in a predetermined, arbitrarily large, region. The algorithm is quadratically convergent for problems having a strictly complementary solution. We also propose an extension of a recent algorithm of Mizuno to P_* (k)-matrix linear complementarity problems such that it can start from arbitrary positive points and has superlinear convergence without a strictly complementary condition..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:164</identifier><datestamp>2026-08-05T08:12:38Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>Error bounds for nondifferentiable convex inequalities under a strong Slater constraint qualification</dc:title>
  <dc:creator>Mangasarian, O. L.</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1998</dc:date>
  <dc:subject>Convex inequalities</dc:subject>
  <dc:subject>Error bounds</dc:subject>
  <dc:subject>Strong Slater constraint qualification</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 83, Num. 2 (October 1998), p. 187-194</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/164</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:164</dc:identifier>
  <dc:identifier>urn:articleid:00255610v83n2p187</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>A global error bound is given on the distance between an arbitrary point in the n-dimensional real space R^n and its projection on a nonempty convex set determined by m convex, possibly nondifferentiable, inequalities. The bound is in terms of a natural residual that measures the violations of the inequalities multiplied by a new simple condition constant that embodies a single strong Slater constraint qualification (CQ) which implies the ordinary Slater CQ. A very simple bound on the distance to the projection relative to the distance to a point satisfying the ordinary Slater CQ is given first and then used to derive the principal global error bound..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:165</identifier><datestamp>2026-08-05T08:12:38Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>Merit functions for semi-definite complementarity problems</dc:title>
  <dc:creator>Tseng, Paul</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1998</dc:date>
  <dc:subject>Semi-definite complementarity problems</dc:subject>
  <dc:subject>Merit functions</dc:subject>
  <dc:subject>Gap functions</dc:subject>
  <dc:subject>Implicit Lagrangian</dc:subject>
  <dc:subject>Fischer-Burmeister function</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 83, Num. 2 (October 1998), p. 159-185</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/165</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:165</dc:identifier>
  <dc:identifier>urn:articleid:00255610v83n2p159</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>Merit functions such as the gap function, the regularized gap function, the implicit Lagrangian, and the norm squared of the Fischer-Burmeister function have played an important role in the solution of complementarity problems defined over the cone of nonnegative real vectors. We study the extension of these merit functions to complementarity problems defined over the cone of block-diagonal symmetric positive semi-definite real matrices. The extension suggests new solution methods for the latter problems..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:166</identifier><datestamp>2026-08-05T08:12:38Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>Perturbation analysis of a condition number for convex inequality systems and global error bounds for analytic systems</dc:title>
  <dc:creator>Sien, Deng</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1998</dc:date>
  <dc:subject>Condition numbers</dc:subject>
  <dc:subject>Analytic systems</dc:subject>
  <dc:subject>Convex inequality systems</dc:subject>
  <dc:subject>Level-coercivity</dc:subject>
  <dc:subject>Recession functions</dc:subject>
  <dc:subject>Recession cones</dc:subject>
  <dc:subject>Perturbation analysis</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 83, Num. 2 (October 1998), p. 263-276</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/166</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:166</dc:identifier>
  <dc:identifier>urn:articleid:00255610v83n2p263</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>In this paper several types of perturbations on a convex inequality system are considered, and conditions are obtained for the system to be well-conditioned under these types of perturbations, where the well-conditionedness of a convex inequality system is defined in terms of the uniform boundedness of condition numbers under a set of perturbations. It is shown that certain types of perturbations can be used to characterize the well-conditionedness of a convex inequality system, in which either the system has a bounded solution set and satisfies the Slater condition or an associated convex inequality system, which defines the recession cone of the solution set for the system, satisfies the Slater condition. Finally, sufficient conditions are given for the existence of a global error bound for an analytic system. It is shown that such a global error bound always holds for any inequality system defined by finitely many convex analytic functions when the zero vector is in the relative interior of the domain of an associated convex conjugate function..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:167</identifier><datestamp>2026-08-05T08:12:38Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>Location and shape of a rectangular facility in R^n. Convexity properties</dc:title>
  <dc:creator>Carrizosa, E.</dc:creator>
  <dc:creator>Muñoz-Márquez, M.</dc:creator>
  <dc:creator>Puerto, J.</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1998</dc:date>
  <dc:subject>Regional location</dc:subject>
  <dc:subject>Facilities</dc:subject>
  <dc:subject>Average distance</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 83, Num. 2 (October 1998), p. 277-290</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/167</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:167</dc:identifier>
  <dc:identifier>urn:articleid:00255610v83n2p277</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>In this paper we address a generalization of the Weber problem, in which we seek for the center and the shape of a rectangle (the facility) minimizing the average distance to a given set (the demand-set) which is not assumed to be finite. Some theoretical properties of the average distance are studied, and an expression for its gradient, involving solely expected distances to rectangles, is obtained. This enables the resolution of the problem by standard optimization techniques..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:168</identifier><datestamp>2026-08-05T08:12:38Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>L-shaped decomposition of two-stage stochastic programs with integer recourse</dc:title>
  <dc:creator>Carøe, Claus C.</dc:creator>
  <dc:creator>Tind, Jørgen</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1998</dc:date>
  <dc:subject>Stochastic programming</dc:subject>
  <dc:subject>Integer programming</dc:subject>
  <dc:subject>Benders decomposition</dc:subject>
  <dc:subject>General duality theory</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 83, Num. 3 (November 1998), p. 451-464</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/168</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:168</dc:identifier>
  <dc:identifier>urn:articleid:00255610v83n3p451</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>We consider two-stage stochastic programming problems with integer recourse. The L-shaped method of stochastic linear programming is generalized to these problems by using generalized Benders decomposition. Nonlinear feasibility and optimality cuts are determined via general duality theory and can be generated when the second stage problem is solved by standard techniques. Finite convergence of the method is established when Gomory's fractional cutting plane algorithm or a branch-and-bound algorithm is applied..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:169</identifier><datestamp>2026-08-05T08:12:37Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>Affine scaling algorithm fails for semidefinite programming</dc:title>
  <dc:creator>Muramatsu, Masakazu</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1998</dc:date>
  <dc:subject>Semidefinite programming</dc:subject>
  <dc:subject>Affine scaling algorithm</dc:subject>
  <dc:subject>Global convergence analysis</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 83, Num. 3 (November 1998), p. 393-406</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/169</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:169</dc:identifier>
  <dc:identifier>urn:articleid:00255610v83n3p393</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>In this paper, we introduce an affine scaling algorithm for semidefine programming (SDP), and give an example of a semidefinite program such that the affine scaling algorithm converges to a non-optimal point. Both our program and its dual have interior feasible solutions and unique optimal solutions which satisfy strict complementarity, and they are non-degenerate everywhere..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:170</identifier><datestamp>2026-08-05T08:12:37Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>A branch and bound method for stochastic global optimization</dc:title>
  <dc:creator>Norkin, Vladimir I.</dc:creator>
  <dc:creator>Pflug, Georg Ch</dc:creator>
  <dc:creator>Ruszczynski, Andrzej</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1998</dc:date>
  <dc:subject>Stochastic programming</dc:subject>
  <dc:subject>Global optimization</dc:subject>
  <dc:subject>Branch and bound method</dc:subject>
  <dc:subject>Facility location</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 83, Num. 3 (November 1998), p. 425-450</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/170</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:170</dc:identifier>
  <dc:identifier>urn:articleid:00255610v83n3p425</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>A stochastic branch and bound method for solving stochastic global optimization problems is proposed. As in the deterministic case, the feasible set is partitioned into compact subsets. To guide the partitioning process the method uses stochastic upper and lower estimates of the optimal value of the objective function in each subset. Convergence of the method is proved and random accuracy estimates derived. Methods for constructing stochastic upper and lower bounds are discussed. The theoretical considerations are illustrated with an example of a facility location problem..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:171</identifier><datestamp>2026-08-05T08:12:37Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>Discrete convex analysis</dc:title>
  <dc:creator>Murota, Kazuo</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1998</dc:date>
  <dc:subject>Convex analysis</dc:subject>
  <dc:subject>Combinatorial optimization</dc:subject>
  <dc:subject>Discrete separation theorem</dc:subject>
  <dc:subject>Integer programming</dc:subject>
  <dc:subject>Lagrange duality</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 83, Num. 3 (November 1998), p. 313-371</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/171</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:171</dc:identifier>
  <dc:identifier>urn:articleid:00255610v83n3p313</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>A theory of "discrete convex analysis" is developed for integer-valued functions defined on integer lattice points. The theory parallels the ordinary convex analysis, covering discrete analogues of the fundamental concepts such as conjugacy, subgradients, the Fenchel min-max duality, separation theorems and the Lagrange duality framework for convex/nonconvex optimization. The technical development is based on matroid-theoretic concepts, in particular, submodular functions and exchange axioms. Sections 1-4 extend the conjugacy relationship between submodularity and exchange ability, deepening our understanding of the relationship between convexity and submodularity investigated in the eighties by A. Frank, S. Fujishige, L. Lovász and others. Sections 5 and 6 establish duality theorems for M- and L-convex functions, namely, the Fenchel min-max duality and separation theorems. These are the generalizations of the discrete separation theorem for submodular functions due to A. Frank and the optimality criteria for the submodular flow problem due to M. Iri-N. Tomizawa, S. Fujishige, and A. Frank. A novel Lagrange duality framework is also developed in integer programming. We follow Rockafellar's conjugate duality approach to convex/nonconvex programs in nonlinear optimization, while technically relying on the fundamental theorems of matroid-theoretic nature..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:172</identifier><datestamp>2026-08-05T08:12:37Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>Infeasible-interior-point paths for sufficient linear complementarity problems and their analyticity</dc:title>
  <dc:creator>Stoer, Josef</dc:creator>
  <dc:creator>Wechs, Martin</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1998</dc:date>
  <dc:subject>Horizontal linear complementarity problems</dc:subject>
  <dc:subject>Sufficient matrices</dc:subject>
  <dc:subject>Infeasible interior-point-paths</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 83, Num. 3 (November 1998), p. 407-423</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/172</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:172</dc:identifier>
  <dc:identifier>urn:articleid:00255610v83n3p407</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>In this paper we study the behavior of infeasible-interior-point-paths for solving horizontal linear complementarity problems that are sufficient in the sense of Cottle et al. (R.W. Cottle, J.-S. Pang, Venkateswaran, Linear Algebra Appl. 114/115 (1989) 231-249). We show that these paths converge to a central point of the set of solutions. It is also shown that these are analytic functions of the path parameter even at the limitpoint, if the complementarity problem has a strictly complementary solution, and have a simple branchpoint, if it is solveable, but has no strictly complementarity solution..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:173</identifier><datestamp>2026-08-05T08:12:37Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>Solving stochastic programs with integer recourse by enumeration : A framework using Gröbner basis reductions</dc:title>
  <dc:creator>Schultz, Rüdiger</dc:creator>
  <dc:creator>Stougie, Leen</dc:creator>
  <dc:creator>van der Vlerk, Maarten H.</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1998</dc:date>
  <dc:subject>Stochastic programming</dc:subject>
  <dc:subject>Integer recourse</dc:subject>
  <dc:subject>Algorithm</dc:subject>
  <dc:subject>Gröbner basis</dc:subject>
  <dc:relation>Mathematical programming ; Vol. 83, Num. 2 (October 1998), p. 229-252</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/173</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:173</dc:identifier>
  <dc:identifier>urn:articleid:00255610v83n2p229</dc:identifier>
  <dc:rights>restricted access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>In this paper we present a framework for solving stochastic programs with complete integer recourse and discretely distributed right-hand side vector, using Gröbner basis methods from computational algebra to solve the numerous second-stage integer programs. Using structural properties of the expected integer recourse function, we prove that under mild conditions an optimal solution is contained in a finite set. Furthermore, we present a basic scheme to enumerate this set and suggest improvements to reduce the number of function evaluations needed..</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:176</identifier><datestamp>2026-04-04T12:12:34Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>spa</dc:language>
  <dc:title>Demanda de dinero y tipos de interés : un estudio teórico</dc:title>
  <dc:creator>Aznar Grasa, Antonio</dc:creator>
  <dc:creator>Pozo Remiro, Eduardo</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1998</dc:date>
  <dc:subject>Tipos de interés</dc:subject>
  <dc:subject>Demanda de dinero</dc:subject>
  <dc:subject>Demandas de activos</dc:subject>
  <dc:subject>Principio de Equivalencia Ricardiana</dc:subject>
  <dc:subject>Efecto Fisher</dc:subject>
  <dc:subject>Interest rates</dc:subject>
  <dc:subject>Money demand</dc:subject>
  <dc:subject>Assets demands</dc:subject>
  <dc:subject>Ricardian Equivalence Theorem</dc:subject>
  <dc:subject>Fisher Effect</dc:subject>
  <dc:relation>Revista española de economia ; Vol. 15, Num. 1 (1998), p. 123-145</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/176</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:176</dc:identifier>
  <dc:identifier>urn:articleid:02101025v15n1p123</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>El presente trabajo consta de tres bloques diferenciados: En primer lugar, sirviéndonos del enfoque de demanda de dinero por motivo transacción construimos un modelo teórico de determinación de las demandas de activos. En segundo lugar, tomando éste último como base, se formula un modelo de determinación de los tipos de interés, en el que los mismos se obtienen a partir del equilibrio en los mercados de activos. Por último, dentro de este marco se analiza la incidencia de la tasa de inflación esperada y del stock de deuda pública sobre los tipos reales de interés, presentando resultados sobre el cumplimiento de los lla-mados Efecto Fisher y Principio de Equivalencia Ricardiana.</dc:description>
  <dc:description>In this paper we re-examine some aspects related to the theoretical determinants of interestrates. First, we build a theoretical model of the demand for assets, centered on the transactionary demand for money approach. Second, on the basis of the aforementioned model, we formulate a model for the determination of interest rates, in which these are derived from the equilibrium conditions in the assets markets. Finally, within this last framework, we analyse the incidence of the expected inflation rate and the public debt stock upon the real interest rates, obtaining some results related to the so-called Fisher Effect and Ricardian Equivalence Theorem.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:177</identifier><datestamp>2026-04-04T12:12:34Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>A Note on Numerical Representations for Weak-Continuous Acyclic Preferences</dc:title>
  <dc:creator>Subiza, Begoña</dc:creator>
  <dc:creator>Peris, Josep E.</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1998</dc:date>
  <dc:subject>Utility functions</dc:subject>
  <dc:subject>Weak-continuity</dc:subject>
  <dc:subject>Acyclicity</dc:subject>
  <dc:subject>Funciones de utilidad</dc:subject>
  <dc:subject>Continuidad débil</dc:subject>
  <dc:subject>Aciclicidad</dc:subject>
  <dc:relation>Revista española de economia ; Vol. 15, Num. 1 (1998), p. 15-21</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/177</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:177</dc:identifier>
  <dc:identifier>urn:articleid:02101025v15n1p15</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>In this note we obtain a continuous utility function for acyclic preferences by using a weaker than usual continuity condition. Then we extend some results on representability of continuous quasiorders and acyclic preferences.</dc:description>
  <dc:description>En este trabajo se extienden algunos resultados sobre representaciones numéricas de órdenes parciales y relaciones acíclicas, utilizando una condición de continuidad más débil que la usual.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:178</identifier><datestamp>2026-04-04T12:12:34Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>spa</dc:language>
  <dc:title>Entrada y negociaciones salariales que abarcan varios períodos</dc:title>
  <dc:creator>Bárcena Ruiz, Juan Carlos</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1998</dc:date>
  <dc:subject>Estructura negociadora</dc:subject>
  <dc:subject>Entrada</dc:subject>
  <dc:subject>Bargaining structure</dc:subject>
  <dc:subject>Entry</dc:subject>
  <dc:relation>Revista española de economia ; Vol. 15, Num. 1 (1998), p. 23-35</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/178</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:178</dc:identifier>
  <dc:identifier>urn:articleid:02101025v15n1p23</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>Las empresas, por motivos estratégicos, pueden estar interesadas en fomentar negociaciones salariales con los trabajadores que abarcan varios períodos temporales, en vez de negociar período a período, ya que de este modo pueden lograr ventajas sobre los rivales.</dc:description>
  <dc:description>Strategic reasons may imply that firms prefer long-term wage bargaining with workers (two periods) instead of short-term wage bargaining (one period), since it could imply advantages over rivals.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:179</identifier><datestamp>2026-04-04T12:12:34Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>Bargaining with Claims in Economic Environments</dc:title>
  <dc:creator>Herrero Blanco, Carmen</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1998</dc:date>
  <dc:subject>Economic environments</dc:subject>
  <dc:subject>Bargaining with claims</dc:subject>
  <dc:subject>Entornos económicos</dc:subject>
  <dc:subject>Negociación</dc:subject>
  <dc:subject>Derechos</dc:subject>
  <dc:relation>Revista española de economia ; Vol. 15, Num. 1 (1998), p. 3-13</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/179</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:179</dc:identifier>
  <dc:identifier>urn:articleid:02101025v15n1p3</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>In this paper a reconstruction of the theory of bargaining with claims in economic environments is addressed. The spirit of that reconstruction is similar to that of the standard bargaining theory made by Roemer.</dc:description>
  <dc:description>En este trabajo se aborda el problema de la reconstrucción de la teoría de negociación con derechos en entornos económicos. El espíritu de la reconstrucción y las técnicas son semejantes a las de Roemer para el problema clásico de negociación.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:180</identifier><datestamp>2026-04-04T12:12:34Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>spa</dc:language>
  <dc:title>La inflación permanente y latente en España : una perspectiva macroeconómica</dc:title>
  <dc:creator>Álvarez, Luis Julián</dc:creator>
  <dc:creator>Sebastián, Miguel</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1998</dc:date>
  <dc:subject>Inflación</dc:subject>
  <dc:subject>VAR estructural (SVAR)</dc:subject>
  <dc:subject>Ciclo económico</dc:subject>
  <dc:subject>Perturbaciones transitorias y permanentes</dc:subject>
  <dc:subject>Perturbaciones de oferta y de demanda</dc:subject>
  <dc:subject>Inflation</dc:subject>
  <dc:subject>Structural VAR (SVAR)</dc:subject>
  <dc:subject>Output gap</dc:subject>
  <dc:subject>Transitory and permanent shocks</dc:subject>
  <dc:subject>Demand and supply shocks</dc:subject>
  <dc:relation>Revista española de economia ; Vol. 15, Num. 1 (1998), p. 37-65</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/180</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:180</dc:identifier>
  <dc:identifier>urn:articleid:02101025v15n1p37</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>El empleo directo de índices de precios puede dificultar la distinción entre cambios de precios relativos y elevaciones generalizadas de precios. Para abordar este problema, se utilizan habitualmente enfoques que, o bien excluyen determinados componentes del índice, o bien utilizan técnicas univariantes para obtener medidas tendenciales. En este trabajo, el análisis es multivariante y se emplea un modelo dinámico estructural con restricciones de largo plazo. Se construyen, para el período 1970-1993, dos medidas de tendencia de la inflación: la inflación permanente y la inflación latente. La semejanza de ambas medidas con la tasa de inflación observada indica que la dinámica de la inflación en España ha seguido un comportamiento inercial que apenas ha venido determinado por perturbaciones con efecto permanente sobre el nivel de producción. Asimismo, la similitud entre las medidas de inflación tendencial citadas indica que las perturbaciones permanentes de carácter nominal han desempeñado un papel clave en la determinación de la senda inflacionista. A pesar de esto, también se detecta un componente procíclico en la tasa de inflación, lo que pone de manifiesto la existencia de perturbaciones significativas de demanda con efectos reales transitorios.</dc:description>
  <dc:description>Direct use of price indices may make it difficult to distinguish between changes in relative prices and the sustained overall price rises that define an inflationary situation. To tackle this problem, several approaches are commonly used. They range from excluding specific index components to the use of univariate signal extraction techniques. In this paper, the analysis is multivariate and we adopt an structural dynamic model with long run identifying restrictions. We estimate, for the period 1970-1993, two measures of trend inflation: permanent inflation and latent inflation. The similarity of both measures with actual inflation indicates that inflation has shown a persistent behaviour which has been barely affected by shocks with a permanent effect on output. Moreover, the similarity of both measures of trend inflation shows that permanent disturbances of a nominal nature have played a key role in determing the path of inflation in our economy. However, we also detect a procyclical component in the inflation rate which reflects the existence of significant demand disturbances with transitory real effects.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:181</identifier><datestamp>2026-04-04T12:12:34Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>spa</dc:language>
  <dc:title>La eficiencia técnica de la industria española</dc:title>
  <dc:creator>Gumbau Albert, Mercedes</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1998</dc:date>
  <dc:subject>Eficiencia técnica</dc:subject>
  <dc:subject>Frontera estocástica</dc:subject>
  <dc:subject>Industria</dc:subject>
  <dc:subject>Technical efficiency</dc:subject>
  <dc:subject>Stochastic approach</dc:subject>
  <dc:subject>Industry</dc:subject>
  <dc:relation>Revista española de economia ; Vol. 15, Num. 1 (1998), p. 67-84</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/181</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:181</dc:identifier>
  <dc:identifier>urn:articleid:02101025v15n1p67</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>El objetivo de este trabajo es analizar la eficiencia técnica de los sectores industriales españoles durante el período 1991-1994 utilizando la Encuesta Sobre Estrategias Empresariales (ESEE) del Ministerio de Industria y Energía. Más concretamente, se va a seguir el enfoque de frontera estocástica para calcular los niveles de eficiencia que se obtienen tras la estimación de una función de producción frontera con dos factores de producción: trabajo y capital privado. Los resultados obtenidos muestran un nivel de eficiencia media entorno al 76-83%, si bien existen importantes diferencias intrasectoriales.</dc:description>
  <dc:description>The objective of this paper is to analyze the technical efficiency of the Spanish industrial sectors during the period 1991-1994 using the Encuesta Sobre Estrategias Empresariales (ESEE) of the Industry and Energy Ministry. More concretely, the paper follows the stochastic frontier approach to calculate the efficiency levels that are obtained from a production frontier function with two inputs: labour and private capital. The obtained results show a mean efficiency level of 76-83%, even though there are important differences within industrial sectors.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:182</identifier><datestamp>2026-04-04T12:12:33Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>spa</dc:language>
  <dc:title>Gestión óptima de aguas subterráneas : regulación frente a no regulación</dc:title>
  <dc:creator>Pardo, F. Javier</dc:creator>
  <dc:creator>Castro, J. Patricio</dc:creator>
  <dc:creator>Martínez, Constantino</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1998</dc:date>
  <dc:subject>Agua subterránea</dc:subject>
  <dc:subject>Control óptimo</dc:subject>
  <dc:subject>Derechos de propiedad</dc:subject>
  <dc:subject>Regulación</dc:subject>
  <dc:subject>Valor presente</dc:subject>
  <dc:subject>Groundwater</dc:subject>
  <dc:subject>Optimal Control</dc:subject>
  <dc:subject>Property Rights</dc:subject>
  <dc:subject>Regulation</dc:subject>
  <dc:subject>Present Value</dc:subject>
  <dc:relation>Revista española de economia ; Vol. 15, Num. 1 (1998), p. 85-121</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/182</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:182</dc:identifier>
  <dc:identifier>urn:articleid:02101025v15n1p85</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>En este artículo se comparan dos modelos de gestión de aguas subterráneas: control y no-control. La diferencia entre ambos viene dada porque en el primero de ellos se computa el coste de uso del recurso, mientras que en el segundo no. La demanda de agua subterránea se desagrega por cultivos lo que permite obtener una asignación inter e intratemporal del recurso. Asimismo se realiza la aplicación sobre el acuífero de Ascoy-Sopalmo (Cuenca del Segura). La obtención del valor presente del excedente neto de los agricultores en ambos escenarios permite concluir que la pérdida de eficiencia es mínima para unos valores normales de las tasas de descuento y recarga.</dc:description>
  <dc:description>In this paper two management models of groundwater (control and no-control) are compared. The difference between these models is that in the first one user cost is considered whilst in the second one is not. The groundwater demand is disaggregated by crops, which makes possible to obtain an inter and intratemporal resource allocation. Furthermore, an application to the aquifer of Ascoy-Sopalmo (Segura Basin) is carried out. From the present value of the farmer's net surplus, derived in both models, we can conclude that the efficiency loss is minimum for normal values of the discount rate and recharge rate.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:184</identifier><datestamp>2026-04-04T12:12:33Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>spa</dc:language>
  <dc:title>¿Existe un efecto Fisher en el largo plazo? Evidencia para la economía española, 1962-1996</dc:title>
  <dc:creator>Bajo, Óscar</dc:creator>
  <dc:creator>Esteve, Vicente</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1998</dc:date>
  <dc:subject>Tipos de interés</dc:subject>
  <dc:subject>Inflación</dc:subject>
  <dc:subject>Efecto Fisher a largo plazo</dc:subject>
  <dc:subject>Cointegración</dc:subject>
  <dc:subject>Interest rates</dc:subject>
  <dc:subject>Inflation</dc:subject>
  <dc:subject>Long-run Fisher effect</dc:subject>
  <dc:subject>Cointegration</dc:subject>
  <dc:relation>Revista española de economia ; Vol. 15, Num. 2 (1998), p. 149-166</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/184</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:184</dc:identifier>
  <dc:identifier>urn:articleid:02101025v15n2p149</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>En este trabajo se contrasta empíricamente el cumplimiento del efecto Fisher a largo plazo para el caso español, utilizando datos trimestrales para el período 1962-1996. Para ello se utilizan nuevas técnicas de raíces unitarias y cointegración, donde se tiene en cuenta explícitamente la presencia de posibles cambios estructurales en la tendencia de las series. Los resultados son favorables a la existencia de un efecto Fisher parcial en el largo plazo, con una transmisión al tipo de interés nominal de aproximadamente un tercio por cada punto de incremento en la tasa de inflación.</dc:description>
  <dc:description>In this paper we provide an empirical test of the long-run Fisher effect for the Spanish case, using quarterly data for the period 1962-1996. To this end, we make use of some new techniques on unit roots and cointegration, where the presence of possible structural changes in the trend of the series is explicitly considered. The results indicate the existence of a partial Fisher effect in the long-run, with a transmission to the nominal interest rate of roughly one third for each point increase in the inflation rate.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:185</identifier><datestamp>2026-04-04T12:12:33Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>spa</dc:language>
  <dc:title>Gasto público, «Tax-Smoothing» y déficit público óptimo : el caso de España</dc:title>
  <dc:creator>Esteve, Vicente</dc:creator>
  <dc:creator>Sapena, Juan</dc:creator>
  <dc:creator>Tamarit Escalona, Cecilio R.</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1998</dc:date>
  <dc:subject>Unión Económica y Monetaria</dc:subject>
  <dc:subject>Política fiscal</dc:subject>
  <dc:subject>Política impositiva óptima</dc:subject>
  <dc:subject>Tax-smoothing</dc:subject>
  <dc:subject>Cointegración</dc:subject>
  <dc:subject>Economic and Monetary Union</dc:subject>
  <dc:subject>Fiscal policy</dc:subject>
  <dc:subject>Optimal tax policy</dc:subject>
  <dc:subject>Tax-smooth-ing</dc:subject>
  <dc:subject>Cointegration</dc:subject>
  <dc:relation>Revista española de economia ; Vol. 15, Num. 2 (1998), p. 167-198</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/185</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:185</dc:identifier>
  <dc:identifier>urn:articleid:02101025v15n2p167</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>En este trabajo se contrasta para la economía española y con datos del período 1964-1995, la teoría de la financiación óptima del gobierno basada en la regla del tax-smoothing. Desde el punto de vista empírico, la novedad del estudio radica en la utilización del déficit público como la variable de referencia, así como la estimación del modelo a través de un VAR, tal y como propone Ghosh (1995a). El estudio se enmarca en el debate de si las restricciones fiscales del Tratado de Maastricht entran en contradicción con las teorías tradicionales de financiación óptima del gobierno.</dc:description>
  <dc:description>In this paper, we test the optimal taxation theory based on the tax-smoothing rule for the Spanish case. The sample period covers from 1964 to 1995. The empirical approach considered is based on Ghosh (1995a) which leads to two main improvements in the estimation. First, the reference variable is the public deficit, and second, the estimation uses VAR models. This study tries to shed some light in the controversy between the inter-temporal fiscal rules agreed on in the Maastricht Treaty and the traditional rules of optimal taxation.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:186</identifier><datestamp>2026-04-04T12:12:33Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>spa</dc:language>
  <dc:title>Valoración de opciones de compra bermuda con precios de ejercicio variables</dc:title>
  <dc:creator>Leguey Galán, Santiago</dc:creator>
  <dc:creator>Llerena Garrés, Francesc</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1998</dc:date>
  <dc:subject>Arbitraje</dc:subject>
  <dc:subject>Opción de compra bermuda</dc:subject>
  <dc:subject>Proceso de difusión lognormal</dc:subject>
  <dc:subject>Arbitrage</dc:subject>
  <dc:subject>Bermuda call option</dc:subject>
  <dc:subject>Lognormal difussion process</dc:subject>
  <dc:relation>Revista española de economia ; Vol. 15, Num. 2 (1998), p. 199-216</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/186</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:186</dc:identifier>
  <dc:identifier>urn:articleid:02101025v15n2p199</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>En el presente trabajo se obtiene una fórmula para valorar opciones de compra bermuda con precios de ejercicio variables sobre un activo subjayente que no paga dividendos y cuya dinámica viene descrita por un proceso browniano geométrico o lognormal. En el marco teórico planteado la fórmula de Black-Scholes para opciones de compra europeas resulta ser un caso particular de la expresión obtenida. La discretización del conjunto de oportunidades de ejercicio permite aproximar el valor de una opcción de compra que puede ejercerse en cualquier instante a un precio de ejercicio estrictamente creciente respecto al tiempo.</dc:description>
  <dc:description>In this paper a formula is deduced in order to value bermuda call options with variable exercise prices on a non-dividend-paying stock. It is assumed that the dynamics of underlying asset prices are defined by a lognormal difussion process. The Black Scholes formula for European call options is a particular case within the established valuation framework. The discretization of exercice opportunities allows an approximation of the call option's value which can be executed at any moment to an exercice price that strictly increases with time.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:187</identifier><datestamp>2026-04-04T12:12:33Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>spa</dc:language>
  <dc:title>Garantía de mejor precio y bienestar social en un modelo de entrada con información incompleta</dc:title>
  <dc:creator>Casado Izaga, Francisco Javier</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1998</dc:date>
  <dc:subject>Cláusula de mejor precio</dc:subject>
  <dc:subject>Colusión</dc:subject>
  <dc:subject>Prácticas restrictivas de la competencia</dc:subject>
  <dc:subject>Guaranteed lowest prices</dc:subject>
  <dc:subject>Price matching</dc:subject>
  <dc:subject>Facilitating practices</dc:subject>
  <dc:subject>Collusion</dc:subject>
  <dc:relation>Revista española de economia ; Vol. 15, Num. 2 (1998), p. 217-234</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/187</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:187</dc:identifier>
  <dc:identifier>urn:articleid:02101025v15n2p217</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>La cláusula de mejor precio es un compromiso cuyo uso es muy frecuente en el sector de ventas al detalle y que obliga a la empresa que lo aplica a igualar las mejores ofertas rivales. En la literatura se ha hecho hincapié en los efectos anticompetitivos asociados al uso de esta cláusula. Este trabajo muestra que el compromiso puede tener efectos positivos desde la perspectiva del bienestar social cuando es utilizado como mecanismo transmisor de información a potenciales entrantes.</dc:description>
  <dc:description>A guaranteed lowest prices policy is a commonly observed pricing practice in retailing markets. When firms use this clause they are publicly committing themselves to match the prices of their competitors. Literature has focused on the use of this practice in order to guarantee successful co-ordination between rivals. In contrast to this wisdom this paper shows that the clause may have positive effects from the social point of view because that it can be used in order to transmit information to firms which are considering to stablish in the market.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:188</identifier><datestamp>2026-04-04T12:12:33Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>spa</dc:language>
  <dc:title>Convergencia en las regiones españolas : cambio técnico, eficiencia y productividad</dc:title>
  <dc:creator>Maudos, Joaquín</dc:creator>
  <dc:creator>Pastor, José Manuel</dc:creator>
  <dc:creator>Serrano, Lorenzo</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1998</dc:date>
  <dc:subject>Convergencia</dc:subject>
  <dc:subject>Cambio técnico</dc:subject>
  <dc:subject>Eficiencia</dc:subject>
  <dc:subject>índice de Malmquist</dc:subject>
  <dc:subject>Convergence</dc:subject>
  <dc:subject>Technical change</dc:subject>
  <dc:subject>Efficiency</dc:subject>
  <dc:subject>Malmquist index</dc:subject>
  <dc:relation>Revista española de economia ; Vol. 15, Num. 2 (1998), p. 235-264</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/188</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:188</dc:identifier>
  <dc:identifier>urn:articleid:02101025v15n2p235</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>El objetivo de este trabajo es analizar la convergencia en la productividad del trabajo de las regiones españolas en el período 1964-1991. Se utiliza una aproximación frontera no paramétrica para calcular el índice de Malmquist de productividad. A través de su descomposición, se cuantifica la contribución del progreso técnico, de los cambios en eficiencia y de la acumulación de inputs por trabajador a la convergencia de la productividad del trabajo. A diferencia de otros trabajos, los resultados obtenidos muestran que, lejos de existir un proceso de catching-up tecnológico, el progreso técnico ha jugado en contra de la convergencia en la productividad del trabajo, dado que las regiones ricas han experimentado mayores tasas de crecimiento del progreso técnico.</dc:description>
  <dc:description>The aim of this paper is to analyze the convergence of labor productivity in the Spanish regions over the period 1964-1991. A nonparametric approach is used to compute Malmquist productivity indexes. Through their decomposition, we calculate the contribution of technical progress, changes in efficiency and inputs accumulation per worker to the convergence of labor productivity. Contrary to other papers, the results show that, far from existing a process of technological catching-up, the technical progress has played against the convergence in labor productivity, since richer regions have experienced larger rates of growth of technical progress.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:189</identifier><datestamp>2026-06-11T06:32:11Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>spa</dc:language>
  <dc:title>Fronteras de producción eficiente y convergencia regional : un comentario al trabajo de Maudos, Pastor y Serrano</dc:title>
  <dc:creator>Fuente Moreno, Ángel de la</dc:creator>
  <dc:type>Ressenya</dc:type>
  <dc:publisher/>
  <dc:date>1998</dc:date>
  <dc:relation>Revista española de economia ; Vol. 15, Num. 2 (1998), p. 265-271</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/189</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:189</dc:identifier>
  <dc:identifier>urn:articleid:02101025v15n2p265</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:190</identifier><datestamp>2026-04-04T12:12:32Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>spa</dc:language>
  <dc:title>Fronteras de producción eficiente y convergencia regional : réplica</dc:title>
  <dc:creator>Maudos, Joaquín</dc:creator>
  <dc:creator>Pastor, José Manuel</dc:creator>
  <dc:creator>Serrano, Lorenzo</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1998</dc:date>
  <dc:relation>Revista española de economia ; Vol. 15, Num. 2 (1998), p. 273-279</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/190</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:190</dc:identifier>
  <dc:identifier>urn:articleid:02101025v15n2p273</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:191</identifier><datestamp>2026-04-04T12:12:32Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>spa</dc:language>
  <dc:title>Equilibrio estratégico en economías con un continuo de agentes</dc:title>
  <dc:creator>Hervés Beloso, Carlos</dc:creator>
  <dc:creator>Moreno García, Emma</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1998</dc:date>
  <dc:subject>Economía de intercambio</dc:subject>
  <dc:subject>Economía continua</dc:subject>
  <dc:subject>Equilibrio Walrasiano</dc:subject>
  <dc:subject>Equilibrio estratégico</dc:subject>
  <dc:subject>Exchange Economy</dc:subject>
  <dc:subject>Continuum of agents</dc:subject>
  <dc:subject>Walrasian equilibrium</dc:subject>
  <dc:subject>Strategic equilibrium</dc:subject>
  <dc:relation>Revista española de economia ; Vol. 15, Num. 2 (1998), p. 281-288</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/191</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:191</dc:identifier>
  <dc:identifier>urn:articleid:02101025v15n2p281</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>En este artículo, se considera una economía de intercambio puro con un continuo de agentes que pueden comportarse estratégicamente ocultando parte de sus recursos iniciales y falsificando sus verdaderas preferencias. Se introduce un concepto de equilibrio estratégico que permite considerar como caso particular otras nociones de equilibrio bien conocidas como, por ejemplo, el equilibrio Cournot-Walras. En este marco, se prueba que el comportamiento estratégico y el comportamiento precio-aceptante de los agentes conducen a idéntico resultado.</dc:description>
  <dc:description>A pure exchange economy with a continuum of agents who behave strategically misrepresenting their initial endowments and preferences is considered. We define a notion of strategic equilibrium, which contains, as particular cases, several well known concepts of equilibrium as, for example, the Cournot-Walras equilibrium. In this setting, we precise and formalize the intuitive idea that price-taking and strategic behaviour lead to identical results.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:192</identifier><datestamp>2026-04-04T12:12:32Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>On Radial Reductions of International Indirect Taxes under the Origin Principle</dc:title>
  <dc:creator>López García, Miguel Ángel</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1998</dc:date>
  <dc:subject>International Indirect Taxation</dc:subject>
  <dc:subject>Origin Principle</dc:subject>
  <dc:subject>Imposición indirecta internacional</dc:subject>
  <dc:subject>Principio de origen</dc:subject>
  <dc:relation>Revista española de economia ; Vol. 15, Num. 2 (1998), p. 289-296</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/192</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:192</dc:identifier>
  <dc:identifier>urn:articleid:02101025v15n2p289</dc:identifier>
  <dc:identifier>urn:recercauab:ARE-66710</dc:identifier>
  <dc:identifier>urn:oai:egreta.uab.cat:publications/62934200-1a34-4f1a-a35b-84f3ceb9a5e4</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>This paper deals with the welfare effects of radial or equiproportional reductions of international indirect taxes when these are levied according to the origin principle. Focusing on the analysis of radial reductions of indirect taxes as a collective response to the tax-induced distortions on trade it is argued that this reform is potentially Pareto-improving. The discussion provides a further example of the parallelism that has sometimes been advanced between the welfare effects of multilateral tax reforms under the origin and destination principles.</dc:description>
  <dc:description>En este trabajo se discuten los efectos en términos de bienestar derivados de las reducciones radiales o equiproporcionales de los impuestos indirectos internacionales cuando éstos se recaudan sobre la base del principio de origen. Poniendo el acento en el análisis de las reducciones radiales de los impuestos indirectos como respuesta colectiva a las distorsiones en el comercio inducidas por la imposición, se muestra que esta reforma entraña un cambio potencialmente Pareto-superior. La discusión proporciona un ejemplo adicional del paralelismo que en ocasiones se ha avanzado entre los efectos sobre el bienestar de las reformas impositivas multilaterales bajo los principios de origen y de destino.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:195</identifier><datestamp>2026-04-04T12:12:32Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>spa</dc:language>
  <dc:title>Caracterización del PIB español a partir de modelos univariantes no lineales</dc:title>
  <dc:creator>Martínez, José Manuel</dc:creator>
  <dc:creator>Espasa, Antoni</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1998</dc:date>
  <dc:subject>Ciclos de actividad</dc:subject>
  <dc:subject>SETAR</dc:subject>
  <dc:subject>Medias segmentadas</dc:subject>
  <dc:subject>Raíces unitarias</dc:subject>
  <dc:subject>Regímenes cambiantes</dc:subject>
  <dc:subject>Asimetría</dc:subject>
  <dc:subject>Ciclo límite</dc:subject>
  <dc:subject>Business Cycle</dc:subject>
  <dc:subject>Segmented Means</dc:subject>
  <dc:subject>Unit Roots</dc:subject>
  <dc:subject>Switching Regimes</dc:subject>
  <dc:subject>Asymmetry</dc:subject>
  <dc:subject>Limit Cycle</dc:subject>
  <dc:relation>Revista española de economia ; Vol. 15, Num. 3 (1998), p. 325-354</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/195</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:195</dc:identifier>
  <dc:identifier>urn:articleid:02101025v15n3p325</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>En este trabajo se estudia el comportamiento dinámico del PIB español a partir de modelos de forma final (univariante). Los modelos empleados son del tipo: (a) autorregresivos por umbrales, (b) con una raíz unitaria y (c) segmentaciones en el nivel medio. Se discuten las principales direcciones de investigación sobre modelos con regímenes cambiantes, optándose por desarrollar para el caso español una orientación similar a la seguida por Tiao y Tsay (1994). Los resultados que destacan sobre el ciclo del PIB español son: (1) el crecimiento medio, la dinámica y la varianza condicional son dependientes de la fase cíclica; (2) la entrada y salida de una recesión no se deben a la dinámica del sistema, se producen por innovaciones; (3) el saldo comercial internacional parece ser un factor importante en las salidas de las crisis económicas.</dc:description>
  <dc:description>This paper studies the dynamic behaviour of Spanish GDP starting from final form (univariate) models. The models employed are of the following type: (a) threshold autoregressive, (b) with a unit root and (c) with shifts in the mean. The main directions of published research on switching regime models and the main results obtained are discussed. The option taken for the Spanish case is to develop on the TAR models proposed by Tiao and Tsay (1994) with two useful modifications. The outstanding results concerning the Spanish GDP cycle are: (1) mean growth, the dynamics and the conditional variance are dependant on the cyclical phase; (2) going into and coming out of a recession does not happen due to the dynamics of the system, only come by shocks; (3) The international trade balance is a determining factor in finding a way out of economic recessions.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:196</identifier><datestamp>2026-04-04T12:12:32Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>A Simple Model of Recurrent Hyperinflation</dc:title>
  <dc:creator>Vázquez, Jesús</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1998</dc:date>
  <dc:subject>Crawling peg rules</dc:subject>
  <dc:subject>Government debt</dc:subject>
  <dc:subject>Global and local dynamics</dc:subject>
  <dc:subject>Reglas crawling peg</dc:subject>
  <dc:subject>Deuda pública</dc:subject>
  <dc:subject>Dinámica global y local</dc:subject>
  <dc:relation>Revista española de economia ; Vol. 15, Num. 3 (1998), p. 355-377</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/196</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:196</dc:identifier>
  <dc:identifier>urn:articleid:02101025v15n3p355</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>The model developed in this paper builds on Cagan's demand for money by considering that a share of government expenditure is spent on servicing foreign debt obligations and fixed in foreign currency. Given this fiscal policy the choice of the depreciation rate implies a passive money supply rule. We show in this model that two types of high-inflation path exist. One type is driven by crawling peg rules of the official exchange rate and is characterized by the saddle-stable path dynamics. The other type characterizes hyperinflationary dynamics. This latter type is a consequence of the global dynamics of the model. The existence of these two types of path can generate recurrent hyperinflation. Moreover, hyperinflation can arise independently of government spending.</dc:description>
  <dc:description>A partir de la función de demanda de dinero de Cagan, el modelo desarrollado en este artículo considera que una fracción del gasto gubernamental se destina al pago de intereses asociado a la deuda externa y que dicho pago es constante medido en unidades de la moneda extranjera. Dada esta política fiscal, la elección de una tasa de depreciación del tipo de cambio implica una política monetaria pasiva. En este modelo, mostramos que dos tipos de sendas de alta inflación existen. Un tipo de estas sendas se deriva de la adopción de reglas sobre la tasa de depreciación del tipo de cambio oficial, conocidas como crawling peg rules. Este tipo de sendas están caracterizadas por una dinámica de punto de silla. El otro tipo de sendas caracterizan dinámicas hiperinflacionarias. Este último tipo es una consecuencia de la dinámica global del modelo. La coexistencia de estos dos tipos de sendas puede generar hiperinflaciones recurrentes. Además, las hiperinflaciones pueden surgir independientemente de variaciones del gasto del gobierno.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:197</identifier><datestamp>2026-04-04T12:12:32Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>Ex-post Real Interest Rates versus Ex-ante Real Rates : a CCAPM Approach</dc:title>
  <dc:creator>Ayuso, Juan</dc:creator>
  <dc:creator>López Salido, J. David</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1998</dc:date>
  <dc:subject>Inflation expectation errors</dc:subject>
  <dc:subject>Inflation risk premia</dc:subject>
  <dc:subject>Preference specifications</dc:subject>
  <dc:subject>Errores de expectativas de inflación</dc:subject>
  <dc:subject>Prima de riesgo inflacionista</dc:subject>
  <dc:subject>Preferencias</dc:subject>
  <dc:relation>Revista española de economia ; Vol. 15, Num. 3 (1998), p. 379-401</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/197</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:197</dc:identifier>
  <dc:identifier>urn:articleid:02101025v15n3p379</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>We use an integrated framework based on the CCAPM to jointly estimate ex-ante real interest rates, (bounds on) inflation risk premia and (bounds on) agents' inflation expectation errors. Using the Spanish economy as a natural case study, we illustrate that, for different preference specifications, 1-year ex-ante real interest rates exhibit a very low correlation with the 1-year ex-post rate. According to our results, the difference between both real rates seems to be mainly explained in terms of agents' inflation expectation errors, while the inflation premia play a minor role.</dc:description>
  <dc:description>Usando el marco proporcionado por el modelo CCAPM podemos estimar conjuntamente tipos de interés reales ex-ante, y cotas a las expectativas de inflación y primas de riesgo inflacionista. Utilizamos la economía española para ilustrar la baja correlación existente entre los tipos reales ex-ante a un año y sus correspondientes tipos ex-post. Nuestros resultados confirman la importancia de las expectativas de inflación para explicar tales diferencias.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:198</identifier><datestamp>2026-04-04T12:12:31Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>spa</dc:language>
  <dc:title>Impacto de la inversión en infraestructuras sobre el producto, la ocupación y la inversión privada en España</dc:title>
  <dc:creator>Roca i Sagalés, Oriol</dc:creator>
  <dc:creator>Pereira, Alfredo M.</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1998</dc:date>
  <dc:subject>Capital público</dc:subject>
  <dc:subject>Vectores autorregresivos</dc:subject>
  <dc:subject>Análisis sectorial</dc:subject>
  <dc:subject>Public capital</dc:subject>
  <dc:subject>Vector Autorregressions</dc:subject>
  <dc:subject>Sectoral analysis</dc:subject>
  <dc:relation>Revista española de economia ; Vol. 15, Num. 3 (1998), p. 403-432</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/198</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:198</dc:identifier>
  <dc:identifier>urn:articleid:02101025v15n3p403</dc:identifier>
  <dc:identifier>urn:recercauab:ARE-15294</dc:identifier>
  <dc:identifier>urn:oai:egreta.uab.cat:publications/3bb89cee-1b56-4ea0-9938-529462bba36c</dc:identifier>
  <dc:identifier>urn:oai:egreta.uab.cat:publications/fdb74916-ff04-4e9d-93d8-ae954911bda3</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>En este artículo se pretende definir un modelo que permita evaluar el impacto de la inversión en infraestructuras de transportes y comunicaciones sobre el comportamiento de la economía española. Se propone un modelo de vectores autorregresivos, para la estimación del impacto de un shock en la tasa de crecimiento del capital público sobre las variables PIB, capital privado y trabajo. Los datos cubren el período 1970-1991. Se considera la estimación de un modelo agregado referente al total de la economía, y también cuatro modelos sectoriales, lo cual permite la estimación de como se reparten los efectos económicos entre los sectores considerados.</dc:description>
  <dc:description>In this article we define a model which allows the evaluation of transport and communication infrastructural investment on the Spanish economy. More specifically, a vector autoregression model is proposed for the estimation of the impact of a public investment impulse on GDP, private capital and labor. Using Spanish economy data for the period 1970-1991, the model is estimated firstly for the whole economy and secondly for four different sectors corresponding to agriculture, manufacturing, construction and services. As a result, the sectoral distribution of the total effects is also measured.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:199</identifier><datestamp>2026-04-04T12:12:31Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>spa</dc:language>
  <dc:title>Estructura impositiva, capital público y ciclo económico</dc:title>
  <dc:creator>Manzano, Baltasar</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1998</dc:date>
  <dc:subject>Ciclo económico</dc:subject>
  <dc:subject>Sistema impositivo</dc:subject>
  <dc:subject>Políticas de inversión pública</dc:subject>
  <dc:subject>Business cycle</dc:subject>
  <dc:subject>Tax system</dc:subject>
  <dc:subject>Public investment policies</dc:subject>
  <dc:relation>Revista española de economia ; Vol. 15, Num. 3 (1998), p. 433-461</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/199</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:199</dc:identifier>
  <dc:identifier>urn:articleid:02101025v15n3p433</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>En este trabajo se analizan los potenciales efectos que diferentes políticas impositivas y de inversión pública tendrían sobre las características del ciclo económico. Se plantea un modelo de equilibrio general, calibrado con datos de la economía española, donde el stock de capital público aparece como un input adicional. La utilización de un determinado impuesto para ajustar las fluctuaciones de gastos e ingresos del gobierno, genera un comportamiento estocástico del tipo impositivo, que se transmite al precio del bien gravado, aumentando la volatilidad relativa de este bien. Así, los resultados indican que los impuestos tienen un efecto distorsionante diferenciado, provocando cambios en la transmisión de las fluctuaciones económicas. La imposición indirecta reduce las fluctuaciones del producto respecto a la imposición directa. Adicionalmente, se analiza el coste de bienestar del ciclo económico y los efectos de políticas procíclicas y contracíclicas de inversión pública sobre la inversión privada.</dc:description>
  <dc:description>The aim of this paper is to analize the potential effects that different tax and public investment policies would have on the business cycle features. We set a general equilibrium model, calibrated with Spanish economy data, where public capital stock is an additional input. The use of different taxes to fulfill the government budget constraint, induces an stochastic path for the tax rate, that affects the taxed good price, increasing the relative volatility of this good. So, distorting effects of taxes change business cycle properties. Consumption taxes reduce output fluctuations relative to direct taxation. We analize the welfare cost of the business cycle and the effect of the design of the public investment policy over the business cycle on private investment.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:200</identifier><datestamp>2026-04-04T12:12:30Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>spa</dc:language>
  <dc:title>Liquidez, costes financieros e inversión de las empresas españolas : un análisis empírico</dc:title>
  <dc:creator>García Marco, Teresa</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1998</dc:date>
  <dc:subject>Restricciones financieras</dc:subject>
  <dc:subject>Inversión</dc:subject>
  <dc:subject>Activos específicos</dc:subject>
  <dc:subject>Liquidez</dc:subject>
  <dc:subject>Borrowing constraint</dc:subject>
  <dc:subject>Investment</dc:subject>
  <dc:subject>Specific assets</dc:subject>
  <dc:subject>Tax shield</dc:subject>
  <dc:subject>Liquidity</dc:subject>
  <dc:relation>Revista española de economia ; Vol. 15, Num. 3 (1998), p. 463-486</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/200</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:200</dc:identifier>
  <dc:identifier>urn:articleid:02101025v15n3p463</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.</dc:rights>
  <dc:rights>https://rightsstatements.org/vocab/InC/1.0/</dc:rights>
  <dc:description>Este artículo analiza el comportamiento inversor de una muestra de empresas españolas que cotizan en bolsa a través de un modelo dinámico. La inversión es explicada con características financieras como, liquidez, costes de quiebra, ahorro fiscal y activos específicos de las empresas. Los resultados obtenidos son dos principalmente. El primero es una fuerte relación entre la inversión y la deuda, además el efecto endeudamiento sobre la inversión es mayor en las empresas con activos menos líquidos que en las empresas con activos más líquidos, lo que puede indicar, restricciones financieras. El segundo resultado es que la relación entre liquidez y valor de liquidación de los activos en caso de quiebra es negativa.</dc:description>
  <dc:description>This paper analyzes the investment behavior of Spanish firms through a dynamic model where investment is explained by financial characteristics such as, liquidity, bankruptcy costs, tax shield and specific assets of the firms. The model is estimated for a sample of Spanish quoted manufacturing firms during 1991-1995. Two main results arise. First, a strong relationship between investment and debt has been found. Moreover, indebtedness rate effects on investment are larger in less liquid asset firms than in more liquid asset firms. That seemingly indicates that those are financial constraints. Secondly, a negative relationship between liquidity and scrapping value of assets (in the case of bankruptcy). In this case, the firm uses internal financial resources to extend liquidity and to make optimal investment decisions.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:202</identifier><datestamp>2026-04-10T10:13:06Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>spa</dc:language>
  <dc:title>Familia e inserción social</dc:title>
  <dc:creator>Álvarez Suárez, Mayda</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Inserción social y familia</dc:subject>
  <dc:subject>Funciones familiares</dc:subject>
  <dc:subject>Tamaño y composición de las familias</dc:subject>
  <dc:subject>Matrimonio</dc:subject>
  <dc:subject>Divorcio</dc:subject>
  <dc:subject>Fecundiad</dc:subject>
  <dc:subject>Trabajo doméstico</dc:subject>
  <dc:subject>Comunicación familiar</dc:subject>
  <dc:subject>Family functions</dc:subject>
  <dc:subject>Social insertion</dc:subject>
  <dc:subject>Family composition</dc:subject>
  <dc:subject>Domestic labour</dc:subject>
  <dc:relation>Papers : revista de sociologia ; Num. 52 (1997), p. 101-113</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/202</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:202</dc:identifier>
  <dc:identifier>urn:10.5565/rev/papers.1883</dc:identifier>
  <dc:identifier>urn:articleid:20139004n52p101</dc:identifier>
  <dc:identifier>urn:oai:papers.revistes.uab.cat:article/1883</dc:identifier>
  <dc:identifier>urn:oai:raco.cat:article/25467</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest document està subjecte a una llicència d'ús Creative Commons. Es permet la reproducció total o parcial, la distribució, la comunicació pública de l'obra i la creació d'obres derivades, sempre que no sigui amb finalitats comercials, i sempre que es reconegui l'autoria de l'obra original.</dc:rights>
  <dc:rights>https://creativecommons.org/licenses/by-nc/3.0/</dc:rights>
  <dc:description>Profundos y trascendentales cambios han tenido lugar en la estructura y funcionamiento de la familia en todo el mundo y Cuba no ha estado ajena a los mismos.El presente artículo analiza las variaciones que la inserción a diferentes sectores y grupos sociales introduce en el funcionamiento familiar.Se inicia la caracterización de las familias cubanas con datos acerca del tamaño y composición de los hogares. Se destaca la disminución del tamaño medio de los núcleos, el aumento de los hogares encabezados por mujeres y la disminución de las diferencias del tamaño de las familias entre zonas urbanas y rurales a partir de 1959.La función biosocial de la familia es abordada a través del análisis de los procesos de formación y disolución de las familias y de sus aportes a la reproducción de la población.Un estudio realizado en una muestra representativa nacional de familias obreras y de trabajadores intelecturales, urbanas y completas, sirve de base para el análisis de las variaciones que la inserción social de los miembros adultos introduce en el cumplimiento de las funciones económica y cultural de la familia. El artículo concluye con reflexiones acerca del papel de la familia en la sociedad cubana actual.</dc:description>
  <dc:description>Deep changes have taken place in the family structure and function everywhere in the world and in Cuba. This article deals with the changes induced by insertion in different sectors and social groups. It examines variations in family composition and dimension as well as the biosocial function of this institution through statistical and survey data.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:203</identifier><datestamp>2026-04-10T10:13:06Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>spa</dc:language>
  <dc:title>Cuba : medio físico e infraestructura económica</dc:title>
  <dc:creator>Díaz Vásquez, Julio A.</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Sector agropecuario</dc:subject>
  <dc:subject>Complejo agroindustrial azucarero</dc:subject>
  <dc:subject>Concentración industrial</dc:subject>
  <dc:subject>Cuban agriculture</dc:subject>
  <dc:subject>Cuban sugar industry</dc:subject>
  <dc:subject>Industrial concentration in Cuba</dc:subject>
  <dc:relation>Papers : revista de sociologia ; Num. 52 (1997), p. 11-31</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/203</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:203</dc:identifier>
  <dc:identifier>urn:10.5565/rev/papers/v52n0.1877</dc:identifier>
  <dc:identifier>urn:articleid:20139004n52p11</dc:identifier>
  <dc:identifier>urn:oai:raco.cat:article/25460</dc:identifier>
  <dc:identifier>urn:oai:papers.revistes.uab.cat:article/1877</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest document està subjecte a una llicència d'ús Creative Commons. Es permet la reproducció total o parcial, la distribució, la comunicació pública de l'obra i la creació d'obres derivades, sempre que no sigui amb finalitats comercials, i sempre que es reconegui l'autoria de l'obra original.</dc:rights>
  <dc:rights>https://creativecommons.org/licenses/by-nc/3.0/</dc:rights>
  <dc:description>El trabajo compendia lo más relevante del medio geográfico de Cuba. Ofrece, en apretada síntesis, una caracterización de los recursos naturales, así como las formas que asume la explotación de la tierra y el desempeño del sector agropecuario de la Isla. Describe el potencial y comportamiento de los sectores económicos incluyendo las principales ramas industriales del país. Relaciona el nivel alcanzado en el desarrollo de las actividades industriales, transporte y comunicaciones que apoyan el desenvolvimiento de la economía nacional. Varias tablas estadísticas muestran los datos que amplian el caudal informativo acerca de los medios e infraestructrua económica de que dispone Cuba.</dc:description>
  <dc:description>This piece of work sythesizes the most relevant aspects of Cuban geography and natural resources, as roell as the forms of land exploitation. It describes the role and behaviour of economic sectors and the development of industrial activities, transport and comunications. Statiscal data show the development of economic infrastructure of Cuba.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:204</identifier><datestamp>2026-04-10T10:13:06Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>spa</dc:language>
  <dc:title>El sistema educativo cubano en los noventa</dc:title>
  <dc:creator>Álvarez Figueroa, Oneida</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Educación</dc:subject>
  <dc:subject>Sistema educativo</dc:subject>
  <dc:subject>Escuelas</dc:subject>
  <dc:subject>Universidad</dc:subject>
  <dc:subject>Personal docente</dc:subject>
  <dc:subject>Tasa de escolaridad</dc:subject>
  <dc:subject>Presupuesto educacional</dc:subject>
  <dc:subject>Enseñanza básica</dc:subject>
  <dc:subject>Alumnos</dc:subject>
  <dc:subject>Planes de estudios</dc:subject>
  <dc:subject>Education</dc:subject>
  <dc:subject>Educational system</dc:subject>
  <dc:subject>Levels of education</dc:subject>
  <dc:relation>Papers : revista de sociologia ; Num. 52 (1997), p. 115-137</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/204</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:204</dc:identifier>
  <dc:identifier>urn:10.5565/rev/papers.1884</dc:identifier>
  <dc:identifier>urn:articleid:20139004n52p115</dc:identifier>
  <dc:identifier>urn:oai:papers.revistes.uab.cat:article/1884</dc:identifier>
  <dc:identifier>urn:oai:raco.cat:article/25468</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest document està subjecte a una llicència d'ús Creative Commons. Es permet la reproducció total o parcial, la distribució, la comunicació pública de l'obra i la creació d'obres derivades, sempre que no sigui amb finalitats comercials, i sempre que es reconegui l'autoria de l'obra original.</dc:rights>
  <dc:rights>https://creativecommons.org/licenses/by-nc/3.0/</dc:rights>
  <dc:description>La estrategia cubana de desarrollo ha concedido especial atención al sistema educativo como uno de los ejes para lograr la modernización de la estructura económica, reduciendo las desigualdades sociales. Desde esta perspectiva, el presente artículo ofrece un panorama general del sistema educativo, comenzando por un análisis histórico en el que se trata de la etapa colonial española, del impacto de la ocupación norteamericana, de la etapa prerrevolucionaria y del desarrollo de la educación a partir de 1959, poniendo mayor énfasis en el análisis del sistema educativo cubano durante la presente década. Para hacerlo, se estructura el trabajo en tres partes que analizan las características y retos principales de la enseñanza básica, media y superior respectivamente. Se presentan los principios del sistema, su estructura, organización, niveles logrados en los principales índices valorativos del sector y su dinámica, y se intenta señalar los principales nudos gordianos en la perspectiva del cercano siglo XXI.</dc:description>
  <dc:description>Cuban development strategy has centred in the educational system, in order to modernize the economic structure and reduce social inequalities. The article examines the historical evolution of Cuban educational system from Spanish colonization, the 1959 revolution to the present decade. It analizes the main aspects of primary, secondary and higher education, as well as the most important endeavour towards xxith Century.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:205</identifier><datestamp>2026-04-10T10:13:06Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>spa</dc:language>
  <dc:title>Religión, cultura y sociedad en Cuba</dc:title>
  <dc:creator>Ramírez Calzadilla, Jorge</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Religiosidad</dc:subject>
  <dc:subject>Expresión religiosa</dc:subject>
  <dc:subject>Religiosidad popular</dc:subject>
  <dc:subject>Significación social de la religión</dc:subject>
  <dc:subject>Reactivamiento religioso</dc:subject>
  <dc:subject>Modelo sociocultural</dc:subject>
  <dc:subject>Cuadro religioso cubano</dc:subject>
  <dc:subject>Religiosity</dc:subject>
  <dc:subject>Popular religiosity</dc:subject>
  <dc:subject>Sociocultural model of Cuban religiosity</dc:subject>
  <dc:relation>Papers : revista de sociologia ; Num. 52 (1997), p. 139-153</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/205</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:205</dc:identifier>
  <dc:identifier>urn:10.5565/rev/papers/v52n0.1885</dc:identifier>
  <dc:identifier>urn:articleid:20139004n52p139</dc:identifier>
  <dc:identifier>urn:oai:papers.revistes.uab.cat:article/1885</dc:identifier>
  <dc:identifier>urn:oai:raco.cat:article/25469</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest document està subjecte a una llicència d'ús Creative Commons. Es permet la reproducció total o parcial, la distribució, la comunicació pública de l'obra i la creació d'obres derivades, sempre que no sigui amb finalitats comercials, i sempre que es reconegui l'autoria de l'obra original.</dc:rights>
  <dc:rights>https://creativecommons.org/licenses/by-nc/3.0/</dc:rights>
  <dc:description>El cuadro religioso cubano presenta una peculiar complejidad por la diversidad de formas y organizaciones religiosas que lo componen y en especial por las notables diferencias entre ellas. Esto responde a que históricamente se han establecido distintos modelos socioculturales que han aportado modos distintos de expresar la religiosidad.De la cultura aborigen, quedan algunas huellas poco perceptibles. Los modelos más importantes, el español y el africano, establecieron respectivamente el catolicismo con carácter hegemónico y expresiones cubanizadas conformadas en un proceso de transculturación. El modelo norteamericano importó el espiritismo y más de 50 denominaciones protestantes. Por otras influencias se han incorporado el vodú haitiano, formas religiosas de chinos, el judaísmo, etc.Si bien en la mayoría de la población existen elementos religiosos, el pueblo cubano sin embargo no es eminentemente católico, protestante, santero o espiritista. Prevalece una religiosidad espontánea, asistemática, referida principalmente a la cotidianeidad que se expresa en variadas devociones, creencias y prácticas de contenido más bien mágico y supersticioso.Se destaca que en conjunto la religión no ha alcanzado en Cuba un nivel alto de significación sociopolítica en su intervención en la reproducción de la sociedad concreta. Ha tenido sucesivos momentos de incremento y de recesión. Se han verificado momentos de reactivamiento religioso en las etapas colonial, republicana neocolonial y revolucionaria. Actualmente, coincidiendo con una crisis socioeconómica se constata un reactivamiento religioso, debido a múltiples factores, desde 1989 y más aún en los años noventa.</dc:description>
  <dc:description>There are several religious forms and organizations in Cuba. Religiosity is shown in different sociocultural models. There are several cultural models: Spanish, African, Northamerican, Haity vudú, Chinese religious practices, etc. which have influenced Cuban religious believes and practices.However Cuba is a Catholic country and religion has no sociopolitical signifcance, except for a slight increase of religiosity since 1989-1990.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:206</identifier><datestamp>2026-04-10T10:13:06Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>spa</dc:language>
  <dc:title>El legado africano en Cuba</dc:title>
  <dc:creator>Bolívar, Natalia</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Santería o Regla de Ocha</dc:subject>
  <dc:subject>Esclavitud</dc:subject>
  <dc:subject>Cabildos</dc:subject>
  <dc:subject>Partido de los Independientes de Color</dc:subject>
  <dc:subject>Santeros y paleros (sacerdotes)</dc:subject>
  <dc:subject>Casas de babalawos (templos)</dc:subject>
  <dc:subject>Religión</dc:subject>
  <dc:subject>Creencias</dc:subject>
  <dc:subject>Santería</dc:subject>
  <dc:subject>Religion</dc:subject>
  <dc:subject>Slavery</dc:subject>
  <dc:subject>Coloured Independent Party</dc:subject>
  <dc:relation>Papers : revista de sociologia ; Num. 52 (1997), p. 155-166</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/206</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:206</dc:identifier>
  <dc:identifier>urn:10.5565/rev/papers.1886</dc:identifier>
  <dc:identifier>urn:articleid:20139004n52p155</dc:identifier>
  <dc:identifier>urn:oai:papers.revistes.uab.cat:article/1886</dc:identifier>
  <dc:identifier>urn:oai:raco.cat:article/25470</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest document està subjecte a una llicència d'ús Creative Commons. Es permet la reproducció total o parcial, la distribució, la comunicació pública de l'obra i la creació d'obres derivades, sempre que no sigui amb finalitats comercials, i sempre que es reconegui l'autoria de l'obra original.</dc:rights>
  <dc:rights>https://creativecommons.org/licenses/by-nc/3.0/</dc:rights>
  <dc:description>En este artículo se trata de la actividad religiosa, o parareligiosa, practicada en amplios sectores de la población de color de Cuba, que hunde sus raíces en su anterior vida en África y en la esclavitud. Porque los esclavos negros mantuvieron inicialmente el culto de sus antiguos dioses, y también de sus costumbres y asociaciones, que en alguna forma sobrevivieron y a la larga dieron lugar a varios sistemas religiosos en los que restructuraron sus creencias. Y así las prácticas religiosas de la cultura yoruba cristalizaron en un solo cuerpo litúrgico al que denominaron la Regla de Ocha o santería; las procedentes del Congo y Angola en la Regla de Palo o mayombe, y en forma parecida nacieron los preceptos religiosos de la sociedad secreta Abakuá, procedente de Nigeria; las casas de babalawos, etc. Con la independencia (1898) paradójicamente se produjo cierta persecución de corte racista contra la población de color, hasta que en 1940 se promulgó una nueva Constitución favorable a la libertad religiosa. Por último el artículo describe someramente las distintas actitudes que se han tenido desde 1959 y se cierra con un cuadro que describe el sincretismo religioso existente entre las distintas vírgenes cristianas y divinidades afrocubanas equivalentes.</dc:description>
  <dc:description>The article deals with religious activity and para-religious practices among coloured Cuban population, due to African roots and slavery. Yoruba cultural and religious traditions have developed into a unique liturgy called the Regla de Ocha or Santería, those coming from Congo and Angola have influenced the Regla del Palo o Mayombe, etc. Since 1940 Religious freedom has been garanteed. Since 1959 different attitudes have developed into the actual religious sincretism.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:207</identifier><datestamp>2026-04-10T10:13:06Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>spa</dc:language>
  <dc:title>Cultura y prostitución : una solución posible</dc:title>
  <dc:creator>Díaz Canals, Teresa</dc:creator>
  <dc:creator>González Olmedo, Graciela</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Mujer</dc:subject>
  <dc:subject>Prostitución</dc:subject>
  <dc:subject>Crisis</dc:subject>
  <dc:subject>Valores</dc:subject>
  <dc:subject>Women</dc:subject>
  <dc:subject>Prostitution</dc:subject>
  <dc:subject>Economic crisis in Cuban</dc:subject>
  <dc:relation>Papers : revista de sociologia ; Num. 52 (1997), p. 167-175</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/207</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:207</dc:identifier>
  <dc:identifier>urn:10.5565/rev/papers/v52n0.1887</dc:identifier>
  <dc:identifier>urn:articleid:20139004n52p167</dc:identifier>
  <dc:identifier>urn:oai:papers.revistes.uab.cat:article/1887</dc:identifier>
  <dc:identifier>urn:oai:raco.cat:article/25472</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest document està subjecte a una llicència d'ús Creative Commons. Es permet la reproducció total o parcial, la distribució, la comunicació pública de l'obra i la creació d'obres derivades, sempre que no sigui amb finalitats comercials, i sempre que es reconegui l'autoria de l'obra original.</dc:rights>
  <dc:rights>https://creativecommons.org/licenses/by-nc/3.0/</dc:rights>
  <dc:description>Es indudable que el proceso de transformaciones económicas, políticas y sociales que se llevó a cabo en Cuba a partir de 1959 eliminó las bases en las que se sustentaba la existencia de la prostitución. La mujer cubana fue beneficiaria de un conjunto de medidas aplicadas como resultado del triunfo revolucionario. El estudio, el trabajo, la salud, la seguridad social, fueron posibles entonces y ahora.El resurgimiento de este fenómeno en los últimos años de forma explosiva tiene sus causas principales en la profunda crisis económica a que nuestro país fue sometido como resultado del recrudecimiento del bloqueo norteamericano (hoy evidenciado en la Ley Helms-Burton) y el derrumbe del socialismo europeo, lo que provocó la pérdida de ventajas comerciales.La necesidad de reflexionar sobre el problema nos lleva, en primer lugar, a tener en cuenta ante todo que la solución del mismo pasa por la comprensión de que en toda relación mercantil se prostituye no sólo la mujer que vende sino el hombre que paga. Hay también todo un conjunto de factores que incidieron en el resurgimiento de la prostitución: problemas con la transmisión de valores y medidas económicas imprescindibles de tomar para enfrentar la situación económica a partir del año 1989.Asumir un paradigma en el tránsito al nuevo orden social que señalaba la desaparición de la prostitución por sí sola en cuanto se resolviera el contexto macrosocial, ha traido consecuencias inesperadas para el modelo establecido. Es de esperar que en la medida que Cuba se enfrente, como lo está haciendo ya, a la crisis que ha deteriorado el nivel de vida de su población, en la medida que se elimine el efecto de espejismo del turismo internacional, en la medida que se revaloricen los elementos clave que contribuyeron a su aparición, esa prostitución sui generis, peculiar en sus manifestaciones, pierda su razón de ser.La dimensión cultural a la que hacemos referencia en el trabajo es importante para cualquier solución en el caso cubano, exluiría un tratamiento moralista del problema y todo tipo de discriminación hacia la mujer que en el plano subjetivo aún pudiera subsistir.</dc:description>
  <dc:description>It goes without saying that the process of economic, political and social transformations of Cuba since 1959 have eliminated the grounds for the existence of prostitution. Cuban women benefited from political measures according to revolutionary principles which helped women study, work, health and social security.In the last few years prostitution has experiencede an increase because of the economic crisis due to American blocage (Helms-Burton law) and the declive of European socialism.It is necessary to think on this problem to soloe it. It is clear that the commercial relation prostitution means affect not only women but men who pay for such activity. There are other factors which affect the resurgence of prostitution value system and economic policies to deal with the economic situation since 1989.The construction of a paradigm of the transition towards a new social order that implicitly denied prostitution at the macrosocial level has had non-attended consequences. As far as Cuba shall confront the actual economic crisis which has greatly decreased her population life estandards, controls international tourism and recovery her key elements, prostitution sui generis well disappear.Cultural dimension is central to the Cuban case aprecially to the problem of women discrimination.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:208</identifier><datestamp>2026-04-10T10:13:05Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>spa</dc:language>
  <dc:title>El sida en Cuba</dc:title>
  <dc:creator>Rodríguez Roch, Liana</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Sida</dc:subject>
  <dc:subject>VIH</dc:subject>
  <dc:subject>Grupos de riesgo</dc:subject>
  <dc:subject>Seropositivo</dc:subject>
  <dc:subject>Sexualidad</dc:subject>
  <dc:subject>Seropositive</dc:subject>
  <dc:subject>Aids</dc:subject>
  <dc:subject>Sexuality</dc:subject>
  <dc:relation>Papers : revista de sociologia ; Num. 52 (1997), p. 177-186</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/208</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:208</dc:identifier>
  <dc:identifier>urn:10.5565/rev/papers/v52n0.1888</dc:identifier>
  <dc:identifier>urn:articleid:20139004n52p177</dc:identifier>
  <dc:identifier>urn:oai:papers.revistes.uab.cat:article/1888</dc:identifier>
  <dc:identifier>urn:oai:raco.cat:article/25474</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest document està subjecte a una llicència d'ús Creative Commons. Es permet la reproducció total o parcial, la distribució, la comunicació pública de l'obra i la creació d'obres derivades, sempre que no sigui amb finalitats comercials, i sempre que es reconegui l'autoria de l'obra original.</dc:rights>
  <dc:rights>https://creativecommons.org/licenses/by-nc/3.0/</dc:rights>
  <dc:description>Las siglas S.I.D.A. significan síndrome de inmuno deficiencia adquirida. Sida es una definición operativa del estadio extremo de la infección por el VIH (virus de la inmunodeficiencia humana).Las estadísticas indican que las vías de difusión más frecuentes en el mundo son las relaciones sexuales de riesgo y la utilización de drogas por vía intravenosa, hecho este último que no constituye un problema en Cuba.Con el sida, la sexualidad y la muerte, ambos viejos tabúes, han saltado a la palestra para formar un binomio que es sinónimo público de enfermedad; la sociedad se enfrenta a un reto complejo en el que la moral y las costumbres dictan las principales normas de actuación. El VIH es un virus biológico que ha "descubierto" viejos, agresivos y letales "virus" sociales.En 1986 se diagnosticaron los primeros casos de VIH en Cuba. En ese mismo año se pone en práctica el Programa Nacional de Lucha contra el Sida para el control y prevención de la infección por VIH. La estrategia cubana contemplaría como aspectos fundamentales el pesquisaje masivo, el tratamiento sanatorial y la educación sanitaria.</dc:description>
  <dc:description>Aids is the extreme result of the HIV infection. Statistics show several ways of diffussion of "sida" or Aids through sexual relations, drugs, etc. This things into question the problem of death, sexuality, illness, to be controlled by the National Pragramme to Fight Aids as well as health treatment and education.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:209</identifier><datestamp>2026-04-10T10:13:05Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>spa</dc:language>
  <dc:title>Aproximación a la sociología cubana</dc:title>
  <dc:creator>Núñez Jover, Jorge</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Sociología</dc:subject>
  <dc:subject>Historia de la ciencia</dc:subject>
  <dc:subject>Ciencias sociales</dc:subject>
  <dc:subject>Institucionalización</dc:subject>
  <dc:subject>Cuba</dc:subject>
  <dc:subject>Sociology</dc:subject>
  <dc:subject>History of science</dc:subject>
  <dc:subject>Social sciences</dc:subject>
  <dc:subject>Institutionalization</dc:subject>
  <dc:relation>Papers : revista de sociologia ; Num. 52 (1997), p. 187-203</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/209</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:209</dc:identifier>
  <dc:identifier>urn:10.5565/rev/papers.1889</dc:identifier>
  <dc:identifier>urn:articleid:20139004n52p187</dc:identifier>
  <dc:identifier>urn:oai:papers.revistes.uab.cat:article/1889</dc:identifier>
  <dc:identifier>urn:oai:raco.cat:article/25475</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest document està subjecte a una llicència d'ús Creative Commons. Es permet la reproducció total o parcial, la distribució, la comunicació pública de l'obra i la creació d'obres derivades, sempre que no sigui amb finalitats comercials, i sempre que es reconegui l'autoria de l'obra original.</dc:rights>
  <dc:rights>https://creativecommons.org/licenses/by-nc/3.0/</dc:rights>
  <dc:description>Existen muy pocos estudios sobre la evolución de las ciencias sociales en Cuba. Este ensayo ofrece una descripción sintética de algunos de los procesos más importantes vinculados con la enseñanza universitaria, la formación de posgrado, las publicaciones y la investigación en el área de la sociología entre 1959 y 1995.En esta descripción se transparenta la influencia que el marco sociopolítico e ideológico ha ejercido sobre el desarrollo de esta disciplina y se fundamenta la necesidad de definir estrategias que conduzcan a la consolidación académica de la sociología y al incremento de sus interrelacions con las transformaciones que vive la sociedad cubana.</dc:description>
  <dc:description>There are very few studies about the development of the social sciences in Cuba. The idea that sustains this document is the need of studying the history of various scientific disciplines as a resource por defining present and future policies.This essay offers a synthetic description of some of the most important processes related with undergraduate studies, postgraduate studies, publications and research in cuban sociology between 1959 and 1995.The influence which the sociopolitical and ideological frame has exerted upon the development of this discipline is demonstrated and the need of defining strategies that leed to the academic consolidation of sociology, as well as to increase its interrelations with the transformations that cuban society currently lives.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:210</identifier><datestamp>2026-04-10T10:13:05Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>spa</dc:language>
  <dc:title>La población</dc:title>
  <dc:creator>Morejón Seijas, Blanca</dc:creator>
  <dc:creator>Molina Soto, Juan</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Población</dc:subject>
  <dc:subject>Demografía</dc:subject>
  <dc:subject>Crecimiento demográfico</dc:subject>
  <dc:subject>Migraciones</dc:subject>
  <dc:subject>Tasas demográficas</dc:subject>
  <dc:subject>Fecundidad</dc:subject>
  <dc:subject>Mortalidad</dc:subject>
  <dc:subject>Esperanza media de vida</dc:subject>
  <dc:subject>Estructura demográfica</dc:subject>
  <dc:subject>Envejecimiento</dc:subject>
  <dc:subject>Movilidad territorial</dc:subject>
  <dc:subject>Cuban population</dc:subject>
  <dc:subject>Demographic grocoth</dc:subject>
  <dc:subject>Migration</dc:subject>
  <dc:subject>Geographical mobility</dc:subject>
  <dc:relation>Papers : revista de sociologia ; Num. 52 (1997), p. 33-47</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/210</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:210</dc:identifier>
  <dc:identifier>urn:10.5565/rev/papers.1878</dc:identifier>
  <dc:identifier>urn:articleid:20139004n52p33</dc:identifier>
  <dc:identifier>urn:oai:papers.revistes.uab.cat:article/1878</dc:identifier>
  <dc:identifier>urn:oai:raco.cat:article/25461</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest document està subjecte a una llicència d'ús Creative Commons. Es permet la reproducció total o parcial, la distribució, la comunicació pública de l'obra i la creació d'obres derivades, sempre que no sigui amb finalitats comercials, i sempre que es reconegui l'autoria de l'obra original.</dc:rights>
  <dc:rights>https://creativecommons.org/licenses/by-nc/3.0/</dc:rights>
  <dc:description>En este artículo se trata del crecimiento demográfico desde la independencia y más especialmente desde 1959, analizando sus componentes: la fecundidad, la mortalidad y la migración externa. Sigue el estudio de la distribución territorial de la población y la migración interna, que responde a las corrientes rurales-urbanas, hacia territorios y ciudades en desarrollo, y de oriente a occidente de la Isla. El siguiente epígrafe analiza la estructura demográfica de la población, prestando atención al género y a los grupos de edad, que indican cierto envejecimiento. Del artículo se deduce que Cuba comparte con las sociedades avanzadas, la generalidad de sus índices demográficos: baja fecundidad y mortalidad, disminución de la natalidad y de la mortalidad infantil, aumento de la esperanza media de vida y aceleración en el proceso de envejecimiento, proceso de urbanización, intensa movilidad territorial, etc.</dc:description>
  <dc:description>This article deals with demographic grocoth since 1959, especially fertility, mortality and external migration. It loovy at the geographical distribution of Cuban population and internal migration, and the demographic structure of the country as far as gendre and age is concerned. Cuba has, like most advanced societies, low fertility, mortality, birth rates and higher rates of life spend and internal migration and mobility.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:211</identifier><datestamp>2026-04-10T10:13:05Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>spa</dc:language>
  <dc:title>Aproximación a un análisis del proceso migratorio cubano</dc:title>
  <dc:creator>Urrutia Barroso, Lourdes de</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Flujo migratorio</dc:subject>
  <dc:subject>Política migratoria</dc:subject>
  <dc:subject>Migración legal</dc:subject>
  <dc:subject>Migración ilegal</dc:subject>
  <dc:subject>Migration flows</dc:subject>
  <dc:subject>Migration policis</dc:subject>
  <dc:subject>Legal migration</dc:subject>
  <dc:subject>Illegal migration</dc:subject>
  <dc:relation>Papers : revista de sociologia ; Num. 52 (1997), p. 49-56</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/211</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:211</dc:identifier>
  <dc:identifier>urn:10.5565/rev/papers/v52n0.1879</dc:identifier>
  <dc:identifier>urn:articleid:20139004n52p49</dc:identifier>
  <dc:identifier>urn:oai:papers.revistes.uab.cat:article/1879</dc:identifier>
  <dc:identifier>urn:oai:raco.cat:article/25462</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest document està subjecte a una llicència d'ús Creative Commons. Es permet la reproducció total o parcial, la distribució, la comunicació pública de l'obra i la creació d'obres derivades, sempre que no sigui amb finalitats comercials, i sempre que es reconegui l'autoria de l'obra original.</dc:rights>
  <dc:rights>https://creativecommons.org/licenses/by-nc/3.0/</dc:rights>
  <dc:description>En el artículo la autora expone sus consideraciones acerca de cómo se ha comportado el flujo migratorio cubano hacia su principal país receptor: los EEUU desde el triunfo revolucionario del año 1959. Se hace referencia a la política migratoria de este país hacia Cuba y al papel que dicha política ha desempeñado dentro del diferendo existente entre ambos países. Se analizan los sucesos de agosto de 1994 y sus causas. Tambíen la autora brinda a través de variables sociodemográficas seleccionadas las características de los emigrados cubanos en los años noventa.</dc:description>
  <dc:description>This article presents Cuban migration flows towards USA since 1959, the year of revolution. Migrations have had an important rol in international relations between both countries. Characteristics of Cuban emigrees in the 90's are also examined.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:212</identifier><datestamp>2026-04-10T10:13:05Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>spa</dc:language>
  <dc:title>La cuestión "racial" en Cuba actual : algunas consideraciones</dc:title>
  <dc:creator>Guanche Pérez, Jesús</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Autoimagen racial</dc:subject>
  <dc:subject>Fenotipos populares</dc:subject>
  <dc:subject>Racialidad</dc:subject>
  <dc:subject>Endoculturación familiar</dc:subject>
  <dc:subject>Racial sefimage</dc:subject>
  <dc:subject>Popular fenotipics</dc:subject>
  <dc:subject>Raciality</dc:subject>
  <dc:subject>Domestic endoculturation</dc:subject>
  <dc:relation>Papers : revista de sociologia ; Num. 52 (1997), p. 57-65</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/212</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:212</dc:identifier>
  <dc:identifier>urn:10.5565/rev/papers.1880</dc:identifier>
  <dc:identifier>urn:articleid:20139004n52p57</dc:identifier>
  <dc:identifier>urn:oai:papers.revistes.uab.cat:article/1880</dc:identifier>
  <dc:identifier>urn:oai:raco.cat:article/25463</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest document està subjecte a una llicència d'ús Creative Commons. Es permet la reproducció total o parcial, la distribució, la comunicació pública de l'obra i la creació d'obres derivades, sempre que no sigui amb finalitats comercials, i sempre que es reconegui l'autoria de l'obra original.</dc:rights>
  <dc:rights>https://creativecommons.org/licenses/by-nc/3.0/</dc:rights>
  <dc:description>El presente trabajo valora cuestiones principales sobre la racialidad -en este caso como construcción cultural- en la sociedad cubana de los años noventa. La presencia del prejuicio racial en las estructuras horizontales de la sociedad, no obstante las acciones para transformar estas diferencias en el orden legal. Considera el papel de la autoimagen racial vinculada con la pertenencia social y su reproducción desde el nivel personal y familiar.</dc:description>
  <dc:description>The present paper rate the essential problems about raciality -in this case as cultural construction- in the cuban society at the ninety years. The presence of racial prejudice in horizontal structure of the society, however the actions to transform that differences in legal regime. Conside the rol of racial selfimage in relation with the social position and his reproduction from personal and familiar level.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:213</identifier><datestamp>2026-04-10T10:13:05Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>spa</dc:language>
  <dc:title>La juventud en el contexto de la estructura social cubana. Datos y reflexiones</dc:title>
  <dc:creator>Domínguez García, María Isabel</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Juventud</dc:subject>
  <dc:subject>Estructura social</dc:subject>
  <dc:subject>Generaciones</dc:subject>
  <dc:subject>Inserción social de la juventud</dc:subject>
  <dc:subject>Youth</dc:subject>
  <dc:subject>Social structure</dc:subject>
  <dc:subject>Youth social insertion</dc:subject>
  <dc:relation>Papers : revista de sociologia ; Num. 52 (1997), p. 67-81</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/213</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:213</dc:identifier>
  <dc:identifier>urn:10.5565/rev/papers.1881</dc:identifier>
  <dc:identifier>urn:articleid:20139004n52p67</dc:identifier>
  <dc:identifier>urn:oai:papers.revistes.uab.cat:article/1881</dc:identifier>
  <dc:identifier>urn:oai:raco.cat:article/25464</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest document està subjecte a una llicència d'ús Creative Commons. Es permet la reproducció total o parcial, la distribució, la comunicació pública de l'obra i la creació d'obres derivades, sempre que no sigui amb finalitats comercials, i sempre que es reconegui l'autoria de l'obra original.</dc:rights>
  <dc:rights>https://creativecommons.org/licenses/by-nc/3.0/</dc:rights>
  <dc:description>La juventud constituye uno de los grupos más significativos de la sociedad cubana por su alto peso numérico, sus actuales rasgos cualitativos y una larga tradición de protagonismo social a lo largo de distintas etapas de la historia nacional.El artículo analiza al sector juvenil en el contexto de la estructura generacional, demográfica y socioclasista de la población y aborda los cambios que se están produciendo en su situación social como efecto de la crisis económica que vive el país desde 1990 y de la estrategia de reestructuración que se desarrolla para salir de ella.</dc:description>
  <dc:description>Youth is one of the key social groups of Cuban society because of the number of young people and their traditional role in Cuban history.The article analyses the changes in the social situation of this group after the economic crises since 1990 and the implementation of restructuring policies in Cuba.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:214</identifier><datestamp>2026-04-10T10:13:05Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>spa</dc:language>
  <dc:title>Presentación</dc:title>
  <dc:creator>Busquets, Juli</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:relation>Papers : revista de sociologia ; Num. 52 (1997), p. 7-10</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/214</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:214</dc:identifier>
  <dc:identifier>urn:10.5565/rev/papers.1876</dc:identifier>
  <dc:identifier>urn:articleid:20139004n52p7</dc:identifier>
  <dc:identifier>urn:recercauab:ARE-10251</dc:identifier>
  <dc:identifier>urn:oai:raco.cat:article/50372</dc:identifier>
  <dc:identifier>urn:oai:papers.revistes.uab.cat:article/1876</dc:identifier>
  <dc:identifier>urn:oai:egreta.uab.cat:publications/5fd5a3bb-0d33-4865-8f8a-259b27ce7375</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest document està subjecte a una llicència d'ús Creative Commons. Es permet la reproducció total o parcial, la distribució, la comunicació pública de l'obra i la creació d'obres derivades, sempre que no sigui amb finalitats comercials, i sempre que es reconegui l'autoria de l'obra original.</dc:rights>
  <dc:rights>https://creativecommons.org/licenses/by-nc/3.0/</dc:rights>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:215</identifier><datestamp>2026-04-10T10:13:05Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>spa</dc:language>
  <dc:title>Transformaciones recientes de la estructura socioclasista cubana</dc:title>
  <dc:creator>Espina Prieto, Mayra Paula</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Estructura socioclasista</dc:subject>
  <dc:subject>Desigualdades sociales</dc:subject>
  <dc:subject>Relaciones de propiedad</dc:subject>
  <dc:subject>Socialismo</dc:subject>
  <dc:subject>Cuban class structure</dc:subject>
  <dc:subject>Social inequalities</dc:subject>
  <dc:subject>Propiety relations</dc:subject>
  <dc:subject>Socialism</dc:subject>
  <dc:relation>Papers : revista de sociologia ; Num. 52 (1997), p. 83-99</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/215</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:215</dc:identifier>
  <dc:identifier>urn:10.5565/rev/papers.1882</dc:identifier>
  <dc:identifier>urn:articleid:20139004n52p83</dc:identifier>
  <dc:identifier>urn:oai:papers.revistes.uab.cat:article/1882</dc:identifier>
  <dc:identifier>urn:oai:raco.cat:article/25466</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest document està subjecte a una llicència d'ús Creative Commons. Es permet la reproducció total o parcial, la distribució, la comunicació pública de l'obra i la creació d'obres derivades, sempre que no sigui amb finalitats comercials, i sempre que es reconegui l'autoria de l'obra original.</dc:rights>
  <dc:rights>https://creativecommons.org/licenses/by-nc/3.0/</dc:rights>
  <dc:description>Uno de los elementos básicos para caracterizar una sociedad concreta es precisamente su estructura social, entendida como la segmentación en clases, capas y grupos -y las relaciones entre estos segmentos- que le es consustancial a su reproducción. La revolución cubana significó un cambio radical en la composición socioclasista nacional, al sustituir aceleradamente la vieja estructura típica del capitalismo dependiente y periférico por la correspondiente a la transición socialista, caracterizada por altos grados de igualdad e integración social. El artículo ofrece una imagen de esa estructura propia de la transición, de sus debilidades y fortalezas y presenta algunos de los problemas claves que ha hecho emerger la crisis cubana de los noventa. Intenta demostrar que con la crisis y la estrategia diseñada para su enfrentamiento ha aparecido una nueva etapa en la reproducción socioestructural, asociada fundamentalmente a la presencia de un nuevo modelo de organización del sistema de propiedad sobre los medios de producción, donde ha cambiado sustantivamente el papel del Estado en la configuración de esta estructrua y en el que las desigualdades sociales y los procesos de desintegración tienen un espacio mayor.</dc:description>
  <dc:description>One of the basic elements of a specific society is ther social structure, that is, segmentation and differentiation by classes, groups and their relations with the social reproduction process. Cuban revolution meant a radical change of the national class composition the old social structure linked to the dependent and peripheral capitalism was quickly substituted by socialist transition in colsich high levels of social equality and integration were able. The article clearly examines the transition social structure, its strong and weak elements and shows some key problems emerging from 1990 economic crisis. It tries to demonstrate that the crisis and its solution has devoeloped into a new steps of the social structural reproduction. This has been basically associated with the existence of a new model of the property system organization of the means of production. The role of the state has accordingly changed and has influenced the system of social inequalities and the processes of non integration.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:217</identifier><datestamp>2026-04-10T10:13:05Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>spa</dc:language>
  <dc:title>Las políticas de cuidado de los niños a nivel nacional en España (1975-1996)</dc:title>
  <dc:creator>Valiente Fernández, Celia</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Cuidado de los niños</dc:subject>
  <dc:subject>España</dc:subject>
  <dc:subject>Establecimiento de la agenda</dc:subject>
  <dc:subject>Escuelas infantiles</dc:subject>
  <dc:subject>Child care</dc:subject>
  <dc:subject>Spain</dc:subject>
  <dc:subject>Agenda-setting</dc:subject>
  <dc:subject>Pre-school services</dc:subject>
  <dc:relation>Papers : revista de sociologia ; Num. 53 (1997), p. 101-136</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/217</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:217</dc:identifier>
  <dc:identifier>urn:10.5565/rev/papers.1898</dc:identifier>
  <dc:identifier>urn:articleid:20139004n53p101</dc:identifier>
  <dc:identifier>urn:oai:papers.revistes.uab.cat:article/1898</dc:identifier>
  <dc:identifier>urn:oai:raco.cat:article/25483</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest document està subjecte a una llicència d'ús Creative Commons. Es permet la reproducció total o parcial, la distribució, la comunicació pública de l'obra i la creació d'obres derivades, sempre que no sigui amb finalitats comercials, i sempre que es reconegui l'autoria de l'obra original.</dc:rights>
  <dc:rights>https://creativecommons.org/licenses/by-nc/3.0/</dc:rights>
  <dc:description>Desde 1975 las principales políticas de cuidado de los niños de ámbito nacional en España han consistido en la puesta en marcha de un alto número de programas educativos para niños de cuatro y cinco años, lo cual contrasta con la escasa oferta de tales servicios para los menores de tres años. Al examinar el papel desempeñado por distintos actores sociales y políticos en la fase del proceso de toma de decisiones políticas denominada el «establecimiento de la agenda» (agenda setting), podemos observar que los actores que desde 1975 podían haber demandado otro tipo de medidas (principalmente el movimiento de mujeres, las feministas de Estado y de los sindicatos) no las han reivindicado o lo han hecho tímidamente, debido a la influencia de los siguientes factores: el pasado político autoritario; las peculiaridades del mercado de trabajo; las características del Estado de bienestar, y las concepciones de amplios sectores de la población acerca del cuidado de los menores. En realidad, en este área de política pública se han desarrollado en las dos últimas décadas las medidas ya existentes antes de 1975, esto es, los servicios educativos en centros públicos para niños mayores de tres años.</dc:description>
  <dc:description>A distinguishing feature characterizes the main Spanish central-state child care policies (for children under six, when mandatory education starts). Most policies are educational pre-school programs for children aged three or over. The scope of these programs is quite high in comparative terms. In contrast, the percentage of Spanish children aged two or under cared for in public centers is one of the lowest in the European Union. The characteristics of Spanish child care policy can be understood by examining the political agenda, and the role played by the main social and political actors of the agenda setting stage. Those who might have emerged as determined advocates of more public child care programs after 1975, namely, the feminist movement, state feminists, and the women's departments of trade unions, have in practice not consistently advanced such demands. This paper examines why women's advocates either did not mobilize around child care issues, or were unable to introduce their demands into the government's agenda. The relevant explanatory factors include: the influence of the authoritarian political past; the characteristics of the labor market and the welfare state; and societal views on child rearing. Policy-makers have extended the programs which already existed before 1975, that is, educational services. They have been defined by policy-makers as measures that chiefly benefit children. Therefore, the policies are targeted at children aged three or over, because in Spain most policy-makers think that children should be enrolled in educational programs around the age of three.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:218</identifier><datestamp>2026-04-10T10:13:05Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>spa</dc:language>
  <dc:title>Reproducción e imagen de la mujer : crítica de género en demografía</dc:title>
  <dc:creator>Sarrible Pedroni, Graciela</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Mujer</dc:subject>
  <dc:subject>Género</dc:subject>
  <dc:subject>Fecundidad</dc:subject>
  <dc:subject>Patriarcado</dc:subject>
  <dc:subject>Woman</dc:subject>
  <dc:subject>Gender</dc:subject>
  <dc:subject>Fertility</dc:subject>
  <dc:subject>Patriarchy</dc:subject>
  <dc:relation>Papers : revista de sociologia ; Num. 53 (1997), p. 11-24</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/218</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:218</dc:identifier>
  <dc:identifier>urn:10.5565/rev/papers.1891</dc:identifier>
  <dc:identifier>urn:articleid:20139004n53p11</dc:identifier>
  <dc:identifier>urn:oai:raco.cat:article/25476</dc:identifier>
  <dc:identifier>urn:oai:papers.revistes.uab.cat:article/1891</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest document està subjecte a una llicència d'ús Creative Commons. Es permet la reproducció total o parcial, la distribució, la comunicació pública de l'obra i la creació d'obres derivades, sempre que no sigui amb finalitats comercials, i sempre que es reconegui l'autoria de l'obra original.</dc:rights>
  <dc:rights>https://creativecommons.org/licenses/by-nc/3.0/</dc:rights>
  <dc:description>El artículo trata la cuestión del género en conexión con variables demográficas y las nuevas propuestas sobre el estatus y la posición de la mujer que afectan los niveles de fecundidad tanto en sociedades en desarrollo como en sociedades avanzadas.</dc:description>
  <dc:description>The article deals with the question of gender in connection with demographic variables. New approaches to women status and social position might explain the fecundity level in advanced as well as non developed societies.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:219</identifier><datestamp>2026-04-10T10:13:05Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>spa</dc:language>
  <dc:title>La educación en la sociedad multicultural</dc:title>
  <dc:creator>Sánchez, Mariano</dc:creator>
  <dc:creator>Ordóñez, María Jesús</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Socialización</dc:subject>
  <dc:subject>Instrucción</dc:subject>
  <dc:subject>Multiculturalidad</dc:subject>
  <dc:subject>Sociología</dc:subject>
  <dc:subject>Educación</dc:subject>
  <dc:subject>Socialization</dc:subject>
  <dc:subject>Instruction</dc:subject>
  <dc:subject>Multiculturality</dc:subject>
  <dc:subject>Sociology</dc:subject>
  <dc:subject>Education</dc:subject>
  <dc:relation>Papers : revista de sociologia ; Num. 53 (1997), p. 139-148</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/219</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:219</dc:identifier>
  <dc:identifier>urn:10.5565/rev/papers.1899</dc:identifier>
  <dc:identifier>urn:articleid:20139004n53p139</dc:identifier>
  <dc:identifier>urn:oai:papers.revistes.uab.cat:article/1899</dc:identifier>
  <dc:identifier>urn:oai:raco.cat:article/25484</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest document està subjecte a una llicència d'ús Creative Commons. Es permet la reproducció total o parcial, la distribució, la comunicació pública de l'obra i la creació d'obres derivades, sempre que no sigui amb finalitats comercials, i sempre que es reconegui l'autoria de l'obra original.</dc:rights>
  <dc:rights>https://creativecommons.org/licenses/by-nc/3.0/</dc:rights>
  <dc:description>El aprender, en cuanto a experiencia condicionada por la acción recíproca entre la persona y el mundo, puede ser considerado desde un punto de vista biológico y desde un punto de vista sociocultural. Las ideas del mundo se desarrollan en distintas condiciones, el clima, las razas, las naciones determinadas por la historia y la formación de los Estados, las deli-mitaciones, condicionadas según las épocas, se enlazan con las condiciones especiales que influyen en el origen de la multiplicidad de las visiones del mundo. La diferencias entre ser, poder y fin del hombre hace necesaria la educación: una acción conjunta de los individuos con el objeto de ayudar a los recién nacidos, a los niños y niñas y adolescentes a aprender la «vida humana». La educación y su investigación, así como la reflexión crítica sobre la misma, adquieren hoy día mayor importancia, ya que la forma de vida del individuo, así como las formas de convivencia social, dependen cada vez más de soluciones a conflictos de creencias y de cultura que se deben plantear en la educación. El campo propio de la educación sería el de la libertad, como condición imprescindible para un libre desenvolvimiento de la personalidad. La educación de personas libres, en cuanto no puede tener otro fin que el desenvolvimiento libre de la personalidad, rechaza toda coacción. Tendríamos así un modelo de educación en el que el ideal que la define se concreta en el desarrollo de personas libres, pues la característica de la educación en la modernidad consiste en suprimir la coacción. El currículum multicultural exige un marco democrático de decisiones sobre los contenidos de la enseñanza para representar los intereses de todos. Se trata de un desafío: lograr que la diversidad cultural entre personas y colectivos, etc. deje de ser motivo de marginación para ser factor de enriquecimiento humano.</dc:description>
  <dc:description>It is possible to consider learning with respect to a process conditioned by a reciprocal action between a person and the world. Ideas of the world are developing under different conditions, climates, races, nations determined by history and formation of countries, delimitation's determined by time periods connected with special conditions of influence whose origin is the diversity of views of the world. Education is necessary to differentiate between to be, to be able to and purpose of man: an ensemble action of people with the objective to help new borns, children and adolescents learn «human life». Education and its investigation following in the same line as critical thought, are of greatest importance today because of real people, manners of socializing depend more and more on solutions to cultural conflicts that must be posed to education. The field of education could be that of freedom as an essential condition for the free development of personality. Education of free people, which can not have other aims than the free development of people, lies in the elimination of all coercion. The result would b an education «model» whose ideals are defined by the development of free people, since the characteristic of education in modern times is based on eliminating coercion. The multicultural curriculum needs a democratic program to make the best decisions about the academic contents to represent everyone's interests. This the a challenge: Suceed in making the cultural diversity between people and groups, etc. not a cause of exclusion but a factor of human enrichment.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header status="deleted"><identifier>oai:ddd.uab.cat:220</identifier><datestamp>2026-04-10T10:13:05Z</datestamp><setSpec>artpubuab</setSpec></header></record><record><header><identifier>oai:ddd.uab.cat:221</identifier><datestamp>2026-04-10T10:13:05Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>spa</dc:language>
  <dc:title>Identidad contra identidades : el destino contra Babelia</dc:title>
  <dc:creator>Martínez Llopis, José L.</dc:creator>
  <dc:creator>Pérez Adán, José</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Identitad</dc:subject>
  <dc:subject>Nacionalismo</dc:subject>
  <dc:subject>Relaciones internacionales</dc:subject>
  <dc:subject>Identity</dc:subject>
  <dc:subject>Nationalism</dc:subject>
  <dc:subject>International relations</dc:subject>
  <dc:relation>Papers : revista de sociologia ; Num. 53 (1997), p. 159-170</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/221</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:221</dc:identifier>
  <dc:identifier>urn:10.5565/rev/papers.1901</dc:identifier>
  <dc:identifier>urn:articleid:20139004n53p159</dc:identifier>
  <dc:identifier>urn:oai:papers.revistes.uab.cat:article/1901</dc:identifier>
  <dc:identifier>urn:oai:raco.cat:article/25487</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest document està subjecte a una llicència d'ús Creative Commons. Es permet la reproducció total o parcial, la distribució, la comunicació pública de l'obra i la creació d'obres derivades, sempre que no sigui amb finalitats comercials, i sempre que es reconegui l'autoria de l'obra original.</dc:rights>
  <dc:rights>https://creativecommons.org/licenses/by-nc/3.0/</dc:rights>
  <dc:description>El impulso de los nacionalismos y la constatación de la crisis ecológica global, son fenómenos paradójicos y contradictorios. En base a las contribuciones desde la sociología de Eisenstadt y Geisen, y desde el derecho y la teoría política de Wendt y Falk, nosotros argumentamos que el concepto de identidad planetaria, al tiempo que se opone conceptualmente al babelismo nacionalista dominante en ciertos sectores intelectuales, puede cimentar las bases para un entendimiento racional del devenir en este fin de siglo.</dc:description>
  <dc:description>Nationalism and environmental global conscience are contradictory ideas. We argue in this paper, using as a source from the sociological point of view the work of Eisenstadt and Giesen and from the point of view of legal theory the work of Wendt and Falk, that the concept of planetarian identity is rationally sound. We defend that planetarian collective identity may work against the shortcomings of this return to Babelia represented by nationalism, and it may also set a valid framework of reference to understand developments at the end of the twentieth century.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:222</identifier><datestamp>2026-04-10T10:13:04Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>spa</dc:language>
  <dc:title>Del ocio al neg-ocio... y otra vez al ocio</dc:title>
  <dc:creator>Rul·lán Buades, Gaspar</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Ocio</dc:subject>
  <dc:subject>Negocio</dc:subject>
  <dc:subject>Pensamiento social</dc:subject>
  <dc:subject>Tiempo de ocio</dc:subject>
  <dc:subject>Tiempo de trabajo</dc:subject>
  <dc:subject>Leisure</dc:subject>
  <dc:subject>Business</dc:subject>
  <dc:subject>Social thought</dc:subject>
  <dc:subject>Leisure time</dc:subject>
  <dc:subject>Work time</dc:subject>
  <dc:relation>Papers : revista de sociologia ; Num. 53 (1997), p. 171-193</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/222</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:222</dc:identifier>
  <dc:identifier>urn:10.5565/rev/papers.1902</dc:identifier>
  <dc:identifier>urn:articleid:20139004n53p171</dc:identifier>
  <dc:identifier>urn:oai:papers.revistes.uab.cat:article/1902</dc:identifier>
  <dc:identifier>urn:oai:raco.cat:article/25488</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest document està subjecte a una llicència d'ús Creative Commons. Es permet la reproducció total o parcial, la distribució, la comunicació pública de l'obra i la creació d'obres derivades, sempre que no sigui amb finalitats comercials, i sempre que es reconegui l'autoria de l'obra original.</dc:rights>
  <dc:rights>https://creativecommons.org/licenses/by-nc/3.0/</dc:rights>
  <dc:description>A través de la historia del pensamiento social se analiza el binomio ocio/negocio en términos de actividad y tiempo.</dc:description>
  <dc:description>Through the history of social thought the dicotomic relationship between leisure and business is analysed in terms of activity and use of time.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:223</identifier><datestamp>2026-04-10T10:13:04Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>spa</dc:language>
  <dc:title>Recensions</dc:title>
  <dc:creator>Santamarina Campos, Beatriz</dc:creator>
  <dc:type>Ressenya</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:relation>Papers : revista de sociologia ; Num. 53 (1997), p. 195-199</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/223</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:223</dc:identifier>
  <dc:identifier>urn:10.5565/rev/papers.1903</dc:identifier>
  <dc:identifier>urn:articleid:20139004n53p195</dc:identifier>
  <dc:identifier>urn:oai:papers.revistes.uab.cat:article/1903</dc:identifier>
  <dc:identifier>urn:oai:raco.cat:article/50373</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest document està subjecte a una llicència d'ús Creative Commons. Es permet la reproducció total o parcial, la distribució, la comunicació pública de l'obra i la creació d'obres derivades, sempre que no sigui amb finalitats comercials, i sempre que es reconegui l'autoria de l'obra original.</dc:rights>
  <dc:rights>https://creativecommons.org/licenses/by-nc/3.0/</dc:rights>
  <dc:description>Obra ressenyada: Pilar ESCARIO; Inés ALBERDI; Ana Inés LÓPEZ-ACCOTTO, Lo personal es político. El movimiento feminista en la transición. Instituto de la Mujer, 1996.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:225</identifier><datestamp>2026-04-10T10:13:04Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>spa</dc:language>
  <dc:title>Reproducción social y reproducción biológica en la Italia del fin de milenio</dc:title>
  <dc:creator>Re, Alisa del</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Cuerpo femenino</dc:subject>
  <dc:subject>Reproducción biológica</dc:subject>
  <dc:subject>Fecundación asistida</dc:subject>
  <dc:subject>Woman's body</dc:subject>
  <dc:subject>Biological reproduction</dc:subject>
  <dc:subject>Aided fertility</dc:subject>
  <dc:relation>Papers : revista de sociologia ; Num. 53 (1997), p. 25-36</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/225</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:225</dc:identifier>
  <dc:identifier>urn:10.5565/rev/papers.1892</dc:identifier>
  <dc:identifier>urn:articleid:20139004n53p25</dc:identifier>
  <dc:identifier>urn:oai:papers.revistes.uab.cat:article/1892</dc:identifier>
  <dc:identifier>urn:oai:raco.cat:article/25477</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest document està subjecte a una llicència d'ús Creative Commons. Es permet la reproducció total o parcial, la distribució, la comunicació pública de l'obra i la creació d'obres derivades, sempre que no sigui amb finalitats comercials, i sempre que es reconegui l'autoria de l'obra original.</dc:rights>
  <dc:rights>https://creativecommons.org/licenses/by-nc/3.0/</dc:rights>
  <dc:description>En el contexto de crisis económica, debilitamiento del consenso, la preocupación por el cuerpo femenino y nuevas formas de reproducción toma una especial relevancia en Italia en términos éticos y políticos.</dc:description>
  <dc:description>In the context of the actual economic crisis and lack of consensus, great concern exist in woman's body and new forms of reproduction in ethical and political terms.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:226</identifier><datestamp>2026-04-10T10:13:04Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>spa</dc:language>
  <dc:title>Reproducción humana asistida : los problemas que suscita desde la bioética y el derecho</dc:title>
  <dc:creator>Casado, María</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Reproducción asistida</dc:subject>
  <dc:subject>Bioética</dc:subject>
  <dc:subject>Derecho de familia</dc:subject>
  <dc:subject>Assisted reproduction</dc:subject>
  <dc:subject>Bioethics</dc:subject>
  <dc:subject>Family law</dc:subject>
  <dc:relation>Papers : revista de sociologia ; Num. 53 (1997), p. 37-44</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/226</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:226</dc:identifier>
  <dc:identifier>urn:10.5565/rev/papers.1893</dc:identifier>
  <dc:identifier>urn:articleid:20139004n53p37</dc:identifier>
  <dc:identifier>urn:oai:papers.revistes.uab.cat:article/1893</dc:identifier>
  <dc:identifier>urn:oai:raco.cat:article/25478</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest document està subjecte a una llicència d'ús Creative Commons. Es permet la reproducció total o parcial, la distribució, la comunicació pública de l'obra i la creació d'obres derivades, sempre que no sigui amb finalitats comercials, i sempre que es reconegui l'autoria de l'obra original.</dc:rights>
  <dc:rights>https://creativecommons.org/licenses/by-nc/3.0/</dc:rights>
  <dc:description>El artículo trata de los problemas éticos y jurídicos que surgen a raíz de la puesta en práctica de técnicas de reproducción asistida, al querer determinar la paternidad o poder elegir el sexo de un embrión viable, entre otros.</dc:description>
  <dc:description>The article deals with the ethical and juridical problems derived from the implementation of assisted reproduction techniques in determining paternity a the sex of au embryo, among other questions.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:227</identifier><datestamp>2026-04-10T10:13:04Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>spa</dc:language>
  <dc:title>Regímenes de bienestar y roles familiares : un análisis del caso español</dc:title>
  <dc:creator>Guillén, Ana M.</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Roles familiares</dc:subject>
  <dc:subject>Mercado de trabajo</dc:subject>
  <dc:subject>Política social familiar</dc:subject>
  <dc:subject>Family roles</dc:subject>
  <dc:subject>Labour market</dc:subject>
  <dc:subject>Family social policy</dc:subject>
  <dc:relation>Papers : revista de sociologia ; Num. 53 (1997), p. 45-63</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/227</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:227</dc:identifier>
  <dc:identifier>urn:10.5565/rev/papers.1894</dc:identifier>
  <dc:identifier>urn:articleid:20139004n53p45</dc:identifier>
  <dc:identifier>urn:oai:papers.revistes.uab.cat:article/1894</dc:identifier>
  <dc:identifier>urn:oai:raco.cat:article/25479</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest document està subjecte a una llicència d'ús Creative Commons. Es permet la reproducció total o parcial, la distribució, la comunicació pública de l'obra i la creació d'obres derivades, sempre que no sigui amb finalitats comercials, i sempre que es reconegui l'autoria de l'obra original.</dc:rights>
  <dc:rights>https://creativecommons.org/licenses/by-nc/3.0/</dc:rights>
  <dc:description>El texto plantea la influencia de la incorporación de la mujer al mercado de trabajo y la existencia del estado del bienestar en los roles familiares.</dc:description>
  <dc:description>The article shows the influence of woman's incorporation into the labour market and the existence of a Welfare State in family roles.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:228</identifier><datestamp>2026-04-10T10:13:04Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>spa</dc:language>
  <dc:title>Grupos minoritarios y acción positiva : las mujeres y las políticas de igualdad</dc:title>
  <dc:creator>Osborne, Raquel</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Mujer</dc:subject>
  <dc:subject>Género</dc:subject>
  <dc:subject>Acción positiva</dc:subject>
  <dc:subject>Políticas de igualdad sexual</dc:subject>
  <dc:subject>Woman</dc:subject>
  <dc:subject>Gender</dc:subject>
  <dc:subject>Positive action</dc:subject>
  <dc:subject>Sexual equality policies</dc:subject>
  <dc:relation>Papers : revista de sociologia ; Num. 53 (1997), p. 65-76</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/228</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:228</dc:identifier>
  <dc:identifier>urn:10.5565/rev/papers/v53n0.1895</dc:identifier>
  <dc:identifier>urn:articleid:20139004n53p65</dc:identifier>
  <dc:identifier>urn:oai:papers.revistes.uab.cat:article/1895</dc:identifier>
  <dc:identifier>urn:oai:raco.cat:article/25481</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest document està subjecte a una llicència d'ús Creative Commons. Es permet la reproducció total o parcial, la distribució, la comunicació pública de l'obra i la creació d'obres derivades, sempre que no sigui amb finalitats comercials, i sempre que es reconegui l'autoria de l'obra original.</dc:rights>
  <dc:rights>https://creativecommons.org/licenses/by-nc/3.0/</dc:rights>
  <dc:description>El texto trata de la desigualdad de la mujer frente al hombre en las sociedades avanzadas. Las acciones positivas para establecer la igualdad de oportunidades pretenden igualar las condiciones del punto de partida. Resultan insuficientes en muchos casos como medidas de discriminación positiva pero son un punto de partida crucial en el diseño de políticas de igualdad.</dc:description>
  <dc:description>The text deals with woman's inequality in advanced societies. Positive actions in order to establish equal opportunities try to level life conditions. They are probably not adequate as positive discrimination measures but surely are the starting point for equality policies.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:230</identifier><datestamp>2026-04-10T10:13:04Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>spa</dc:language>
  <dc:title>La participación masculina en el cuidado de los hijos en la nueva familia urbana española</dc:title>
  <dc:creator>Meil Landwerlin, Gerardo</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1997</dc:date>
  <dc:subject>Cuidado niños</dc:subject>
  <dc:subject>Actividad doméstica masculina</dc:subject>
  <dc:subject>Familias urbanas</dc:subject>
  <dc:subject>Child care</dc:subject>
  <dc:subject>Domestic male activity</dc:subject>
  <dc:subject>Urban families</dc:subject>
  <dc:relation>Papers : revista de sociologia ; Num. 53 (1997), p. 77-99</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/230</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:230</dc:identifier>
  <dc:identifier>urn:10.5565/rev/papers.1897</dc:identifier>
  <dc:identifier>urn:articleid:20139004n53p77</dc:identifier>
  <dc:identifier>urn:oai:papers.revistes.uab.cat:article/1897</dc:identifier>
  <dc:identifier>urn:oai:raco.cat:article/25482</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest document està subjecte a una llicència d'ús Creative Commons. Es permet la reproducció total o parcial, la distribució, la comunicació pública de l'obra i la creació d'obres derivades, sempre que no sigui amb finalitats comercials, i sempre que es reconegui l'autoria de l'obra original.</dc:rights>
  <dc:rights>https://creativecommons.org/licenses/by-nc/3.0/</dc:rights>
  <dc:description>En este trabajo se analiza la evolución de la participación del hombre en las tareas de atención y cuidado de los hijos en las nuevas familias urbanas durante la última década, así como los factores de los que depende dicha participación. Los resultados que de este estudio se obtienen evidencian un cambio apreciable pero no muy elevado durante la última década, así como la necesidad de distinguir entre tipos de actividades o tareas relacionadas con la atención y el cuidado de los hijos, pues las pautas de división según el género de estas actividades depende del tipo de tareas de que se trate. La participación del hombre en las tareas matinales están exclusivamente condicionadas por el estatus laboral de la mujer, mientras que las demás tareas, ya sean cotidianas o más o menos esporádicas, están más condicionadas por la sobrecarga relativa de las familias y el nivel educativo de los padres. El juego con los niños, por el contrario, está únicamente condicionado por la edad de éstos.</dc:description>
  <dc:description>This piece of work analizes the evolution of male participation in child care in new urban families during the last decades. It also heats the main factors of the male participation in domestic work. It shows how labour status of women influences domestic male participation.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:232</identifier><datestamp>2026-04-10T10:13:04Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>spa</dc:language>
  <dc:title>Modelos de inserción sociolaboral de las jóvenes rurales</dc:title>
  <dc:creator>Díaz Méndez, Cecilia</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1998</dc:date>
  <dc:subject>Mujer rural</dc:subject>
  <dc:subject>Estrategias familiares</dc:subject>
  <dc:subject>Familia campesina</dc:subject>
  <dc:subject>Reproducción social</dc:subject>
  <dc:subject>Rural women</dc:subject>
  <dc:subject>Agrarian family unit</dc:subject>
  <dc:subject>Family strategies</dc:subject>
  <dc:subject>Social reproduction</dc:subject>
  <dc:relation>Papers : revista de sociologia ; Num. 54 (1998), p. 113-128</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/232</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:232</dc:identifier>
  <dc:identifier>urn:10.5565/rev/papers.1914</dc:identifier>
  <dc:identifier>urn:articleid:20139004n54p113</dc:identifier>
  <dc:identifier>urn:oai:papers.revistes.uab.cat:article/1914</dc:identifier>
  <dc:identifier>urn:oai:raco.cat:article/25493</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest document està subjecte a una llicència d'ús Creative Commons. Es permet la reproducció total o parcial, la distribució, la comunicació pública de l'obra i la creació d'obres derivades, sempre que no sigui amb finalitats comercials, i sempre que es reconegui l'autoria de l'obra original.</dc:rights>
  <dc:rights>https://creativecommons.org/licenses/by-nc/3.0/</dc:rights>
  <dc:description>Las familias agrarias vinculadas a la pequeña agricultura familiar han sido objeto de estudio para analizar las trayectorias sociolaborales de sus hijas. Este análisis, realizado con una metodología de tipo cualitativo (entrevistas en profundidad y grupos de discusión), ha permitido, entre otras cosas, describir las pautas de inserción sociolaboral de estas jóvenes, así como conocer la forma en que la familia actúa para apoyar su tránsito a la vida adulta. La particular organización familiar y laboral de este tipo de familias obliga a la distribución de los recursos para el mantenimiento y la reproducción del grupo. Con grandes o escasos recursos y en un entorno que presiona la marcha socioeconómica de las explotaciones agroganaderas, las familias manejan su potencial para lograr el objetivo de reproducción y cambio. Esta distribución de recursos humanos y materiales es desigual y está diferenciada por el género, que constituye una pauta de reproducción de las familias estudiadas. Las chicas contarán con dos opciones fundamentales: proseguir con la familia o abandonarla. El matrimonio fuera del pueblo y los estudios les permitirán una independencia de la familia de origen. La soltería o el matrimonio con un joven ganadero las vinculará, por el contrario, al grupo familiar. Todas las alternativas son opciones de vida para estas jóvenes y evidencian una imagen de mujer joven rural sólo madura e independiente tras el matrimonio.</dc:description>
  <dc:description>Agrarian families linked with small family farms have been studied to unveil the insertion itineraries followed by its young female members. Following a qualitative methodology (in-depth interviews, and discussion groups), we have been able to describe the social and labour insertion of these young women, and to detect the family's influence in the young women's personal development. The peculiar family and labour organization of these groups is the origin of how resources available are distributed in order to secure the group's survival and reproduction. In a milieu in which socioeconomic life greatly influences agrarian exploitations, families manipulate their scarce or plentiful resources in order to attain their aim of surviving and, at the same time, changing. The distribution of these human and material resources is unequal, it is different according to members' gender, and, in the studied cases, it constitutes a reproduction model. Young women count on two basic options: to live on within the family unit or to abandon it. Marriage away from the village where they were born, and academic life will grant them independence from their own family. On the contrary, remaining single, or marrying a young agrarian will link them for life to the family unit. These options are personal choices of these young women, and show a clear image of young female agrarians who are considered to be independent and mature only after marriage.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:233</identifier><datestamp>2026-04-10T10:13:04Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>spa</dc:language>
  <dc:title>La moda en las sociedades avanzadas</dc:title>
  <dc:creator>Martínez Barreiro, Ana</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1998</dc:date>
  <dc:subject>Consumo</dc:subject>
  <dc:subject>Moda</dc:subject>
  <dc:subject>Distinción</dc:subject>
  <dc:subject>Estética</dc:subject>
  <dc:subject>Postmodernidad</dc:subject>
  <dc:subject>Proceso tribal</dc:subject>
  <dc:subject>Individualismo</dc:subject>
  <dc:subject>Diferenciación</dc:subject>
  <dc:subject>Consumption</dc:subject>
  <dc:subject>Fashion</dc:subject>
  <dc:subject>Distinction</dc:subject>
  <dc:subject>Aesthetic</dc:subject>
  <dc:subject>Post-modernity</dc:subject>
  <dc:subject>Tribal-process</dc:subject>
  <dc:subject>Individualism</dc:subject>
  <dc:relation>Papers : revista de sociologia ; Num. 54 (1998), p. 129-137</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/233</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:233</dc:identifier>
  <dc:identifier>urn:10.5565/rev/papers.1915</dc:identifier>
  <dc:identifier>urn:articleid:20139004n54p129</dc:identifier>
  <dc:identifier>urn:oai:papers.revistes.uab.cat:article/1915</dc:identifier>
  <dc:identifier>urn:oai:raco.cat:article/25494</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest document està subjecte a una llicència d'ús Creative Commons. Es permet la reproducció total o parcial, la distribució, la comunicació pública de l'obra i la creació d'obres derivades, sempre que no sigui amb finalitats comercials, i sempre que es reconegui l'autoria de l'obra original.</dc:rights>
  <dc:rights>https://creativecommons.org/licenses/by-nc/3.0/</dc:rights>
  <dc:description>Este trabajo intenta desvelar el nuevo papel de la moda en las sociedades avanzadas, frente a la posición ideológica de la escuela francesa, integrada por Bourdieu y Baudrillard, aparecen otras posturas más centradas en la postmodernidad como las de Lipovetsky, Morace y Maffesoli que abordan el papel de la moda de forma diferente. Ya que el consumo jerárquico de la moda ha sido sustituido por el placer y la comodidad, pasando del «estatus símbolo» al «estilo símbolo» y al desencadenamiento del proceso tribal en el ámbito de las apariencias. El interés de este trabajo arranca, precisamente, de esta nueva perspectiva que intenta descifrar el nuevo papel de la moda en las sociedades postmodernas.</dc:description>
  <dc:description>This work attempts to reveal the new role of fashion in advanced societies, facing the ideological position of the French school, integrated for Bourdieu and Baudrillard, appear other postures more focused on post-modernity as the ones of Lipovetsky, Morace and Maffesoli; that broach the role of fashion a different way. Since the hierarchical consumption of fashion has been replaced for pleasure and comfort, going from the «status symbol» to the «style symbol» and also to the development of the tribal process in the field of the appearances. The interest of this work comes, precisely, from this new perspective that tries to decipher the new role of fashion in post-modern societies.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:234</identifier><datestamp>2026-04-10T10:13:04Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>spa</dc:language>
  <dc:title>Homogamia educativa y capital cultural</dc:title>
  <dc:creator>Samper, Lluís</dc:creator>
  <dc:creator>Mayoral, Dolors</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1998</dc:date>
  <dc:subject>Cambio familiar</dc:subject>
  <dc:subject>Homogamia</dc:subject>
  <dc:subject>Capital cultural</dc:subject>
  <dc:subject>Educación</dc:subject>
  <dc:subject>Family change</dc:subject>
  <dc:subject>Homogamy</dc:subject>
  <dc:subject>Cultural capital</dc:subject>
  <dc:subject>Education</dc:subject>
  <dc:relation>Papers : revista de sociologia ; Num. 54 (1998), p. 139-155</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/234</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:234</dc:identifier>
  <dc:identifier>urn:10.5565/rev/papers.1916</dc:identifier>
  <dc:identifier>urn:articleid:20139004n54p139</dc:identifier>
  <dc:identifier>urn:oai:papers.revistes.uab.cat:article/1916</dc:identifier>
  <dc:identifier>urn:oai:raco.cat:article/25495</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest document està subjecte a una llicència d'ús Creative Commons. Es permet la reproducció total o parcial, la distribució, la comunicació pública de l'obra i la creació d'obres derivades, sempre que no sigui amb finalitats comercials, i sempre que es reconegui l'autoria de l'obra original.</dc:rights>
  <dc:rights>https://creativecommons.org/licenses/by-nc/3.0/</dc:rights>
  <dc:description>El artículo trata la relación positiva entre hipogamia educativa, cohorte generacional femenina nacida con posterioridad a 1955 y capital cultural en los hogares de la ciudad de Lleida. Los resultados se interpretan en un contexto más amplio de modernización familiar de la sociedad española.</dc:description>
  <dc:description>The article deals with de relationship between educational hipogamy, female cohorts born after 1955 and cultural capital in Lleida city households. This issues are interpreted in a wider context of family modernization of Spanish social structure.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:235</identifier><datestamp>2026-04-10T10:13:04Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>spa</dc:language>
  <dc:title>La presencia humana de Japón en España</dc:title>
  <dc:creator>Valls Campà, L.</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1998</dc:date>
  <dc:subject>Residentes japoneses</dc:subject>
  <dc:subject>Características sociológicas</dc:subject>
  <dc:subject>Japanese residents</dc:subject>
  <dc:subject>Sociological characteristics</dc:subject>
  <dc:relation>Papers : revista de sociologia ; Num. 54 (1998), p. 157-167</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/235</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:235</dc:identifier>
  <dc:identifier>urn:10.5565/rev/papers.1917</dc:identifier>
  <dc:identifier>urn:articleid:20139004n54p157</dc:identifier>
  <dc:identifier>urn:oai:papers.revistes.uab.cat:article/1917</dc:identifier>
  <dc:identifier>urn:oai:raco.cat:article/25496</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest document està subjecte a una llicència d'ús Creative Commons. Es permet la reproducció total o parcial, la distribució, la comunicació pública de l'obra i la creació d'obres derivades, sempre que no sigui amb finalitats comercials, i sempre que es reconegui l'autoria de l'obra original.</dc:rights>
  <dc:rights>https://creativecommons.org/licenses/by-nc/3.0/</dc:rights>
  <dc:description>En este artículo se analiza la evolución de la presencia de residentes de nacionalidad japonesa en el Estado español. Se estudia la evolución cuantitativa de residentes japoneses desde el año 1966, su distribución territorial por comunidades autónomas y sus características sociológicas en comparación con residentes extranjeros de otras nacionalidades. Se concluye que la comunidad japonesa residente en España se configura con unas características propias, que la distinguen de las demás grupos de residentes extranjeros.</dc:description>
  <dc:description>This article analyzes the evolution of the Japanese residents in Spain. We consider the quantitative evolution of the Japanese residents since 1966, their territorial distribution by Autonomous Communities, and their sociological characteristics in contrast with the foreign residents from other countries. The Japanese residents in Spain show a particular set of characteristics which distinguishes them from the other foreign residents.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:236</identifier><datestamp>2026-04-10T10:13:04Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>spa</dc:language>
  <dc:title>Las formas de la religión en la sociedad moderna</dc:title>
  <dc:creator>Sánchez Capdequí, Celso</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1998</dc:date>
  <dc:subject>Religión</dc:subject>
  <dc:subject>Secularización</dc:subject>
  <dc:subject>Sagrado</dc:subject>
  <dc:subject>Símbolo</dc:subject>
  <dc:subject>Religion</dc:subject>
  <dc:subject>Secularization</dc:subject>
  <dc:subject>Sacred</dc:subject>
  <dc:subject>Symbol</dc:subject>
  <dc:relation>Papers : revista de sociologia ; Num. 54 (1998), p. 169-185</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/236</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:236</dc:identifier>
  <dc:identifier>urn:10.5565/rev/papers.1918</dc:identifier>
  <dc:identifier>urn:articleid:20139004n54p169</dc:identifier>
  <dc:identifier>urn:oai:raco.cat:article/25497</dc:identifier>
  <dc:identifier>urn:oai:papers.revistes.uab.cat:article/1918</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest document està subjecte a una llicència d'ús Creative Commons. Es permet la reproducció total o parcial, la distribució, la comunicació pública de l'obra i la creació d'obres derivades, sempre que no sigui amb finalitats comercials, i sempre que es reconegui l'autoria de l'obra original.</dc:rights>
  <dc:rights>https://creativecommons.org/licenses/by-nc/3.0/</dc:rights>
  <dc:description>El presente artículo expone las claves que explican el lugar que ocupa la experiencia religiosa en nuestra sociedad. Analiza su nueva posición a la luz de los intensos procesos de secularización, que, en un principio, vaticinaban su desaparición. La tesis que aquí se defiende es que la religión es inherente a toda vida humana y que, por tanto, su rostro puede cambiar adquiriendo tonos más o menos seculares.</dc:description>
  <dc:description>This article analyzes the explaining aspects of the place of religious experience in our societies. It accounts for it in the light of the secularization processes that foretold its disapparence. The thesis defended here is that religion is something inherent to all human beings, and that therefore its face may change taking on more or less secular aspects.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:237</identifier><datestamp>2026-05-28T07:15:08Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>cat</dc:language>
  <dc:title>Anàlisi sociològica dels assistents al XIX Congrès Nacional d'ERC (Barcelona, 1993)</dc:title>
  <dc:creator>Argelaguet i Argemí, Jordi</dc:creator>
  <dc:creator>Maestro Garcia, Jesús</dc:creator>
  <dc:creator>Amorós, Moisès</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1998</dc:date>
  <dc:subject>Partits polítics</dc:subject>
  <dc:subject>Militants</dc:subject>
  <dc:subject>ERC</dc:subject>
  <dc:subject>Catalunya</dc:subject>
  <dc:subject>Political parties</dc:subject>
  <dc:subject>Catalonia</dc:subject>
  <dc:relation>Papers : revista de sociologia ; Num. 54 (1998), p. 187-200</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/237</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:237</dc:identifier>
  <dc:identifier>urn:10.5565/rev/papers.1919</dc:identifier>
  <dc:identifier>urn:articleid:20139004n54p187</dc:identifier>
  <dc:identifier>urn:recercauab:ARE-14862</dc:identifier>
  <dc:identifier>urn:oai:papers.revistes.uab.cat:article/1919</dc:identifier>
  <dc:identifier>urn:oai:raco.cat:article/25499</dc:identifier>
  <dc:identifier>urn:oai:egreta.uab.cat:publications/6c8e6ddd-ee20-4bf6-a116-171ba04a2a3e</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest document està subjecte a una llicència d'ús Creative Commons. Es permet la reproducció total o parcial, la distribució, la comunicació pública de l'obra i la creació d'obres derivades, sempre que no sigui amb finalitats comercials, i sempre que es reconegui l'autoria de l'obra original.</dc:rights>
  <dc:rights>https://creativecommons.org/licenses/by-nc/3.0/</dc:rights>
  <dc:description>Aquest breu article mostra la composició sociològica dels militants d'ERC que van assistir al XIX Congrés Nacional que va tenir lloc a Barcelona el 1993. Es constata com aquest històric partit de Catalunya ha estat, a la pràctica, refundat. D'una banda, ha canviat part de la seva ideologia, ha assumit la tradició de l'independentisme i ha recuperat la posició esquerrana de 1931. De l'altra, es tracta d'un partit nou en la mesura que la majoria dels seus militants -i el seu nucli dirigent- ha entrat en els darrers anys i molts d'ells procedents d'altres organitzacions polítiques.</dc:description>
  <dc:description>In this brief article it is analyzed the sociological dimensions of the militants of ERC that took part in the XIX Congrés Nacional, which was held in Barcelona in 1993. It shows how this historical Catalan party has been, de facto, refounded. On the one hand, it has partially changed its ideology: it has assumed the independentist tradition, and it has recovered the leftist tradition of 1931. On the other hand, it is a new party as long as the majority of its militants and leading elites came into ERC very recently, the majority of whom came from other political organisations.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:238</identifier><datestamp>2026-04-10T10:13:03Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>cat</dc:language>
  <dc:title>Capitals, trajectòries i estratègies : la teoria general dels camps de P. Bourdieu</dc:title>
  <dc:creator>Brunet Icart, Ignasi</dc:creator>
  <dc:creator>Morell Blanch, Antoni</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1998</dc:date>
  <dc:subject>Classes socials</dc:subject>
  <dc:subject>Camp</dc:subject>
  <dc:subject>Habitus</dc:subject>
  <dc:subject>Capital</dc:subject>
  <dc:subject>Trajectòria</dc:subject>
  <dc:subject>Estratègia</dc:subject>
  <dc:subject>Social classes</dc:subject>
  <dc:subject>Field</dc:subject>
  <dc:subject>Path</dc:subject>
  <dc:subject>Strategy</dc:subject>
  <dc:relation>Papers : revista de sociologia ; Num. 54 (1998), p. 201-214</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/238</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:238</dc:identifier>
  <dc:identifier>urn:10.5565/rev/papers.1920</dc:identifier>
  <dc:identifier>urn:articleid:20139004n54p201</dc:identifier>
  <dc:identifier>urn:oai:papers.revistes.uab.cat:article/1920</dc:identifier>
  <dc:identifier>urn:oai:raco.cat:article/25501</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest document està subjecte a una llicència d'ús Creative Commons. Es permet la reproducció total o parcial, la distribució, la comunicació pública de l'obra i la creació d'obres derivades, sempre que no sigui amb finalitats comercials, i sempre que es reconegui l'autoria de l'obra original.</dc:rights>
  <dc:rights>https://creativecommons.org/licenses/by-nc/3.0/</dc:rights>
  <dc:description>El model de classes de P. Bourdieu articula la dimensió objectiva -l'estructura de classe- i la dimensió subjectiva -l'acció de classe-. Aquesta anàlisi de classe forma part d'un debat al voltant de la naturalesa de la realitat social, en el qual el punt més important és la connexió del camp de la producció i del camp de la reproducció de subjectes. Bourdieu, en enfasitzar la condició relacional de l'àmbit social, defineix l'acció social com a dependent de l'estructura relacional, en existir una connexió lògica necessària entre la localització dels agents en un conjunt de relacions socials i els seus interessos, objectius i estratègies d'acció. Per tant, per a aquest autor, hi ha una eficàcia estructuradora de l'acció dels agents socials per l'estructura de classe, i es constitueix, així, en una matriu d'acció, o millor dit, en una estructura probabilística de l'acció. És, doncs, fonamental, considerar el paper de l'acció en la construcció de les classes en si, ja que les classes teòriques, agrupacions fictícies que només existeixen sobre el paper, estan predisposades a convertir-se en classes en el sentit marxista del terme. I sols es passa de la classe sobre el paper a clase real a costa d'una labor política de movilització. Així, l'existència de classes, tant en la teoria com en la realitat, és una aposta de lluites en existir un espai social, un espai de diferències, en el qual les classes existeixen en estat virtual, no com quelcom donat, sinó com quelcom que es tracta de construir.</dc:description>
  <dc:description>P. Bourdieu's model of classes articulates the objective dimension -class structure- and the subjective dimension -class acion. This class analysis takes place around a debate about the nature of social reality in which the main point is the connexion between the production field and the subjects reproduction field. Bourdieu, in emphasizing the relational condition of the social area, defines the social action as relational structure dependent, because there is a logic connection between the agents located in a set of social relations and their interests, objectives and action strategies. In Bourdieu's view there is an structuring efficiency of the social agents action by the class estructure, thus becoming an action matrix, or putting it better, a probabilistic structure of the action. Therefore, it's basic to understand the role of the action in the construction of the classes, given that the theoric classes, fictitious associations that only exist on the paper, are predisposed to become classes in the marxist sense of the word. And on the paper classes become real classes only through a political activism work. Thus, class existence, in theory as in reality, it's a bet of fightings in existing a social space, a differences space, in which classes exist in virtual state, not as something given, but as something that is trying to be constructed.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:239</identifier><datestamp>2026-04-10T10:13:03Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>cat</dc:language>
  <dc:title>Recensions</dc:title>
  <dc:creator>García Blanco, José María</dc:creator>
  <dc:type>Ressenya</dc:type>
  <dc:publisher/>
  <dc:date>1998</dc:date>
  <dc:relation>Papers : revista de sociologia ; Num. 54 (1998), p. 215-219</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/239</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:239</dc:identifier>
  <dc:identifier>urn:10.5565/rev/papers/v54n0.1921</dc:identifier>
  <dc:identifier>urn:articleid:20139004n54p215</dc:identifier>
  <dc:identifier>urn:oai:papers.revistes.uab.cat:article/1921</dc:identifier>
  <dc:identifier>urn:oai:raco.cat:article/50396</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest document està subjecte a una llicència d'ús Creative Commons. Es permet la reproducció total o parcial, la distribució, la comunicació pública de l'obra i la creació d'obres derivades, sempre que no sigui amb finalitats comercials, i sempre que es reconegui l'autoria de l'obra original.</dc:rights>
  <dc:rights>https://creativecommons.org/licenses/by-nc/3.0/</dc:rights>
  <dc:description>Obres ressenyades: A. GIDDENS; Z. BAUMAN; N. LUHMANN; U. BECK; J. BERIAIN (comp.), Las consecuencias perversas de la modernidad. Barcelona: Anthropos, 1996 ; Josetxo BERIAIN, La integración en las sociedades modernas. Barcelona: Anthropos, 1996.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:240</identifier><datestamp>2026-06-03T05:12:58Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>cat</dc:language>
  <dc:title>Necrològica Rudolf Bahro</dc:title>
  <dc:creator>Sole Puig, Luisa Carlota</dc:creator>
  <dc:type>Altres</dc:type>
  <dc:publisher/>
  <dc:date>1998</dc:date>
  <dc:relation>Papers : revista de sociologia ; Num. 54 (1998), p. 241</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/240</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:240</dc:identifier>
  <dc:identifier>urn:10.5565/rev/papers.1928</dc:identifier>
  <dc:identifier>urn:articleid:20139004n54p241</dc:identifier>
  <dc:identifier>urn:recercauab:ARE-13591</dc:identifier>
  <dc:identifier>urn:oai:papers.revistes.uab.cat:article/1928</dc:identifier>
  <dc:identifier>urn:oai:raco.cat:article/50403</dc:identifier>
  <dc:identifier>urn:oai:egreta.uab.cat:publications/bb5163ba-5051-42ed-b943-4b2421930322</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest document està subjecte a una llicència d'ús Creative Commons. Es permet la reproducció total o parcial, la distribució, la comunicació pública de l'obra i la creació d'obres derivades, sempre que no sigui amb finalitats comercials, i sempre que es reconegui l'autoria de l'obra original.</dc:rights>
  <dc:rights>https://creativecommons.org/licenses/by-nc/3.0/</dc:rights>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:241</identifier><datestamp>2026-06-26T09:14:24Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>spa</dc:language>
  <dc:title>La opinión pública interior en un sindicato histórico de clase : paradojas de la reminiscencia y modelos cognitivos</dc:title>
  <dc:creator>Bouza Álvarez, Fermín</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1998</dc:date>
  <dc:subject>Modelos cognitivos</dc:subject>
  <dc:subject>Hábitos cognitivos</dc:subject>
  <dc:subject>Opinión pública</dc:subject>
  <dc:subject>Cultura sindical</dc:subject>
  <dc:subject>Cognitive models</dc:subject>
  <dc:subject>Cognitive habits</dc:subject>
  <dc:subject>Public opinion</dc:subject>
  <dc:subject>Labour unions culture</dc:subject>
  <dc:relation>Papers : revista de sociologia ; Num. 54 (1998), p. 49-77</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/241</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:241</dc:identifier>
  <dc:identifier>urn:10.5565/rev/papers.1912</dc:identifier>
  <dc:identifier>urn:articleid:20139004n54p49</dc:identifier>
  <dc:identifier>urn:oai:papers.revistes.uab.cat:article/1912</dc:identifier>
  <dc:identifier>urn:oai:raco.cat:article/25490</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest document està subjecte a una llicència d'ús Creative Commons. Es permet la reproducció total o parcial, la distribució, la comunicació pública de l'obra i la creació d'obres derivades, sempre que no sigui amb finalitats comercials, i sempre que es reconegui l'autoria de l'obra original.</dc:rights>
  <dc:rights>https://creativecommons.org/licenses/by-nc/3.0/</dc:rights>
  <dc:description>La definición de la situación en el interior del sindicato es un hecho colectivo, que tiene, sin embargo, un núcleo más activo en los sectores más próximos al centro (cargos sindicales y delegados afiliados). Esa definición se hace desde unos hábitos cognitivos históricos enmarcados en toda una cultura sindical que toma la forma de ideología (postulados sistemáticos) en los escritos de la organización y genera una opinión pública interior. Cambiar o no esa cultura es un vasto problema estratégico cuyo alcance desborda este ámbito analítico.</dc:description>
  <dc:description>The definition of a situation inside a labour union is a collective fact which has, however, a more active nucleus close to the central sectors (hierarchy, member delegates). This definition is reached through historical cognitive habits which are inside every labour unions culture and gives rise to an ideology (sistematic postulates) in the organization writings and produces an internal public opinion. To modify or not modify that culture is a broad strategic question which is outside this analysis.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:242</identifier><datestamp>2026-06-03T05:12:58Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>cat</dc:language>
  <dc:title>Presentació</dc:title>
  <dc:creator>Sole Puig, Luisa Carlota</dc:creator>
  <dc:type>Editorial</dc:type>
  <dc:publisher/>
  <dc:date>1998</dc:date>
  <dc:relation>Papers : revista de sociologia ; Num. 54 (1998), p. 7</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/242</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:242</dc:identifier>
  <dc:identifier>urn:10.5565/rev/papers.1910</dc:identifier>
  <dc:identifier>urn:articleid:20139004n54p7</dc:identifier>
  <dc:identifier>urn:oai:papers.revistes.uab.cat:article/1910</dc:identifier>
  <dc:identifier>urn:oai:raco.cat:article/50404</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest document està subjecte a una llicència d'ús Creative Commons. Es permet la reproducció total o parcial, la distribució, la comunicació pública de l'obra i la creació d'obres derivades, sempre que no sigui amb finalitats comercials, i sempre que es reconegui l'autoria de l'obra original.</dc:rights>
  <dc:rights>https://creativecommons.org/licenses/by-nc/3.0/</dc:rights>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:243</identifier><datestamp>2026-05-06T02:16:29Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>spa</dc:language>
  <dc:title>Cultura organizativa de investigadores y entorno político y social</dc:title>
  <dc:creator>Bellavista, Joan</dc:creator>
  <dc:creator>Turpin, Tim</dc:creator>
  <dc:creator>Hill, Stephen</dc:creator>
  <dc:creator>De Miguel, Jesús M..</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1998</dc:date>
  <dc:subject>Ciencia</dc:subject>
  <dc:subject>Tecnología</dc:subject>
  <dc:subject>Política</dc:subject>
  <dc:subject>Sociedad</dc:subject>
  <dc:subject>Cultura</dc:subject>
  <dc:subject>Organización</dc:subject>
  <dc:subject>Science</dc:subject>
  <dc:subject>Technology</dc:subject>
  <dc:subject>Policy</dc:subject>
  <dc:subject>Society</dc:subject>
  <dc:subject>Culture</dc:subject>
  <dc:subject>Organization</dc:subject>
  <dc:relation>Papers : revista de sociologia ; Num. 54 (1998), p. 79-109</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/243</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:243</dc:identifier>
  <dc:identifier>urn:10.5565/rev/papers/v54n0.1913</dc:identifier>
  <dc:identifier>urn:articleid:20139004n54p79</dc:identifier>
  <dc:identifier>urn:oai:papers.revistes.uab.cat:article/1913</dc:identifier>
  <dc:identifier>urn:oai:raco.cat:article/25492</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest document està subjecte a una llicència d'ús Creative Commons. Es permet la reproducció total o parcial, la distribució, la comunicació pública de l'obra i la creació d'obres derivades, sempre que no sigui amb finalitats comercials, i sempre que es reconegui l'autoria de l'obra original.</dc:rights>
  <dc:rights>https://creativecommons.org/licenses/by-nc/3.0/</dc:rights>
  <dc:description>La organización de la investigación se transforma de forma rápida y profunda en la mayoría de países. Las fronteras tradicionales de la ciencia se cuestionan por la influencia de la industria y el gobierno. Estas afectan a multitud de países y la investigación científica se lleva a cabo mediante diferentes imperativos cualitativos como respuesta a mercados diferentes de los que predominaron durante las décadas anteriores. Aparece un espacio social donde se rediscuten las fronteras entre las culturas de investigación. Para muchos gobiernos, el impacto de los cambios del sistema científico en el desarrollo social y cultural se convierten en una prioridad. Las instituciones son más competitivas, más orientadas en lo comercial, más estratégicas, introduciendo prácticas y valores de gestión. En concreto se analizan los cambios que se operan mediante un análisis longitudinal de los casos de España y Australia.</dc:description>
  <dc:description>The organization of research is changing fastly in most countries. Research traditional boundaries are beeing questioned by industry and government. The latter occurs in many countries, and scientific research is carried out as an answer to new markets. There is a social space where research cultures' boundaries are reviewed. For many governments, the impact of changes in the scientific system upon social and cultural development becomes a priority. Institutions are more competitive, commercially oriented, more strategy-involved, and acquiring management practices and values. In particular, the evolution of these changes are analysed for Spain and Australia.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:244</identifier><datestamp>2026-04-10T10:13:03Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>spa</dc:language>
  <dc:title>Teoría y empiría en el análisis sociológico : Paul F. Lazarsfeld y sus críticos</dc:title>
  <dc:creator>Picó, Josep</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1998</dc:date>
  <dc:subject>Teoría</dc:subject>
  <dc:subject>Empiría</dc:subject>
  <dc:subject>Lazarsfeld</dc:subject>
  <dc:subject>Adorno</dc:subject>
  <dc:subject>Técnicas de investigación</dc:subject>
  <dc:subject>Controversias</dc:subject>
  <dc:subject>Positivismo</dc:subject>
  <dc:subject>Sondeo</dc:subject>
  <dc:subject>Panel</dc:subject>
  <dc:subject>Theory</dc:subject>
  <dc:subject>Practice</dc:subject>
  <dc:subject>Quantitative methods</dc:subject>
  <dc:subject>Disputes in sociology</dc:subject>
  <dc:subject>Positivism</dc:subject>
  <dc:subject>Survey</dc:subject>
  <dc:relation>Papers : revista de sociologia ; Num. 54 (1998), p. 9-48</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/244</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:244</dc:identifier>
  <dc:identifier>urn:10.5565/rev/papers.1911</dc:identifier>
  <dc:identifier>urn:articleid:20139004n54p9</dc:identifier>
  <dc:identifier>urn:oai:papers.revistes.uab.cat:article/1911</dc:identifier>
  <dc:identifier>urn:oai:raco.cat:article/25489</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest document està subjecte a una llicència d'ús Creative Commons. Es permet la reproducció total o parcial, la distribució, la comunicació pública de l'obra i la creació d'obres derivades, sempre que no sigui amb finalitats comercials, i sempre que es reconegui l'autoria de l'obra original.</dc:rights>
  <dc:rights>https://creativecommons.org/licenses/by-nc/3.0/</dc:rights>
  <dc:description>Este artículo trata sobre la importancia del trabajo de Paul F. Lazarsfeld durante los cincuenta años de su vida como escritor, investigador y docente en el campo de la sociología. Se habla en primer lugar de las influencias intelectuales en su adolescencia y de su carrera como ayudante de los psicólogos Karl y Charlotte Bühler en la Universidad de Viena (1927). Sus actividades llamaron la atención de la Fundación Rockefeller, que le concedió una beca para ir a Estados Unidos en 1933, donde comenzó su trabajo institucional, primero en la Universidad de Newark y después en el Bureau of Applied Social Research en la Universidad de Columbia. A Lazarsfeld se le identifica como pionero en el campo del análisis cuantitativo. Sus trabajos se vinculan a la creciente importancia de la investigación empírica, de la que podemos distinguir dos características principales: a) un aspecto metodológico, donde los problemas generales de la investigación son tratados con técnicas específicas de análisis, como el de las estructuras latentes; b) otro aspecto, el de la investigación, que se centra en los problemas sobre la toma de decisiones. Su principal foco de interés fue el «análisis empírico de la acción» -el estudio de la acción individual- y las encuestas por muestreo que se convirtieron en su instrumento de trabajo más importante. La segunda parte del artículo describe el panorama crítico de los aspectos más filosóficos y metodológicos de su obra. En primer lugar, a finales de los años treinta su desencuentro con Adorno en el Princeton Radio Research Project, cuando Lazarsfeld le contrató para supervisar un estudio sobre la cultura musical a través de la radio. El problema que surgió entre ambos fue cómo medir socialmente la cultura. Aquí se enfrentaron dos puntos de vista diferentes: Adorno entendía la palabra método más en el sentido epistemológico europeo que en el sentido técnico americano. Este enfoque crítico enfrentó a Adorno con todo el equipo de investigación y tuvo que dimitir. Pero su crítica no era una crítica sólo teórica sino metodológica, referida a la sociedad y a la forma de hacer sociología en la universidad americana. Por otra parte, la crítica desde el interaccionismo de H. Blumer, la reacción radical de C.W. Mills contra el empirismo abstracto y la controversia marxista entre M. Pollak y J. Dumazedier señalan la importancia del papel intelectual que tuvo Lazarsfeld después de la Segunda Guerra Mundial y su influencia tanto sobre la sociología europea, especialmente en Francia, como sobre muchas de las instituciones internacionales relacionadas con la investigación social. Finalmente, se trata de perfilar un balance de sus circunstancias históricas y su trabajo, con una referencia especial a la relación entre el enfoque teórico y empírico en la ciencia social.</dc:description>
  <dc:description>This paper states the importance of Lazarsfeld's work during his half-century of teaching, research and writing. First I write on the intellectual influences to which he was exposed from his late adolescence and outline his career as assistant to the psychologists Karl and Charlotte Bühler in the University (1927). These activities attract the Rockefeller Foundation attention, which invited him to come to the United States as a «Rockefeller Fellow» of statistical- mathematical background with interest in social psychology (1932). I write too on his institutional work from the University of Newark to the Columbia's support of the Bureau of Applied Social Research. Lazarsfeld is most often identified as a pioneer in the field of quantitative analysis. His contributions are connected to this growing importance of empirical research at the institutional level from which we distinguish two mean trends: a) a methodological one where general problems, like setting up research, are treated with specific techniques of analysis as the latent structural ones; b) a research trend centred on problems like how we come to a decision. This first interest was in what he called «the empirical analysis of action» -the study of individual action- and sample surveys became the principal tool. The second part of this paper provides a critical overview of the more philosophical and methodological aspects of his work. First of all in the late 1930's, when Lazarsfeld was director of the Rockefeller Funded Princeton Radio Research Project and he employed Th. W. Adorno to supervise a study on music within American culture. The cornerstone of the problem between Lazarsfeld and Adorno was the measurement of culture. Two points of view were confronted: Adorno understood the word method more in its European sense of epistemology than in its American sense of research technique. This approach pushed Adorno in the direction of being regarded as a social commentator and not a social scientist, and he was definitely dismissed. But his critique of music was not simply a musical one but a critique of the society within which such music was produced. The interactionisme of H. Blumer, the radical reaction of C.W. Mills against the abstract empirism and the marxist controversy between M. Pollack and J. Dumazedier signals the importance and the rol played by Lazarsfeld after the Second World War, and his influence on the european sociology, specially in France, and on other international institutions of social research. Finally, I try to point out a balance of his work and circumstances, with special reference to the link between theoretical and empirical approach in social science.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:246</identifier><datestamp>2026-04-10T10:13:03Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>spa</dc:language>
  <dc:title>La articulación de ámbitos sociales a partir de la base temporal</dc:title>
  <dc:creator>Lozares Colina, Carlos</dc:creator>
  <dc:creator>López Roldán, Pedro</dc:creator>
  <dc:creator>Domínguez Amorós, Màrius</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1998</dc:date>
  <dc:subject>Tiempos sociales</dc:subject>
  <dc:subject>Vida cotidiana</dc:subject>
  <dc:subject>Grupos sociales</dc:subject>
  <dc:subject>Social times</dc:subject>
  <dc:subject>Everyday life</dc:subject>
  <dc:subject>Social groups</dc:subject>
  <dc:relation>Papers : revista de sociologia ; Num. 55 (1998), p. 115-130</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/246</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:246</dc:identifier>
  <dc:identifier>urn:10.5565/rev/papers.1935</dc:identifier>
  <dc:identifier>urn:articleid:20139004n55p115</dc:identifier>
  <dc:identifier>urn:recercauab:ARE-14674</dc:identifier>
  <dc:identifier>urn:oai:papers.revistes.uab.cat:article/1935</dc:identifier>
  <dc:identifier>urn:oai:raco.cat:article/25508</dc:identifier>
  <dc:identifier>urn:oai:egreta.uab.cat:publications/3e036f0a-16a3-45c5-b264-803c331f19af</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest document està subjecte a una llicència d'ús Creative Commons. Es permet la reproducció total o parcial, la distribució, la comunicació pública de l'obra i la creació d'obres derivades, sempre que no sigui amb finalitats comercials, i sempre que es reconegui l'autoria de l'obra original.</dc:rights>
  <dc:rights>https://creativecommons.org/licenses/by-nc/3.0/</dc:rights>
  <dc:description>Uno de los objetivos de la investigación ha consistido, en un primer nivel de análisis, en conseguir una tipología general de la forma de vinculación entre los ámbitos de TP (trabajo productivo), TR (trabajo reproductivo) y TL (disponibilidad de tiempo libre) a partir de datos e indicaciones cuantitativas. Después de diversos ensayos, los resultados y el procedimiento más simple y eficaz se han conseguido a partir de dimensiones indicativas del empleo del tiempo para cada uno de los ámbitos. Por tanto, una vez construidas las tipologías de cada uno de los ámbitos, se toma el tiempo, en este artículo, como referente o sustrato para la constitución de modos de vida cotidiana. Los tipos de modos de vida cotidiana serán a su vez la base de la intervención por entrevistas en la segunda y tercera parte de la investigación. El artículo muestra cómo el tiempo, en tanto que instrumento y soporte para la construcción de los modos de vida, pasa a ser un descritor y clasificador de grupos sin necesidad de recurrir directamente a las variables categoriales: sexo, categorías sociales, edad, etc. Este artículo es parte de una investigación cuyos resultados aparecen en este mismo número de PAPERS. El artículo tiene autonomía y entidad por sí mismo pero la lectura del resto de los artículos de este número facilitará su contextualización.</dc:description>
  <dc:description>In an initial level of analysis, one of the objectives of the research project consisted in obtaining a general typologie of the way in which the results obtained in each area, PW (Productive Work), RW (Reproductive Work) and FT (Availability for Free Time) were linked and articulated using quantitative data and indications. After several trials the results and the simplest and most effective procedure were obtained from indicative dimensions of the use of time for each area. Therefore, once the typologies of each area had been constructed, in this article time was taken as a referent or substratum for the constitution of Daily Ways of Life, that is to say, as a criterion for articulating the initial Typologies. The Types of Daily Ways of Life will in turn be the basis for action through interviews in the second and third part of the research. The article shows how time as an instrument and a support for the construction of ways of life becomes a social describer and classifier of groups without the need for direct use of categorial variables: sex, social categories, age, etc. This paper is part of a research work whose results are in this PAPERSvolume. The paper is autonomous but the reading of the other papers of this volum can help to contextualize it.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:247</identifier><datestamp>2026-04-10T10:13:02Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>spa</dc:language>
  <dc:title>Las representaciones en el mundo de la vida cotidiana</dc:title>
  <dc:creator>Lozares Colina, Carlos</dc:creator>
  <dc:creator>Carrasquer, Pilar</dc:creator>
  <dc:creator>Domínguez Amorós, Màrius</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1998</dc:date>
  <dc:subject>Representación</dc:subject>
  <dc:subject>Vida cotidiana</dc:subject>
  <dc:subject>Conocimiento cotidiano</dc:subject>
  <dc:subject>Representation</dc:subject>
  <dc:subject>Everyday life</dc:subject>
  <dc:subject>Daily knowledge</dc:subject>
  <dc:relation>Papers : revista de sociologia ; Num. 55 (1998), p. 131-149</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/247</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:247</dc:identifier>
  <dc:identifier>urn:10.5565/rev/papers.1936</dc:identifier>
  <dc:identifier>urn:articleid:20139004n55p131</dc:identifier>
  <dc:identifier>urn:recercauab:ARE-14677</dc:identifier>
  <dc:identifier>urn:oai:raco.cat:article/25509</dc:identifier>
  <dc:identifier>urn:oai:papers.revistes.uab.cat:article/1936</dc:identifier>
  <dc:identifier>urn:oai:egreta.uab.cat:publications/fc72e07e-2b92-4e6f-8d77-865e661e3e6d</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest document està subjecte a una llicència d'ús Creative Commons. Es permet la reproducció total o parcial, la distribució, la comunicació pública de l'obra i la creació d'obres derivades, sempre que no sigui amb finalitats comercials, i sempre que es reconegui l'autoria de l'obra original.</dc:rights>
  <dc:rights>https://creativecommons.org/licenses/by-nc/3.0/</dc:rights>
  <dc:description>Esta investigación no se ha reducido, en el análisis, a los niveles objetivables, sino que ha indagado en otros; es decir, no pretendía sólo estudiar las relaciones entre los ámbitos productivo, reproductivo y tiempo libre a partir de una serie de indicadores de hechos o actividades, sino también indagar en dichas relaciones en los niveles de las pautas de comportamiento, de las actitudes y de las representaciones cognitivas. La idea de base consiste en que la vida social no sólo se libra, se construye y se realiza en el campo de las actividades objetivadas sino también en el de los hábitos, sean bajo la forma de actitudes o de representaciones. El objetivo más específico de este artículo se refiere sólo al análisis de las representaciones que la gente se hace de cada uno de los ámbitos y de su articulación en la forma de modos de representaciones o de conocimento cotidiano. Los datos para estudiar las actitudes y las representaciones han sido obtenidos volviendo de nuevo a los encuestados sobre la base de una muestra más reducida basada en las tipologías conseguidas en los niveles precedentes de análisis. Este artículo es parte de una investigación cuyos resultados aparecen en este mismo número de PAPERS. El artículo tiene autonomía y entidad por sí mismo pero la lectura del resto de los artículos de este número facilitará su contextualización.</dc:description>
  <dc:description>This research did not seek to remain at a level of analysis of social life that we have called objectifiable but ventured into another level; that is to say, it did not only seek to study the relations between the areas of production, reproduction and free time using a series of indicators of facts or activities, but also attempted to study these relations in the levels of behavioural patterns, attitudes and cognitive representations. The basic idea was that social life is not only approached, constructed and carried out in the field of the objectified activities but also in that of habits, whether in the form of attitudes or representations. The most specific objective in this article only refers to the analysis of the representations that people make of each of the areas and of their articulation in the form of ways of representation or daily knowledge. The data for studying the attitudes and representations were obtained by returning to the inteviewees and taking a smaller sample based on the typologies obtained in the previous levels of analysis. This paper is part of a research work whose results are in this PAPERSvolume. The paper is autonomous but the reading of the other papers of this volum can help to contextualize it.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:248</identifier><datestamp>2026-05-19T04:13:25Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>spa</dc:language>
  <dc:title>Las estructuras de sentido de la vida cotidiana</dc:title>
  <dc:creator>Miguelez Lobo, Faustino</dc:creator>
  <dc:creator>Torns, Teresa</dc:creator>
  <dc:creator>Rebollo Izquierdo, José Oscar</dc:creator>
  <dc:creator>Pastor, Inma</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1998</dc:date>
  <dc:subject>Orientaciones simbólicas</dc:subject>
  <dc:subject>Proyectos y aspiraciones</dc:subject>
  <dc:subject>Tiempo cotidiano</dc:subject>
  <dc:subject>Tiempo de vida</dc:subject>
  <dc:subject>Entrevistas en profundidad</dc:subject>
  <dc:subject>Simbolic orientations</dc:subject>
  <dc:subject>Projects and aspirations</dc:subject>
  <dc:subject>Time of day</dc:subject>
  <dc:subject>Time of life</dc:subject>
  <dc:subject>Depth interviews</dc:subject>
  <dc:relation>Papers : revista de sociologia ; Num. 55 (1998), p. 151-179</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/248</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:248</dc:identifier>
  <dc:identifier>urn:10.5565/rev/papers.1937</dc:identifier>
  <dc:identifier>urn:articleid:20139004n55p151</dc:identifier>
  <dc:identifier>urn:recercauab:ARE-14738</dc:identifier>
  <dc:identifier>urn:oai:papers.revistes.uab.cat:article/1937</dc:identifier>
  <dc:identifier>urn:oai:raco.cat:article/25511</dc:identifier>
  <dc:identifier>urn:oai:egreta.uab.cat:publications/f1a34620-ece4-46db-8c44-242b6d810429</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest document està subjecte a una llicència d'ús Creative Commons. Es permet la reproducció total o parcial, la distribució, la comunicació pública de l'obra i la creació d'obres derivades, sempre que no sigui amb finalitats comercials, i sempre que es reconegui l'autoria de l'obra original.</dc:rights>
  <dc:rights>https://creativecommons.org/licenses/by-nc/3.0/</dc:rights>
  <dc:description>Una vez examinadas las relaciones en el nivel de las actividades objetivables entre ámbitos y en el de las representaciones y actitudes, parece lógico y consecuente que se realice un paso posterior: ¿cómo las personas, situadas en posiciones características dentro de las tipologías precedentes de articulación entre ámbitos, construyen un espacio intencional, de sentido y/o simbólico tomando como referencia de contenidos dichos ámbitos y sus vinculaciones? ¿Cómo se forman lo que denominamos «estructuras u orientaciones de sentido»? Es decir, ¿cómo se organiza el mundo de sus deseos, de sus aspiraciones y de sus proyectos en función de las centralidades que cada ámbito tiene según momentos del día y épocas de la vida? Evidentemente, para obtener información de cara a este objetivo hemos tenido que retornar de nuevo a los entrevistados y, por medio de entrevistas semidirigidas, indagar y reconstruir en el análisis este mundo simbólico. Este artículo es parte de una investigación cuyos resultados aparecen en este mismo número de PAPERS. El artículo tiene autonomía y entidad por sí mismo pero la lectura del resto de los artículos de este número facilitará su contextualización.</dc:description>
  <dc:description>After examining the relations between areas at the level of the objectifiable activities and at the level of representations and attitudes, it seems logical and consequent to take a further step: how do people, located in characteristic positions inside the previous typologies of articulation among environments, build a meaningful or symbolic intentional space by taking these areas and the links between them as a reference of content? How are what we call structures or orientations of meaning formed? That is to say, how is the world of their desires, their aspirations and their projects organised on the basis of the centralities that each environment has according to the time of day and the time of life? Evidently, to obtain information for this objective we had to return to the interviewees and investigate and reconstruct this symbolic world through semi-directed interviews. This paper is part of a research work whose results are in this PAPERS volume. The paper is autonomous but the reading of the other papers of this volum can help to contextualize it.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:249</identifier><datestamp>2026-04-10T10:13:02Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>cat</dc:language>
  <dc:title>Recensions</dc:title>
  <dc:creator>Padilla i Rovira, Jordi</dc:creator>
  <dc:type>Ressenya</dc:type>
  <dc:publisher/>
  <dc:date>1998</dc:date>
  <dc:relation>Papers : revista de sociologia ; Num. 55 (1998), p. 181-183</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/249</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:249</dc:identifier>
  <dc:identifier>urn:10.5565/rev/papers/v55n0.1938</dc:identifier>
  <dc:identifier>urn:articleid:20139004n55p181</dc:identifier>
  <dc:identifier>urn:oai:papers.revistes.uab.cat:article/1938</dc:identifier>
  <dc:identifier>urn:oai:raco.cat:article/50406</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest document està subjecte a una llicència d'ús Creative Commons. Es permet la reproducció total o parcial, la distribució, la comunicació pública de l'obra i la creació d'obres derivades, sempre que no sigui amb finalitats comercials, i sempre que es reconegui l'autoria de l'obra original.</dc:rights>
  <dc:rights>https://creativecommons.org/licenses/by-nc/3.0/</dc:rights>
  <dc:description>Obra ressenyada: Rafael GRASA; Andreu ULIED (eds.), Medi ambient i governabilitat a la Mediterrània. Barcelona: Proa, 1997.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:251</identifier><datestamp>2026-04-10T10:13:02Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>spa</dc:language>
  <dc:title>El tratamiento multiestratégico en la investigación sociológica</dc:title>
  <dc:creator>Lozares Colina, Carlos</dc:creator>
  <dc:creator>López Roldán, Pedro</dc:creator>
  <dc:creator>Martin, Antonio</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1998</dc:date>
  <dc:subject>Metodología</dc:subject>
  <dc:subject>Diseño de investigación</dc:subject>
  <dc:subject>Métodos cuantitativos y cualitativos</dc:subject>
  <dc:subject>Methodology</dc:subject>
  <dc:subject>Design of research</dc:subject>
  <dc:subject>Quantitative and qualitative methods</dc:subject>
  <dc:relation>Papers : revista de sociologia ; Num. 55 (1998), p. 27-43</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/251</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:251</dc:identifier>
  <dc:identifier>urn:10.5565/rev/papers.1931</dc:identifier>
  <dc:identifier>urn:articleid:20139004n55p27</dc:identifier>
  <dc:identifier>urn:recercauab:ARE-14670</dc:identifier>
  <dc:identifier>urn:oai:papers.revistes.uab.cat:article/1931</dc:identifier>
  <dc:identifier>urn:oai:raco.cat:article/25503</dc:identifier>
  <dc:identifier>urn:oai:egreta.uab.cat:publications/69501976-3001-4c6b-ab9f-39c7d79270db</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest document està subjecte a una llicència d'ús Creative Commons. Es permet la reproducció total o parcial, la distribució, la comunicació pública de l'obra i la creació d'obres derivades, sempre que no sigui amb finalitats comercials, i sempre que es reconegui l'autoria de l'obra original.</dc:rights>
  <dc:rights>https://creativecommons.org/licenses/by-nc/3.0/</dc:rights>
  <dc:description>Este artículo pretende aportar una reflexión metodológica en una dirección que, siguiendo a Derek Layder (1993) denominamos «aproximación multiestratégica». Esta orientación propone un modelo y un proceso metodológico que trata de captar y analizar el hecho social investigado como una totalidad a partir de las distintas pertinencias que lo componen, sin que sea reducido o segmentado en su identidad por los efectos de modelo y método de análisis utilizado. Esta metodología es la que ha sido seguida, en líneas generales, en esta investigación como la más apropiada para el tratamiento de una realidad social que, como la estudiada, está atravesada por dimensiones múltiples y contiene un elevado grado de complejidad. Se da cuenta de sus objetivos, de la comparación con otras metodologías, de los elementos que la componen así como de la correspondencia y adecuación entre la metodología de nuestra investigación y dicha perspectiva de análisis. Este artículo es parte de una investigación cuyos resultados aparecen en este mismo número de PAPERS. El artículo tiene autonomía y entidad por sí mismo pero la lectura del resto de los artículos de este número facilitará su contextualización.</dc:description>
  <dc:description>This article seeks to contribute a methodological reflection in a direction that, following Derek Layder (1993) we call the Multi-strategy Approach. This approach proposes a model and a methodological process that aims to grasp and analyse the social phenomenon as a totality through its different aspects without its identity being reduced or segmented by the effects of the model and the method of analysis. This methodology was generally followed in this research project as being the most appropriate for dealing with a social reality composed of interlinking dimensions and involving a high degree of complexity. We present the objectives, make a comparison with other methods, and study the elements of which it is composed and the correspondence and adaptation of our research methodology to this perspective of analysis. This paper is part of a research work whose results are in this PAPERS volume. The paper is autonomous but the reading of the other papers of this volum can help to contextualize it.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:252</identifier><datestamp>2026-05-19T04:13:25Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>spa</dc:language>
  <dc:title>La segmentación laboral : hacia una tipología del ámbito productivo</dc:title>
  <dc:creator>López Roldán, Pedro</dc:creator>
  <dc:creator>Lope Peña, Andreu</dc:creator>
  <dc:creator>Miguelez Lobo, Faustino</dc:creator>
  <dc:creator>Coller, Xavier</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1998</dc:date>
  <dc:subject>Mercado de trabajo</dc:subject>
  <dc:subject>Segmentación</dc:subject>
  <dc:subject>Trabajo productivo</dc:subject>
  <dc:subject>Metodología</dc:subject>
  <dc:subject>Tipología</dc:subject>
  <dc:relation>Papers : revista de sociologia ; Num. 55 (1998), p. 45-77</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/252</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:252</dc:identifier>
  <dc:identifier>urn:10.5565/rev/papers.1932</dc:identifier>
  <dc:identifier>urn:articleid:20139004n55p45</dc:identifier>
  <dc:identifier>urn:recercauab:ARE-14695</dc:identifier>
  <dc:identifier>urn:oai:papers.revistes.uab.cat:article/1932</dc:identifier>
  <dc:identifier>urn:oai:raco.cat:article/25504</dc:identifier>
  <dc:identifier>urn:oai:egreta.uab.cat:publications/b58edea8-81b0-4d46-b97b-076019b9a20a</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest document està subjecte a una llicència d'ús Creative Commons. Es permet la reproducció total o parcial, la distribució, la comunicació pública de l'obra i la creació d'obres derivades, sempre que no sigui amb finalitats comercials, i sempre que es reconegui l'autoria de l'obra original.</dc:rights>
  <dc:rights>https://creativecommons.org/licenses/by-nc/3.0/</dc:rights>
  <dc:description>Este artículo toma como temática central el mundo productivo y más concretamente la segmentación del mercado laboral, construyendo una tipología en esta dirección. Dicha tipología es la base de referencia, dentro del ámbito productivo, para establecer y analizar las relaciones entre dicho ámbito y el reproductivo a partir de la información proveniente de una encuesta social, y por tanto, contando con datos cuantitativos y con sus métodos y técnicas correspondientes. El interés de esta tipología, además de su propia construcción, es triple: primero, porque en su elaboración no sólo intervienen indicadores y variables propias del mundo de la empresa, sino también otros datos contextuales; segundo, porque posibilita la ampliación de la tipología a otras poblaciones no ocupadas como parados, inactivos, amas de casa, y tercero, porque permite caracterizar con variables sociodemográficas y otras ligadas a los estilos de vida los tipos de segmentación laboral. Este artículo es parte de una investigación cuyos resultados aparecen en este mismo número de PAPERS. El artículo tiene autonomía y entidad por sí mismo pero la lectura del resto de los artículos de este número facilitará su contextualización.</dc:description>
  <dc:description>The central topic of this article is the world of production, and more specifically the segmentation of the labour market, for which a typology is constructed. This typology is the basis of reference within the production environment for establishing and analysing the relations between this environment and the environment of reproduction, using the information from a social survey and therefore applying quantitative data with the corresponding methods and techniques. In addition to its value in itself, this typology is of additional interest for three reasons: first, because it involves not only indicators and variables characteristic of the business world but also other contextual data; second, because it allows the typology to be extended to non-employed persons, such as the unemployed, the inactive and housewives; and third, because it allows the types of labour segmentation to be categorised with socio-demographic variables and other variables related to lifestyles. This paper is part of a research work whose results are in this PAPERS volume. The paper is autonomous but the reading of the other papers of this volum can help to contextualize it.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:254</identifier><datestamp>2026-04-10T10:13:02Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>spa</dc:language>
  <dc:title>La complementariedad del log-lineal y del análisis de correspondencias en la elaboración y el análisis de tipologías</dc:title>
  <dc:creator>Lozares Colina, Carlos</dc:creator>
  <dc:creator>López Roldán, Pedro</dc:creator>
  <dc:creator>Borràs Català, Vicent</dc:creator>
  <dc:type>Editorial</dc:type>
  <dc:publisher/>
  <dc:date>1998</dc:date>
  <dc:subject>Análisis log-lineal</dc:subject>
  <dc:subject>Análisis de correspondencias</dc:subject>
  <dc:subject>Metodología</dc:subject>
  <dc:subject>Tipología</dc:subject>
  <dc:subject>Log-linear analysis</dc:subject>
  <dc:subject>Correspondence analysis</dc:subject>
  <dc:subject>Methodology</dc:subject>
  <dc:subject>Typology</dc:subject>
  <dc:subject>Statistic method</dc:subject>
  <dc:subject>Métodos estadísticos</dc:subject>
  <dc:relation>Papers : revista de sociologia ; Num. 55 (1998), p. 79-93</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/254</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:254</dc:identifier>
  <dc:identifier>urn:10.5565/rev/papers.1933</dc:identifier>
  <dc:identifier>urn:articleid:20139004n55p79</dc:identifier>
  <dc:identifier>urn:recercauab:ARE-14673</dc:identifier>
  <dc:identifier>urn:oai:papers.revistes.uab.cat:article/1933</dc:identifier>
  <dc:identifier>urn:oai:raco.cat:article/25506</dc:identifier>
  <dc:identifier>urn:oai:egreta.uab.cat:publications/7ac18f96-b397-4026-9999-70737705e084</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest document està subjecte a una llicència d'ús Creative Commons. Es permet la reproducció total o parcial, la distribució, la comunicació pública de l'obra i la creació d'obres derivades, sempre que no sigui amb finalitats comercials, i sempre que es reconegui l'autoria de l'obra original.</dc:rights>
  <dc:rights>https://creativecommons.org/licenses/by-nc/3.0/</dc:rights>
  <dc:description>Los análisis que combinan diversos métodos y técnicas según los diferentes objetivos planteados son susceptibles de obtener subproductos que, teniendo un interés sólo indirecto o relativo dentro del planteamiento global, permiten también mejorar los métodos de análisis y encontrar formas combinadas para construir objetos que sean pertinentes para la investigación. Es el caso de este artículo. En la construcción de tipologías se han empleado, aparte de otros métodos, dos concretamente que se han mostrado eficaces para dicha finalidad: el log-linear y el análisis de correspondencias. Como resultado de dicho trabajo se ha analizado su complementariedad y sobre todo dónde radica analíticamente dicha complementariedad. Este artículo es parte de una investigación cuyos resultados aparecen en este mismo número de PAPERS. El artículo tiene autonomía y entidad por sí mismo pero la lectura del resto de los artículos de este número facilitará su contextualización.</dc:description>
  <dc:description>Studies that combine different methods and techniques according to different objectives may give rise to by-products that only have an indirect or relative interest within the general approach, but that allow us to improve the methods of analysis and to find combined ways of building objects that are relevant to the research. This is the case of this article. In the construction of typologies, apart from other methods, two specific methods were used that proved effective for this purpose: the log-linear method and correspondence analysis. As a result of this work the complementary nature of these methods was studied, with particular reference to the analytical position of this complementariness. This paper is part of a research work whose results are in this PAPERS volume. The paper is autonomous but the reading of the other papers of this volum can help to contextualize it.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:255</identifier><datestamp>2026-05-19T04:13:25Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>spa</dc:language>
  <dc:title>Introducción al análisis del trabajo y de la vida cotidiana</dc:title>
  <dc:creator>Miguelez Lobo, Faustino</dc:creator>
  <dc:creator>Torns, Teresa</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1998</dc:date>
  <dc:subject>Producción</dc:subject>
  <dc:subject>Reproducción</dc:subject>
  <dc:subject>Tiempo libre</dc:subject>
  <dc:subject>Vida cotidiana</dc:subject>
  <dc:subject>Production</dc:subject>
  <dc:subject>Reproduction</dc:subject>
  <dc:subject>Free time</dc:subject>
  <dc:subject>Everyday life</dc:subject>
  <dc:relation>Papers : revista de sociologia ; Num. 55 (1998), p. 9-25</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/255</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:255</dc:identifier>
  <dc:identifier>urn:10.5565/rev/papers.1930</dc:identifier>
  <dc:identifier>urn:articleid:20139004n55p9</dc:identifier>
  <dc:identifier>urn:recercauab:ARE-14732</dc:identifier>
  <dc:identifier>urn:oai:papers.revistes.uab.cat:article/1930</dc:identifier>
  <dc:identifier>urn:oai:raco.cat:article/25502</dc:identifier>
  <dc:identifier>urn:oai:egreta.uab.cat:publications/be412056-5a5c-47c1-a0bf-b01b0227b4d2</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest document està subjecte a una llicència d'ús Creative Commons. Es permet la reproducció total o parcial, la distribució, la comunicació pública de l'obra i la creació d'obres derivades, sempre que no sigui amb finalitats comercials, i sempre que es reconegui l'autoria de l'obra original.</dc:rights>
  <dc:rights>https://creativecommons.org/licenses/by-nc/3.0/</dc:rights>
  <dc:description>El artículo plantea la introducción a la investigación y, en este sentido, a los artículos posteriores. Aparecen las preocupaciones y la problemática que están en el origen de la investigación, es decir, la necesidad de superar los análisis sectoriales en los campos de la producción, reproducción y tiempo libre para dar precisamente cuenta de hechos sociales vinculados a la relación entre ellos, aparte de ofrecer un visión de cada uno de ellos. Establece los objetivos de la investigación y los marcos teóricos de referencia, concretamente la perspectiva de la vida cotidiana y las teorías que vinculan producción y reproducción, así como las fases, niveles de tratamiento, las grandes orientaciones metodologicas y las técnicas utilizadas. Este artículo es parte de una investigación cuyos resultados aparecen en este mismo número de PAPERS. El artículo tiene autonomía y entidad por sí mismo pero la lectura del resto de los artículos de este número facilitará su contextualización.</dc:description>
  <dc:description>This article presents the introduction to the research and to the later articles. It deals with the concerns and the problems that form the basis for the research, that is to say, the need to go beyond sectorial analysis in the fields of production, reproduction and free time in order to account for social facts arising from the relation between them and to offer a view of each one. It establishes the objectives of the research and the theoretical frameworks of reference, specifically the perspective of daily life and the theories that link production and reproduction as well as the phases, levels of processing, major methodological guidelines and techniques used. This paper is part of a research work whose results are in this PAPERS volume. The paper is autonomous but the reading of the other papers of this volum can help to contextualize it.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:256</identifier><datestamp>2026-04-10T10:13:00Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>spa</dc:language>
  <dc:title>El trabajo reproductivo</dc:title>
  <dc:creator>Carrasquer, Pilar</dc:creator>
  <dc:creator>Torns, Teresa</dc:creator>
  <dc:creator>Tejero, Elisabet</dc:creator>
  <dc:creator>Romero, Alfonso</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1998</dc:date>
  <dc:subject>Tipología del trabajo reproductivo</dc:subject>
  <dc:subject>Cuidado de la persona</dc:subject>
  <dc:subject>Responsabilidad familiar</dc:subject>
  <dc:subject>Vida cotidiana</dc:subject>
  <dc:subject>Typology of reproductive work</dc:subject>
  <dc:subject>Care of persons</dc:subject>
  <dc:subject>Family responsabilities</dc:subject>
  <dc:subject>Everyday life</dc:subject>
  <dc:relation>Papers : revista de sociologia ; Num. 55 (1998), p. 95-114</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/256</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:256</dc:identifier>
  <dc:identifier>urn:10.5565/rev/papers.1934</dc:identifier>
  <dc:identifier>urn:articleid:20139004n55p95</dc:identifier>
  <dc:identifier>urn:recercauab:ARE-14610</dc:identifier>
  <dc:identifier>urn:oai:papers.revistes.uab.cat:article/1934</dc:identifier>
  <dc:identifier>urn:oai:raco.cat:article/25507</dc:identifier>
  <dc:identifier>urn:oai:egreta.uab.cat:publications/d4d6132a-caea-4588-922c-02515a7f1311</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest document està subjecte a una llicència d'ús Creative Commons. Es permet la reproducció total o parcial, la distribució, la comunicació pública de l'obra i la creació d'obres derivades, sempre que no sigui amb finalitats comercials, i sempre que es reconegui l'autoria de l'obra original.</dc:rights>
  <dc:rights>https://creativecommons.org/licenses/by-nc/3.0/</dc:rights>
  <dc:description>La investigación ha analizado cada uno de los ámbitos antes de elaborar una tipología global de articulación entre ellos. Si bien los datos disponibles de la encuesta social no eran ni sufientes ni los más pertinentes para elaborar una tipología de trabajo reproductivo, se ha realizado un esfuerzo en dicha dirección y sobre todo se ha visto la necesidad de mejorar y afinar los indicadores de las grandes encuestas que se refieren a esta problemática. Por ello, en un segundo trabajo de campo más dirigido al examen de actitudes y representaciones, se ha solicitado además a los encuestados una información más específica y propia para analizar el ámbito reproductivo, por ejemplo atendiendo y considerando datos más relacionados con el cuidado de la persona y los miembros del hogar, con las responsabilidades en la familia, con la decisiones ante determinadas situaciones, etc. Este artículo es parte de una investigación cuyos resultados aparecen en este mismo número de PAPERS. El artículo tiene autonomía y entidad por sí mismo pero la lectura del resto de los artículos de este número facilitará su contextualización.</dc:description>
  <dc:description>As was announced, the research project analysed each area before producing a general typology of their articulation. Although the available data of the social survey were neither sufficient nor the most relevant for producing a typology of reproductive work, an effort was made in this direction and above all the need was detected to improve and to adjust the indicators of large surveys dealing with this problem. Therefore, in a second field work that was more oriented at examining attitudes and representations, the interviewees were also asked to give more specific and individual information in order to analyse the reproduction environment, for example by taking and considering data more related to care of persons and the members of the home, family responsibilities, decisions taken in response to certain situations, etc. This paper is part of a research work whose results are in this PAPERS volume. The paper is autonomous but the reading of the other papers of this volum can help to contextualize it.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:258</identifier><datestamp>2026-04-10T10:12:59Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>spa</dc:language>
  <dc:title>La teoría del actuar comunicativo de Jürgen Habermas : un marco para el análisis de las condiciones socializadoras en las sociedades modernas</dc:title>
  <dc:creator>Radl Philipp, Rita</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1998</dc:date>
  <dc:subject>Teoría del actuar comunicativo</dc:subject>
  <dc:subject>Racionalidad comunicativa</dc:subject>
  <dc:subject>Condiciones socializadoras</dc:subject>
  <dc:subject>Interacciones simbólicas</dc:subject>
  <dc:subject>Intersubjetividad</dc:subject>
  <dc:subject>Theory of Communicative Action</dc:subject>
  <dc:subject>Communicative Rationality</dc:subject>
  <dc:subject>Socialization Conditions</dc:subject>
  <dc:subject>Symbolic Interactions</dc:subject>
  <dc:subject>Intersubjectivity</dc:subject>
  <dc:relation>Papers : revista de sociologia ; Num. 56 (1998), p. 103-123</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/258</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:258</dc:identifier>
  <dc:identifier>urn:10.5565/rev/papers.1946</dc:identifier>
  <dc:identifier>urn:articleid:20139004n56p103</dc:identifier>
  <dc:identifier>urn:oai:papers.revistes.uab.cat:article/1946</dc:identifier>
  <dc:identifier>urn:oai:raco.cat:article/25518</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest document està subjecte a una llicència d'ús Creative Commons. Es permet la reproducció total o parcial, la distribució, la comunicació pública de l'obra i la creació d'obres derivades, sempre que no sigui amb finalitats comercials, i sempre que es reconegui l'autoria de l'obra original.</dc:rights>
  <dc:rights>https://creativecommons.org/licenses/by-nc/3.0/</dc:rights>
  <dc:description>En este artículo examinamos el significado de la teoría del actuar comunicativo de Jürgen Habermas para la explicación de los múltiples y a la vez variados procesos sociales que transcurren en las sociedades modernas. El sistema teórico habermasiano ofrece, a nuestro juicio, las categorías precisas para la realización de un análisis empírico explicativo de las estructuras sociales existentes que permite la estrecha vinculación del nivel macroestructural con el de las acciones directas entre personas. En este marco nos centramos en las condiciones socializadoras de las instituciones educativas modernas, que son especialmente susceptibles de ser analizadas desde un punto de vista teórico-comunicativo que interrelaciona el plano estructural con el de las relaciones intersubjetivas, adscribiendo a los sujetos las capacidades necesarias para unas intervenciones activas, tanto en el nivel estructural como en el del contexto vital.</dc:description>
  <dc:description>The paper focuses on the significance of Jürgen Habermas's «Theory of Communicative Action» to the explanation of the many and varied social processes that take place in modern societies. In our judgement, Habermas's theoretical system offers categories which are suitable for carrying out an empirical, explicative analysis of social structure. In this context, we emphasize the socialization conditions in modern educational institutions. This conditions would be analyzed from a theoretically communicative perspective, interrelating the structure sphere with the inter-subjetiveone, ascribing to individuals the necessary capacities for intervening both actively and concurrently in the aforementioned structure sphere and living context.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:259</identifier><datestamp>2026-04-10T10:12:59Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>spa</dc:language>
  <dc:title>El objeto olvidado de la sociología</dc:title>
  <dc:creator>Parra Luna, Francisco</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1998</dc:date>
  <dc:subject>Necesidad</dc:subject>
  <dc:subject>Fines</dc:subject>
  <dc:subject>Medios</dc:subject>
  <dc:subject>Eficiencia</dc:subject>
  <dc:subject>Transformación</dc:subject>
  <dc:subject>Axiología</dc:subject>
  <dc:subject>Need</dc:subject>
  <dc:subject>Goals</dc:subject>
  <dc:subject>Means</dc:subject>
  <dc:subject>Performance</dc:subject>
  <dc:subject>Transformation</dc:subject>
  <dc:subject>Axiology</dc:subject>
  <dc:relation>Papers : revista de sociologia ; Num. 56 (1998), p. 11-30</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/259</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:259</dc:identifier>
  <dc:identifier>urn:10.5565/rev/papers.1942</dc:identifier>
  <dc:identifier>urn:articleid:20139004n56p11</dc:identifier>
  <dc:identifier>urn:oai:papers.revistes.uab.cat:article/1942</dc:identifier>
  <dc:identifier>urn:oai:raco.cat:article/25512</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest document està subjecte a una llicència d'ús Creative Commons. Es permet la reproducció total o parcial, la distribució, la comunicació pública de l'obra i la creació d'obres derivades, sempre que no sigui amb finalitats comercials, i sempre que es reconegui l'autoria de l'obra original.</dc:rights>
  <dc:rights>https://creativecommons.org/licenses/by-nc/3.0/</dc:rights>
  <dc:description>La sociología podría haber olvidado el objeto para el cual comienza estableciéndose como ciencia. A partir del homocentrismo tradicional de la sociología, se conviene en admitir que es la persona humana (la «vieja medida de todas las cosas»), con su complejo vital de necesidades e intereses, significaciones y deseos, expectativas y cálculos, el centro de interés insoslayable de todo estudio sobre lo social. Sin embargo, formalismos como los de Simmel, unidos a la eclosión de las numerosas especialidades a que da origen el acelerado desarrollo institucional de la ciencia y el más que probable mimetismo sociológico por seguirla, han ido minando subrepticiamente el fin primigenio de la sociología (hasta llegar, por ejemplo, a la «sociedad sin hombres» de Luhmann), que no fue otro que el descubrimiento de los principios más estructurantes que determinaban o condicionaban el funcionamiento de la vida social con el fin exclusivo de la mejora de ésta última; lo que es tanto como decir, para beneficio de las personas que la formaban. En este artículo, que enfatiza el falso dilema cualitativo-cuantitativo como perversión del lenguaje sociológico, se pretende recordar que la sociedad no podría ser sólo un compuesto de formas abstractas, sino sobre todo un conjunto interactivo y consciente de personas con necesidades concretas, las cuales viven precisamente en sociedad sólo y exclusivamente para mejor satisfacerlas. Y que la sociología es, o debería ser, ese conocimiento acumulado sobre los fenómenos sociales que coadyuve hacia la mayor satisfacción de estas necesidades.</dc:description>
  <dc:description>Sociology seems to have forgotten the objet for which it was initially created as a science. From the early ethnocentric stream of thought in the founding fathers, human concerns (needs; interests and meanings) wore at the heart of sociological reflection. Later on, under the influence of formalists like Simmel, and the accelerated development of positive natural sciences with their small and numerous specialities, the initial objet of Sociology was increasingly substituted by some secondary aspects of society f.i. «communications» (until reaching Luhmann's «Society without men»), which are only means used by people for achieving their goals. Thus, Sociology seems to forget progressively to study the concept of goal-setting (the systems of values persued/achieved) for which society (or any type of social organization) was created, since this is the purpose justifying the existence of society. In this paper, which emphasises the spurious qualitative-quantitative dilemma as a perversion of sociological language, I try to remain that society is not composed solely of abstract forms, but mainly of human individuals who live together because, in this way, they satisfy their mutual needs better. Sociology should or could then be the science which offers its cumulated knowledge on social phenomenon to cater for the satisfaction of these needs.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:260</identifier><datestamp>2026-04-10T10:12:58Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>spa</dc:language>
  <dc:title>Dimensiones referencial, imaginaria y pragmática del tiempo en la modernidad y en la postmodernidad</dc:title>
  <dc:creator>Bergua Amores, José Ángel</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1998</dc:date>
  <dc:subject>Tiempo</dc:subject>
  <dc:subject>Postmodernidad</dc:subject>
  <dc:subject>Imaginario</dc:subject>
  <dc:subject>Complejidad</dc:subject>
  <dc:subject>Time</dc:subject>
  <dc:subject>Postmodernity</dc:subject>
  <dc:subject>Imagery</dc:subject>
  <dc:subject>Complexity</dc:subject>
  <dc:relation>Papers : revista de sociologia ; Num. 56 (1998), p. 125-141</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/260</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:260</dc:identifier>
  <dc:identifier>urn:10.5565/rev/papers.1947</dc:identifier>
  <dc:identifier>urn:articleid:20139004n56p125</dc:identifier>
  <dc:identifier>urn:oai:papers.revistes.uab.cat:article/1947</dc:identifier>
  <dc:identifier>urn:oai:raco.cat:article/25519</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest document està subjecte a una llicència d'ús Creative Commons. Es permet la reproducció total o parcial, la distribució, la comunicació pública de l'obra i la creació d'obres derivades, sempre que no sigui amb finalitats comercials, i sempre que es reconegui l'autoria de l'obra original.</dc:rights>
  <dc:rights>https://creativecommons.org/licenses/by-nc/3.0/</dc:rights>
  <dc:description>En forma de ensayo, el presente artículo propone analizar desde un punto de vista semiótico el tiempo de la modernidad y de su crisis según tres dimensiones: una referencial o identitaria, que atiende a los sistemas de referencias utilizados para medirlo, otra imaginaria, que le otorga cualidad y afecto, y finalmente otra pragmática, que alude a su performatividad. En la modernidad la dimensión referencial debe dar cuenta del contexto social en el que toman protagonismo el reloj y el mecanicismo clásico, la imaginaria, de los tiempos que van del eterno retorno al existencialismo, y la pragmática, del modo como algunos relojes centrales sincronizan los tiempos de las sociabilidades periféricas. En la actual crisis de la modernidad pensar el tiempo exige poder dar cuenta de sus líneas de fuga, y para ello resultan útiles el paradigma de la irreversibilidad dinámica en la dimensión referencial, ciertas imágenes valorizadoras del presente en la dimensión imaginaria y un nuevo modo de valorar la asincronía en la dimensión pragmática.</dc:description>
  <dc:description>This article sets out to analyse the time of modernity and its crisis acording to three dimension from the semiotic point of view: a referential or identity that takes care of the reference system used to measure it, another imaginary that gives quality and affecttion, and finally one that alluds its performance. The referential dimension in modernity, should take into consideration the social context in wich the clock and the mechanicism play the leading role, the imaginary of times that range from etern return to existencialism, and he pragmatic mode of some crisis of modernity, to think time equires considering its scape times, and certain image valueer of the present in the imaginary dimension, and the reflection about the social conditions of the asincronicity in the pragmatic dimension.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:261</identifier><datestamp>2026-04-10T10:12:58Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>spa</dc:language>
  <dc:title>Vejez dependiente, políticas y calidad de vida</dc:title>
  <dc:creator>Bazo, María Teresa</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1998</dc:date>
  <dc:subject>Políticas sociosanitarias</dc:subject>
  <dc:subject>Vejez dependiente</dc:subject>
  <dc:subject>Calidad de vida</dc:subject>
  <dc:subject>Cuidados informales de salud</dc:subject>
  <dc:subject>Sistema mixto de cuidados</dc:subject>
  <dc:subject>Health and social policies</dc:subject>
  <dc:subject>Dependent old age</dc:subject>
  <dc:subject>Quality of life</dc:subject>
  <dc:subject>Informal health care</dc:subject>
  <dc:subject>Welfare mix</dc:subject>
  <dc:relation>Papers : revista de sociologia ; Num. 56 (1998), p. 143-161</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/261</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:261</dc:identifier>
  <dc:identifier>urn:10.5565/rev/papers.1949</dc:identifier>
  <dc:identifier>urn:articleid:20139004n56p143</dc:identifier>
  <dc:identifier>urn:oai:papers.revistes.uab.cat:article/1949</dc:identifier>
  <dc:identifier>urn:oai:raco.cat:article/25520</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest document està subjecte a una llicència d'ús Creative Commons. Es permet la reproducció total o parcial, la distribució, la comunicació pública de l'obra i la creació d'obres derivades, sempre que no sigui amb finalitats comercials, i sempre que es reconegui l'autoria de l'obra original.</dc:rights>
  <dc:rights>https://creativecommons.org/licenses/by-nc/3.0/</dc:rights>
  <dc:description>En el artículo se realiza una exposición y un análisis de las políticas relacionadas con el cuidado de la salud familiar en el contexto actual de cambios demográficos, familiares, económicos, y sociales, que con carácter global afectan a los países de Europa y otras sociedades económicamente desarrolladas, y donde se plantean cambios en los sistemas de bienestar que hagan compatibles el desarrollo económico y el social. A continuación se exponen algunos resultados y algunas conclusiones de una investigación dirigida y realizada por la autora en el País Vasco, Cataluña y Madrid sobre un tema que hasta recientemente no ha comenzado a investigarse en España: los cuidados familiares de salud de las personas ancianas dependientes. El proyecto resulta finalista en la convocatoria de los proyectos de investigación Miquel Àngel Terribas de la Fundació «la Caixa». Es seleccionado y financiado por la Fundación Caja de Madrid en una convocatoria nacional, y la investigación recibe el accésit de los Premios Rogeli Duocastella de la Fundació «la Caixa». Se analiza en las tres comunidades autónomas una muestra de un centenar de personas cuidadoras de ancianos y ancianas enfermos crónicos y discapacitados, y personas pertenecientes a la Asociación de Familiares de Enfermos de Alzheimer. Se utiliza la entrevista semiestructurada en profundidad y la entrevista de grupo.</dc:description>
  <dc:description>An analysis of family health care policies is developed in the article. It is embedded within the change processes that are currently occurring. Those processes are related to demographic, family, economic and social changes, and they affect the European countries as well as other developed societies. Currently, a common concern in those societies is how to deal with the changes that need to be made within the welfare systems, in order to improve both economic and social development. Following such analysis, some research results and conclusions are presented. The research was carried out by the author in the Basque Country, Catalonia and Madrid, using qualitative methods. The topic, namely, family health care for frail elderly persons, has not been sufficiently studied in Spain. The project and research received several awards from prestigious Catalan institutions, and was partly funded by Fundación Caja de Madrid. One hundred in-depth interviews addressed to careers, and three semi-structured interviews addressed to relatives of Alzheimer' Patients in the three regions were done.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:262</identifier><datestamp>2026-04-10T10:12:58Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>spa</dc:language>
  <dc:title>La especificidad organizativa del tercer sector : tipos y dinámicas</dc:title>
  <dc:creator>Herrera Gómez, Manuel</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1998</dc:date>
  <dc:subject>Sociología de las organizaciones</dc:subject>
  <dc:subject>Tercer sector</dc:subject>
  <dc:subject>Organizaciones sin fines de lucro</dc:subject>
  <dc:subject>Organizations sociology</dc:subject>
  <dc:subject>Third sector</dc:subject>
  <dc:subject>Non profit organizations</dc:subject>
  <dc:relation>Papers : revista de sociologia ; Num. 56 (1998), p. 163-196</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/262</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:262</dc:identifier>
  <dc:identifier>urn:10.5565/rev/papers.1950</dc:identifier>
  <dc:identifier>urn:articleid:20139004n56p163</dc:identifier>
  <dc:identifier>urn:oai:papers.revistes.uab.cat:article/1950</dc:identifier>
  <dc:identifier>urn:oai:raco.cat:article/25521</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest document està subjecte a una llicència d'ús Creative Commons. Es permet la reproducció total o parcial, la distribució, la comunicació pública de l'obra i la creació d'obres derivades, sempre que no sigui amb finalitats comercials, i sempre que es reconegui l'autoria de l'obra original.</dc:rights>
  <dc:rights>https://creativecommons.org/licenses/by-nc/3.0/</dc:rights>
  <dc:description>En las últimas décadas ha crecido el interés por aquellos sujetos asociativos, con grado diverso de formalización e institucionalización, que se sitúan en el espacio público entre el Estado y el mercado. Muy numerosas y diferentes son las denominaciones utilizadas: organizaciones sin fines de lucro, tercer sector, privado social, tercer sistema, etc. Estas páginas intentan aportar una contribución desde una óptica sociológica y de teoría de las organizaciones. Tras analizar críticamente las aportaciones más significativas de los estudiosos de management, se intentan individuar las características específicas de un nuevo tipo de organizaciones que se diferencian tanto de las ubicadas en el sector público, como de las situadas en el sector privado.</dc:description>
  <dc:description>The interest for the associative subjetcs situated among State and market has grown in the last decades. Many different names has been used for this associative subjects with a diverse range or formalitation and institutionalitation: non profit organizations, third sector, social private, third system, etc. These pages try to supply a contribution from the sight of a sociology of the organizations theory. It tells about the main and more meaningful aportations of the management experts. This is the start point to individualize the specific characters of a king of organizations that are quite different from those of the public sector and the market.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:263</identifier><datestamp>2026-04-10T10:12:58Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>cat</dc:language>
  <dc:title>Minories ètniques, associacionisme i integració sociocultural</dc:title>
  <dc:creator>Garreta i Bochaca, Jordi</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1998</dc:date>
  <dc:subject>Associacions</dc:subject>
  <dc:subject>Africans</dc:subject>
  <dc:subject>Asiàtics</dc:subject>
  <dc:subject>Gitanos</dc:subject>
  <dc:subject>Integració</dc:subject>
  <dc:subject>Associations</dc:subject>
  <dc:subject>Asians</dc:subject>
  <dc:subject>Gipsies</dc:subject>
  <dc:subject>Integration</dc:subject>
  <dc:relation>Papers : revista de sociologia ; Num. 56 (1998), p. 197-230</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/263</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:263</dc:identifier>
  <dc:identifier>urn:10.5565/rev/papers/v56n0.1951</dc:identifier>
  <dc:identifier>urn:articleid:20139004n56p197</dc:identifier>
  <dc:identifier>urn:oai:papers.revistes.uab.cat:article/1951</dc:identifier>
  <dc:identifier>urn:oai:raco.cat:article/25522</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest document està subjecte a una llicència d'ús Creative Commons. Es permet la reproducció total o parcial, la distribució, la comunicació pública de l'obra i la creació d'obres derivades, sempre que no sigui amb finalitats comercials, i sempre que es reconegui l'autoria de l'obra original.</dc:rights>
  <dc:rights>https://creativecommons.org/licenses/by-nc/3.0/</dc:rights>
  <dc:description>Les associacions, enteses com una forma de vertebrar la minoria i defensar-ne els interessos, és a dir, com a base per a l'acció col·lectiva, poden actuar com a catalitzador del procés d'integració social i de la seva negociació, com també de la seva participació política. Des d'aquest plantejament es presenta la síntesi d'un estudi de les associacions d'africans i gitanos de dues províncies (una de la comunitat autònoma d'Aragó i una altra de Catalunya) destacant-ne els objectius, el funcionament, els membres, les dificultats i els problemes i si tenen un paper important en el procés d'integració sociocultural dels seus «representats». Al mateix temps, utilitzant una enquesta i entrevistes en profunditat a individus d'aquests col·lectius, ens aproximarem al coneixement, a l'acceptació, a la participació... en aquestes associacions.</dc:description>
  <dc:description>Associations, these undertood as a way to give the minority a structure and defend its interests, that is, as a base for collective action, can work as a catalyzer of the social integration process and its negotiation, and also of its political participation. From this approach we are introduced to the synthesis of a research on Africans and Gipsies associations in two provinces (one in the Aragon Autonomous Community and other one in the Catalan Community), pointing out their aims, functioning, members, difficulties and problems and whether they have an important tole in the process of sociocultural integration of their «represented». At the same time, we shall approach to the knowledge, acceptation and participation in these communities, by means of a survey and thorough interviews to individuals from these groups.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:264</identifier><datestamp>2026-04-10T10:12:58Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>spa</dc:language>
  <dc:title>Género, redes de amistad y rendimiento académico</dc:title>
  <dc:creator>Requena Santos, Félix</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1998</dc:date>
  <dc:subject>Redes sociales</dc:subject>
  <dc:subject>Amistad</dc:subject>
  <dc:subject>éxito académico</dc:subject>
  <dc:subject>Género</dc:subject>
  <dc:subject>Social networks</dc:subject>
  <dc:subject>Friendship</dc:subject>
  <dc:subject>Academic success</dc:subject>
  <dc:subject>Gender</dc:subject>
  <dc:relation>Papers : revista de sociologia ; Num. 56 (1998), p. 233-242</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/264</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:264</dc:identifier>
  <dc:identifier>urn:10.5565/rev/papers.1952</dc:identifier>
  <dc:identifier>urn:articleid:20139004n56p233</dc:identifier>
  <dc:identifier>urn:oai:papers.revistes.uab.cat:article/1952</dc:identifier>
  <dc:identifier>urn:oai:raco.cat:article/25523</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest document està subjecte a una llicència d'ús Creative Commons. Es permet la reproducció total o parcial, la distribució, la comunicació pública de l'obra i la creació d'obres derivades, sempre que no sigui amb finalitats comercials, i sempre que es reconegui l'autoria de l'obra original.</dc:rights>
  <dc:rights>https://creativecommons.org/licenses/by-nc/3.0/</dc:rights>
  <dc:description>El presente artículo examina empíricamente la relación que existe entre las redes sociales de amistad y éxito académico en base a los resultados de los exámenes, prestando especial atención a las diferencias entre hombre y mujer. El trabajo está basado en una encuesta realizada en 1992 por el Departamento de Sociología (Universidad de Málaga) sobre estudiantes de primer curso de la Facultad de Ciencias Económicas. En el transcurso del análisis se evidencia, por una parte, que la influencia de las relaciones de amistad sobre el resultado de los exámenes es positiva en los hombres y negativa en las mujeres; por otra parte, existe una mayor fuerza explicativa de las variables reticulares en el rendimiento de los hombres que en el de las mujeres.</dc:description>
  <dc:description>This paper empirically examines the relationship between friendship networks and academic success based on exam results, particulary concern to gender differences. It is based on a social survey data from Economic Faculty 1st. course undertaken in 1992 by Sociology Dept. (Malaga U.). The main results was, on one hand, positive influence of friendship relations on exam results in men and negative in women; and the other hand, network variables have stronger incidence on men's academic success than women's.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:265</identifier><datestamp>2026-04-10T10:12:58Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>spa</dc:language>
  <dc:title>La identidad colectiva boliviana entre los tradicionales valores particularistas y las modernas coerciones universalistas</dc:title>
  <dc:creator>Mansilla, H. C. F.</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1998</dc:date>
  <dc:subject>Identidad colectiva</dc:subject>
  <dc:subject>Tradición</dc:subject>
  <dc:subject>Modernización</dc:subject>
  <dc:subject>Universalismo</dc:subject>
  <dc:subject>Particularismo</dc:subject>
  <dc:subject>Collective identity</dc:subject>
  <dc:subject>Tradition</dc:subject>
  <dc:subject>Modernization</dc:subject>
  <dc:subject>Universalism</dc:subject>
  <dc:subject>Particularism</dc:subject>
  <dc:relation>Papers : revista de sociologia ; Num. 56 (1998), p. 243-255</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/265</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:265</dc:identifier>
  <dc:identifier>urn:10.5565/rev/papers.1953</dc:identifier>
  <dc:identifier>urn:articleid:20139004n56p243</dc:identifier>
  <dc:identifier>urn:oai:papers.revistes.uab.cat:article/1953</dc:identifier>
  <dc:identifier>urn:oai:raco.cat:article/25524</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest document està subjecte a una llicència d'ús Creative Commons. Es permet la reproducció total o parcial, la distribució, la comunicació pública de l'obra i la creació d'obres derivades, sempre que no sigui amb finalitats comercials, i sempre que es reconegui l'autoria de l'obra original.</dc:rights>
  <dc:rights>https://creativecommons.org/licenses/by-nc/3.0/</dc:rights>
  <dc:description>Este ensayo trata de la confrontación entre principios universalistas y particularistas en lo que respecta a la construcción de identidades colectivas y nacionalidades (con especial referencia al caso boliviano). Por un lado, tenemos los principios universalistas, basados generalmente en el racionalismo clásico y la Ilustración, cuya consecuencia actual es el proceso de globalización (y modernización en Bolivia). A esta corriente, representada en Bolivia por la élite de blancos y por los sectores mestizos de clase media, se le puede atribuir un optimismo histórico acrítico y una clara tendencia modernizadora, niveladora y centralizadora. Por otro lado, tenemos los principios particularistas, relativistas y parcialmente tradicionalistas, que buscan comprender, sostener y consolidar las llamadas culturas arcaicas y extraeuropeas. Mediante una confrontación crítica de ambas corrientes en la realidad boliviana, el autor cree posible una síntesis fructífera de ambos principios, considerados como complementarios (sobre todo en sus versiones moderadas): la ética universal (en especial los derechos humanos) sería la base para un derecho efectivo a la diferencia.</dc:description>
  <dc:description>This essay deals with the confrontation between universalistic and particularistic principles with regard to the building of collective identities and nationalities (especially as to the Bolivian case). We have, on the one hand, universalistic standards, based on classical rationalism and enlightenment, whose current and last consequence is to be seen in the globalization and modernization processes. In Bolivia it is carried out by the elite of whites and mestizos. Their ideology is clearly optimistic, but also uncritical vis-à-vis centralization and standardization drives. On the other hand they are still particularistic, relativistic and tradicionalist tendencies, which try to unterstand and further pre-industrial and premodern cultures of non-European origin. According to his analysis of Bolivian reality, the author sees the possibility of a fruitful synthesis of both tendencies, as they are rather conplementary and not contradictory: the universal ethics of human rights may be considered as the basis of the effective right to differences of all type.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:266</identifier><datestamp>2026-04-10T10:12:57Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>spa</dc:language>
  <dc:title>La investigación de los movimientos sociales desde la sociología y la ciencia política. Una propuesta de aproximación teórica</dc:title>
  <dc:creator>Pont Vidal, Josep</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1998</dc:date>
  <dc:subject>Movimientos sociales</dc:subject>
  <dc:subject>Asociaciones</dc:subject>
  <dc:subject>Grupos de interés</dc:subject>
  <dc:subject>Movimientos políticos</dc:subject>
  <dc:subject>«pro-teoría»</dc:subject>
  <dc:subject>Acción colectiva</dc:subject>
  <dc:subject>Docencia de los movimientos sociales</dc:subject>
  <dc:subject>Policy Networks</dc:subject>
  <dc:subject>Social movements</dc:subject>
  <dc:subject>Associations</dc:subject>
  <dc:subject>Interest groups</dc:subject>
  <dc:subject>Political movements</dc:subject>
  <dc:subject>«Pro-theory»</dc:subject>
  <dc:subject>Collective action</dc:subject>
  <dc:subject>Teaching and investigation of social movements</dc:subject>
  <dc:relation>Papers : revista de sociologia ; Num. 56 (1998), p. 257-272</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/266</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:266</dc:identifier>
  <dc:identifier>urn:10.5565/rev/papers.1955</dc:identifier>
  <dc:identifier>urn:articleid:20139004n56p257</dc:identifier>
  <dc:identifier>urn:oai:papers.revistes.uab.cat:article/1955</dc:identifier>
  <dc:identifier>urn:oai:raco.cat:article/25525</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest document està subjecte a una llicència d'ús Creative Commons. Es permet la reproducció total o parcial, la distribució, la comunicació pública de l'obra i la creació d'obres derivades, sempre que no sigui amb finalitats comercials, i sempre que es reconegui l'autoria de l'obra original.</dc:rights>
  <dc:rights>https://creativecommons.org/licenses/by-nc/3.0/</dc:rights>
  <dc:description>El presente artículo constituye un intento de plantear los principales problemas que representa el estudio de los movimientos sociales desde el punto de vista sociológico y politológico. El artículo tiene un doble objetivo: por un lado, ofrecer una síntesis de los recientes puntos de vista teóricos de la sociología y la ciencia política respecto al estudio de los movimientos sociales. Por otro lado, partiendo de un catálogo de hipótesis y cuestiones, se propone un marco de síntesis teórico en el que pueden inscribirse futuras investigaciones. Finalmente, y en forma de epílogo, se realiza una breve aproximación comparativa sobre la docencia de la acción colectiva y los movimientos sociales en las facultades de sociología en dos países.</dc:description>
  <dc:description>This article attempts to expound the main problems entailed in the study of social movements from the point of view of sociology and political science. The article has a two-fold objective: on the one hand, it offers a synthesis of the recent theoretical points of view found in sociology and political science regarding the study of social movements. On the other hand, starting out from a catalogue of hypotheses and staded questions, a framework of theoretical synthesis is proposed upon which future investigation can be based. Finally, as an epilogue, there is a brief comparison of the teaching and the investigation of collective action and social movements to be found in Departaments and Faculties of Sociology in a number of countries.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:267</identifier><datestamp>2026-06-03T05:12:57Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>cat</dc:language>
  <dc:title>Necrològica Jean-François Lyotard</dc:title>
  <dc:creator>Sole Puig, Luisa Carlota</dc:creator>
  <dc:type>Altres</dc:type>
  <dc:publisher/>
  <dc:date>1998</dc:date>
  <dc:relation>Papers : revista de sociologia ; Num. 56 (1998), p. 273-274</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/267</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:267</dc:identifier>
  <dc:identifier>urn:10.5565/rev/papers.1956</dc:identifier>
  <dc:identifier>urn:articleid:20139004n56p273</dc:identifier>
  <dc:identifier>urn:recercauab:ARE-14846</dc:identifier>
  <dc:identifier>urn:oai:papers.revistes.uab.cat:article/1956</dc:identifier>
  <dc:identifier>urn:oai:raco.cat:article/25526</dc:identifier>
  <dc:identifier>urn:oai:egreta.uab.cat:publications/f734b849-17cb-465a-a7b9-43418836e055</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest document està subjecte a una llicència d'ús Creative Commons. Es permet la reproducció total o parcial, la distribució, la comunicació pública de l'obra i la creació d'obres derivades, sempre que no sigui amb finalitats comercials, i sempre que es reconegui l'autoria de l'obra original.</dc:rights>
  <dc:rights>https://creativecommons.org/licenses/by-nc/3.0/</dc:rights>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:268</identifier><datestamp>2026-04-10T10:12:57Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>cat</dc:language>
  <dc:title>Recensions</dc:title>
  <dc:creator>Valiente Fernández, Celia</dc:creator>
  <dc:type>Ressenya</dc:type>
  <dc:publisher/>
  <dc:date>1998</dc:date>
  <dc:relation>Papers : revista de sociologia ; Num. 56 (1998), p. 275-277</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/268</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:268</dc:identifier>
  <dc:identifier>urn:10.5565/rev/papers.1957</dc:identifier>
  <dc:identifier>urn:articleid:20139004n56p275</dc:identifier>
  <dc:identifier>urn:oai:papers.revistes.uab.cat:article/1957</dc:identifier>
  <dc:identifier>urn:oai:raco.cat:article/50410</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest document està subjecte a una llicència d'ús Creative Commons. Es permet la reproducció total o parcial, la distribució, la comunicació pública de l'obra i la creació d'obres derivades, sempre que no sigui amb finalitats comercials, i sempre que es reconegui l'autoria de l'obra original.</dc:rights>
  <dc:rights>https://creativecommons.org/licenses/by-nc/3.0/</dc:rights>
  <dc:description>Obra ressenyada: Josune AGUINAGA ROUSTÁN; Domingo COMAS ARNAU, Cambio de hábitos en el uso del tiempo: trayectorias temporales de los jóvenes españoles. Madrid: Instituto de la Juventud, 1997.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:269</identifier><datestamp>2026-04-10T10:12:57Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>spa</dc:language>
  <dc:title>Articulación de perspectivas metodológicas : posibilidades del grupo de discusión para una sociedad reflexiva</dc:title>
  <dc:creator>Callejo, Javier</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1998</dc:date>
  <dc:subject>Reflexividad</dc:subject>
  <dc:subject>Grupo de discusión</dc:subject>
  <dc:subject>Perspectiva estructural</dc:subject>
  <dc:subject>Perspectiva dia-léctica</dc:subject>
  <dc:subject>Relación observador-observados</dc:subject>
  <dc:subject>Reflexivity</dc:subject>
  <dc:subject>Focus group</dc:subject>
  <dc:subject>Structural perspective</dc:subject>
  <dc:subject>Dialectic perspective</dc:subject>
  <dc:subject>Observer-observed relation</dc:subject>
  <dc:relation>Papers : revista de sociologia ; Num. 56 (1998), p. 31-55</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/269</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:269</dc:identifier>
  <dc:identifier>urn:10.5565/rev/papers.1943</dc:identifier>
  <dc:identifier>urn:articleid:20139004n56p31</dc:identifier>
  <dc:identifier>urn:oai:papers.revistes.uab.cat:article/1943</dc:identifier>
  <dc:identifier>urn:oai:raco.cat:article/25513</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest document està subjecte a una llicència d'ús Creative Commons. Es permet la reproducció total o parcial, la distribució, la comunicació pública de l'obra i la creació d'obres derivades, sempre que no sigui amb finalitats comercials, i sempre que es reconegui l'autoria de l'obra original.</dc:rights>
  <dc:rights>https://creativecommons.org/licenses/by-nc/3.0/</dc:rights>
  <dc:description>La concreción de las distintas técnicas de investigación social tienen lugar en condiciones sociales determinadas. Por diversos autores, las sociedades contemporáneas son caracterizadas como reflexivas. ¿Qué consecuencias tiene tal caracterización sobre la sociología empírica? Se ofrece una respuesta que tiene como referencia una práctica de investigación, el grupo de discusión, aplicada a campos que necesitan establecer unas mínimas líneas de consenso en medio del conflicto. Este tipo de aplicación cuestiona algunos criterios de clasificación e identificación de los distintos modos de hacer investigación social. Así, la barrera entre perspectiva estructural y perspectiva dialéctica, tomada de Ibáñez, desaparece. El artículo analiza algunas de las consecuencias prácticas sobre la técnica al situarse en el cruce de perspecivas: sobre la dinámica y el estilo de moderación.</dc:description>
  <dc:description>In the concret, every social research instrument is applied in specific social conditions. Following sociologist as Beck, Giddens and others, contemporary societies are reflexive societies. How to take this in the empirical social research? This work offers a reply to the question using the focus group as reference, specially when the focus group is used in research? This work offers a reply to the question using the focus group as reference, specially when the focus group is used in researchs with the aim to observe the posibilities of consensus. Using the focus group in that way, we have found how some criteria to classify the ways of doing social research doesn't serve. So, the frontier between structural perspective and dialectic perspective, proposed by Ibañez, disappears. This essay analyse some of the practical consequences in the focus grop if we use it in the reflexive way. Special consideration to focus group dynamic and moderator role.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:270</identifier><datestamp>2026-04-10T09:13:16Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>spa</dc:language>
  <dc:title>Los decires y los haceres</dc:title>
  <dc:creator>Martín Criado, Enrique</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1998</dc:date>
  <dc:subject>Metodología sociológica</dc:subject>
  <dc:subject>Técnicas de investigación</dc:subject>
  <dc:subject>Discurso</dc:subject>
  <dc:subject>Sociedad y lenguaje</dc:subject>
  <dc:subject>Methods and techniques in social sciences</dc:subject>
  <dc:subject>Discourse</dc:subject>
  <dc:subject>Society and language</dc:subject>
  <dc:relation>Papers : revista de sociologia ; Num. 56 (1998), p. 57-71</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/270</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:270</dc:identifier>
  <dc:identifier>urn:10.5565/rev/papers.1944</dc:identifier>
  <dc:identifier>urn:articleid:20139004n56p57</dc:identifier>
  <dc:identifier>urn:oai:papers.revistes.uab.cat:article/1944</dc:identifier>
  <dc:identifier>urn:oai:raco.cat:article/25514</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest document està subjecte a una llicència d'ús Creative Commons. Es permet la reproducció total o parcial, la distribució, la comunicació pública de l'obra i la creació d'obres derivades, sempre que no sigui amb finalitats comercials, i sempre que es reconegui l'autoria de l'obra original.</dc:rights>
  <dc:rights>https://creativecommons.org/licenses/by-nc/3.0/</dc:rights>
  <dc:description>La mayoría de las técnicas de investigación sociológicas son lingüísticas. Ello plantea el problema de la relación entre lo que los sujetos hacen y lo que dicen. Normalmente se analiza esta problemática desde una perspectiva idealista que reduce el lenguaje a expresión. Se propone, a partir de las obras de Goffman y Bourdieu, una perspectiva pragmática del lenguaje: los discursos son prácticas de los sujetos en situaciones sociales. Desde esta perspectiva, la pregunta sobre la relación entre los decires y los haceres lleva al análisis de la relación entre las diversas censuras estructurales de las diversas prácticas -discursivas y extradiscursivas- en distintas situaciones sociales.</dc:description>
  <dc:description>Most of research techniques in sociology are linguistic. This raises the question of the relation between what the subjects say and what they do. This question is usually analyzed from an idealistic perspective, which reduces language to expression. A pragmatic perspective of language -based upon Goffman and Bourdieu's work- is proposed: discour-ses are subject's practices in social situations. From this point of view, the question about the relation between what people say and what they do leads us to the analysis of the relation between the different «structural censorships» of the different -discoursive and extradiscoursive- practices in different social situations.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:272</identifier><datestamp>2026-04-10T09:13:16Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>spa</dc:language>
  <dc:title>Las encrucijadas de un modelo social</dc:title>
  <dc:creator>Azor Hernández, Marlene</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1998</dc:date>
  <dc:relation>Papers : revista de sociologia ; Num. 56 (1998), p. 73-101</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/272</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:272</dc:identifier>
  <dc:identifier>urn:10.5565/rev/papers.1945</dc:identifier>
  <dc:identifier>urn:articleid:20139004n56p73</dc:identifier>
  <dc:identifier>urn:oai:papers.revistes.uab.cat:article/1945</dc:identifier>
  <dc:identifier>urn:oai:raco.cat:article/25516</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest document està subjecte a una llicència d'ús Creative Commons. Es permet la reproducció total o parcial, la distribució, la comunicació pública de l'obra i la creació d'obres derivades, sempre que no sigui amb finalitats comercials, i sempre que es reconegui l'autoria de l'obra original.</dc:rights>
  <dc:rights>https://creativecommons.org/licenses/by-nc/3.0/</dc:rights>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><record><header><identifier>oai:ddd.uab.cat:274</identifier><datestamp>2026-04-10T09:13:16Z</datestamp><setSpec>scholar</setSpec><setSpec>driver</setSpec><setSpec>artpubuab</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>cat</dc:language>
  <dc:title>El Manifest comunista en la història del pensament</dc:title>
  <dc:creator>Argemí, Lluís</dc:creator>
  <dc:type>Article</dc:type>
  <dc:publisher/>
  <dc:date>1999</dc:date>
  <dc:subject>Manifest comunista</dc:subject>
  <dc:subject>Marx</dc:subject>
  <dc:subject>Engels</dc:subject>
  <dc:subject>Teoria econòmica</dc:subject>
  <dc:subject>Lluita de classes</dc:subject>
  <dc:subject>Materialisme històric</dc:subject>
  <dc:subject>Socialisme</dc:subject>
  <dc:subject>Capitalisme</dc:subject>
  <dc:subject>The Communist Manifest</dc:subject>
  <dc:subject>Economic theory</dc:subject>
  <dc:subject>Struggle of classes</dc:subject>
  <dc:subject>Historic materialism</dc:subject>
  <dc:subject>Socialism</dc:subject>
  <dc:subject>Capitalism</dc:subject>
  <dc:relation>Papers : revista de sociologia ; Num. 57 (1999), p. 11-20</dc:relation>
  <dc:identifier>https://ddd.uab.cat/record/274</dc:identifier>
  <dc:identifier>urn:oai:ddd.uab.cat:274</dc:identifier>
  <dc:identifier>urn:10.5565/rev/papers/v57n0.1963</dc:identifier>
  <dc:identifier>urn:articleid:20139004n57p11</dc:identifier>
  <dc:identifier>urn:oai:papers.revistes.uab.cat:article/1963</dc:identifier>
  <dc:identifier>urn:oai:raco.cat:article/25528</dc:identifier>
  <dc:rights>open access</dc:rights>
  <dc:rights>Aquest document està subjecte a una llicència d'ús Creative Commons. Es permet la reproducció total o parcial, la distribució, la comunicació pública de l'obra i la creació d'obres derivades, sempre que no sigui amb finalitats comercials, i sempre que es reconegui l'autoria de l'obra original.</dc:rights>
  <dc:rights>https://creativecommons.org/licenses/by-nc/3.0/</dc:rights>
  <dc:description>Aquest article reivindica l'obra de Marx i Engels, en especial el Manifest comunista, com a obra clàssica imprescindible en les ciències polítiques, econòmiques i en sociologia, per la influència que ha deixat en la cultura occidental. A través de l'anàlisi dels aspectes formals, teòrics i polítics del Manifest comunista, Lluís Argemí ens fa prendre consciència de les grans aportacions de Marx i Engels al pensament polític i social actual i de fins a quin punt ha determinat els paràmetres en què avui es mou.</dc:description>
  <dc:description>This article claims for the Marx and Engels' writings, specially The Communist Manifest, as a contemporary classic indispensable to Political Science, Economics and Sociology for all its influence in Western culture. Throug the analysis of formal, theoretic and political aspects of The Communist Manifest, Lluís Argemí tries to make us conscientious of Marx and Engels' great contribution to the political and social present thought.</dc:description>
  <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record><resumptionToken cursor="0" completeListSize="150777" expirationDate="2026-09-19T08:20:29Z">scholar___Bb6qT9</resumptionToken></ListRecords>
</OAI-PMH>

