Library

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
    Book
    Book
    Model building in mathematical programming (1999)
    Chichester u.a. :Wiley,
    Details
    Title: Model building in mathematical programming
    Author: Williams, H. Paul
    Edition: 4th ed.
    Publisher: Chichester u.a. :Wiley,
    Year of publication: 1999
    Pages: 354 S.
    Type of Medium: Book
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    ZIB Catalog
    Zuse Institute Berlin get availability status
  • 2
    Electronic Resource
    Electronic Resource
    Increase in Maximum Usable Frequency for Two-hop Transatlantic Propagation due to Horizontal Gradients (1962)
    [s.l.] : Nature Publishing Group
    Nature 196 (1962), S. 256-258 
    Details
    ISSN: 1476-4687
    Source: Nature Archives 1869 - 2009
    Topics: Biology , Chemistry and Pharmacology , Medicine , Natural Sciences in General , Physics
    Notes: [Auszug] An examination of the records of oblique incidence recordings, taken over a 5,600-km link between Ottawa and Den Haag, has revealed that the increase in MUF is strongly correlated with the horizontal ionization gradient. This can be seen from Figs, la and b, which give four typical cases for ...
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1038/196256b0
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    The progressive party problem: Integer linear programming and constraint programming compared (1996)
    Springer
    Constraints 1 (1996), S. 119-138 
    Details
    ISSN: 1572-9354
    Keywords: combinatorial optimization ; integer linear programming ; constraint programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Many discrete optimization problems can be formulated as either integer linear programming problems or constraint satisfaction problems. Although ILP methods appear to be more powerful, sometimes constraint programming can solve these problems more quickly. This paper describes a problem in which the difference in performance between the two approaches was particularly marked, since a solution could not be found using ILP. The problem arose in the context of organizing a “progressive party” at a yachting rally. Some yachts were to be designated hosts; the crews of the remaining yachts would then visit the hosts for six successive half-hour periods. A guest crew could not revisit the same host, and two guest crews could not meet more than once. Additional constraints were imposed by the capacities of the host yachts and the crew sizes of the guests. Integer linear programming formulations which included all the constraints resulted in very large models, and despite trying several different strategies, all attempts to find a solution failed. Constraint programming was tried instead and solved the problem very quickly, with a little manual assistance. Reasons for the success of constraint programming in this problem are identified and discussed.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00143880
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    The Two-Period Travelling Salesman Problem Applied to Milk Collection in Ireland (1997)
    Springer
    Computational optimization and applications 7 (1997), S. 291-306 
    Details
    ISSN: 1573-2894
    Keywords: travelling salesman problem ; inequalities ; cutting planes ; Branch-and-Bound
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract We describe a new extension to the Symmetric Travelling Salesman Problem (STSP) in which some nodes are visited inboth of 2 periods and the remaining nodes are visited in either 1 ofthe periods. A number of possible Integer Programming Formulationsare given. Valid cutting plane inequalities are defined for thisproblem which result in an, otherwise prohibitively difficult, modelof 42 nodes becoming easily solvable by a combination of cuts andBranch-and-Bound. Some of the cuts are entered in a “pool” andonly used when it is automatically verified that they are violated.Other constraints which are generalisations of the subtour and combinequalities for the single period STSP, are identified manuallywhen needed. Full computational details of solution process aregiven.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1008608828763
    Library Location Call Number Volume/Issue/Year 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...