Sökning: "Integer Programming"

Visar resultat 6 - 10 av 138 avhandlingar innehållade orden Integer Programming.

  1. 6. Polyhedral and complexity studies in integer optimization, with applications to maintenance planning and location–routing problems

    Författare :Adam Wojciechowski; Göteborgs universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; integer linear programming; complexity theory; polyhedral analysis; stochastic programming; maintenance optimization; Hamiltonian p-median problem; maintenance optimization;

    Sammanfattning : This thesis develops integer linear programming models for and studies the complexity of problems in the areas of maintenance optimization and location–routing. We study how well the polyhedra defined by the linear programming relaxation of themodels approximate the convex hull of the integer feasible solutions. LÄS MER

  3. 7. Integration of Constraint Programming and Integer Programming for Combinatorial Optimization

    Författare :Greger Ottosson; Mats Carlsson; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Computer science; Datalogi; Datalogi; Computing Science;

    Sammanfattning : The last several years have seen an increasing interest in combining the models and methods of optimization with those of constraint programming. Integration of the two was initially impeded by their different cultural origins, one having developed largely in the operations research community and the other in the computer science and artificial intelligence communities. LÄS MER

  4. 8. Function Variables for Constraint Programming

    Författare :Brahim Hnich; Edward Tsang; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Datalogi; Constraint saisfaction; constraint programming; high-level modelling; abstraction; reformulation; function variables.; Datalogi; Computer science; Datalogi; Computer Science; data- och systemvetenskap;

    Sammanfattning : Quite often modelers with constraint programming (CP) use the same modelling patterns for different problems, possibly from different domains. This results in recurring idioms in constraint programs. Our approach can be seen as a three-step approach. First, we identify some of these recurring patterns in constraint programs. LÄS MER

  5. 9. Radiation Therapy Patient Scheduling: An Operations Research Approach

    Författare :Sara Frimodig; Per Enqvist; Jan Kronqvist; Mats Carlsson; Willem-Jan van Hoeve; KTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Radiation therapy scheduling; patient scheduling; multi-appointment scheduling; operations research; integer programming; constraint programming; column generation; Schemaläggning; strålterapi; operationsanalys; heltalsprogrammering; villkorsprogrammering; kolumngenerering; Optimeringslära och systemteori; Optimization and Systems Theory;

    Sammanfattning : The manual scheduling of patients for radiation therapy is difficult and labor-intensive. With the increase in cancer patient numbers, efficient resource planning is an important tool to achieve short waiting times and equal right to care. This thesis studies an operations research approach to the radiation therapy scheduling problem. LÄS MER

  7. 10. Contributions within two topics in integer programming : nurse scheduling and column generation

    Författare :Elina Rönnberg; Torbjörn Larsson; Marco Lübbecke; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : Integer programming can be used to provide solutions to complex decision and planning problems occurring in a wide variety of situations. The application of integer programming to solve real world problems requires a modelling phase in which the problem at hand is translated into a mathematical description of the problem, and a solution phase that aims at developing methods for producing solutions to the mathematical formulation of the problem. LÄS MER