Log in

Relevant bibliographies by topics / Integer programming / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Integer programming.

Dissertations / Theses on the topic 'Integer programming'

Author: Grafiati

Published: 4 June 2021

Last updated: 25 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'Integer programming.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Achterberg, Tobias. "Constraint integer programming /." München : Verl. Dr. Hut, 2008. http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&doc_number=017108806&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Achterberg, Tobias. "Constraint integer programming." München Verl. Dr. Hut, 2007. http://d-nb.info/992163366/04.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Hewitt, Michael R. "Integer programming based search." Diss., Atlanta, Ga. : Georgia Institute of Technology, 2009. http://hdl.handle.net/1853/31641.

Full text

Abstract:

Thesis (Ph.D)--Industrial and Systems Engineering, Georgia Institute of Technology, 2010.<br>Committee Chair: Erera, Martin; Committee Chair: Nemhauser, George; Committee Chair: Savelsbergh, Martin; Committee Member: Ergun, Ozlem; Committee Member: Ferguson, Mark. Part of the SMARTech Electronic Thesis and Dissertation Collection.

APA, Harvard, Vancouver, ISO, and other styles

4

Vigerske, Stefan. "Decomposition in multistage stochastic programming and a constraint integer programming approach to mixed-integer nonlinear programming." Doctoral thesis, Humboldt-Universität zu Berlin, Mathematisch-Naturwissenschaftliche Fakultät II, 2013. http://dx.doi.org/10.18452/16704.

Full text

Abstract:

Diese Arbeit leistet Beiträge zu zwei Gebieten der mathematischen Programmierung: stochastische Optimierung und gemischt-ganzzahlige nichtlineare Optimierung (MINLP). Im ersten Teil erweitern wir quantitative Stetigkeitsresultate für zweistufige stochastische gemischt-ganzzahlige lineare Programme auf Situationen in denen Unsicherheit gleichzeitig in den Kosten und der rechten Seite auftritt, geben eine ausführliche Übersicht zu Dekompositionsverfahren für zwei- und mehrstufige stochastische lineare und gemischt-ganzzahlig lineare Programme, und diskutieren Erweiterungen und Kombinationen d

APA, Harvard, Vancouver, ISO, and other styles

5

Shmonin, Gennady. "Parameterised integer programming, integer cones, and related problems." [S.l.] : [s.n.], 2007. http://deposit.ddb.de/cgi-bin/dokserv?idn=985786132.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Espinoza, Daniel G. "On Linear Programming, Integer Programming and Cutting Planes." Diss., Georgia Institute of Technology, 2006. http://hdl.handle.net/1853/10482.

Full text

Abstract:

In this thesis we address three related topic in the field of Operations Research. Firstly we discuss the problems and limitation of most common solvers for linear programming, precision. We then present a solver that generate rational optimal solutions to linear programming problems by solving a succession of (increasingly more precise) floating point approximations of the original rational problem until the rational optimality conditions are achieved. This method is shown to be (on average) only 20% slower than the common pure floating point approach, while returning true optimal solutions

APA, Harvard, Vancouver, ISO, and other styles

7

Hooker, Kevin J. "Hypergraphs and integer programming polytopes /." Search for this dissertation online, 2005. http://wwwlib.umi.com/cr/ksu/main.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Chandrasekaran, Karthekeyan. "New approaches to integer programming." Diss., Georgia Institute of Technology, 2012. http://hdl.handle.net/1853/44814.

Full text

Abstract:

Integer Programming (IP) is a powerful and widely-used formulation for combinatorial problems. The study of IP over the past several decades has led to fascinating theoretical developments, and has improved our ability to solve discrete optimization problems arising in practice. This thesis makes progress on algorithmic solutions for IP by building on combinatorial, geometric and Linear Programming (LP) approaches. We use a combinatorial approach to give an approximation algorithm for the feedback vertex set problem (FVS) in a recently developed Implicit Hitting Set framework. Our algorithm

APA, Harvard, Vancouver, ISO, and other styles

9

Mefo, Kue Floriane. "Mixed integer bilevel programming problems." Doctoral thesis, Technische Universitaet Bergakademie Freiberg Universitaetsbibliothek "Georgius Agricola", 2017. http://nbn-resolving.de/urn:nbn:de:bsz:105-qucosa-230335.

Full text

Abstract:

This thesis presents the mixed integer bilevel programming problems where some optimality conditions and solution algorithms are derived. Bilevel programming problems are optimization problems which are partly constrained by another optimization problem. The theoretical part of this dissertation is mainly based on the investigation of optimality conditions of mixed integer bilevel program. Taking into account both approaches (optimistic and pessimistic) which have been developed in the literature to deal with this type of problem, we derive some conditions for the existence of solutions. Afte

APA, Harvard, Vancouver, ISO, and other styles

10

Evans, G. M. "Parallel and distributed integer programming." Thesis, University of East Anglia, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.267706.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Connard, Peter. "Mixed Integer Programming on transputers." Thesis, University of Warwick, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.359933.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

De, Vries Tonny Tessa. "Irrigation scheduling with integer programming." Thesis, University of Southampton, 2003. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.273891.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Ginn, Isabella Brooke. "Integer Programming With Groebner Basis." VCU Scholars Compass, 2007. http://scholarscompass.vcu.edu/etd/769.

Full text

Abstract:

Integer Programming problems are difficult to solve. The goal is to find an optimal solution that minimizes cost. With the help of Groebner based algorithms the optimal solution can be found if it exists. The application of the Groebner based algorithm and how it works is the topic of research. The Algorithms are The Conti-Traverso Algorithm and the Original Conti-Traverso Algorithm. Examples are given as well as proofs that correspond to the algorithms. The latter algorithm is more efficient as well as user friendly. The algorithms are not necessarily the best way to solve and integer

APA, Harvard, Vancouver, ISO, and other styles

14

Patel, Harsida. "Diet planning by goal programming and integer goal programming." Thesis, University of Portsmouth, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.286085.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Vielma, Centeno Juan Pablo. "Mixed integer programming approaches for nonlinear and stochastic programming." Diss., Atlanta, Ga. : Georgia Institute of Technology, 2009. http://hdl.handle.net/1853/29624.

Full text

Abstract:

Thesis (Ph.D)--Industrial and Systems Engineering, Georgia Institute of Technology, 2010.<br>Committee Chair: Nemhauser, George; Committee Co-Chair: Ahmed, Shabbir; Committee Member: Bill Cook; Committee Member: Gu, Zonghao; Committee Member: Johnson, Ellis. Part of the SMARTech Electronic Thesis and Dissertation Collection.

APA, Harvard, Vancouver, ISO, and other styles

16

McAdoo, Michael John. "Three set inequalities in integer programming." Thesis, Manhattan, Kan. : Kansas State University, 2007. http://hdl.handle.net/2097/476.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Li, Yaxian. "Lower bounds for integer programming problems." Diss., Georgia Institute of Technology, 2013. http://hdl.handle.net/1853/48959.

Full text

Abstract:

Solving real world problems with mixed integer programming (MIP) involves efforts in modeling and efficient algorithms. To solve a minimization MIP problem, a lower bound is needed in a branch-and-bound algorithm to evaluate the quality of a feasible solution and to improve the efficiency of the algorithm. This thesis develops a new MIP model and studies algorithms for obtaining lower bounds for MIP. The first part of the thesis is dedicated to a new production planning model with pricing decisions. To increase profit, a company can use pricing to influence its demand to increase revenue, decr

APA, Harvard, Vancouver, ISO, and other styles

18

Tjandraatmadja, Christian. "Decision Diagram Relaxations for Integer Programming." Research Showcase @ CMU, 2018. http://repository.cmu.edu/dissertations/1194.

Full text

Abstract:

Mixed-integer programming (MIP) is often a practitioner’s primary approach when tackling hard discrete optimization problems. This important role was enabled by decades of theory and practical experience poured into modern MIP solvers. However, many problems are still challenging for MIP solvers, which motivates the need for novel perspectives to enhance MIP technology. In this dissertation, we explore the use of relaxed decision diagrams to improve MIP solvers. Relaxed decision diagrams are graph structures that encode relaxations of discrete optimization problems. One of their many uses in o

APA, Harvard, Vancouver, ISO, and other styles

19

Zanette, Arrigo. "Three Topics in Mixed Integer Programming." Doctoral thesis, Università degli studi di Padova, 2009. http://hdl.handle.net/11577/3425623.

Full text

Abstract:

In chapter entitled "Lexicography and degeneracy: Can a pure cutting plane algorithm work?", we discuss an implementation of the lexicographic version of Gomory's fractional cutting plane method for Integer Linear Programming (ILP) problems and of two heuristics mimicking the latter. In computational testing on a battery of MIPLIB problems we compare the performance of these variants with that of the standard Gomory algorithm, both in the single-cut and in the multi-cut (rounds of cuts) version, and show that they provide a radical improvement over the standard procedure. In particular, we rep

APA, Harvard, Vancouver, ISO, and other styles

20

Andreotti, Sandro [Verfasser]. "Linear Programming and Integer Linear Programming in Bioinformatics / Sandro Andreotti." Berlin : Freie Universität Berlin, 2015. http://d-nb.info/1066645213/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Wang, Guanglei. "Relaxations in mixed-integer quadratically constrained programming and robust programming." Thesis, Evry, Institut national des télécommunications, 2016. http://www.theses.fr/2016TELE0026/document.

Full text

Abstract:

De nombreux problèmes de la vie réelle sont exprimés sous la forme de décisions à prendre à l’aide de l’information accessible dans le but d’atteindre certains objectifs. La programmation numérique a prouvé être un outil efficace pour modéliser et résoudre une grande variété de problèmes de ce type. Cependant, de nombreux problèmes en apparence faciles sont encore durs à résoudre. Et même des problèmes faciles de programmation linéaire deviennent durs avec l’incertitude de l’information disponible. Motivés par un problème de télécommunication où l’on doit associer des machines virtuelles à des

APA, Harvard, Vancouver, ISO, and other styles

22

Wang, Guanglei. "Relaxations in mixed-integer quadratically constrained programming and robust programming." Electronic Thesis or Diss., Evry, Institut national des télécommunications, 2016. http://www.theses.fr/2016TELE0026.

Full text

Abstract:

De nombreux problèmes de la vie réelle sont exprimés sous la forme de décisions à prendre à l’aide de l’information accessible dans le but d’atteindre certains objectifs. La programmation numérique a prouvé être un outil efficace pour modéliser et résoudre une grande variété de problèmes de ce type. Cependant, de nombreux problèmes en apparence faciles sont encore durs à résoudre. Et même des problèmes faciles de programmation linéaire deviennent durs avec l’incertitude de l’information disponible. Motivés par un problème de télécommunication où l’on doit associer des machines virtuelles à des

APA, Harvard, Vancouver, ISO, and other styles

23

Mirrazavi, Seyed Keyvan. "Investigation and development of efficient integer and integer goal programming systems." Thesis, University of Portsmouth, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.299475.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Detar, Paul J. "Scheduling Marine Corps entry-level MOS schools." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2004. http://library.nps.navy.mil/uhtbin/hyperion/04Sept%5FDetar.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Easton, Kelly King. "Using integer programming and constraint programming to solve sports scheduling problems." Diss., Georgia Institute of Technology, 2002. http://hdl.handle.net/1853/25795.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Strauss, Aaron B. 1980. "Applying integer programming techniques to find minimum integer weights of voting games." Thesis, Massachusetts Institute of Technology, 2003. http://hdl.handle.net/1721.1/18019.

Full text

Abstract:

Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2003.<br>Includes bibliographical references (p. 73-76).<br>Using concepts from computer science and mathematics I develop three algorithms to find the minimum integer weights for voting games. Games with up to at least 17 players can be solved in a reasonable amount of time. First, coalitions are mapped to constraints, reducing the problem to constraint optimization. The optimization techniques used are Gomory's all-integer simplex algorithm and a variant of the popular integer progr

APA, Harvard, Vancouver, ISO, and other styles

27

Kästner, Daniel. "Retargetable postpass optimisation by integer linear programming." [S.l.] : [s.n.], 2000. http://deposit.ddb.de/cgi-bin/dokserv?idn=972330917.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Chen, Kenneth. "Topics in group methods for integer programming." Diss., Georgia Institute of Technology, 2011. http://hdl.handle.net/1853/41133.

Full text

Abstract:

In 2003, Gomory and Johnson gave two different three-slope T-space facet constructions, both of which shared a slope with the corresponding Gomory mixed-integer cut. We give a new three-slope facet which is independent of the GMIC and also give a four-slope T-space facet construction, which to our knowledge, is the first four-slope construction. We describe an enumerative framework for the discovery of T-space facets. Using an algorithm by Harvey for computing integer hulls in the plane, we give a heuristic for quickly computing lattice-free triangles. Given two rows of the tableau, we der

APA, Harvard, Vancouver, ISO, and other styles

29

Ulusal, Elif. "Integer programming models for the branchwidth problem." Diss., Texas A&M University, 2008. http://hdl.handle.net/1969.1/85936.

Full text

Abstract:

We consider the problem of computing the branchwidth and an optimal branch decomposition of a graph. Branch decompositions and branchwidth were introduced in 1991 by Robertson and Seymour and were used in the proof of Graph Minors Theorem (GMT), a well known conjecture (Wagner's conjecture) in graph theory. The notions of branchwidth and branch decompositions have been proved to be useful for solving many NP-hard problems that have applications in fields such as graph theory, network design, sensor networks and biology. Branch decompositions have been utilized for problems such as the travelin

APA, Harvard, Vancouver, ISO, and other styles

30

Stoutchinin, Artour V. "Optimal software pipelining, integer linear programming approach." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk2/tape16/PQDD_0002/MQ29793.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Bogart, Tristram. "Problems in computational algebra and integer programming /." Thesis, Connect to this title online; UW restricted, 2007. http://hdl.handle.net/1773/5805.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Axehill, Daniel. "Integer quadratic programming for control and communcation /." Linköping : Department of Electrical Engineering, Linköping University, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-10642.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Stoutchinin, Artour V. "Optimal software pipelining : integer linear programming approach." Thesis, McGill University, 1996. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=27418.

Full text

Abstract:

In optimizing the code for high-performance processors, software pipelining of innermost loops is of fundamental importance. In order to benefit from software pipelining, it is essential to: (i) find the rate-optimal legal schedule, and (ii) allocate registers to the found schedule (it must fit into the limited number of available machine registers). This thesis deals with the development of a software pipeliner that produces the best possible schedules in terms of required registers, thus, assisting register allocation.<br>Software pipelining and register allocation can be formulated as an in

APA, Harvard, Vancouver, ISO, and other styles

34

AMORIM, RAFAEL FREITAS DE. "INTEGER PROGRAMMING PROBLEMS ON TELECOMMUNICATIONS OPTICAL NETWORKS." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2006. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=8796@1.

Full text

Abstract:

COORDENAÇÃO DE APERFEIÇOAMENTO DO PESSOAL DE ENSINO SUPERIOR<br>Impulsionadas pelo crescimento do mercado corporativo e pela prestação de serviços para grandes clientes, as operadoras de serviços de telecomunicação estão buscando processos automatizados e redução de custo no desenvolvimento de novos projetos de redes de telecomunicações. Nesse cenário, dois modelos de Programação Inteira são apresentados buscando uma minimização de custos. O primeiro para o problema de planejamento de novas redes. E segundo para o problema de configuração de trails nas redes SDH. Uma introdução sobre me

APA, Harvard, Vancouver, ISO, and other styles

35

Richards, Arthur George 1977. "Trajectory optimization using mixed-integer linear programming." Thesis, Massachusetts Institute of Technology, 2002. http://hdl.handle.net/1721.1/16873.

Full text

Abstract:

Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Aeronautics and Astronautics, 2002.<br>Includes bibliographical references (p. 121-129).<br>This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.<br>This thesis presents methods for finding optimal trajectories for vehicles subjected to avoidance and assignment requirements. The former include avoidance of collisions with obstacles or other vehicles and avoidance of thruster plumes from spacecraft. Assignment refers to the inclusion of deci

APA, Harvard, Vancouver, ISO, and other styles

36

Axehill, Daniel. "Integer Quadratic Programming for Control and Communication." Doctoral thesis, Linköpings universitet, Reglerteknik, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-10642.

Full text

Abstract:

The main topic of this thesis is integer quadratic programming with applications to problems arising in the areas of automatic control and communication. One of the most widespread modern control methods is Model Predictive Control (MPC). In each sampling time, MPC requires the solution of a Quadratic Programming (QP) problem. To be able to use MPC for large systems, and at high sampling rates, optimization routines tailored for MPC are used. In recent years, the range of application of MPC has been extended to so-called hybrid systems. Hybrid systems are systems where continuous dynamics inte

APA, Harvard, Vancouver, ISO, and other styles

37

Council, Steven Michael. "A 'satisfiability' based approach to integer programming." Thesis, University of Southampton, 1999. https://eprints.soton.ac.uk/50600/.

Full text

Abstract:

The purpose of this work is the development of a collection of satisfiability based algorithms that can be used to solve particular instances of integer programming problems. Satisfiability based algorithms have recently obtained a strong standing within the industrial community and, although for all but a few special cases the problem is NP-complete, research has shown that other problems in this class can often be transformed into a corresponding satisfiability problem and solved more effectively using the best SAT-solvers. One of the most important uses of satisfiability based algorithms is

APA, Harvard, Vancouver, ISO, and other styles

38

Liu, Xiao. "Integer Programming Approaches to Risk-Averse Optimization." The Ohio State University, 2016. http://rave.ohiolink.edu/etdc/view?acc_num=osu1480461192784862.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Planes, Francisco J. "Metabolic pathway analysis via integer linear programming." Thesis, Brunel University, 2008. http://bura.brunel.ac.uk/handle/2438/6134.

Full text

Abstract:

The understanding of cellular metabolism has been an intriguing challenge in classical cellular biology for decades. Essentially, cellular metabolism can be viewed as a complex system of enzyme-catalysed biochemical reactions that produces the energy and material necessary for the maintenance of life. In modern biochemistry, it is well-known that these reactions group into metabolic pathways so as to accomplish a particular function in the cell. The identification of these metabolic pathways is a key step to fully understanding the metabolic capabilities of a given organism. Typically, metabol

APA, Harvard, Vancouver, ISO, and other styles

40

Tural, Mustafa Kemal Lu Shu. "Topics in basis reduction and integer programming." Chapel Hill, N.C. : University of North Carolina at Chapel Hill, 2009. http://dc.lib.unc.edu/u?/etd,2521.

Full text

Abstract:

Thesis (Ph. D.)--University of North Carolina at Chapel Hill, 2009.<br>Title from electronic title page (viewed Oct. 5, 2009). "... in partial fulfillment of the requirements for the degree of Doctor of Philosophy in the Department of Statistics and Operations Research." Discipline: Statistics and Operations Research; Department/School: Statistics and Operations Research.

APA, Harvard, Vancouver, ISO, and other styles

41

D'Ambrosio, Claudia <1980&gt. "Application-oriented Mixed Integer Non-Linear Programming." Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2009. http://amsdottorato.unibo.it/1634/1/DAmbrosio_Claudia_tesi.pdf.

Full text

Abstract:

In the most recent years there is a renovate interest for Mixed Integer Non-Linear Programming (MINLP) problems. This can be explained for different reasons: (i) the performance of solvers handling non-linear constraints was largely improved; (ii) the awareness that most of the applications from the real-world can be modeled as an MINLP problem; (iii) the challenging nature of this very general class of problems. It is well-known that MINLP problems are NP-hard because they are the generalization of MILP problems, which are NP-hard themselves. However, MINLPs are, in general, also hard to sol

APA, Harvard, Vancouver, ISO, and other styles

42

D'Ambrosio, Claudia <1980&gt. "Application-oriented Mixed Integer Non-Linear Programming." Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2009. http://amsdottorato.unibo.it/1634/.

Full text

Abstract:

In the most recent years there is a renovate interest for Mixed Integer Non-Linear Programming (MINLP) problems. This can be explained for different reasons: (i) the performance of solvers handling non-linear constraints was largely improved; (ii) the awareness that most of the applications from the real-world can be modeled as an MINLP problem; (iii) the challenging nature of this very general class of problems. It is well-known that MINLP problems are NP-hard because they are the generalization of MILP problems, which are NP-hard themselves. However, MINLPs are, in general, also hard to sol

APA, Harvard, Vancouver, ISO, and other styles

43

Angulo, Olivares Gustavo I. "Integer programming approaches for semicontinuous and stochastic optimization." Diss., Georgia Institute of Technology, 2014. http://hdl.handle.net/1853/51862.

Full text

Abstract:

This thesis concerns the application of mixed-integer programming techniques to solve special classes of network flow problems and stochastic integer programs. We draw tools from complexity and polyhedral theory to analyze these problems and propose improved solution methods. In the first part, we consider semi-continuous network flow problems, that is, a class of network flow problems where some of the variables are required to take values above a prespecified minimum threshold whenever they are not zero. These problems find applications in management and supply chain models where orders in s

APA, Harvard, Vancouver, ISO, and other styles

44

Rönnberg, Elina. "Methods and Applications in Integer Programming : All-Integer Column Generation and Nurse Scheduling." Licentiate thesis, Linköping University, Linköping University, Optimization, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-15143.

Full text

Abstract:

<p>Integer programming can be used to provide solutionsto complex decision and planning problems occurring in a wide varietyof situations. Applying integer programming to a real life problembasically involves a first phase where a mathematical model isconstructed, and a second phase where the problem described by themodel is solved. While the nature of the challenges involved in therespective two phases differ, the strong relationship between theproperties of models, and which methods that are appropriate for theirsolution, links the two phases. This thesis constitutes of threepapers, of which

APA, Harvard, Vancouver, ISO, and other styles

45

Wiese, Sven <1985&gt. "On the interplay of Mixed Integer Linear, Mixed Integer Nonlinear and Constraint Programming." Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2016. http://amsdottorato.unibo.it/7612/1/wiese_sven_tesi.pdf.

Full text

Abstract:

In this thesis we study selected topics in the field of Mixed Integer Programming (MIP), in particular Mixed Integer Linear and Nonlinear Programming (MI(N)LP). We set a focus on the influences of Constraint Programming (CP). First, we analyze Mathematical Programming approaches to water network optimization, a set of challenging optimization problems frequently modeled as non-convex MINLPs. We give detailed descriptions of many variants and survey solution approaches from the literature. We are particularly interested in MILP approximations and present a respective computational study for

APA, Harvard, Vancouver, ISO, and other styles

46

Wiese, Sven <1985&gt. "On the interplay of Mixed Integer Linear, Mixed Integer Nonlinear and Constraint Programming." Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2016. http://amsdottorato.unibo.it/7612/.

Full text

Abstract:

In this thesis we study selected topics in the field of Mixed Integer Programming (MIP), in particular Mixed Integer Linear and Nonlinear Programming (MI(N)LP). We set a focus on the influences of Constraint Programming (CP). First, we analyze Mathematical Programming approaches to water network optimization, a set of challenging optimization problems frequently modeled as non-convex MINLPs. We give detailed descriptions of many variants and survey solution approaches from the literature. We are particularly interested in MILP approximations and present a respective computational study for

APA, Harvard, Vancouver, ISO, and other styles

47

Goycoolea, Marcos G. "Cutting Planes for Large Mixed Integer Programming Models." Diss., Georgia Institute of Technology, 2006. http://hdl.handle.net/1853/13956.

Full text

Abstract:

In this thesis I focus on cutting planes for large Mixed Integer Programming (MIP) problems. More specifically, I focus on two independent cutting planes studies. The first of these deals with cutting planes for the Traveling Salesman Problem (TSP), and the second with cutting planes for general MIPs. In the first study I introduce a new class of cutting planes which I call the Generalized Domino Parity (GDP) inequalities. My main achievements with regard to these are: (1) I show that these are valid for the TSP and for the graphical TSP. (2) I show that they generalize most well-known TSP in

APA, Harvard, Vancouver, ISO, and other styles

48

Vigerske, Stefan [Verfasser], Werner [Akademischer Betreuer] Römisch, Rüdiger [Akademischer Betreuer] Schultz, and Pierre [Akademischer Betreuer] Bonami. "Decomposition in multistage stochastic programming and a constraint integer programming approach to mixed-integer nonlinear programming / Stefan Vigerske. Gutachter: Werner Römisch ; Rüdiger Schultz ; Pierre Bonami." Berlin : Humboldt Universität zu Berlin, Mathematisch-Naturwissenschaftliche Fakultät II, 2013. http://d-nb.info/1033586579/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Engineer, Faramroze Godrej. "Advances in shortest path based column generation for integer programming." Diss., Georgia Institute of Technology, 2009. http://hdl.handle.net/1853/34761.

Full text

Abstract:

Branch-price-and-cut algorithms are among the most successful exact optimization approaches for solving many routing and scheduling problems. This is due, in part, to the availability of extremely efficient and effective dynamic programming algorithms for solving the pricing problem, and the availability of efficient and effective branching schemes and cutting planes that drive integrality. In terms of branch-price-and-cut, two obstacles we face today are (1) being able to solve harder and larger pricing problems, and (2) solving mixed-integer column generation formulations that suffer from re

APA, Harvard, Vancouver, ISO, and other styles

50

朱紫君 and Chi-kwan Chu. "Polynomial time algorithms for linear and integer programming." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2000. http://hub.hku.hk/bib/B31224301.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!