Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(Operations research mathematical programming). Showing records 1 – 30 of 83951 total matches.

[1] [2] [3] [4] [5] … [2799]

Search Limiters

Last 2 Years | English Only

Languages

Country

▼ Search Limiters


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)

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

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 (7th 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

 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)

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

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 (7th 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

 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)

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

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 (7th 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

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 (7th 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

 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)

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

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 (7th 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

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 (7th 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

  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)

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

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 (7th 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

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 (7th 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

 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)

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

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 (7th 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

 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)

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

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 (7th 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

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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 (7th 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

 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)

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

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 (7th 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

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

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 (7th 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

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

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 (7th 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

 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)

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

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 (7th 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

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 (7th 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

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)

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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 (7th 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

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 (7th 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

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 (7th 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

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

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 (7th 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

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 (7th 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

 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)

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

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 (7th 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

 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)

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

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 (7th 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

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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 (7th 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

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 (7th 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

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 (7th 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

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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 (7th 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

 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)

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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 (7th 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

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 (7th 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

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 (7th 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

[1] [2] [3] [4] [5] … [2799]

.