subject:(Operations research mathematical programming)

Universidade do Rio Grande do Sul

1. Bucco, Guilherme Brandelli. Construção de um modelo de programação linear para o University Timetabling Problem.

Degree: 2014, Universidade do Rio Grande do Sul

►

A construção de grades horárias dos cursos de uma universidade é um problema que deve ser enfrentado no início de todos os semestres e, por… (more)

▼

A construção de grades horárias dos cursos de uma universidade é um problema que deve ser enfrentado no início de todos os semestres e, por mobilizar quantidades significativas de recursos, se constitui numa das mais importantes tarefas administrativas de uma universidade. Trata-se de um problema clássico, combinatório, que tem atraído atenção por conta da dificuldade de se encontrar boas soluções. É classificado, em termos de complexidade computacional, como NP-hard, o que implica grande exigência de capacidade de processamento. É modelado de maneiras muito diversas, no intuito de se obter adequação quanto ao contexto educacional do país, às regras específicas da instituição ou aos objetivos específicos dos gestores, entre outros. Foi feita uma revisão de literatura no intuito de apoiar a modelagem do problema, nesse trabalho, e de contribuir com a comunidade de pesquisadores sobre o tema ao agregar informações a respeito das pesquisas publicadas até então. O problema é modelado, neste trabalho, por meio de técnicas de Pesquisa Operacional com o objetivo de produzir grades horárias com aulas distribuídas uniformemente ao longo da semana, em uma primeira etapa, para que, na etapa seguinte, ao se atribuir salas de aula às turmas, a utilização dos espaços físicos da Universidade seja otimizada. Dados foram coletados de uma instituição federal de ensino superior para a implementação do modelo. Resultados obtidos no processamento com os dados reais mostraram que o modelo reduz consideravelmente a utilização de salas de aula.

The timetabling construction for University courses is a problem that must be faced at each beginning of semester and, since it mobilizes significant amounts of resources, it constitutes in one of the most important administrative tasks in a University. It's a classic, combinatorial problem that has attracted attention due to its difficulty in finding good solutions. In terms of computational complexity, it's classified as NP-hard, which involves great processing capacity. It's modeled in a number of different ways, aimed to obtain adequacy to the educational context of the country, to the specific higher education institutional rules, or to the specific managers goals, amongst others. A literature review was performed, aimed to support, in this research, the problems modeling, and to contribute to the researchers community, adding the research information published so far. The problem is modeled, in this work, by means of Operations Research techniques, aiming to produce evenly distributed timetables along the week, in the first step, and to assign the classrooms to the groups of students in the next, in such a way that the physical spaces utilization of the University is optimized. Data was collected from a federal higher education institution in order to implement de model. Results obtained through its processing with this data showed that the model considerably reduces the classrooms utilization.

Advisors/Committee Members: Bandeira, Denise Lindstrom.

Subjects/Keywords: University timetabling problem; Modelos matemáticos; Gestão; Operations research; Mathematical programming; Timetables

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Bucco, G. B. (2014). Construção de um modelo de programação linear para o University Timetabling Problem. (Thesis). Universidade do Rio Grande do Sul. Retrieved from http://hdl.handle.net/10183/101491

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Bucco, Guilherme Brandelli. “Construção de um modelo de programação linear para o University Timetabling Problem.” 2014. Thesis, Universidade do Rio Grande do Sul. Accessed December 07, 2019. http://hdl.handle.net/10183/101491.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Bucco, Guilherme Brandelli. “Construção de um modelo de programação linear para o University Timetabling Problem.” 2014. Web. 07 Dec 2019.

Vancouver:

Bucco GB. Construção de um modelo de programação linear para o University Timetabling Problem. [Internet] [Thesis]. Universidade do Rio Grande do Sul; 2014. [cited 2019 Dec 07]. Available from: http://hdl.handle.net/10183/101491.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Bucco GB. Construção de um modelo de programação linear para o University Timetabling Problem. [Thesis]. Universidade do Rio Grande do Sul; 2014. Available from: http://hdl.handle.net/10183/101491

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Clemson University

2. Curry, Robert M. Mathematical Models and Algorithms for Network Flow Problems Arising in Wireless Sensor Network Applications.

Degree: PhD, Industrial Engineering, 2018, Clemson University

URL: https://tigerprints.clemson.edu/all_dissertations/2226

► We examine multiple variations on two classical network flow problems, the maximum flow and minimum-cost flow problems. These two problems are well-studied within the optimization… (more)

▼ We examine multiple variations on two classical network flow problems, the maximum flow and minimum-cost flow problems. These two problems are well-studied within the optimization community, and many models and algorithms have been presented for their solution. Due to the unique characteristics of the problems we consider, existing approaches cannot be directly applied. The problem variations we examine commonly arise in wireless sensor network (WSN) applications. A WSN consists of a set of sensors and collection sinks that gather and analyze environmental conditions. In addition to providing a taxonomy of relevant literature, we present mathematical programming models and algorithms for solving such problems. First, we consider a variation of the maximum flow problem having node-capacity restrictions. As an alternative to solving a single linear programming (LP) model, we present two alternative solution techniques. The first iteratively solves two smaller auxiliary LP models, and the second is a heuristic approach that avoids solving any LP. We also examine a variation of the maximum flow problem having semicontinuous restrictions that requires the flow, if positive, on any path to be greater than or equal to a minimum threshold. To avoid solving a mixed-integer programming (MIP) model, we present a branch-and-price algorithm that significantly improves the computational time required to solve the problem. Finally, we study two dynamic network flow problems that arise in wireless sensor networks under non-simultaneous flow assumptions. We first consider a dynamic maximum flow problem that requires an arc to transmit a minimum amount of flow each time it begins transmission. We present an MIP for solving this problem along with a heuristic algorithm for its solution. Additionally, we study a dynamic minimum-cost flow problem, in which an additional cost is incurred each time an arc begins transmission. In addition to an MIP, we present an exact algorithm that iteratively solves a relaxed version of the MIP until an optimal solution is found. Advisors/Committee Members: Dr. J. Cole Smith, Committee Chair, Dr. Warren Adams, Dr. Sandra D. Ekşioğlu, Dr. Amin Khademi.

Subjects/Keywords: Industrial Engineering; Mathematical Programming; Network Optimzation; Operations Research

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Curry, R. M. (2018). Mathematical Models and Algorithms for Network Flow Problems Arising in Wireless Sensor Network Applications. (Doctoral Dissertation). Clemson University. Retrieved from https://tigerprints.clemson.edu/all_dissertations/2226

Chicago Manual of Style (16^th Edition):

Curry, Robert M. “Mathematical Models and Algorithms for Network Flow Problems Arising in Wireless Sensor Network Applications.” 2018. Doctoral Dissertation, Clemson University. Accessed December 07, 2019. https://tigerprints.clemson.edu/all_dissertations/2226.

MLA Handbook (7^th Edition):

Curry, Robert M. “Mathematical Models and Algorithms for Network Flow Problems Arising in Wireless Sensor Network Applications.” 2018. Web. 07 Dec 2019.

Vancouver:

Curry RM. Mathematical Models and Algorithms for Network Flow Problems Arising in Wireless Sensor Network Applications. [Internet] [Doctoral dissertation]. Clemson University; 2018. [cited 2019 Dec 07]. Available from: https://tigerprints.clemson.edu/all_dissertations/2226.

Council of Science Editors:

Curry RM. Mathematical Models and Algorithms for Network Flow Problems Arising in Wireless Sensor Network Applications. [Doctoral Dissertation]. Clemson University; 2018. Available from: https://tigerprints.clemson.edu/all_dissertations/2226

Columbia University

3. Munoz, Gonzalo. Integer programming techniques for Polynomial Optimization.

Degree: 2017, Columbia University

URL: https://doi.org/10.7916/D82F812G

► Modern problems arising in many domains are driving a need for more capable, state-of-the-art optimization tools. A sharp focus on performance and accuracy has appeared,… (more)

▼ Modern problems arising in many domains are driving a need for more capable, state-of-the-art optimization tools. A sharp focus on performance and accuracy has appeared, for example, in science and engineering applications. In particular, we have seen a growth in studies related to Polynomial Optimization: a field with beautiful and deep theory, offering flexibility for modeling and high impact in diverse areas. The understanding of structural aspects of the feasible sets in Polynomial Optimization, mainly studied in Real Algebraic Geometry, has a long tradition in Mathematics and it has recently acquired increased computational maturity, opening the gate for new Optimization methodologies to be developed. The celebrated hierarchies due to Lasserre, for example, emerged as good algorithmic templates. They allow the representation of semi-algebraic sets, possibly non-convex, through convex sets in lifted spaces, thus enabling the use of long-studied Convex Optimization methods. Nonetheless, there are some computational drawbacks for these approaches: they often rely on possibly large semidefinite programs, and due to scalability and numerical issues associated with SDPs, alternatives and complements are arising. In this dissertation, we will explore theoretical and practical Integer-Programming-based techniques for Polynomial Optimization problems. We first present a Linear Programming relaxation for the AC-OPF problem in Power Systems, a non-convex quadratic problem, and show how such relaxation can be used to develop a tractable MIP-based algorithm for the AC Transmission Switching problem. From a more theoretical perspective, and motivated by the AC-OPF problem, we study how sparsity can be exploited as a tool for analysis of the fundamental complexity of a Polynomial Optimization problem, by showing LP formulations that can efficiently approximate sparse polynomial problems. Finally, we show a computationally practical approach for constructing strong LP approximations on-the-fly, using cutting plane approaches. We will show two different frameworks that can generate cutting planes, which are based on classical methods used in Mixed-Integer Programming. Our methods mainly rely on the maturity of current MIP technology; we believe these contributions are important for the development of manageable approaches to general Polynomial Optimization problems.

Subjects/Keywords: Operations research; Mathematics; Polynomials; Integer programming; Mathematical optimization

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Munoz, G. (2017). Integer programming techniques for Polynomial Optimization. (Doctoral Dissertation). Columbia University. Retrieved from https://doi.org/10.7916/D82F812G

Chicago Manual of Style (16^th Edition):

Munoz, Gonzalo. “Integer programming techniques for Polynomial Optimization.” 2017. Doctoral Dissertation, Columbia University. Accessed December 07, 2019. https://doi.org/10.7916/D82F812G.

MLA Handbook (7^th Edition):

Munoz, Gonzalo. “Integer programming techniques for Polynomial Optimization.” 2017. Web. 07 Dec 2019.

Vancouver:

Munoz G. Integer programming techniques for Polynomial Optimization. [Internet] [Doctoral dissertation]. Columbia University; 2017. [cited 2019 Dec 07]. Available from: https://doi.org/10.7916/D82F812G.

Council of Science Editors:

Munoz G. Integer programming techniques for Polynomial Optimization. [Doctoral Dissertation]. Columbia University; 2017. Available from: https://doi.org/10.7916/D82F812G

University of Florida

4. Burchett, Deon Lamar. Multi-Commodity Fixed Charge Capacitated Network Design Polyhedral Characteristics, Network Resilience, and Algorithms.

Degree: PhD, Industrial and Systems Engineering, 2015, University of Florida

URL: http://ufdc.ufl.edu/UFE0047507

► We perform a polyhedral study of a multi-commodity generalization of variable upper bound flow models. In particular, we establish some relations between facets of single-… (more)

Subjects/Keywords: Aggregation; Algorithms; Commodities; Infrastructure; Linear programming; Mathematical inequalities; Mathematical programming; Operations research; Optimal solutions; Transportation; design – multicommodity – network – polyhedral

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Burchett, D. L. (2015). Multi-Commodity Fixed Charge Capacitated Network Design Polyhedral Characteristics, Network Resilience, and Algorithms. (Doctoral Dissertation). University of Florida. Retrieved from http://ufdc.ufl.edu/UFE0047507

Chicago Manual of Style (16^th Edition):

Burchett, Deon Lamar. “Multi-Commodity Fixed Charge Capacitated Network Design Polyhedral Characteristics, Network Resilience, and Algorithms.” 2015. Doctoral Dissertation, University of Florida. Accessed December 07, 2019. http://ufdc.ufl.edu/UFE0047507.

MLA Handbook (7^th Edition):

Burchett, Deon Lamar. “Multi-Commodity Fixed Charge Capacitated Network Design Polyhedral Characteristics, Network Resilience, and Algorithms.” 2015. Web. 07 Dec 2019.

Vancouver:

Burchett DL. Multi-Commodity Fixed Charge Capacitated Network Design Polyhedral Characteristics, Network Resilience, and Algorithms. [Internet] [Doctoral dissertation]. University of Florida; 2015. [cited 2019 Dec 07]. Available from: http://ufdc.ufl.edu/UFE0047507.

Council of Science Editors:

Burchett DL. Multi-Commodity Fixed Charge Capacitated Network Design Polyhedral Characteristics, Network Resilience, and Algorithms. [Doctoral Dissertation]. University of Florida; 2015. Available from: http://ufdc.ufl.edu/UFE0047507

University of Florida

5. Chung, Kwanghun. Strong Valid Inequalities for Mixed-Integer Nonlinear Programs Via Disjunctive Programming and Lifting.

Degree: PhD, Industrial and Systems Engineering, 2010, University of Florida

URL: http://ufdc.ufl.edu/UFE0042147

► STRONG VALID INEQUALITIES FOR MIXED-INTEGER NONLINEAR PROGRAMS VIA DISJUNCTIVE PROGRAMMING AND LIFTING Mixed-Integer Nonlinear Programs (MINLP) are optimization problems that have found applications in virtually… (more)

▼ STRONG VALID INEQUALITIES FOR MIXED-INTEGER NONLINEAR PROGRAMS VIA DISJUNCTIVE PROGRAMMING AND LIFTING Mixed-Integer Nonlinear Programs (MINLP) are optimization problems that have found applications in virtually all sectors of the economy. Although these models can be used to design and improve a large array of practical systems, they are typically difficult to solve to global optimality. In this thesis, we introduce new tools for the solution of such problems. In particular, we develop new procedures to construct convex relaxations of certain MINLP problems. These relaxations are stronger than those currently known for these problems and therefore provide improvements in the solution of MINLPs through branch-and-bound techniques. There are three main components to our contributions. First, we derive a closed-form characterization of the convex hull of a generic nonlinear set, when the convex hull of this set is completely determined by orthogonal restrictions of the original set. Although the tools used in our derivation include disjunctive programming and convex extensions, our characterization does not introduce additional variables. We develop and apply a toolbox of results to check the technical assumptions under which this convexification tool can be employed. We demonstrate its applicability in integer programming by providing an alternate derivation of the split cut for mixed-integer polyhedral sets and by finding the convex hull of various mixed/pure-integer bilinear sets. We then develop a key result that extends the utility of the convexification tool to relaxing nonconvex inequalities, which are not naturally disjunctive, by providing sufficient conditions for establishing the convex extension property over the non-negative orthant. We illustrate the utility of this result by deriving the convex hull of a continuous bilinear covering set over the non-negative orthant. Second, we study the \01 mixed-integer bilinear covering set. We show that the convex hull of this set is polyhedral and we provide characterizations for its trivial facets. We also obtain a complete convex hull description when it contains only two pairs of variables. We then derive three families of facet-defining inequalities via sequence-independent lifting techniques. Two of these families have an exponential number of members. Next, we relate the polyhedral structure of the \01 mixed-integer bilinear covering set to that of certain single-node flow sets. As a result, we obtain new facet-defining inequalities for flow sets that generalize well-known lifted flow cover inequalities from the integer programming literature. Third, we evaluate the strength of the lifted inequalities we derive for \01 mixed-integer bilinear covering sets inside of a branch-and-cut framework. To this end, we first generalize our theoretical results to bilinear covering sets that have additional linear terms. We then present separation techniques for lifted inequalities and report computational results obtained when using these procedures on several… Advisors/Committee Members: Richard, Jean-Philippe (committee chair), Pardalos, Panagote M. (committee member), Smith, Jonathan (committee member), Hager, William W. (committee member), Tawarmalani, Mohit (committee member).

Subjects/Keywords: Algorithms; Copyrights; Integers; Linear programming; Mathematical inequalities; Mathematical programming; Operations research; Optimal solutions; Polyhedrons; Polytopes; bilinear, convexification, disjunctive, lifting, minlp

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Chung, K. (2010). Strong Valid Inequalities for Mixed-Integer Nonlinear Programs Via Disjunctive Programming and Lifting. (Doctoral Dissertation). University of Florida. Retrieved from http://ufdc.ufl.edu/UFE0042147

Chicago Manual of Style (16^th Edition):

Chung, Kwanghun. “Strong Valid Inequalities for Mixed-Integer Nonlinear Programs Via Disjunctive Programming and Lifting.” 2010. Doctoral Dissertation, University of Florida. Accessed December 07, 2019. http://ufdc.ufl.edu/UFE0042147.

MLA Handbook (7^th Edition):

Chung, Kwanghun. “Strong Valid Inequalities for Mixed-Integer Nonlinear Programs Via Disjunctive Programming and Lifting.” 2010. Web. 07 Dec 2019.

Vancouver:

Chung K. Strong Valid Inequalities for Mixed-Integer Nonlinear Programs Via Disjunctive Programming and Lifting. [Internet] [Doctoral dissertation]. University of Florida; 2010. [cited 2019 Dec 07]. Available from: http://ufdc.ufl.edu/UFE0042147.

Council of Science Editors:

Chung K. Strong Valid Inequalities for Mixed-Integer Nonlinear Programs Via Disjunctive Programming and Lifting. [Doctoral Dissertation]. University of Florida; 2010. Available from: http://ufdc.ufl.edu/UFE0042147

Wright State University

6. Vijayakumar, Bharathwaj. SCHEDULING SURGICAL CASES IN A CONSTRAINED ENVIRONMENT.

Degree: MSEgr, Industrial and Human Factors Engineering, 2011, Wright State University

URL: http://rave.ohiolink.edu/etdc/view?acc_num=wright1303093820

► This research examines a complex surgical case scheduling problem for a publicly-funded hospital in the Midwest United States. Publicly-funded hospitals are typically under tight budget… (more)

Subjects/Keywords: Industrial Engineering; Mathematics; Operations Research; Surgery; surgical case scheduling; operations research; heuristics; mathematical model; mixed integer programming; first fit decrease

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Vijayakumar, B. (2011). SCHEDULING SURGICAL CASES IN A CONSTRAINED ENVIRONMENT. (Masters Thesis). Wright State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=wright1303093820

Chicago Manual of Style (16^th Edition):

Vijayakumar, Bharathwaj. “SCHEDULING SURGICAL CASES IN A CONSTRAINED ENVIRONMENT.” 2011. Masters Thesis, Wright State University. Accessed December 07, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=wright1303093820.

MLA Handbook (7^th Edition):

Vijayakumar, Bharathwaj. “SCHEDULING SURGICAL CASES IN A CONSTRAINED ENVIRONMENT.” 2011. Web. 07 Dec 2019.

Vancouver:

Vijayakumar B. SCHEDULING SURGICAL CASES IN A CONSTRAINED ENVIRONMENT. [Internet] [Masters thesis]. Wright State University; 2011. [cited 2019 Dec 07]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=wright1303093820.

Council of Science Editors:

Vijayakumar B. SCHEDULING SURGICAL CASES IN A CONSTRAINED ENVIRONMENT. [Masters Thesis]. Wright State University; 2011. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=wright1303093820

Portland State University

7. Foes, Chamberlain Lambros. Complex systems and the price-resource directive coordination procedure.

Degree: PhD, Systems Science, 1972, Portland State University

URL: http://pdxscholar.library.pdx.edu/open_access_etds/831

► In this thesis, the problem considered is that of linear static optimization of a large system which is composed of a finite number of… (more)

▼ In this thesis, the problem considered is that of linear static optimization of a large system which is composed of a finite number of subsystems, each characterized by its own constraint matrix and objective function. The total system is itself constrained by resource availabilities and other factors, and its objective function is the mathematical linear sum of the objective function of the subsystems. The total system constraints couple together all the subsystems. The total system is first reformulated as a two-level problem by decoup1ing the total system constraints utilizing an arbitrary partition of the total system resources and other factors according to the number of subsystems. At the upper level we have a so-called central problem having as an objective function the sum of the optima of the subsystems achieved for any given partition and constrained by the total available resources and other factors which can be partitioned. At the lower level we have the subproblems which are small-dimension linear programming problems parameterized on the right-hand side of the part of the constraints which resulted from the decoup1ing of the total system constraints. The resources vector of each subproblem's set of constraints contains the system common resources allocated to it by the central problem. Different allocations of these resources to each subsystem create multiparametric optimization problems for which we have solution methods. The subsystem solutions become functions of the central system allocation policies. Therefore, the major concern for optimization of the whole system is the discovery of the optimum allocation policy. The method that we introduce finds the optimum allocation policy in a finite number of different allocation iterations. The major steps in the development are the discovery that the minimal (in case of multiple solutions) shadow prices of the subsystems are equal at optimality to the central system shadow prices, and that a coordination of the subsystems for the purpose of achieving optimality of the total system can be organized by utilizing the concave relationships governing the subsystem shadow prices versus the resources allocated to these subsystems. The method offers significant computational and conceptual advantages over present decomposition techniques, since it disposes with the solution of a central problem and the subproblems at each iteration and substitutes instead a simple coordination operation and subsystem parametric optimization at each iteration after the first, where a full solution of the subsystems takes place.

Subjects/Keywords: Operations research; Mathematical optimization; Programming (Mathematics)

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Foes, C. L. (1972). Complex systems and the price-resource directive coordination procedure. (Doctoral Dissertation). Portland State University. Retrieved from http://pdxscholar.library.pdx.edu/open_access_etds/831

Chicago Manual of Style (16^th Edition):

Foes, Chamberlain Lambros. “Complex systems and the price-resource directive coordination procedure.” 1972. Doctoral Dissertation, Portland State University. Accessed December 07, 2019. http://pdxscholar.library.pdx.edu/open_access_etds/831.

MLA Handbook (7^th Edition):

Foes, Chamberlain Lambros. “Complex systems and the price-resource directive coordination procedure.” 1972. Web. 07 Dec 2019.

Vancouver:

Foes CL. Complex systems and the price-resource directive coordination procedure. [Internet] [Doctoral dissertation]. Portland State University; 1972. [cited 2019 Dec 07]. Available from: http://pdxscholar.library.pdx.edu/open_access_etds/831.

Council of Science Editors:

Foes CL. Complex systems and the price-resource directive coordination procedure. [Doctoral Dissertation]. Portland State University; 1972. Available from: http://pdxscholar.library.pdx.edu/open_access_etds/831

University of Oxford

8. Xia, Yuan. Multilevel Monte Carlo for jump processes.

Degree: PhD, 2013, University of Oxford

URL: http://ora.ox.ac.uk/objects/uuid:7bc8e98a-0216-4551-a1f3-1b318e514ee8 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.618395

► This thesis consists of two parts. The first part (Chapters 2-4) considers multilevel Monte Carlo for option pricing in finite activity jump-diffusion models. We use… (more)

Subjects/Keywords: 518; Numerical analysis; Operations research,mathematical programming; Probability theory and stochastic processes

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Xia, Y. (2013). Multilevel Monte Carlo for jump processes. (Doctoral Dissertation). University of Oxford. Retrieved from http://ora.ox.ac.uk/objects/uuid:7bc8e98a-0216-4551-a1f3-1b318e514ee8 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.618395

Chicago Manual of Style (16^th Edition):

Xia, Yuan. “Multilevel Monte Carlo for jump processes.” 2013. Doctoral Dissertation, University of Oxford. Accessed December 07, 2019. http://ora.ox.ac.uk/objects/uuid:7bc8e98a-0216-4551-a1f3-1b318e514ee8 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.618395.

MLA Handbook (7^th Edition):

Xia, Yuan. “Multilevel Monte Carlo for jump processes.” 2013. Web. 07 Dec 2019.

Vancouver:

Xia Y. Multilevel Monte Carlo for jump processes. [Internet] [Doctoral dissertation]. University of Oxford; 2013. [cited 2019 Dec 07]. Available from: http://ora.ox.ac.uk/objects/uuid:7bc8e98a-0216-4551-a1f3-1b318e514ee8 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.618395.

Council of Science Editors:

Xia Y. Multilevel Monte Carlo for jump processes. [Doctoral Dissertation]. University of Oxford; 2013. Available from: http://ora.ox.ac.uk/objects/uuid:7bc8e98a-0216-4551-a1f3-1b318e514ee8 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.618395

Australian National University

9. Bertoli, Francesco. Tactical Problems in Vehicle Routing Applications .

Degree: 2018, Australian National University

URL: http://hdl.handle.net/1885/146047

► The class of Vehicle Routing Problems (VRPs) is one the most studied topics in the Operations Research community. The vast majority of the published papers… (more)

▼ The class of Vehicle Routing Problems (VRPs) is one the most studied topics in the Operations Research community. The vast majority of the published papers focus on single-period problems, with a few branches of the literature considering multiperiod generalisations. All of these problems though, consider a short horizon and aim at optimising the decisions at an operational level, i.e. that will have to be taken in the near future. One step above are tactical problems, i.e. problems concerning a longer time horizon. Tactical problems are of a fundamental importance as they directly influence the daily operations, and therefore a part of the incurred costs, for a long time. The main focus of this thesis is to study tactical problems arising in routing applications. The first problem considered concerns the design of a fleet of vehicles. Transportation providers often have to design a fleet that will be used for daily operations across a long-time span. Trucks used for transportation are very expensive to purchase, maintain or hire. On the other side, the composition of the fleet strongly influences the daily plans, and therefore costs such as fuel or drivers’ wages. Balancing these two components is challenging, and optimisation models can lead to substantial savings or provide a useful basis for informed decisions. The second problem presented focuses on the use of a split deliveries policy in multi-period routing problems. It is known that the combined optimisation of delivery scheduling and routing can be very beneficial, and lead to significant reductions in costs. However, it also adds complexity to the model. The same is true when split deliveries are introduced. The problem studied considers the possibility of splitting the deliveries over different days. An analysis, both theoretical and numerical, of the impact of this approach on the overall cost is provided. Finally, a districting problem for routing applications is considered. These types of problems typically arise when transportation providers wish to increase their service consistency. There are several reasons a company may wish to do so: to strengthen the customer-driver relationship, to increase drivers’ familiarity with their service area, or, to simplify the management of the service area. A typical approach, considered here, is to divide the area under consideration in sectors that will be subsequently assigned to specific drivers. This type of problem is inherently of a multi-period and tactical nature. A new formulation is proposed, integrating standard routing models into the design of territories. This makes it possible to investigate how operational constraints and other requirements, such as having a fair workload division amongst drivers, influence the effectiveness of the approach. An analysis of the cost of…

Subjects/Keywords: Vehicle Routing Problems; Tactical Problems; Operations Research; Mathematical Programming; Metaheuristic; Discrete Optimization; Discrete Optimisation

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Bertoli, F. (2018). Tactical Problems in Vehicle Routing Applications . (Thesis). Australian National University. Retrieved from http://hdl.handle.net/1885/146047

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Bertoli, Francesco. “Tactical Problems in Vehicle Routing Applications .” 2018. Thesis, Australian National University. Accessed December 07, 2019. http://hdl.handle.net/1885/146047.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Bertoli, Francesco. “Tactical Problems in Vehicle Routing Applications .” 2018. Web. 07 Dec 2019.

Vancouver:

Bertoli F. Tactical Problems in Vehicle Routing Applications . [Internet] [Thesis]. Australian National University; 2018. [cited 2019 Dec 07]. Available from: http://hdl.handle.net/1885/146047.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Bertoli F. Tactical Problems in Vehicle Routing Applications . [Thesis]. Australian National University; 2018. Available from: http://hdl.handle.net/1885/146047

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Florida

10. Hemmati, Mehdi. Multilevel Discrete Formulations and Algorithms with Applications to New Production Introduction Games and Network Interdiction Problems.

Degree: PhD, Industrial and Systems Engineering, 2013, University of Florida

URL: http://ufdc.ufl.edu/UFE0045762

► In this dissertation, we study multilevel optimization andnetwork interdiction theory, and apply this theory across several applicationsettings. The common theme of all ourproblems involves competitive… (more)

▼ In this dissertation, we study multilevel optimization andnetwork interdiction theory, and apply this theory across several applicationsettings. The common theme of all ourproblems involves competitive settings in which the beneficiary of a systemseeks robust design, protection, or fortification actions to compete againstexternal factors (e.g., uncertainty or an intelligent player) that may affectthe system, either intentionally or unintentionally. We propose discrete bilevel mathematicalprograms for several applications in finite stopping problems underuncertainty, network interdiction problems, a new product introduction game,and competitive facility location problems. We then provide the necessary theory that makes the problems amenable toexact solution techniques. In our first problem, we consider an extension to theoptimal stopping problem in which items offered to a customer are alsoassociated with profits from the seller's viewpoint. For this problem, we seek an ordering thatinduces the customer to purchase an item that maximizes the seller'sprofit. By incorporating uncertainty inthe items' values, profits, and customer stopping thresholds, we studycharacteristics of two optimization philosophies, the ``max-min profit'' andthe ``maximum expected profit,'' for the seller. In particular, we analyze the computationaltractability of the resulting optimization models and devise an exact solutiontechnique for one special case of the problem. The second problem that we study is closely related to theclassical Set Covering Problem, which has applications in new productintroduction games and competitive facility location problems. In our problem, each clause contains anordered partial set of the items. Eachplayer incurs a cost for each item that is selected, and receives rewards basedon satisfied clauses. In particular, aclause is satisfied only by the highest-ranked item (if any) that the playerselects, and the reward granted to the player from this clause depends on theitem that satisfies the clause. We studya nonzero-sum two-player game in which each player aims to maximize its ownprofit through selecting the items and satisfying the clauses based on theprioritized set covering rule. Our third problem addresses another nonzero-sum two-playergame over a network in which an adversarial player aims to spread its influence(control) on the nodes over a number of time stages, while the other playeraims to protect the network against the spread of the adversary's influence. In this problem, we consider the cascadingeffect of the initial influence (via a threshold-based diffusion model), whichresults in the gradual spread of the influence on uninfluenced nodes. Accordingly, the budget-restricted attackeraims to maximize the damage that the network incurs due to the spread of theinfluence resulting from an initial attack. By taking the defender's perspective, we study protection patterns withthe aim of minimizing the maximum damage incurred by the network. This problem has several applications inrecommending… Advisors/Committee Members: Smith, Jonathan Cole (committee chair), Geunes, Joseph Patrick (committee member), Richard, Jean-Philippe P (committee member), Thai, My Tra (committee member).

Subjects/Keywords: Algorithms; Customers; Integers; Linear programming; Mathematical sequences; Mathematical variables; Objective functions; Operations research; Optimal solutions; Product introduction; bilevel – interdiction – network – optimization

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Hemmati, M. (2013). Multilevel Discrete Formulations and Algorithms with Applications to New Production Introduction Games and Network Interdiction Problems. (Doctoral Dissertation). University of Florida. Retrieved from http://ufdc.ufl.edu/UFE0045762

Chicago Manual of Style (16^th Edition):

Hemmati, Mehdi. “Multilevel Discrete Formulations and Algorithms with Applications to New Production Introduction Games and Network Interdiction Problems.” 2013. Doctoral Dissertation, University of Florida. Accessed December 07, 2019. http://ufdc.ufl.edu/UFE0045762.

MLA Handbook (7^th Edition):

Hemmati, Mehdi. “Multilevel Discrete Formulations and Algorithms with Applications to New Production Introduction Games and Network Interdiction Problems.” 2013. Web. 07 Dec 2019.

Vancouver:

Hemmati M. Multilevel Discrete Formulations and Algorithms with Applications to New Production Introduction Games and Network Interdiction Problems. [Internet] [Doctoral dissertation]. University of Florida; 2013. [cited 2019 Dec 07]. Available from: http://ufdc.ufl.edu/UFE0045762.

Council of Science Editors:

Hemmati M. Multilevel Discrete Formulations and Algorithms with Applications to New Production Introduction Games and Network Interdiction Problems. [Doctoral Dissertation]. University of Florida; 2013. Available from: http://ufdc.ufl.edu/UFE0045762

University of Florida

11. Davarnia, Danial. Convexification Techniques for Bilinear and Complementarity Constraints with Application to Network Interdiction.

Degree: PhD, Industrial and Systems Engineering, 2016, University of Florida

URL: http://ufdc.ufl.edu/UFE0050279

Continuous and discrete bilinear and complementarity constraints are widely used to model engineering and management problems. Advisors/Committee Members: RICHARD,JEAN-PHILIPPE P (committee chair), GARCIA,ALFREDO (committee member), HAMILTON,JONATHAN H (committee member), TAWARMALANI,MOHIT (committee member).

Subjects/Keywords: Aggregation; Algorithms; Conic sections; Linear programming; Mathematical inequalities; Mathematical programming; Mathematical variables; Operations research; Optimal solutions; Polytopes; bilinear – complementarity – convexification – cutting-plane – envelope – interdiction – kkt – lifting

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Davarnia, D. (2016). Convexification Techniques for Bilinear and Complementarity Constraints with Application to Network Interdiction. (Doctoral Dissertation). University of Florida. Retrieved from http://ufdc.ufl.edu/UFE0050279

Chicago Manual of Style (16^th Edition):

Davarnia, Danial. “Convexification Techniques for Bilinear and Complementarity Constraints with Application to Network Interdiction.” 2016. Doctoral Dissertation, University of Florida. Accessed December 07, 2019. http://ufdc.ufl.edu/UFE0050279.

MLA Handbook (7^th Edition):

Davarnia, Danial. “Convexification Techniques for Bilinear and Complementarity Constraints with Application to Network Interdiction.” 2016. Web. 07 Dec 2019.

Vancouver:

Davarnia D. Convexification Techniques for Bilinear and Complementarity Constraints with Application to Network Interdiction. [Internet] [Doctoral dissertation]. University of Florida; 2016. [cited 2019 Dec 07]. Available from: http://ufdc.ufl.edu/UFE0050279.

Council of Science Editors:

Davarnia D. Convexification Techniques for Bilinear and Complementarity Constraints with Application to Network Interdiction. [Doctoral Dissertation]. University of Florida; 2016. Available from: http://ufdc.ufl.edu/UFE0050279

12. Acuña-Agost, Rodrigo. Mathematical modeling and methods for rescheduling trains under disrupted operations : Modélisation mathématique et méthodes de résolution pour le problème de réordonnancement de plan de circulation ferroviaire en cas d'incidents.

Degree: Docteur es, Informatique, 2009, Avignon

URL: http://www.theses.fr/2009AVIG0165

► En raison de problèmes opérationnels et d’autres événements inattendus, un grand nombre d’incidents se produisent quotidiennement dans les systèmes de transport ferroviaire. Certains d’entre eux… (more)

▼ En raison de problèmes opérationnels et d’autres événements inattendus, un grand nombre d’incidents se produisent quotidiennement dans les systèmes de transport ferroviaire. Certains d’entre eux ont un impact local, mais quelques fois, essentiellement dans les réseaux ferroviaires plus saturés, des petits incidents peuvent se propager à travers tout le réseau et perturber de manière significative les horaires des trains. Dans cette thèse doctorale, nous présentons le problème de réordonnancement de plan de circulation ferroviaire en cas d’incident comme la problématique de créer un plan de circulation provisoire de manière à minimiser les effets de la propagation des incidents. Ce travail est issu du projet MAGES (Module d’Aide à la Gestion des Sillons) qui développe des systèmes de régulation pour le trafic ferroviaire. Nous présentons deux modèles différents qui permettent de trouver des solutions à ce problème : Programmation Linéaire en Nombres Entiers (PLNE) et Programmation Par Contraintes (PPC). Du fait de la nature fortement combinatoire du problème et de la nécessité de répondre rapidement aux incidents, il ne paraît pas raisonnable d’envisager une résolution exacte. Les méthodes correctives proposées consistent donc à explorer un voisinage restreint des solutions : right-shift rescheduling; une méthode basée sur des coupes de proximité; une méthode d’analyse statistique de la propagation des incidents (SAPI) et un méthode basée sur la PPC. Additionnellement, certaines de ces méthodes ont été adaptées sous forme d’algorithmes itératifs avec l’objectif d’améliorer progressivement la solution quand le temps d’exécution le permet. SAPI est une des principales contributions de cette thèse. SAPI intègre les concepts de right-shift rescheduling avec les coupes de proximité. Du fait de la taille des réseaux en jeu et du nombre de circulations, les phénomènes complexes de propagation d’un incident font qu’il est très difficile de connaitre de manière précise les événements qui seront affectés. Toutefois, il est tout de même envisageable d’évaluer la probabilité qu’un événement soit affecté. Pour calculer cette probabilité, un modèle de régression logistique est utilisé avec des variables explicatives dérivées du réseau et des circulations. Diverses variantes de ces méthodes sont évaluées et comparées en utilisant deux réseaux ferroviaires localisés en France et au Chili. À partir des résultats obtenus, il est possible de conclure que SAPI est meilleure que les autres méthodes en terme de vitesse de convergence vers l’optimum pour les instances de petite taille et moyenne alors qu’une méthode coopérative PNLE/PPC est capable de trouver des solutions pour les instances de plus grande taille. La difficulté de comparer SAPI avec d’autres méthodes présentées dans la littérature nous a encouragés à appliquer la méthode à un autre problème. Ainsi, cette méthodologie a été également adaptée au problème de réordonnancement de passagers, vols et appareils (avions) en cas de perturbations, problème originalement proposé dans… Advisors/Committee Members: Michelon, Philippe (thesis director), Feillet, Dominique (thesis director), Gueye, Serigne Abdoulaye (thesis director).

Subjects/Keywords: Recherche opérationnelle; Transport ferroviaire; Gestion de perturbations; Programmation mathématique; Operations Research; Railways; Disruption Management; Mathematical Programming

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Acuña-Agost, R. (2009). Mathematical modeling and methods for rescheduling trains under disrupted operations : Modélisation mathématique et méthodes de résolution pour le problème de réordonnancement de plan de circulation ferroviaire en cas d'incidents. (Doctoral Dissertation). Avignon. Retrieved from http://www.theses.fr/2009AVIG0165

Chicago Manual of Style (16^th Edition):

Acuña-Agost, Rodrigo. “Mathematical modeling and methods for rescheduling trains under disrupted operations : Modélisation mathématique et méthodes de résolution pour le problème de réordonnancement de plan de circulation ferroviaire en cas d'incidents.” 2009. Doctoral Dissertation, Avignon. Accessed December 07, 2019. http://www.theses.fr/2009AVIG0165.

MLA Handbook (7^th Edition):

Acuña-Agost, Rodrigo. “Mathematical modeling and methods for rescheduling trains under disrupted operations : Modélisation mathématique et méthodes de résolution pour le problème de réordonnancement de plan de circulation ferroviaire en cas d'incidents.” 2009. Web. 07 Dec 2019.

Vancouver:

Acuña-Agost R. Mathematical modeling and methods for rescheduling trains under disrupted operations : Modélisation mathématique et méthodes de résolution pour le problème de réordonnancement de plan de circulation ferroviaire en cas d'incidents. [Internet] [Doctoral dissertation]. Avignon; 2009. [cited 2019 Dec 07]. Available from: http://www.theses.fr/2009AVIG0165.

Council of Science Editors:

Acuña-Agost R. Mathematical modeling and methods for rescheduling trains under disrupted operations : Modélisation mathématique et méthodes de résolution pour le problème de réordonnancement de plan de circulation ferroviaire en cas d'incidents. [Doctoral Dissertation]. Avignon; 2009. Available from: http://www.theses.fr/2009AVIG0165

McGill University

13. Welch, Norma. The formulation and use of a linear programming model of a multi-product Kraft mill.

Degree: MS, School of Computer Science, 1969, McGill University

URL: http://digitool.library.mcgill.ca/thesisfile46587.pdf

Subjects/Keywords: Linear programming; Operations research; Wood-pulp industry – Mathematical models.

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Welch, N. (1969). The formulation and use of a linear programming model of a multi-product Kraft mill. (Masters Thesis). McGill University. Retrieved from http://digitool.library.mcgill.ca/thesisfile46587.pdf

Chicago Manual of Style (16^th Edition):

Welch, Norma. “The formulation and use of a linear programming model of a multi-product Kraft mill.” 1969. Masters Thesis, McGill University. Accessed December 07, 2019. http://digitool.library.mcgill.ca/thesisfile46587.pdf.

MLA Handbook (7^th Edition):

Welch, Norma. “The formulation and use of a linear programming model of a multi-product Kraft mill.” 1969. Web. 07 Dec 2019.

Vancouver:

Welch N. The formulation and use of a linear programming model of a multi-product Kraft mill. [Internet] [Masters thesis]. McGill University; 1969. [cited 2019 Dec 07]. Available from: http://digitool.library.mcgill.ca/thesisfile46587.pdf.

Council of Science Editors:

Welch N. The formulation and use of a linear programming model of a multi-product Kraft mill. [Masters Thesis]. McGill University; 1969. Available from: http://digitool.library.mcgill.ca/thesisfile46587.pdf

University of Oklahoma

14. Mount-campbell, Clark A. The application of capital market equilibrium theory and mathematical programming to the capital budgeting problem under uncertainty.

Degree: PhD, 1974, University of Oklahoma

URL: http://hdl.handle.net/11244/3861

Subjects/Keywords: Finance.; Capital investments Mathematical models.; Nonlinear programming.; Operations Research.

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Mount-campbell, C. A. (1974). The application of capital market equilibrium theory and mathematical programming to the capital budgeting problem under uncertainty. (Doctoral Dissertation). University of Oklahoma. Retrieved from http://hdl.handle.net/11244/3861

Chicago Manual of Style (16^th Edition):

Mount-campbell, Clark A. “The application of capital market equilibrium theory and mathematical programming to the capital budgeting problem under uncertainty.” 1974. Doctoral Dissertation, University of Oklahoma. Accessed December 07, 2019. http://hdl.handle.net/11244/3861.

MLA Handbook (7^th Edition):

Mount-campbell, Clark A. “The application of capital market equilibrium theory and mathematical programming to the capital budgeting problem under uncertainty.” 1974. Web. 07 Dec 2019.

Vancouver:

Mount-campbell CA. The application of capital market equilibrium theory and mathematical programming to the capital budgeting problem under uncertainty. [Internet] [Doctoral dissertation]. University of Oklahoma; 1974. [cited 2019 Dec 07]. Available from: http://hdl.handle.net/11244/3861.

Council of Science Editors:

Mount-campbell CA. The application of capital market equilibrium theory and mathematical programming to the capital budgeting problem under uncertainty. [Doctoral Dissertation]. University of Oklahoma; 1974. Available from: http://hdl.handle.net/11244/3861

The Ohio State University

15. Rahimian, Hamed. Risk-Averse and Distributionally Robust Optimization:Methodology and Applications.

Degree: PhD, Industrial and Systems Engineering, 2018, The Ohio State University

URL: http://rave.ohiolink.edu/etdc/view?acc_num=osu1531822931371766

► Many decision-making problems arising in science, engineering, and business involveuncertainties. One way to address these problems is to use stochastic optimization.A crucial task when building… (more)

▼ Many decision-making problems arising in science, engineering, and business involveuncertainties. One way to address these problems is to use stochastic optimization.A crucial task when building stochastic optimization models is quantifying aprobability distribution to represent the uncertainty. Most often, partial informationabout the uncertainty is available through a series of historical data. In such circumstances,classical stochastic optimization models rely on approximating the underlyingprobability distribution. However, in many real-world applications, the underlyingprobability distribution cannot be accurately determined, even when historical dataare available. This distributional ambiguity might lead to highly suboptimal decisions.An alternative approach to handle such an issue is to use distributionally robuststochastic optimization (DRSO for short), which assumes the underlying probabilitydistribution is unknown but lies in an ambiguity set of distributions.Many existing studies on DRSO focus on how to construct the ambiguity set andhow to transform the resulting DRSO into equivalent (well-studied) models such asmixed-integer programming and semidefinite programming. This dissertation, however,addresses more fundamental questions, in a different manner than the literature.An overarching question that motivates most of this dissertation is whichscenarios/uncertainties are critical to a stochastic optimization problem? A majorcontribution of this dissertation is a precise mathematical definition of what is meant by a critical scenario and investigation on how to identify them for DRSO. As hasnever been done before for DRSO (to the best of our knowledge), we introduce thenotion of effective and ineffective scenarios for DRSO.This dissertation considers DRSOs for which the ambiguity set contains all probabilitydistributions that are not far – in the sense of the so-called total variationdistance – from a nominal distribution (which may be obtained from data). This dissertationthen identifies effective scenarios for two classes of DRSO problems formedvia the total variation distance: (1) a class of convex stochastic optimization problemswith a discrete sample space and (2) a class of inventory problems with a continuoussample space.All these classes of DRSO problems have equivalent risk-averse optimization problemsthat lay the foundation to identify effective scenarios. We elaborate how effectivescenarios, along with other notions, can be used to choose an appropriate size forthe ambiguity set of distributions. Then, we devise customized algorithms to solveDRSO formed via the total variation distance. Moreover, we survey existing algorithmsto solve a closely related risk-averse optimization problem to those induced bythe studied DRSO problems, and we propose new variations. Finally, to highlight thepractical relevance of our findings, we implement all our modeling, theoretical, andcomputational results to solve problems arising in environment, energy, healthcare,and… Advisors/Committee Members: Bayraksan, Guzin (Advisor).

Subjects/Keywords: Operations Research; Industrial Engineering; Decision-Making under Uncertainty, Mathematical Programming, Stochastic Optimization, Risk-Averse Optimization, Distributionally Robust Optimization

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Rahimian, H. (2018). Risk-Averse and Distributionally Robust Optimization:Methodology and Applications. (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1531822931371766

Chicago Manual of Style (16^th Edition):

Rahimian, Hamed. “Risk-Averse and Distributionally Robust Optimization:Methodology and Applications.” 2018. Doctoral Dissertation, The Ohio State University. Accessed December 07, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=osu1531822931371766.

MLA Handbook (7^th Edition):

Rahimian, Hamed. “Risk-Averse and Distributionally Robust Optimization:Methodology and Applications.” 2018. Web. 07 Dec 2019.

Vancouver:

Rahimian H. Risk-Averse and Distributionally Robust Optimization:Methodology and Applications. [Internet] [Doctoral dissertation]. The Ohio State University; 2018. [cited 2019 Dec 07]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1531822931371766.

Council of Science Editors:

Rahimian H. Risk-Averse and Distributionally Robust Optimization:Methodology and Applications. [Doctoral Dissertation]. The Ohio State University; 2018. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1531822931371766

University of Florida

16. Shylo, Oleg. New Tools For Large-Scale Combinatorial Optimization Problems.

Degree: PhD, Industrial and Systems Engineering, 2009, University of Florida

URL: http://ufdc.ufl.edu/UFE0024719

► Many traditional algorithmic techniques used in combinatorial optimization have reached the computational limits of their scope. A relatively low cost and availability of parallel multi-core… (more)

Subjects/Keywords: Algorithms; Combinatorial optimization; Computer programming; Heuristics; Job shops; Mathematical vectors; Matrices; Operations research; Scheduling; Taboos; optimization, parallel, portfolio, quadratic, restart, scheduling

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Shylo, O. (2009). New Tools For Large-Scale Combinatorial Optimization Problems. (Doctoral Dissertation). University of Florida. Retrieved from http://ufdc.ufl.edu/UFE0024719

Chicago Manual of Style (16^th Edition):

Shylo, Oleg. “New Tools For Large-Scale Combinatorial Optimization Problems.” 2009. Doctoral Dissertation, University of Florida. Accessed December 07, 2019. http://ufdc.ufl.edu/UFE0024719.

MLA Handbook (7^th Edition):

Shylo, Oleg. “New Tools For Large-Scale Combinatorial Optimization Problems.” 2009. Web. 07 Dec 2019.

Vancouver:

Shylo O. New Tools For Large-Scale Combinatorial Optimization Problems. [Internet] [Doctoral dissertation]. University of Florida; 2009. [cited 2019 Dec 07]. Available from: http://ufdc.ufl.edu/UFE0024719.

Council of Science Editors:

Shylo O. New Tools For Large-Scale Combinatorial Optimization Problems. [Doctoral Dissertation]. University of Florida; 2009. Available from: http://ufdc.ufl.edu/UFE0024719

17. Hrouga, Mustapha. Optimisation de la logistique inverse et planification du désassemblage : Optimization of reverse logistics and disassembly planning.

Degree: Docteur es, Optimisation et Sûreté des Systèmes, 2016, Troyes

URL: http://www.theses.fr/2016TROY0021

►

Dans cette thèse, nous traitons essentiellement des problèmes de lot sizing en désassemblage avec une structure de produits à désassembler à deux niveaux sans composants… (more)

▼

Dans cette thèse, nous traitons essentiellement des problèmes de lot sizing en désassemblage avec une structure de produits à désassembler à deux niveaux sans composants communs. Nous traitons deux problèmes différents. Dans le premier problème, nous considérons un seul produit et la contribution porte sur le développement de deux modèles de programmation en nombres entiers. Le premier modèle est considéré sans ventes perdues où toutes les demandes doivent être satisfaites, et le deuxième est considéré avec ventes perdues où les demandes peuvent ne pas être satisfaites. Pour la résolution de ce problème, nous développons d’abord une approche analytique permettant de calculer les stocks de surplus (avant la résolution du problème) à la fin de l’horizon de planification. Ensuite, nous adaptons trois heuristiques connues pour leurs performances et largement utilisées dans le problème lot sizing en production « Silver Meal, Part Period Balancing et Least Unit Cost ». Dans le deuxième problème, nous considérons plusieurs produits avec contrainte de capacité et la contribution porte sur l’extension des deux modèles précédents. Le premier est également considéré sans ventes perdues et le deuxième avec ventes perdues. En ce qui concerne la résolution de ce problème et compte tenu de sa complexité, un algorithme génétique est d’abord proposé. Ensuite, afin d’améliorer cet algorithme, nous intégrons une heuristique Fix-and-Optimize dans ce dernier tout en proposant une approche hybride. Finalement, des tests sont effectués sur de nombreuses instances de la littérature afin de montrer l’efficacité et les limites de chaque approche de résolution

In this thesis, we mainly deal with lot sizing problems by disassembling with a structure of products to disassemble with two levels and without commonality components. We treat two different problems. In the first problem, we consider a single product whose contribution focuses on developing the two programming models integers. The first model is considered without lost sales where all demands must be satisfied, and the second one is considered with lost sales where demands may not be met. To solve this problem, we first develop an analytical approach to calculate the surplus stocks (before solving the problem) at the end of the planning horizon. Then we adapt three heuristics known for their performance and widely used in the lot sizing problem of production "Silver Meal, Part Period Balancing and Least Unit Cost". In the second problem, we consider a number of products with capacity constraint, and the contribution relates to the extension of the two previous models. The first is considered without lost sales and the second with lost sales. Regarding the resolution of this problem and given its complexity, a genetic algorithm is first proposed. Then, to improve this algorithm, we integrate a Fix-and-Optimize heuristic in the latter while offering a hybrid approach. Finally, various tests are performed on different literature instances to demonstrate the effectiveness and…

Advisors/Committee Members: Amodeo, Lionel (thesis director), Godichaud, Matthieu (thesis director).

Subjects/Keywords: Distribution logistique; Planification; Optimisation mathématique; Recherche opérationnelle; Programmation heuristique; Programmation linéaire; Logistic distribution; Planning; Mathematical optimization; Operations research; Heuristic programming; Linear programming; 658.5

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Hrouga, M. (2016). Optimisation de la logistique inverse et planification du désassemblage : Optimization of reverse logistics and disassembly planning. (Doctoral Dissertation). Troyes. Retrieved from http://www.theses.fr/2016TROY0021

Chicago Manual of Style (16^th Edition):

Hrouga, Mustapha. “Optimisation de la logistique inverse et planification du désassemblage : Optimization of reverse logistics and disassembly planning.” 2016. Doctoral Dissertation, Troyes. Accessed December 07, 2019. http://www.theses.fr/2016TROY0021.

MLA Handbook (7^th Edition):

Hrouga, Mustapha. “Optimisation de la logistique inverse et planification du désassemblage : Optimization of reverse logistics and disassembly planning.” 2016. Web. 07 Dec 2019.

Vancouver:

Hrouga M. Optimisation de la logistique inverse et planification du désassemblage : Optimization of reverse logistics and disassembly planning. [Internet] [Doctoral dissertation]. Troyes; 2016. [cited 2019 Dec 07]. Available from: http://www.theses.fr/2016TROY0021.

Council of Science Editors:

Hrouga M. Optimisation de la logistique inverse et planification du désassemblage : Optimization of reverse logistics and disassembly planning. [Doctoral Dissertation]. Troyes; 2016. Available from: http://www.theses.fr/2016TROY0021

University of Oxford

18. Buerger, Johannes Albert. Fast model predictive control.

Degree: PhD, 2013, University of Oxford

URL: http://ora.ox.ac.uk/objects/uuid:6e296415-f02c-4bc2-b171-3bee80fc081a ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.581321

► This thesis develops efficient optimization methods for Model Predictive Control (MPC) to enable its application to constrained systems with fast and uncertain dynamics. The key… (more)

Subjects/Keywords: 005.116; Calculus of variations and optimal control; Operations research,mathematical programming; Control engineering; robust model predictive control; dynamic programming; active set methods

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Buerger, J. A. (2013). Fast model predictive control. (Doctoral Dissertation). University of Oxford. Retrieved from http://ora.ox.ac.uk/objects/uuid:6e296415-f02c-4bc2-b171-3bee80fc081a ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.581321

Chicago Manual of Style (16^th Edition):

Buerger, Johannes Albert. “Fast model predictive control.” 2013. Doctoral Dissertation, University of Oxford. Accessed December 07, 2019. http://ora.ox.ac.uk/objects/uuid:6e296415-f02c-4bc2-b171-3bee80fc081a ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.581321.

MLA Handbook (7^th Edition):

Buerger, Johannes Albert. “Fast model predictive control.” 2013. Web. 07 Dec 2019.

Vancouver:

Buerger JA. Fast model predictive control. [Internet] [Doctoral dissertation]. University of Oxford; 2013. [cited 2019 Dec 07]. Available from: http://ora.ox.ac.uk/objects/uuid:6e296415-f02c-4bc2-b171-3bee80fc081a ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.581321.

Council of Science Editors:

Buerger JA. Fast model predictive control. [Doctoral Dissertation]. University of Oxford; 2013. Available from: http://ora.ox.ac.uk/objects/uuid:6e296415-f02c-4bc2-b171-3bee80fc081a ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.581321

University of Florida

19. Garg,Nitish. A Polyhedral Study of Integer Bilinear Covering Sets.

Degree: MS, Industrial and Systems Engineering, 2011, University of Florida

URL: http://ufdc.ufl.edu/UFE0042952

► We study the polyhedral structure of an integer bilinear covering set, which appears in the formulation of various practical problems including staff scheduling. Starting from… (more)

Subjects/Keywords: Algorithms; Integers; Linear programming; Mathematical models; Mathematical variables; Mathematics; Matrices; Objective functions; Operations research; Optimal solutions; bilinear – convex – facet – hull – integer – nonconvex – optimzatioin – polyhedral – relaxations

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Garg,Nitish. (2011). A Polyhedral Study of Integer Bilinear Covering Sets. (Masters Thesis). University of Florida. Retrieved from http://ufdc.ufl.edu/UFE0042952

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Chicago Manual of Style (16^th Edition):

Garg,Nitish. “A Polyhedral Study of Integer Bilinear Covering Sets.” 2011. Masters Thesis, University of Florida. Accessed December 07, 2019. http://ufdc.ufl.edu/UFE0042952.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

MLA Handbook (7^th Edition):

Garg,Nitish. “A Polyhedral Study of Integer Bilinear Covering Sets.” 2011. Web. 07 Dec 2019.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Vancouver:

Garg,Nitish. A Polyhedral Study of Integer Bilinear Covering Sets. [Internet] [Masters thesis]. University of Florida; 2011. [cited 2019 Dec 07]. Available from: http://ufdc.ufl.edu/UFE0042952.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Council of Science Editors:

Garg,Nitish. A Polyhedral Study of Integer Bilinear Covering Sets. [Masters Thesis]. University of Florida; 2011. Available from: http://ufdc.ufl.edu/UFE0042952

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Iowa State University

20. Millham, Charles Blanchard. Stochastic linear programming.

Degree: 1962, Iowa State University

URL: https://lib.dr.iastate.edu/rtd/2104

Subjects/Keywords: Mathematics; Operations Research; Linear programming; Mathematical Economics; Economics; Mathematics; Operational Research

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Millham, C. B. (1962). Stochastic linear programming. (Thesis). Iowa State University. Retrieved from https://lib.dr.iastate.edu/rtd/2104

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Millham, Charles Blanchard. “Stochastic linear programming.” 1962. Thesis, Iowa State University. Accessed December 07, 2019. https://lib.dr.iastate.edu/rtd/2104.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Millham, Charles Blanchard. “Stochastic linear programming.” 1962. Web. 07 Dec 2019.

Vancouver:

Millham CB. Stochastic linear programming. [Internet] [Thesis]. Iowa State University; 1962. [cited 2019 Dec 07]. Available from: https://lib.dr.iastate.edu/rtd/2104.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Millham CB. Stochastic linear programming. [Thesis]. Iowa State University; 1962. Available from: https://lib.dr.iastate.edu/rtd/2104

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Columbia University

21. Xiao, Di. Non-Bayesian Inference and Prediction.

Degree: 2017, Columbia University

URL: https://doi.org/10.7916/D8Q81RMV

► In this thesis, we first propose a coherent inference model that is obtained by distorting the prior density in Bayes' rule and replacing the likelihood… (more)

Subjects/Keywords: Operations research; Mathematical statistics; Industrial engineering

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Xiao, D. (2017). Non-Bayesian Inference and Prediction. (Doctoral Dissertation). Columbia University. Retrieved from https://doi.org/10.7916/D8Q81RMV

Chicago Manual of Style (16^th Edition):

Xiao, Di. “Non-Bayesian Inference and Prediction.” 2017. Doctoral Dissertation, Columbia University. Accessed December 07, 2019. https://doi.org/10.7916/D8Q81RMV.

MLA Handbook (7^th Edition):

Xiao, Di. “Non-Bayesian Inference and Prediction.” 2017. Web. 07 Dec 2019.

Vancouver:

Xiao D. Non-Bayesian Inference and Prediction. [Internet] [Doctoral dissertation]. Columbia University; 2017. [cited 2019 Dec 07]. Available from: https://doi.org/10.7916/D8Q81RMV.

Council of Science Editors:

Xiao D. Non-Bayesian Inference and Prediction. [Doctoral Dissertation]. Columbia University; 2017. Available from: https://doi.org/10.7916/D8Q81RMV

Columbia University

22. Qiu, Zhen. Approximation Algorithms for Demand-Response Contract Execution and Coflow Scheduling.

Degree: 2016, Columbia University

URL: https://doi.org/10.7916/D8FQ9WVP

► Solving operations research problems with approximation algorithms has been an important topic since approximation algorithm can provide near-optimal solutions to NP-hard problems while achieving computational… (more)

▼ Solving operations research problems with approximation algorithms has been an important topic since approximation algorithm can provide near-optimal solutions to NP-hard problems while achieving computational efficiency. In this thesis, we consider two different problems in the field of optimal control and scheduling theory respectively and develop efficient approximation algorithms for those problems with performance guarantee. Chapter 2 presents approximation algorithms for solving the optimal execution problem for demand-response contract in electricity markets. Demand side participation is essential for achieving real-time energy balance in today's electricity grid. Demand-response contracts, where an electric utility company buys options from consumers to reduce their load in the future, are an important tool to increase demand-side participation. In this chapter, we consider the operational problem of optimally exercising the available contracts over the planning horizon such that the total cost to satisfy the demand is minimized. In particular, we consider the objective of minimizing the sum of the expected ℓ_β-norm of the load deviations from given thresholds and the contract execution costs over the planning horizon. For β=∞, this reduces to minimizing the expected peak load. The peak load provides a good proxy to the total cost of the utility as spikes in electricity prices are observed only in peak load periods. We present a data driven near-optimal algorithm for the contract execution problem. Our algorithm is a sample average approximation (SAA) based dynamic program over a multi-period planning horizon. We provide a sample complexity bound on the number of demand samples required to compute a (1+ε)-approximate policy for any ε>0. Our SAA algorithm is quite general and we show that it can be adapted to quite general demand models including Markovian demands and objective functions. For the special case where the demand in each period is i.i.d., we show that a static solution is optimal for the dynamic problem. We also conduct a numerical study to compare the performance of our SAA based DP algorithm. Our numerical experiments show that we can achieve a (1+ε)-approximation in significantly smaller numbers of samples than what is implied by the theoretical bounds. Moreover, the structure of the approximate policy also shows that it can be well approximated by a simple affine function of the state. In Chapter 3, we study the NP-hard coflow scheduling problem and develop a polynomial-time approximation algorithm for the problem with constant approximation ratio. Communications in datacenter jobs (such as the shuffle operations in MapReduce applications) often involve many parallel flows, which may be processed simultaneously. This highly parallel structure presents new scheduling challenges in optimizing job-level performance objectives in data centers. Chowdhury and Stoica [13] introduced the coflow abstraction to capture these communication patterns, and recently Chowdhury et al. [15]…

Subjects/Keywords: Approximation algorithms; Mathematical optimization; Scheduling; Operations research

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Qiu, Z. (2016). Approximation Algorithms for Demand-Response Contract Execution and Coflow Scheduling. (Doctoral Dissertation). Columbia University. Retrieved from https://doi.org/10.7916/D8FQ9WVP

Chicago Manual of Style (16^th Edition):

Qiu, Zhen. “Approximation Algorithms for Demand-Response Contract Execution and Coflow Scheduling.” 2016. Doctoral Dissertation, Columbia University. Accessed December 07, 2019. https://doi.org/10.7916/D8FQ9WVP.

MLA Handbook (7^th Edition):

Qiu, Zhen. “Approximation Algorithms for Demand-Response Contract Execution and Coflow Scheduling.” 2016. Web. 07 Dec 2019.

Vancouver:

Qiu Z. Approximation Algorithms for Demand-Response Contract Execution and Coflow Scheduling. [Internet] [Doctoral dissertation]. Columbia University; 2016. [cited 2019 Dec 07]. Available from: https://doi.org/10.7916/D8FQ9WVP.

Council of Science Editors:

Qiu Z. Approximation Algorithms for Demand-Response Contract Execution and Coflow Scheduling. [Doctoral Dissertation]. Columbia University; 2016. Available from: https://doi.org/10.7916/D8FQ9WVP

Columbia University

23. Feigenbaum, Itai Izhak. Optimization in Strategic Environments.

Degree: 2016, Columbia University

URL: https://doi.org/10.7916/D8377916

► This work considers the problem faced by a decision maker (planner) trying to optimize over incomplete data. The missing data is privately held by agents… (more)

▼ This work considers the problem faced by a decision maker (planner) trying to optimize over incomplete data. The missing data is privately held by agents whose objectives are dierent from the planner's, and who can falsely report it in order to advance their objectives. The goal is to design optimization mechanisms (algorithms) that achieve "good" results when agents' reports follow a game-theoretic equilibrium. In the first part of this work, the goal is to design mechanisms that provide a small worst-case approximation ratio (guarantee a large fraction of the optimal value in all instances) at equilibrium. The emphasis is on strategyproof mechanisms|where truthfulness is a dominant strategy equilibrium|and on the approximation ratio at that equilibrium. Two problems are considered|variants of knapsack and facility location problems. In the knapsack problem, items are privately owned by agents, who can hide items or report fake ones; each agent's utility equals the total value of their own items included in the knapsack, while the planner wishes to choose the items that maximize the sum of utilities. In the facility location problem, agents have private linear single sinked/peaked preferences regarding the location of a facility on an interval, while the planner wishes to locate the facility in a way that maximizes one of several objectives. A variety of mechanisms and lower bounds are provided for these problems. The second part of this work explores the problem of reassigning students to schools. Students have privately known preferences over the schools. After an initial assignment is made, the students' preferences change, get reported again, and a reassignment must be obtained. The goal is to design a reassignment mechanism that incentivizes truthfulness, provides high student welfare, transfers relatively few students from their initial assignment, and respects student priorities at schools. The class of mechanisms considered is permuted lottery deferred acceptance (PLDA) mechanisms, which is a natural class of mechanisms based on permuting the lottery numbers students initially draw to decide the initial assignment. Both theoretical and experimental evidence is provided to support the use of a PLDA mechanism called reversed lottery deferred acceptance (RLDA). The evidence suggests that under some conditions, all PLDA mechanisms generate roughly equal welfare, and that RLDA minimizes transfers among PLDA mechanisms.

Subjects/Keywords: Mathematical optimization; Algorithms; Planners; Operations research

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Feigenbaum, I. I. (2016). Optimization in Strategic Environments. (Doctoral Dissertation). Columbia University. Retrieved from https://doi.org/10.7916/D8377916

Chicago Manual of Style (16^th Edition):

Feigenbaum, Itai Izhak. “Optimization in Strategic Environments.” 2016. Doctoral Dissertation, Columbia University. Accessed December 07, 2019. https://doi.org/10.7916/D8377916.

MLA Handbook (7^th Edition):

Feigenbaum, Itai Izhak. “Optimization in Strategic Environments.” 2016. Web. 07 Dec 2019.

Vancouver:

Feigenbaum II. Optimization in Strategic Environments. [Internet] [Doctoral dissertation]. Columbia University; 2016. [cited 2019 Dec 07]. Available from: https://doi.org/10.7916/D8377916.

Council of Science Editors:

Feigenbaum II. Optimization in Strategic Environments. [Doctoral Dissertation]. Columbia University; 2016. Available from: https://doi.org/10.7916/D8377916

ETH Zürich

24. Laumanns, Marco. Analysis and applications of evolutionary multiobjective optimization algorithms.

Degree: 2003, ETH Zürich

URL: http://hdl.handle.net/20.500.11850/147771

Subjects/Keywords: MEHRZIELOPTIMIERUNG (OPERATIONS RESEARCH); EVOLUTIONÄRE ALGORITHMEN (MATHEMATISCHE OPTIMIERUNG); MULTIOBJECTIVE PROGRAMMING (OPERATIONS RESEARCH); EVOLUTIONARY ALGORITHMS (MATHEMATICAL PROGRAMMING); info:eu-repo/classification/ddc/510; Mathematics

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Laumanns, M. (2003). Analysis and applications of evolutionary multiobjective optimization algorithms. (Doctoral Dissertation). ETH Zürich. Retrieved from http://hdl.handle.net/20.500.11850/147771

Chicago Manual of Style (16^th Edition):

Laumanns, Marco. “Analysis and applications of evolutionary multiobjective optimization algorithms.” 2003. Doctoral Dissertation, ETH Zürich. Accessed December 07, 2019. http://hdl.handle.net/20.500.11850/147771.

MLA Handbook (7^th Edition):

Laumanns, Marco. “Analysis and applications of evolutionary multiobjective optimization algorithms.” 2003. Web. 07 Dec 2019.

Vancouver:

Laumanns M. Analysis and applications of evolutionary multiobjective optimization algorithms. [Internet] [Doctoral dissertation]. ETH Zürich; 2003. [cited 2019 Dec 07]. Available from: http://hdl.handle.net/20.500.11850/147771.

Council of Science Editors:

Laumanns M. Analysis and applications of evolutionary multiobjective optimization algorithms. [Doctoral Dissertation]. ETH Zürich; 2003. Available from: http://hdl.handle.net/20.500.11850/147771

Colorado School of Mines

25. Tarvin, David Antony. Benders decomposition : an integer-programming extension with further computational enhancements.

Degree: PhD, Economics and Business, 2007, Colorado School of Mines

URL: http://hdl.handle.net/11124/505

► We extend Benders decomposition in two ways. We begin by introducing a new integer Benders decomposition algorithm (IBDA) that solves pure integer programs (IPs). IBDA… (more)

Subjects/Keywords: Integer Programming; Explicit Enumeration; Benders Decomposition; Integer programming; Programming (Mathematics); Decomposition (Mathematics); Stochastic programming; Mathematical optimization; Operations research

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Tarvin, D. A. (2007). Benders decomposition : an integer-programming extension with further computational enhancements. (Doctoral Dissertation). Colorado School of Mines. Retrieved from http://hdl.handle.net/11124/505

Chicago Manual of Style (16^th Edition):

Tarvin, David Antony. “Benders decomposition : an integer-programming extension with further computational enhancements.” 2007. Doctoral Dissertation, Colorado School of Mines. Accessed December 07, 2019. http://hdl.handle.net/11124/505.

MLA Handbook (7^th Edition):

Tarvin, David Antony. “Benders decomposition : an integer-programming extension with further computational enhancements.” 2007. Web. 07 Dec 2019.

Vancouver:

Tarvin DA. Benders decomposition : an integer-programming extension with further computational enhancements. [Internet] [Doctoral dissertation]. Colorado School of Mines; 2007. [cited 2019 Dec 07]. Available from: http://hdl.handle.net/11124/505.

Council of Science Editors:

Tarvin DA. Benders decomposition : an integer-programming extension with further computational enhancements. [Doctoral Dissertation]. Colorado School of Mines; 2007. Available from: http://hdl.handle.net/11124/505

The Ohio State University

26. Goel, Saumya. Dynamic Probabilistic Lot-Sizing with Service Level Constraints.

Degree: MS, Industrial and Systems Engineering, 2011, The Ohio State University

URL: http://rave.ohiolink.edu/etdc/view?acc_num=osu1306865399

► We consider inventory control problems with stochastic demand in which a specific service level must be met. We assume that demand and cost distributions over… (more)

Subjects/Keywords: Industrial Engineering; Operations Research; Stochastic programming; mixed integer programming; large scale programming; production planning

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Goel, S. (2011). Dynamic Probabilistic Lot-Sizing with Service Level Constraints. (Masters Thesis). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1306865399

Chicago Manual of Style (16^th Edition):

Goel, Saumya. “Dynamic Probabilistic Lot-Sizing with Service Level Constraints.” 2011. Masters Thesis, The Ohio State University. Accessed December 07, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=osu1306865399.

MLA Handbook (7^th Edition):

Goel, Saumya. “Dynamic Probabilistic Lot-Sizing with Service Level Constraints.” 2011. Web. 07 Dec 2019.

Vancouver:

Goel S. Dynamic Probabilistic Lot-Sizing with Service Level Constraints. [Internet] [Masters thesis]. The Ohio State University; 2011. [cited 2019 Dec 07]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1306865399.

Council of Science Editors:

Goel S. Dynamic Probabilistic Lot-Sizing with Service Level Constraints. [Masters Thesis]. The Ohio State University; 2011. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1306865399

ETH Zürich

27. Lüthi, Hans-Jakob. Ein Algorithmus zur Approximation von Lösungen des nichtlinearen Komplementaritätsproblems.

Degree: 1974, ETH Zürich

URL: http://hdl.handle.net/20.500.11850/135497

Subjects/Keywords: NICHTLINEARE OPTIMIERUNG (OPERATIONS RESEARCH); NUMERISCHE METHODEN IN DER NICHTLINEAREN OPTIMIERUNG (OPERATIONS RESEARCH); KOMPLEMENTARITÄTSPROBLEME (MATHEMATISCHE OPTIMIERUNG); NONLINEAR PROGRAMMING (OPERATIONS RESEARCH); NUMERICAL METHODS IN NONLINEAR PROGRAMMING (OPERATIONS RESEARCH); COMPLEMENTARITY PROBLEMS (MATHEMATICAL PROGRAMMING); info:eu-repo/classification/ddc/510; Mathematics

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Lüthi, H. (1974). Ein Algorithmus zur Approximation von Lösungen des nichtlinearen Komplementaritätsproblems. (Doctoral Dissertation). ETH Zürich. Retrieved from http://hdl.handle.net/20.500.11850/135497

Chicago Manual of Style (16^th Edition):

Lüthi, Hans-Jakob. “Ein Algorithmus zur Approximation von Lösungen des nichtlinearen Komplementaritätsproblems.” 1974. Doctoral Dissertation, ETH Zürich. Accessed December 07, 2019. http://hdl.handle.net/20.500.11850/135497.

MLA Handbook (7^th Edition):

Lüthi, Hans-Jakob. “Ein Algorithmus zur Approximation von Lösungen des nichtlinearen Komplementaritätsproblems.” 1974. Web. 07 Dec 2019.

Vancouver:

Lüthi H. Ein Algorithmus zur Approximation von Lösungen des nichtlinearen Komplementaritätsproblems. [Internet] [Doctoral dissertation]. ETH Zürich; 1974. [cited 2019 Dec 07]. Available from: http://hdl.handle.net/20.500.11850/135497.

Council of Science Editors:

Lüthi H. Ein Algorithmus zur Approximation von Lösungen des nichtlinearen Komplementaritätsproblems. [Doctoral Dissertation]. ETH Zürich; 1974. Available from: http://hdl.handle.net/20.500.11850/135497

University of Florida

28. Tang, Yen Thi. A Class of Algorithms for Mixed-Integer Bilevel Min-Max Optimization Problems with Applications.

Degree: PhD, Industrial and Systems Engineering, 2014, University of Florida

URL: http://ufdc.ufl.edu/UFE0046155

► In this dissertation, we construct algorithms to solve a class of mixed-integer bilevel min-max optimization problems, with applications to knapsack, clique, and evacuation problems. These… (more)

▼ In this dissertation, we construct algorithms to solve a class of mixed-integer bilevel min-max optimization problems, with applications to knapsack, clique, and evacuation problems. These optimization problems involve two players, a leader and a follower, who play a Stackelberg game. We investigate first a problem in which the leader seeks to minimize, over a set of discrete variables, the maximum objective that the follower can achieve. We study bilevel min-max programs that can be used to obtain lower and upper bounds on the optimal objective value of the problem. We then develop a class of algorithms that finitely terminate with an optimal solution when the leader variables take binary values. We report the results of a computational study aimed at evaluating the quality of our algorithms on bilevel knapsack and bilevel clique instances. We study an application of the bilevel min-max optimization problem, which we call multilevel evacuation problem. This problem seeks to construct arcs in a network to minimize the cost needed to evacuate a population in the face of disaster, assuming that "nature'' is an intelligent agent. We consider four variants of this problem, corresponding to assumptions where the disaster either is or is not restricted to a set of fixed locations, and where the number of people to be evacuated from an area affected by the disaster either does or does not depend on the distance from that area to the epicenter of the disaster. We formulate this problem as a three-level optimization problem. We then reformulate it into a bilevel model of a form similar to that studied in the first part of this dissertation. We extend the methodology introduced in the first part of this dissertation to construct a finitely convergent algorithm to solve the multilevel evacuation problem. We present numerical results last. ( en ) Advisors/Committee Members: RICHARD,JEAN-PHILIPPE P (committee chair), GEUNES,JOSEPH PATRICK (committee member), YIN,YAFENG (committee member).

Subjects/Keywords: Algorithms; Boxes; Disasters; Emergency evacuations; Integers; Iterative solutions; Linear programming; Mathematical models; Operations research; Optimal solutions; bilevel – evacuation – interdiction – mixed-integer – network – optimization

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Tang, Y. T. (2014). A Class of Algorithms for Mixed-Integer Bilevel Min-Max Optimization Problems with Applications. (Doctoral Dissertation). University of Florida. Retrieved from http://ufdc.ufl.edu/UFE0046155

Chicago Manual of Style (16^th Edition):

Tang, Yen Thi. “A Class of Algorithms for Mixed-Integer Bilevel Min-Max Optimization Problems with Applications.” 2014. Doctoral Dissertation, University of Florida. Accessed December 07, 2019. http://ufdc.ufl.edu/UFE0046155.

MLA Handbook (7^th Edition):

Tang, Yen Thi. “A Class of Algorithms for Mixed-Integer Bilevel Min-Max Optimization Problems with Applications.” 2014. Web. 07 Dec 2019.

Vancouver:

Tang YT. A Class of Algorithms for Mixed-Integer Bilevel Min-Max Optimization Problems with Applications. [Internet] [Doctoral dissertation]. University of Florida; 2014. [cited 2019 Dec 07]. Available from: http://ufdc.ufl.edu/UFE0046155.

Council of Science Editors:

Tang YT. A Class of Algorithms for Mixed-Integer Bilevel Min-Max Optimization Problems with Applications. [Doctoral Dissertation]. University of Florida; 2014. Available from: http://ufdc.ufl.edu/UFE0046155

University of Oxford

29. Pradelski, Bary S. R. Distributed dynamics and learning in games.

Degree: PhD, 2015, University of Oxford

URL: http://ora.ox.ac.uk/objects/uuid:37185594-633c-4d78-a408-dfe4978bacb7 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.658518

► In this thesis we study decentralized dynamics for non-cooperative and cooperative games. The dynamics are behaviorally motivated and assume that very little information is available… (more)

Subjects/Keywords: 519.3; Mathematics; Game theory,economics,social and behavioral sciences (mathematics); Operations research,mathematical programming; Social influence; Economics; Microeconomics; game theory; bounded rationality; decentralized markets

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Pradelski, B. S. R. (2015). Distributed dynamics and learning in games. (Doctoral Dissertation). University of Oxford. Retrieved from http://ora.ox.ac.uk/objects/uuid:37185594-633c-4d78-a408-dfe4978bacb7 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.658518

Chicago Manual of Style (16^th Edition):

Pradelski, Bary S R. “Distributed dynamics and learning in games.” 2015. Doctoral Dissertation, University of Oxford. Accessed December 07, 2019. http://ora.ox.ac.uk/objects/uuid:37185594-633c-4d78-a408-dfe4978bacb7 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.658518.

MLA Handbook (7^th Edition):

Pradelski, Bary S R. “Distributed dynamics and learning in games.” 2015. Web. 07 Dec 2019.

Vancouver:

Pradelski BSR. Distributed dynamics and learning in games. [Internet] [Doctoral dissertation]. University of Oxford; 2015. [cited 2019 Dec 07]. Available from: http://ora.ox.ac.uk/objects/uuid:37185594-633c-4d78-a408-dfe4978bacb7 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.658518.

Council of Science Editors:

Pradelski BSR. Distributed dynamics and learning in games. [Doctoral Dissertation]. University of Oxford; 2015. Available from: http://ora.ox.ac.uk/objects/uuid:37185594-633c-4d78-a408-dfe4978bacb7 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.658518

RMIT University

30. Minas, J. Operations research for decision support in wildfire management.

Degree: 2013, RMIT University

URL: http://researchbank.rmit.edu.au/view/rmit:160407

► The February 2009 â€˜Black Saturdayâ€™ bushfires resulted in 173 fatalities, caused AUD$4 billion in damage and provided a stark reminder of the destructive potential of… (more)

Subjects/Keywords: Fields of Research; Operations research; wildfire; bushfire; integer programming; spatial optimisation

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Minas, J. (2013). Operations research for decision support in wildfire management. (Thesis). RMIT University. Retrieved from http://researchbank.rmit.edu.au/view/rmit:160407

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Minas, J. “Operations research for decision support in wildfire management.” 2013. Thesis, RMIT University. Accessed December 07, 2019. http://researchbank.rmit.edu.au/view/rmit:160407.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Minas, J. “Operations research for decision support in wildfire management.” 2013. Web. 07 Dec 2019.

Vancouver:

Minas J. Operations research for decision support in wildfire management. [Internet] [Thesis]. RMIT University; 2013. [cited 2019 Dec 07]. Available from: http://researchbank.rmit.edu.au/view/rmit:160407.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Minas J. Operations research for decision support in wildfire management. [Thesis]. RMIT University; 2013. Available from: http://researchbank.rmit.edu.au/view/rmit:160407

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

		in
And / Or
		in
And / Or
		in
And / Or
		in

Open Access Theses and Dissertations