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
Filter
  • integer programming
  • 2020-2022
  • 1985-1989  (15)
  • 1970-1974
  • 1950-1954
  • 1945-1949
Collection
Keywords
Publisher
Years
Year
  • 1
    Electronic Resource
    Electronic Resource
    On the set covering polytope: I. All the facets with coefficients in {0, 1, 2} (1989)
    Springer
    Mathematical programming 43 (1989), S. 57-69 
    Details
    ISSN: 1436-4646
    Keywords: Set covering ; facets ; polyhedral combinatorics ; integer programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract While the set packing polytope, through its connection with vertex packing, has lent itself to fruitful investigations, little is known about the set covering polytope. We characterize the class of valid inequalities for the set covering polytope with coefficients equal to 0, 1 or 2, and give necessary and sufficient conditions for such an inequality to be minimal and to be facet defining. We show that all inequalities in the above class are contained in the elementary closure of the constraint set, and that 2 is the largest value ofk such that all valid inequalities for the set covering polytope with integer coefficients no greater thank are contained in the elementary closure. We point out a connection between minimal inequalities in the class investigated and certain circulant submatrices of the coefficient matrix. Finally, we discuss conditions for an inequality to cut off a fractional solution to the linear programming relaxation of the set covering problem and to improve the lower bound given by a feasible solution to the dual of the linear programming relaxation.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01582278
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Algorithms for nonlinear integer bicriterion problems (1989)
    Springer
    Journal of optimization theory and applications 63 (1989), S. 261-279 
    Details
    ISSN: 1573-2878
    Keywords: Bicriteria optimization ; integer programming ; Tchebycheff norm ; quality control ; interactive methods
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Two algorithms to solve the nonlinear bicriterion integer mathematical programming (BIMP) problem are presented. One is a noninteractive procedure that generates the entire efficient set, and the second one is an interactive procedure that determines the best compromise solution of the decision maker (DM). A Tchebycheff norm related approach is used for generating the efficient points for the BIMP problem. An application of the interactive procedure for a quality control problem is also presented.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00939577
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    Impacs - A bus crew scheduling system using integer programming (1988)
    Springer
    Mathematical programming 42 (1988), S. 181-187 
    Details
    ISSN: 1436-4646
    Keywords: Branch and bound ; bus crew scheduling ; integer programming ; scheduling ; set covering
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01589402
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    Some branch and bound techniques for nonlinear optimization (1988)
    Springer
    Mathematical programming 42 (1988), S. 147-157 
    Details
    ISSN: 1436-4646
    Keywords: Branch and bound ; integer programming ; linked ordered sets ; special ordered sets
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The range of nonlinear optimization problems which can be solved by Linear Programming and the Branch and Bound algorithm is extended by introducing Chains of Linked Ordered Sets and by allowing automatic interpolation of new variables. However this approach involves solving a succession of linear subproblems, whose solutions in general violate the logical requirements of the nonlinear formulation and may lie far from any local or global optimum. The paper describes techniques which are designed to improve the performance of the Branch and Bound algorithm on problems containing chains, and which also yield benefits in integer programming. Each linear subproblem is tightened towards the corresponding nonlinear problem by removing variables which must logically be nonbasic in any feasible solution. This is achieved by a ‘presolve’ procedure, and also by post-optimal Lagrangian relaxation which tightens the bound on the objective function by assessing the cheapest way to satisfy any violated chain constraints. Frequently fewer subsequent branches are required to find a feasible solution or to prove infeasibility.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01589399
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 5
    Electronic Resource
    Electronic Resource
    Special ordered sets and an application to gas supply operations planning (1988)
    Springer
    Mathematical programming 42 (1988), S. 69-84 
    Details
    ISSN: 1436-4646
    Keywords: Branch and bound ; gas supply model ; integer programming ; network flows ; special ordered sets
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Special Ordered Sets provide a powerful means of modeling nonconvex functions and discrete requirements, though there has been a tendency to think of them only in terms of multiple-choice zero-one programming. This paper emphasizes the origins and generality of the special ordered set concept, and describes an application in which type 2 sets are used in several forms to model both logical conditions and nonlinear functions.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01589393
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 6
    Electronic Resource
    Electronic Resource
    Layering strategies for creating exploitable structure in linear and integer programs (1988)
    Springer
    Mathematical programming 40 (1988), S. 165-181 
    Details
    ISSN: 1436-4646
    Keywords: Relaxation ; network ; integer programming ; linear programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The strategy of subdividing optimization problems into layers by splitting variables into multiple copies has proved useful as a method for inducing exploitable structure in a variety of applications, particularly those involving embedded pure and generalized networks. A framework is proposed in this paper which leads to new relaxation and restriction methods for linear and integer programming based on our extension of this strategy. This framework underscores the use of constructions that lead to stronger relaxations and more flexible strategies than previous applications. Our results establish the equivalence of all layered Lagrangeans formed by parameterizing the equal value requirement of copied variables for different choices of the principal layers. It is further shown that these Lagrangeans dominate traditional Lagrangeans based on incorporating non-principal layers into the objective function. In addition a means for exploiting the layered Lagrangeans is provided by generating subgradients based on a simple averaging calculation. Finally, we show how this new layering strategy can be augmented by an integrated relaxation/restriction procedure, and indicate variations that can be employed to particular advantage in a parallel processing environment. Preliminary computational results on fifteen real world zero-one personnel assignment problems, comparing two layering approaches with five procedures previously found best for those problems, are encouraging. One of the layering strategies tested dominated all non-layering procedures in terms of both quality and solution time.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01580728
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 7
    Electronic Resource
    Electronic Resource
    Generalized resolution and cutting planes (1988)
    Springer
    Annals of operations research 12 (1988), S. 217-239 
    Details
    ISSN: 1572-9338
    Keywords: Propositional logic ; resolution ; integer programming ; theorem proving ; artificial intelligence
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract This paper illustrates how the application of integer programming to logic can reveal parallels between logic and mathematics and lead to new algorithms for inference in knowledge-based systems. If logical clauses (stating that at least one of a set of literals is true) are written as inequalities, then the resolvent of two clauses corresponds to a certain cutting plane in integer programming. By properly enlarging the class of cutting planes to cover clauses that state that at least a specified number of literals are true, we obtain a generalization of resolution that involves both cancellation-type and circulant-type sums. We show its completeness by proving that it generates all prime implications, generalizing an early result by Quine. This leads to a cutting-plane algorithm as well as a generalized resolution algorithm for checking whether a set of propositions, perhaps representing a knowledge base, logically implies a given proposition. The paper is intended to be readable by persons with either an operations research or an artificial intelligence background.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02186368
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 8
    Electronic Resource
    Electronic Resource
    Integrated production scheduling in large-scale flexible electronic parts manufacturing (1988)
    Springer
    Annals of operations research 15 (1988), S. 269-287 
    Details
    ISSN: 1572-9338
    Keywords: Production scheduling ; integer programming ; simulation ; flexible manufacturing ; hierarchical modelling
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract This study reports the development of a production scheduling system for the integrated management of production in large-scale, high-volume electronic assembly lines. The development of the system incorporates control and planning considerations by addressing the interaction of various subsystems. Stochastic and deterministic aspects of the problem environment are appropriately handled via relevant simulation and analytic models. By effecting a hierarchical breakdown of the problem environment, the system produces information used in practical decision making for production planning and scheduling. Procedures used encompass and address considerations for management of work-in-process, optimization of the various subsystems' performance, minimization of setup time effect, and inventory carrying costs.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02186799
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 9
    Electronic Resource
    Electronic Resource
    On the greedy solution in integer linear programming (1987)
    Springer
    Mathematical methods of operations research 31 (1987), S. A55 
    Details
    ISSN: 1432-5217
    Keywords: integer programming ; greedy method ; Hilbert basis
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Description / Table of Contents: Zusammenfassung In dieser Arbeit wird eine Version des Greedy-Algorithmus zur Lösung ganzzahliger linearer Optimierungsprobleme benutzt, die kein Rucksackproblem als Relaxation verwendet. Das Verfahren basiert auf der natürlichen partiellen Ordnung von Vektoren. Ziel der Arbeit ist es, eine möglichst große Problemklasse zu beschreiben, für die die Greedy-Lösung optimal ist. Die Ergebnisse verallgemeinern Sätze einer früheren Arbeit von Magazine, Nemhauser und Trotter und zeigen gleichzeitig einen Bezug zwischen zwei verschiedenen Gebieten der Kombinatorik auf: des Greedy-Verfahrens und von Hubert-Basen.
    Notes: Abstract A version of the greedy method not using any knapsack relaxation of the integer programming problem is considered in this paper. It is based on a natural partial ordering of the vectors. Our aim is to determine a large class of problems where the greedy solution is always optimal. The results generalize some theorems of an early paper of Magazine, Nemhauser and Trotter and at the same time show a connection between two different notions of combinatorics: the greedy method and the Hilbert basis.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01258608
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 10
    Electronic Resource
    Electronic Resource
    An exact algorithm for solving a capacitated location-routing problem (1986)
    Springer
    Annals of operations research 6 (1986), S. 291-310 
    Details
    ISSN: 1572-9338
    Keywords: Capacitated location-routing ; integer programming ; algorithm ; least cost
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract In location-routing problems, the objective is to locate one or many depots within a set of sites (representing customer locations or cities) and to construct delivery routes from the selected depot or depots to the remaining sites at least system cost. The objective function is the sum of depot operating costs, vehicle acquisition costs and routing costs. This paper considers one such problem in which a weight is assigned to each site and where sites are to be visited by vehicles having a given capacity. The solution must be such that the sum of the weights of sites visited on any given route does not exceed the capacity of the visiting vehicle. The formulation of an integer linear program for this problem involves degree constraints, generalized subtour elimination constraints, and chain barring constraints. An exact algorithm, using initial relaxation of most of the problem constraints, is presented which is capable of solving problems with up to twenty sites within a reasonable number of iterations.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02023807
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 11
    Electronic Resource
    Electronic Resource
    A dynamic programming approach to the complete set partitioning problem (1986)
    Springer
    BIT 26 (1986), S. 467-474 
    Details
    ISSN: 1572-9125
    Keywords: F.1.3 ; F.2.1 ; G.1.6 ; Set partitioning problem ; integer programming ; dynamic programming ; analysis of algorithms
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The complete set partitioning (CSP) problem is a special case of the set partitioning problem where the coefficient matrix has 2 m −1 columns, each column being a binary representation of a unique integer between 1 and 2 m −1,m⩾1. It has wide applications in the area of corporate tax structuring in operations research. In this paper we propose a dynamic programming approach to solve the CSP problem, which has time complexityO(3 m ), wheren=2 m −1 is the size of the problem space.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01935053
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 12
    Electronic Resource
    Electronic Resource
    A note on aggregating constraints in integer programming (1986)
    Springer
    Mathematical methods of operations research 30 (1986), S. A79 
    Details
    ISSN: 1432-5217
    Keywords: Aggregation of constraints ; integer programming ; linear and nonlinear constraints
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Description / Table of Contents: Zusammenfassung Die Zusammenfassung von Restriktionen ist eine Technik zur Lösung ganzzahliger Optimierungsaufgaben. Es wird ein Resultat von Zionts modifiziert. Ohne diese Modifikation gibt es nämlich ein Gegenbeispiel zur Behauptung. Ferner wird ein Satz von Bradley über die Zusammenfassung nichtlinearer Funktionen etwas verallgemeinert.
    Notes: Abstract To aggregate constraints is a technique for solving the integer programming problem. In this note we modify a result of Zionts (1974); without this modification, there is a counterexample for Zionts' result. Further, we give an elegant theorem which considers the aggregation of nonlinear constraints.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01918634
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 13
    Electronic Resource
    Electronic Resource
    The part families problem in flexible manufacturing systems (1985)
    Springer
    Annals of operations research 3 (1985), S. 277-300 
    Details
    ISSN: 1572-9338
    Keywords: Clustering ; integer programming ; flexible manufacturing ; group technology
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract Parts grouping into families can be performed in flexible manufacturing systems (FMSs) to simplify two classes of problems: long horizon planning and short horizon planning. In this paper the emphasis is on the part families problem applicable to the short horizon planning. Traditionally, parts grouping was based on classification and coding systems, some of which are reviewed in this paper. To overcome the drawbacks of the classical approach to parts grouping, two new methodologies are developed. The methodologies presented are very easy to implement because they take advantage of the information already stored in the CAD system. One of the basic elements of this system is the algorithm for solving the part families problem. Some of the existing clustering algorithms for solving this problem are discussed. A new clustering algorithm has been developed. The computational complexity and some of the computational results of solving the part families problem are also discussed.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02023710
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 14
    Electronic Resource
    Electronic Resource
    An efficient alorithm for the general multiple-choice knapsack problem (GMKP) (1985)
    Springer
    Annals of operations research 4 (1985), S. 253-283 
    Details
    ISSN: 1572-9338
    Keywords: Mathematical programming ; integer programming ; general multiple-choice knapsack problem ; knapsack problem ; capital budgeting
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract A common problem frequently faced by business firms and individual investors is to select a few investment opportunities from many available possibilities. This problem, in its simplest form, can be modeled as a 0–1 knapsack problem. In a more general investment scenario, however, we obtain a model which is a general knapsack problem with a multiple-choice constraint. To solve this problem, an efficient enumerative algorithm is developed. The algorithm includes an efficient procedure to solve the LP-relaxed problem, a reduction algorithm which may allow the initial fixing of some of the variables, and various other implicit enumeration criteria derived from the group problem. Extensive computational experience illustrates the efficiency of the algorithm and related results.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02022043
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 15
    Electronic Resource
    Electronic Resource
    Interactive decision software and computer graphics for architectural and space planning (1985)
    Springer
    Annals of operations research 5 (1985), S. 557-573 
    Details
    ISSN: 1572-9338
    Keywords: Modeling ; micro-computers ; integer programming ; nonlinear programming ; heuristics
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract We describe the development and successful implementation of a decision support system now being used by several leading firms in the architecture and space planning industries. The system, which we call SPDS (spatialprogrammingdesignsystem) has the following characteristics: (i) user-friendly convenience features permitting architects and space planners to operate the system without being experienced programmers; (ii) interactive capabilities allowing the user to control and to manipulate relevant parameters, orchestrating conditions to which his or her intuition provides valuable input; (iii) informative and understandable graphics, providing visual displays of interconnections that the computer itself treats in a more abstract methematical form; (iv) convenient ways to change configurations, and to carry out ‘what if’ analyses calling on the system's decision support capabilities; (v) a collection of new methods, invisible to the user, capable of generating good solutions to the mathematical programming problems that underlie each major design component. These new methods succeed in generating high quality solutions to a collection of complex discrete, highly nonlinear problems. While these problems could only be solved in hours, or not at all, with previously existing software, the new methods obtain answers in seconds to minutes on a minicomputer. Major users, including Dalton, Dalton, Newport, and Marshal Erdwin, report numerous advantages of the system over traditional architectural design methods.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02023611
    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...