ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Improvements by the USAF 2nd Space Operations Squadron at the Master Control Station Are Benefiting GPS Users (1995)
    Springer
    GPS solutions 1 (1995), S. 65-73 
    Details
    ISSN: 1521-1886
    Source: Springer Online Journal Archives 1860-2000
    Topics: Architecture, Civil Engineering, Surveying , Geosciences
    Notes: The NAVSTAR Global Positioning System is a space-based, all-weather, worldwide satellite navigation system. GPS uses the constellation of satellites and associated ground equipment to perform the primary missions of highly accurate navigation, time transfer, and nuclear detonation detection. To achieve these missions, GPS has three clearly defined segments – space, user and control (see Figure 1). The control segment, otherwise referred to as the operational control segment (OCS), consists of the personnel and equipment that controls the space segment and interfaces with the user segment. The OCS is made up of the master control station (MCS), the ground antennas (GA), and the monitor stations (MS). The purpose of this article is to describe how the 2nd Space Operations Squadron runs the MCS, the key element of the OCS.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Valid inequalities and facets of the capacitated plant location problem (1989)
    Springer
    Mathematical programming 44 (1989), S. 271-291 
    Details
    ISSN: 1436-4646
    Keywords: Facets of polyhedra ; plant location ; capacitated fixed charge problems ; vertex packing
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Recently, several successful applications of strong cutting plane methods to combinatorial optimization problems have renewed interest in cutting plane methods, and polyhedral characterizations, of integer programming problems. In this paper, we investigate the polyhedral structure of the capacitated plant location problem. Our purpose is to identify facets and valid inequalities for a wide range of capacitated fixed charge problems that contain this prototype problem as a substructure. The first part of the paper introduces a family of facets for a version of the capacitated plant location problem with a constant capacity for all plants. These facet inequalities depend on the capacity and thus differ fundamentally from the valid inequalities for the uncapacited version of the problem. We also introduce a second formulation for a model with indivisible customer demand and show that it is equivalent to a vertex packing problem on a derived graph. We identify facets and valid inequalities for this version of the problem by applying known results for the vertex packing polytope.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01587093
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    The convex hull of two core capacitated network design problems (1993)
    Springer
    Mathematical programming 60 (1993), S. 233-250 
    Details
    ISSN: 1436-4646
    Keywords: Convex hull ; facets ; network design ; capacitated facilities
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The network loading problem (NLP) is a specialized capacitated network design problem in which prescribed point-to-point demand between various pairs of nodes of a network must be met by installing (loading) a capacitated facility. We can load any number of units of the facility on each of the arcs at a specified arc dependent cost. The problem is to determine the number of facilities to be loaded on the arcs that will satisfy the given demand at minimum cost. This paper studies two core subproblems of the NLP. The first problem, motivated by a Lagrangian relaxation approach for solving the problem, considers a multiple commodity, single arc capacitated network design problem. The second problem is a three node network; this specialized network arises in larger networks if we aggregate nodes. In both cases, we develop families of facets and completely characterize the convex hull of feasible solutions to the integer programming formulation of the problems. These results in turn strengthen the formulation of the NLP.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01580612
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    Optimizing constrained subtrees of trees (1995)
    Springer
    Mathematical programming 71 (1995), S. 113-126 
    Details
    ISSN: 1436-4646
    Keywords: Polyhedral combinatorics ; Packing subtrees ; Knapsacks with precedence ; Column generation ; Dynamic programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Given a treeG = (V, E) and a weight function defined on subsets of its nodes, we consider two associated problems. The first, called the “rooted subtree problem”, is to find a maximum weight subtree, with a specified root, from a given set of subtrees. The second problem, called “the subtree packing problem”, is to find a maximum weight packing of node disjoint subtrees chosen from a given set of subtrees, where the value of each subtree may depend on its root. We show that the complexity status of both problems is related, and that the subtree packing problem is polynomial if and only if each rooted subtree problem is polynomial. In addition we show that the convex hulls of the feasible solutions to both problems are related: the convex hull of solutions to the packing problem is given by “pasting together” the convex hulls of the rooted subtree problems. We examine in detail the case where the set of feasible subtrees rooted at nodei consists of all subtrees with at mostk nodes. For this case we derive valid inequalities, and specify the convex hull whenk ⩽ 4.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01585993
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 5
    Electronic Resource
    Electronic Resource
    A unifying geometric solution framework and complexity analysis for variational inequalities (1995)
    Springer
    Mathematical programming 71 (1995), S. 327-351 
    Details
    ISSN: 1436-4646
    Keywords: Variational inequalities ; Nonlinear programming ; Complexity analysis ; Monotone operators
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract In this paper, we propose a concept of polynomiality for variational inequality problems and show how to find a near optimal solution of variational inequality problems in a polynomial number of iterations. To establish this result, we build upon insights from several algorithms for linear and nonlinear programs (the ellipsoid algorithm, the method of centers of gravity, the method of inscribed ellipsoids, and Vaidya's algorithm) to develop a unifying geometric framework for solving variational inequality problems. The analysis rests upon the assumption of strong-f-monotonicity, which is weaker than strict and strong monotonicity. Since linear programs satisfy this assumption, the general framework applies to linear programs.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01590959
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 6
    Electronic Resource
    Electronic Resource
    A hybrid approach to discrete mathematical programming (1978)
    Springer
    Mathematical programming 14 (1978), S. 21-40 
    Details
    ISSN: 1436-4646
    Keywords: Integer Programming ; Dynamic Programming ; Branch-and-Bound ; Discrete Optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The dynamic programming and branch-and-bound approaches are combined to produce a hybrid algorithm for separable discrete mathematical programs. Linear programming is used in a novel way to compute bounds. Every simplex pivot permits a bounding test to be made on every active node in the search tree. Computational experience is reported.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01588949
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 7
    Electronic Resource
    Electronic Resource
    ITONUS: Expert system for machining on a lathe (1991)
    Springer
    Journal of intelligent manufacturing 2 (1991), S. 353-363 
    Details
    ISSN: 1572-8145
    Keywords: expert system ; machining ; diagnosis ; knowledge representation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics
    Notes: Abstract A microcomputer-based expert system for the diagnosis of lathe machining operations has been developed using the EXSYS shell on an IBM AT. Interviews with a journeyman machinist resulted in an initial knowledge base of rules containing basic concepts and relationships concerning set-up and control of lathe machining. The system provides the user with analysis and advice regarding the diagnosis and certain set-up aspects of common lathe operations, and has shown that it is feasible to elicit and mimic at least a portion of an expert machinist's knowledge and special skills.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01471938
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 8
    Electronic Resource
    Electronic Resource
    Intelligent tracking in manufacturing (1999)
    Springer
    Journal of intelligent manufacturing 10 (1999), S. 245-250 
    Details
    ISSN: 1572-8145
    Keywords: Intelligent tracking ; RFID ; virtual warehouse
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics
    Notes: Abstract Dynamic scheduling is an important new innovation in manufacturing and supply chain management. However, the success of dynamic scheduling will depend on real-time information. This paper describes intelligent tracking technologies that provide real-time information throughout the supply chain to support keywords a logistics planning and execution.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1008995707211
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 9
    Electronic Resource
    Electronic Resource
    A steerable laser radar system for atmospheric studies (1978)
    Springer
    Optical and quantum electronics 10 (1978), S. 243-252 
    Details
    ISSN: 1572-817X
    Source: Springer Online Journal Archives 1860-2000
    Topics: Electrical Engineering, Measurement and Control Technology , Physics
    Notes: Abstract A steerable laser radar suitable for a wide range of atmospheric studies is described. The system incorporates a flashlamp-pumped dye laser and a receiving telescope with a 0.3 m mirror. The steering capability is provided by the use of a 0.61 m by 0.46 m plane mirror for both transmission and reception. Manual and automatic control of the mirror drive is provided, with its angular position being recorded. Digital counting is used in the recording electronics. The performance of the system in measurements over a large range of heights in the atmosphere is illustrated.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01208856
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 10
    Electronic Resource
    Electronic Resource
    A rationale for the support of the medium-sized family farm (1989)
    Springer
    Agriculture and human values 6 (1989), S. 47-53 
    Details
    ISSN: 1572-8366
    Source: Springer Online Journal Archives 1860-2000
    Topics: Agriculture, Forestry, Horticulture, Fishery, Domestic Science, Nutrition
    Notes: Abstract The current financial stress in the countryside and the future of the family farm are likely to be major issues in the formulation of the 1990 Farm Bill. Medium-sized commercial family farms may be especially targeted for support. These farms are the basis of rural economies and settlement patterns in many parts of nonmetropolitan America. Two possible changes in farm policy are debt restructuring and the decoupling of farm payments from commodity production. Many medium-sized family farms continue to face substantial debt problems, but most of these farms could be viable with some debt restructuring. Ccmmodity programs have become extremely expensive and encourage overproduction and the consolidation of farming resources into ever larger units. Federal farm programs may become based on need, with a sensitivity to differences in regional farming systems. Such a policy could support medium-sized family farms, slow the growth in superfarms, reduce surpluses, and reduce the overall cost of farm programs.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02217813
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...