Relevant bibliographies by topics / Operation on integers / Dissertations / Theses
To see the other types of publications on this topic, follow the link: Operation on integers.

Dissertations / Theses on the topic 'Operation on integers'

Author: Grafiati
Published: 2 June 2025
Last updated: 31 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 'Operation on integers.'

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

Muir, James. "Efficient Integer Representations for Cryptographic Operations." Thesis, University of Waterloo, 2004. http://hdl.handle.net/10012/1099.

Full text
Abstract:
Every positive integer has a unique radix 2 representation which uses the digits {0,1}. However, if we allow digits other than 0 and 1, say {0,1,-1}, then a positive integer has many representations. Of these <i>redundant</i> representations, it is possible to choose one that has few nonzero digits. It is well known that using representations of integers with few nonzero digits allows certain algebraic operations to be done more quickly. This thesis is concerned with various representations of integers that are related to efficient implementations of algebraic operations in crypto
APA, Harvard, Vancouver, ISO, and other styles
2

Shioda, Romy 1977. "Integer optimization in data mining." Thesis, Massachusetts Institute of Technology, 2003. http://hdl.handle.net/1721.1/17579.

Full text
Abstract:
Thesis (Ph. D.)--Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center, 2003.<br>Includes bibliographical references (p. 103-107).<br>While continuous optimization methods have been widely used in statistics and data mining over the last thirty years, integer optimization has had very limited impact in statistical computation. Thus, our objective is to develop a methodology utilizing state of the art integer optimization methods to exploit the discrete character of data mining problems. The thesis consists of two parts: The first part illustrates a mixed
APA, Harvard, Vancouver, ISO, and other styles
3

Chang, Allison An. "Integer optimization methods for machine learning." Thesis, Massachusetts Institute of Technology, 2012. http://hdl.handle.net/1721.1/72643.

Full text
Abstract:
Thesis (Ph. D.)--Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center, 2012.<br>This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.<br>Cataloged from student-submitted PDF version of thesis.<br>Includes bibliographical references (p. 129-137).<br>In this thesis, we propose new mixed integer optimization (MIO) methods to ad- dress problems in machine learning. The first part develops methods for supervised bipartite ranking, which arises in prioritization tasks
APA, Harvard, Vancouver, ISO, and other styles
4

Saunders, Zachary Clayton. "Multi-target tracking via mixed integer optimization." Thesis, Massachusetts Institute of Technology, 2016. http://hdl.handle.net/1721.1/104998.

Full text
Abstract:
Thesis: S.M., Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center, 2016.<br>This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.<br>Cataloged from student-submitted PDF version of thesis.<br>Includes bibliographical references (pages 85-87).<br>Given a set of target detections over several time periods, this paper addresses the multi-target tracking problem (MTT) of optimally assigning detections to targets and estimating the trajectory of the targets over tim
APA, Harvard, Vancouver, ISO, and other styles
5

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
6

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
7

Sheldon, Jeffrey W. (Jeffrey William) 1978. "Strength reduction of integer division and modulo operations." Thesis, Massachusetts Institute of Technology, 2001. http://hdl.handle.net/1721.1/86849.

Full text
Abstract:
Thesis (M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2001.<br>Includes bibliographical references (leaves 53-54).<br>by Jeffrey W. Sheldon.<br>M.Eng.
APA, Harvard, Vancouver, ISO, and other styles
8

Gade, Dinakar. "Algorithms and Reformulations for Large-Scale Integer and Stochastic Integer Programs." The Ohio State University, 2012. http://rave.ohiolink.edu/etdc/view?acc_num=osu1343182054.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Huchette, Joseph Andrew. "Advanced mixed-integer programming formulations : methodology, computation, and application." Thesis, Massachusetts Institute of Technology, 2018. http://hdl.handle.net/1721.1/119282.

Full text
Abstract:
Thesis: Ph. D., Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center, 2018.<br>This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.<br>Cataloged from student-submitted PDF version of thesis.<br>Includes bibliographical references (pages 193-203).<br>This thesis introduces systematic ways to use mixed-integer programming (MIP) to solve difficult nonconvex optimization problems arising in application areas as varied as operations, robotics, power systems, and mac
APA, Harvard, Vancouver, ISO, and other styles
10

Ozkan, Recep. "Evaluation of logistics operation command and control capability : optimization revisited /." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2005. http://library.nps.navy.mil/uhtbin/hyperion/05Jun%5FOzkan.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
11

Hildebrand, Robert David. "Algorithms and Cutting Planes for Mixed Integer Programs." Thesis, University of California, Davis, 2013. http://pqdtopen.proquest.com/#viewpdf?dispub=3596887.

Full text
Abstract:
<p> This dissertation is devoted to solving general mixed integer optimization problems. Our main focus is understanding and developing strong cutting planes for mixed integer linear programs through Gomory and Johnson's <i> k</i>-dimensional infinite group relaxation. Each cut generated from this problem has an associated function, and among the strongest are extreme functions. For <i>k</i>=1 , we give an algorithm for testing the extremality of piecewise linear (possibly discontinuous) functions with rational breakpoints. This is the first set of necessary and sufficient conditions that c
APA, Harvard, Vancouver, ISO, and other styles
12

Lubin, Miles (Miles C. ). "Mixed-integer convex optimization : outer approximation algorithms and modeling power." Thesis, Massachusetts Institute of Technology, 2017. http://hdl.handle.net/1721.1/113434.

Full text
Abstract:
Thesis: Ph. D., Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center, 2017.<br>This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.<br>Cataloged from student-submitted PDF version of thesis.<br>Includes bibliographical references (pages 137-143).<br>In this thesis, we study mixed-integer convex optimization, or mixed-integer convex programming (MICP), the class of optimization problems where one seeks to minimize a convex objective function subject to convex co
APA, Harvard, Vancouver, ISO, and other styles
13

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
14

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
15

Saleck, Pay Babak. "Decomposition Algorithms in Stochastic Integer Programming: Applications and Computations." VCU Scholars Compass, 2017. http://scholarscompass.vcu.edu/etd/5027.

Full text
Abstract:
In this dissertation we focus on two main topics. Under the first topic, we develop a new framework for stochastic network interdiction problem to address ambiguity in the defender risk preferences. The second topic is dedicated to computational studies of two-stage stochastic integer programs. More specifically, we consider two cases. First, we develop some solution methods for two-stage stochastic integer programs with continuous recourse; second, we study some computational strategies for two-stage stochastic integer programs with integer recourse. We study a class of stochastic network
APA, Harvard, Vancouver, ISO, and other styles
16

Tziligakis, Constantine Nikolaos. "Relaxation and exact algorithms for solving mixed integer-quadratic optimization problems." Thesis, Massachusetts Institute of Technology, 1999. http://hdl.handle.net/1721.1/9375.

Full text
Abstract:
Thesis (S.M.)--Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center, 1999.<br>Includes bibliographical references (leaves 107-111).<br>We develop various algorithms for solving mixed integer-quadratic problems. These problems exhibit exponential complexity resulting from the presence of integer variables. Traditional approaches that apply in pure integer programming are not very helpful, since the existence of continuous variables in our problems complicates their use. Vie develop relaxation and heuristic algorithms designed so as to provide tight lower
APA, Harvard, Vancouver, ISO, and other styles
17

Furini, Fabio <1982&gt. "Decomposition and reformulation of integer linear programming problems." Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2011. http://amsdottorato.unibo.it/3593/.

Full text
Abstract:
This thesis deals with an investigation of Decomposition and Reformulation to solve Integer Linear Programming Problems. This method is often a very successful approach computationally, producing high-quality solutions for well-structured combinatorial optimization problems like vehicle routing, cutting stock, p-median and generalized assignment . However, until now the method has always been tailored to the specific problem under investigation. The principal innovation of this thesis is to develop a new framework able to apply this concept to a generic MIP problem. The new approach is t
APA, Harvard, Vancouver, ISO, and other styles
18

Tramontani, Andrea <1978&gt. "Enhanced Mixed Integer Programming Techniques and Routing Problems." Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2009. http://amsdottorato.unibo.it/1754/1/tramontani_andrea_tesi.pdf.

Full text
Abstract:
Mixed integer programming is up today one of the most widely used techniques for dealing with hard optimization problems. On the one side, many practical optimization problems arising from real-world applications (such as, e.g., scheduling, project planning, transportation, telecommunications, economics and finance, timetabling, etc) can be easily and effectively formulated as Mixed Integer linear Programs (MIPs). On the other hand, 50 and more years of intensive research has dramatically improved on the capability of the current generation of MIP solvers to tackle hard problems in practice.
APA, Harvard, Vancouver, ISO, and other styles
19

Tramontani, Andrea <1978&gt. "Enhanced Mixed Integer Programming Techniques and Routing Problems." Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2009. http://amsdottorato.unibo.it/1754/.

Full text
Abstract:
Mixed integer programming is up today one of the most widely used techniques for dealing with hard optimization problems. On the one side, many practical optimization problems arising from real-world applications (such as, e.g., scheduling, project planning, transportation, telecommunications, economics and finance, timetabling, etc) can be easily and effectively formulated as Mixed Integer linear Programs (MIPs). On the other hand, 50 and more years of intensive research has dramatically improved on the capability of the current generation of MIP solvers to tackle hard problems in practice.
APA, Harvard, Vancouver, ISO, and other styles
20

Neto, Francisco Tavares da Rocha. "Difficulties in learning operative integer numbers in elementary school." Universidade Federal do CearÃ, 2010. http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=5569.

Full text
Abstract:
The present works aimed to identify the causes that make students to have difficulties in the study of integer numbers, verifying accurately the up to what level they manage property that number system, as well to seize the most popular mistakes made by students. In the first part, we offer theoretical bases supported by opinions of authors about the subject. Included in the first part is also a brief history about the evolution of the integer number system, in particular who it appeared, when it started being used, who mathematicians organized the integer numbers system, the origin of the sym
APA, Harvard, Vancouver, ISO, and other styles
21

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
22

Bukenberger, Jesse Paul. "A Set Union Based Formulation for Course Scheduling and Timetabling." DigitalCommons@CalPoly, 2014. https://digitalcommons.calpoly.edu/theses/1250.

Full text
Abstract:
The Course Timetabling Problem is a widely studied optimization problem where a number of sections are scheduled in concert with the assignment of students to sections in order to maximize the desirability of the resulting schedule for all stakeholders. This problem is commonly solved as a linear program with variables for each student or group of students with identical schedules. In this paper we explore an alternative formulation that aggregates binary student variables into integer variables denoting the number of students enrolled in a course. Our solution method assumes decomposition of
APA, Harvard, Vancouver, ISO, and other styles
23

Kasimoglu, Fatih. "An integer Linear Program to schedule an Army installation's maneuver training /." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2004. http://library.nps.navy.mil/uhtbin/hyperion/04Jun%5FKasimoglu.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
24

Permana, Adhi D. "Optimal Design and Operation of A Hybrid Gas/Electric Chilled Water Plant." Thesis, Virginia Tech, 1999. http://hdl.handle.net/10919/43970.

Full text
Abstract:
The design of a chilled water plant involves selecting the size and type of chillers to be employed and determining the operating strategy. The types may include both gas engine and electric motor driven chillers. The issues that have to be considered in the selection problem are to incorporate external and internal factors into the decision making. External factors may include the utility rate schedules, the cooling load profile, and the outdoor temperature profile. Internal factors may include the chiller performance characteristics, initial and maintenance costs, and the chiller(s) operatin
APA, Harvard, Vancouver, ISO, and other styles
25

DÍAZ, CÉSAR DAVID LÓPEZ. "OPERATING ROOM SCHEDULING TO ELECTIVE PATIENTS, AN INTEGER PROGRAMMING MODEL." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2015. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=25684@1.

Full text
Abstract:
PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO<br>COORDENAÇÃO DE APERFEIÇOAMENTO DO PESSOAL DE ENSINO SUPERIOR<br>PROGRAMA DE SUPORTE À PÓS-GRADUAÇÃO DE INSTS. DE ENSINO<br>As despesas anuais em saúde para a maioria dos países são crescentes. Segundo a Organização Mundial de Saúde (OMS), em 2011 o Brasil gastou aproximadamente 10 porcento do produto interno bruto em saúde. Consequentemente, incrementar a eficiência na prestação de serviços médicos está se tornando cada vez mais importante. Em um hospital as salas de cirurgia representam um dos principais centros de custos e de rendimentos.
APA, Harvard, Vancouver, ISO, and other styles
26

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
27

Petersen, Jon D. "Large-scale mixed integer optimization approaches for scheduling airline operations under irregularity." Diss., Georgia Institute of Technology, 2012. http://hdl.handle.net/1853/43662.

Full text
Abstract:
Perhaps no single industry has benefited more from advancements in computation, analytics, and optimization than the airline industry. Operations Research (OR) is now ubiquitous in the way airlines develop their schedules, price their itineraries, manage their fleet, route their aircraft, and schedule their crew. These problems, among others, are well-known to industry practitioners and academics alike and arise within the context of the planning environment which takes place well in advance of the date of departure. One salient feature of the planning environment is that decisions are made in
APA, Harvard, Vancouver, ISO, and other styles
28

Scott, Joseph D. "Optimally scheduling basic courses at the Defense Language Institute using integer programming." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2005. http://handle.dtic.mil/100.2/ADA447035.

Full text
Abstract:
Thesis (M.S. in Operations Research)--Naval Postgraduate School, Sept. 2005.<br>Thesis Advisor(s): Robert F. Dell. "September 2005." Includes bibliographical references (p. 37-38). Also available in print.
APA, Harvard, Vancouver, ISO, and other styles
29

Huang, Wei. "Optimal Operation of Water Supply Networks by Mixed Integer Nonlinear Programming and Algebraic Methods." Phd thesis, tuprints, 2019. http://tuprints.ulb.tu-darmstadt.de/8657/1/Dissertation_Wei_Huang.pdf.

Full text
Abstract:
In this thesis we are dealing with the operative planning of water supply networks. The task of an operative planning is to create a pump and valve configuration such that the water requirement from consumers is fulfilled with necessary quality. An optimal operation corresponds to a configuration that minimizes the operation cost as well as potential water procurement cost. There are different ways to handle this problem. We solve it as an optimization problem using mathematical programming. On the one hand, the network problem contains some discrete variables, for example, the pump or valv
APA, Harvard, Vancouver, ISO, and other styles
30

Andersen, Morten. "Operation Iraqi Freedom : en samordnet og integrert kampanjeplan, eller et påtvunget fellesskap?" Thesis, Försvarshögskolan, 2005. http://urn.kb.se/resolve?urn=urn:nbn:se:fhs:diva-1552.

Full text
Abstract:
I den vestlige verden er en doktrine i sin enkleste form en samling av fastsatte læresetninger ellerretningslinjer for militærmaktens virksomhet som i prinsippet dekker alle krigføringsnivåer. Kortsammenfattet beskriver den grunnlaget for virksomheten, gir normative retningslinjer for hvordanvirksomheten bør utføres, og beskriver hvilke funksjoner og kapasiteter som må besittes ogbeherskes for å møte doktrinens krav. For at doktrinene skal oppfattes som funksjonelle ogtroverdige er det viktig at innholdet i de ulike nivåenes doktriner samsvarer, og at det er samsvarmellom det skrevne ord og de
APA, Harvard, Vancouver, ISO, and other styles
31

Salvagnin, Domenico. "Constraint Programming Techniques for Mixed Integer Linear Programs." Doctoral thesis, Università degli studi di Padova, 2009. http://hdl.handle.net/11577/3425690.

Full text
Abstract:
Many decision problems in industry, logistics, and telecommunications can be viewed as satisfiability or optimization problems. Two paradigms have reached a high degree of sophistication from the point of view of both theory and implementation: Constraint Programming (CP) and Mixed Integer Programming (MIP). The CP and MIP paradigms have strengths and weaknesses that complement each other. On the one hand, CP, through the use of sophisticated propagation techniques, privileges primal inference. On the other hand, MIP, through the techniques of relaxation and strengthening through cutting plane
APA, Harvard, Vancouver, ISO, and other styles
32

Orrsveden, Magnus, and Emil Tarukoski. "Optimization of Collateral allocation for Securities Lending : An Integer Linear Programming Approach." Thesis, KTH, Optimeringslära och systemteori, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-252554.

Full text
Abstract:
Collateral management has, during the most recent years, been an increasingly important part of a bank’s operation. The bank is facing an allocation problem of how to post collateral to all its counterparties in order to mitigate the credit risk and the number of transactions that requires collateralization is increasing. This master thesis has investigated if it is possible to effectively solve this allocation problem and hence reduce the cost of collateral management by using numerical optimization. Four mathematical linear optimization models of different structure and characteristics have
APA, Harvard, Vancouver, ISO, and other styles
33

Sahin, Deniz. "Mixed Integer Linear Programming for Time-Optimal Cyclic Scheduling of High Throughput Screening Systems." Thesis, Southern Illinois University at Edwardsville, 2018. http://pqdtopen.proquest.com/#viewpdf?dispub=10808099.

Full text
Abstract:
<p> High Throughput Screening (HTS) systems are highly technological and fully automated plants which are used for the analysis of thousands of biochemical substances to provide basis for the drug discovery process. As the operation of these systems is remarkably expensive, the scheduling for the processes of such complex systems is critical to the HTS companies. Since the processing time affects the throughput and the efficiency of the system, a time-optimal schedule must be developed for the system which can yield high throughputs. In this thesis, a Mixed Integer Programming model is present
APA, Harvard, Vancouver, ISO, and other styles
34

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
35

Gopal, Kartik. "Modeling and Optimization of Hospital Transportation System." University of Akron / OhioLINK, 2016. http://rave.ohiolink.edu/etdc/view?acc_num=akron1481314351566885.

Full text
APA, Harvard, Vancouver, ISO, and other styles
36

Singh, Manish K. "Optimal Operation of Water and Power Distribution Networks." Thesis, Virginia Tech, 2018. http://hdl.handle.net/10919/86860.

Full text
Abstract:
Under the envisioned smart city paradigm, there is an increasing demand for the coordinated operation of our infrastructure networks. In this context, this thesis puts forth a comprehensive toolbox for the optimization of electric power and water distribution networks. On the analytical front, the toolbox consists of novel mixed-integer (non)-linear program (MINLP) formulations; convex relaxations with optimality guarantees; and the powerful technique of McCormick linearization. On the application side, the developed tools support the operation of each of the infrastructure networks independen
APA, Harvard, Vancouver, ISO, and other styles
37

Kubik, Lauren Ashley. "Simultaneously lifting multiple sets in binary knapsack integer programs." Thesis, Manhattan, Kan. : Kansas State University, 2009. http://hdl.handle.net/2097/1460.

Full text
APA, Harvard, Vancouver, ISO, and other styles
38

Thomopulos, Dimitri <1987&gt. "Models and Solutions of Resource Allocation Problems based on Integer Linear and Nonlinear Programming." Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2016. http://amsdottorato.unibo.it/7399/1/thomopulos_dimitri_tesi.pdf.

Full text
Abstract:
In this thesis we deal with two problems of resource allocation solved through a Mixed-Integer Linear Programming approach and a Mixed-Integer Nonlinear Chance Constraint Programming approach. In the first part we propose a framework to model general guillotine restrictions in two dimensional cutting problems formulated as Mixed-Integer Linear Programs (MILP). The modeling framework requires a pseudo-polynomial number of variables and constraints, which can be effectively enumerated for medium-size instances. Our modeling of general guillotine cuts is the first one that, once it is implemente
APA, Harvard, Vancouver, ISO, and other styles
39

Thomopulos, Dimitri <1987&gt. "Models and Solutions of Resource Allocation Problems based on Integer Linear and Nonlinear Programming." Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2016. http://amsdottorato.unibo.it/7399/.

Full text
Abstract:
In this thesis we deal with two problems of resource allocation solved through a Mixed-Integer Linear Programming approach and a Mixed-Integer Nonlinear Chance Constraint Programming approach. In the first part we propose a framework to model general guillotine restrictions in two dimensional cutting problems formulated as Mixed-Integer Linear Programs (MILP). The modeling framework requires a pseudo-polynomial number of variables and constraints, which can be effectively enumerated for medium-size instances. Our modeling of general guillotine cuts is the first one that, once it is implemente
APA, Harvard, Vancouver, ISO, and other styles
40

Hickman, Randal Edward. "Generating cutting planes through inequality merging for integer programming problems." Diss., Kansas State University, 2014. http://hdl.handle.net/2097/17334.

Full text
Abstract:
Doctor of Philosophy<br>Department of Industrial and Manufacturing Systems Engineering<br>Todd Easton<br>Integer Programming (IP) problems are a common type of optimization problem used to solve numerous real world problems. IPs can require exponential computational effort to solve using the branch and bound technique. A popular method to improve solution times is to generate valid inequalities that serve as cutting planes. This dissertation introduces a new category of cutting planes for general IPs called inequality merging. The inequality merging technique combines two or more low
APA, Harvard, Vancouver, ISO, and other styles
41

Carman, Benjamin Andrew. "Repairing Redistricting: Using an Integer Linear Programming Model to Optimize Fairness in Congressional Districts." Ohio University Honors Tutorial College / OhioLINK, 2021. http://rave.ohiolink.edu/etdc/view?acc_num=ouhonors1619177994406176.

Full text
APA, Harvard, Vancouver, ISO, and other styles
42

Henriksson, Lovisa. "Optimal Maintenance and Operation Scheduling Using Mixed Integer Linear Programming : A Method to Automatize Maintenance Planning." Thesis, KTH, Optimeringslära och systemteori, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-257889.

Full text
Abstract:
In many technical systems it is an essential factor to have functional equipment when needed. To prevent unexpected breakdowns preventive maintenance of the equipment is done regularly and maintenance planning is necessary to achieve an efficiently running system at an optimal cost. In this study, mixed integer linear programming (MILP) is used to optimize preventive maintenance planning and operation for a generic fleet of equipment. The maintenance requirements are mixed conditions of calendar based and operation based constraints. Also, maintenance of hierarchy types are handled. The object
APA, Harvard, Vancouver, ISO, and other styles
43

Damci, Kurt Pelin. "Mixed-Integer Programming Methods for Transportation and Power Generation Problems." The Ohio State University, 2014. http://rave.ohiolink.edu/etdc/view?acc_num=osu1399019482.

Full text
APA, Harvard, Vancouver, ISO, and other styles
44

Silva, Robert A. "Optimizing multi-ship, multi-mission operational planning for the Joint Force Maritime Component Commander." Thesis, Monterey, Calif. : Naval Postgraduate School, 2009. http://edocs.nps.edu/npspubs/scholarly/theses/2009/Mar/09Mar%5FSilva.pdf.

Full text
Abstract:
Thesis (M.S. in Operations Research)--Naval Postgraduate School, March 2009.<br>Thesis Advisor(s): Carlyle, W. Matthew. "March 2009." Description based on title screen as viewed on April 24, 2009. Author(s) subject terms: Integer Programming, Operational Planning, Navy Mission Planner, Navy Asset-Mission Pairing, Maritime Headquarters, Maritime Operations Center, Constrained Enumeration, Stack-based Enumeration, Mathematical Programming, Optimization, Decision Aid, Planning Tool, Ship Employment Schedule. Includes bibliographical references (p. 61-62). Also available in print.
APA, Harvard, Vancouver, ISO, and other styles
45

Tyber, Steven Jay. "Cutting planes in mixed integer programming: theory and algorithms." Diss., Georgia Institute of Technology, 2013. http://hdl.handle.net/1853/47560.

Full text
Abstract:
Recent developments in mixed integer programming have highlighted the need for multi-row cuts. To this day, the performance of such cuts has typically fallen short of the single-row Gomory mixed integer cut. This disparity between the theoretical need and the practical shortcomings of multi-row cuts motivates the study of both the mixed integer cut and multi-row cuts. In this thesis, we build on the theoretical foundations of the mixed integer cut and develop techniques to derive multi-row cuts. The first chapter introduces the mixed integer programming problem. In this chapter, we review t
APA, Harvard, Vancouver, ISO, and other styles
46

McElroy, Jeremy S. "Optimizing the Distribution of United States Army Officers." Thesis, Monterey, California. Naval Postgraduate School, 2005. http://hdl.handle.net/10945/1969.

Full text
Abstract:
The U.S. Army distributes its 51,000 competitive category officers among manning targets specified by location, rank and skill that change over time in response to changing requirements. The officer inventory also changes over time and does not exactly match the manning target requirements. The Army responds to imbalances by redistributing officers in order to provide each location with the minimum required officers while minimizing the number of unfilled targets and excess officers at each location. This thesis focuses on branch officers, branch targets and generalist targets with ranks fro
APA, Harvard, Vancouver, ISO, and other styles
47

Cain, Mark J. "A GAMS-based model of the U.S. Army Wartime Ammunition Distribution System for the Corps level." Thesis, Monterey, California. Naval Postgraduate School, 1985. http://hdl.handle.net/10945/23244.

Full text
Abstract:
Approved for public release; distribution is unlimited<br>The U.S. Army Wartime Ammunition Distribution System (WADS) will experience an unprecedented demand for ammunition under the operational concept of Airland Battle. To meet demand, proper storage facility location and an efficient flow through the distribution network will be required. Using information from Army Field Manuals, maps and simulation data for demand, both a mixed integer program (MIP) and a sequential, optimization-based heuristic are developed to model the WADS. The Generalized Algebraic Modelling System is used to impleme
APA, Harvard, Vancouver, ISO, and other styles
48

Goodman, Gerrit V. R. "A mixed integer model for optimizing equipment scheduling and overburden transport in a surface coal mining operation." Diss., Virginia Polytechnic Institute and State University, 1987. http://hdl.handle.net/10919/76098.

Full text
Abstract:
Recently, competition has increased in the surface coal mining industry, which has necessitated the development of more efficient methods for coal removal. Despite this trend, very little emphasis has been placed on the development of optimization techniques applicable to the surface coal industry. The available methods are inadequate in that they recognize neither the complex equipment interactions present in a surface mining operation nor the interdependence of overburden removal and spoil placement. The lack of available techniques prompted the development of a mixed integer model to opti
APA, Harvard, Vancouver, ISO, and other styles
49

Charchan, Shawn M. "Promoting mission success for the USMC Distributed Operations squad through efficient equipment selection." Thesis, Monterey, California. Naval Postgraduate School, 2006. http://hdl.handle.net/10945/2552.

Full text
Abstract:
The Marine infantryman is carrying too much weight in combat. This thesis analyzes the trade-offs between individual load weights and the value that a Distributed Operations squad receives from the equipment its members carry. We use multiple objective decision analysis principles to help determine the coefficients for an integer linear programming model. The optimization model prescribes equipment assignment to individual positions that maximizes squad mission success while meeting target weights for the individual Marine. Our findings indicate that significant improvements can be made to the
APA, Harvard, Vancouver, ISO, and other styles
50

Di, Summa Marco. "Formulations of mixed-integer sets defined by totally unimodular constraint matrices." Doctoral thesis, Università degli studi di Padova, 2008. http://hdl.handle.net/11577/3425102.

Full text
Abstract:
A mixed-integer program is an optimization problem where one is required to minimize a linear function over a subset defined by a system of linear inequalities, with the additional restriction that some of the variables must take an integer value. Many real-world problems can be formulated as mixed-integer programs. Solving mixed-integer programs is difficult in general. A common approach to tackle this kind of problems exploits the fact that (under mild assumptions) the convex hull of feasible solutions is a polyhedron. When the inequalities describing such a polyhedron are known explicitl
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the bibliographies on the topic 'Operation on integers' for other source types:
Journal articles Books
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!

To the bibliography