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:(Programming Mathematics ). Showing records 1 – 30 of 556 total matches.

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

Search Limiters

Last 2 Years | English Only

Degrees

Levels

Languages

Country

▼ Search Limiters


Oregon State University

1. Noonchester, Howard Basil. Study of effective algorithms for solving polynomial algebraic equations in one unknown.

Degree: MS, Mathematics, 1968, Oregon State University

 This paper makes available practical algorithms and their associated FORTRAN IV computer programs for finding the roots of polynomial equations. The purpose of this paper… (more)

Subjects/Keywords: Programming (Mathematics)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Noonchester, H. B. (1968). Study of effective algorithms for solving polynomial algebraic equations in one unknown. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/46744

Chicago Manual of Style (16th Edition):

Noonchester, Howard Basil. “Study of effective algorithms for solving polynomial algebraic equations in one unknown.” 1968. Masters Thesis, Oregon State University. Accessed April 13, 2021. http://hdl.handle.net/1957/46744.

MLA Handbook (7th Edition):

Noonchester, Howard Basil. “Study of effective algorithms for solving polynomial algebraic equations in one unknown.” 1968. Web. 13 Apr 2021.

Vancouver:

Noonchester HB. Study of effective algorithms for solving polynomial algebraic equations in one unknown. [Internet] [Masters thesis]. Oregon State University; 1968. [cited 2021 Apr 13]. Available from: http://hdl.handle.net/1957/46744.

Council of Science Editors:

Noonchester HB. Study of effective algorithms for solving polynomial algebraic equations in one unknown. [Masters Thesis]. Oregon State University; 1968. Available from: http://hdl.handle.net/1957/46744

2. Bu, Honggang. Scheduling Smart Home Appliances using Goal Programming with Priority.

Degree: 2016, North Dakota State University

 Driven by the advancement of smart electrical grid technologies, automated home energy management systems are being increasingly and extensively studied, developed, and widely accepted. A… (more)

Subjects/Keywords: Home automation; Programming (Mathematics)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bu, H. (2016). Scheduling Smart Home Appliances using Goal Programming with Priority. (Thesis). North Dakota State University. Retrieved from http://hdl.handle.net/10365/28266

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):

Bu, Honggang. “Scheduling Smart Home Appliances using Goal Programming with Priority.” 2016. Thesis, North Dakota State University. Accessed April 13, 2021. http://hdl.handle.net/10365/28266.

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

MLA Handbook (7th Edition):

Bu, Honggang. “Scheduling Smart Home Appliances using Goal Programming with Priority.” 2016. Web. 13 Apr 2021.

Vancouver:

Bu H. Scheduling Smart Home Appliances using Goal Programming with Priority. [Internet] [Thesis]. North Dakota State University; 2016. [cited 2021 Apr 13]. Available from: http://hdl.handle.net/10365/28266.

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

Council of Science Editors:

Bu H. Scheduling Smart Home Appliances using Goal Programming with Priority. [Thesis]. North Dakota State University; 2016. Available from: http://hdl.handle.net/10365/28266

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


Georgia Tech

3. Vaish, Harish. Nonconvex programming with applications to production and location problems.

Degree: PhD, Industrial engineering, 1974, Georgia Tech

Subjects/Keywords: Programming (Mathematics)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Vaish, H. (1974). Nonconvex programming with applications to production and location problems. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/23351

Chicago Manual of Style (16th Edition):

Vaish, Harish. “Nonconvex programming with applications to production and location problems.” 1974. Doctoral Dissertation, Georgia Tech. Accessed April 13, 2021. http://hdl.handle.net/1853/23351.

MLA Handbook (7th Edition):

Vaish, Harish. “Nonconvex programming with applications to production and location problems.” 1974. Web. 13 Apr 2021.

Vancouver:

Vaish H. Nonconvex programming with applications to production and location problems. [Internet] [Doctoral dissertation]. Georgia Tech; 1974. [cited 2021 Apr 13]. Available from: http://hdl.handle.net/1853/23351.

Council of Science Editors:

Vaish H. Nonconvex programming with applications to production and location problems. [Doctoral Dissertation]. Georgia Tech; 1974. Available from: http://hdl.handle.net/1853/23351


Kansas State University

4. Gupta, Pramod Kumar. Method of lagrange multipliers and the Kuhn-Tucker conditions.

Degree: 1973, Kansas State University

Subjects/Keywords: Programming (Mathematics)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gupta, P. K. (1973). Method of lagrange multipliers and the Kuhn-Tucker conditions. (Thesis). Kansas State University. Retrieved from http://hdl.handle.net/2097/8226

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):

Gupta, Pramod Kumar. “Method of lagrange multipliers and the Kuhn-Tucker conditions.” 1973. Thesis, Kansas State University. Accessed April 13, 2021. http://hdl.handle.net/2097/8226.

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

MLA Handbook (7th Edition):

Gupta, Pramod Kumar. “Method of lagrange multipliers and the Kuhn-Tucker conditions.” 1973. Web. 13 Apr 2021.

Vancouver:

Gupta PK. Method of lagrange multipliers and the Kuhn-Tucker conditions. [Internet] [Thesis]. Kansas State University; 1973. [cited 2021 Apr 13]. Available from: http://hdl.handle.net/2097/8226.

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

Council of Science Editors:

Gupta PK. Method of lagrange multipliers and the Kuhn-Tucker conditions. [Thesis]. Kansas State University; 1973. Available from: http://hdl.handle.net/2097/8226

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


University of British Columbia

5. Muir, David Charles William. Duality in convex programming.

Degree: MA- MA, Mathematics, 1966, University of British Columbia

 Problems of minimizing a convex function or maximizing a concave function over a convex set are called convex programming problems. Duality principles relate two problems,… (more)

Subjects/Keywords: Programming (Mathematics)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Muir, D. C. W. (1966). Duality in convex programming. (Masters Thesis). University of British Columbia. Retrieved from http://hdl.handle.net/2429/37031

Chicago Manual of Style (16th Edition):

Muir, David Charles William. “Duality in convex programming.” 1966. Masters Thesis, University of British Columbia. Accessed April 13, 2021. http://hdl.handle.net/2429/37031.

MLA Handbook (7th Edition):

Muir, David Charles William. “Duality in convex programming.” 1966. Web. 13 Apr 2021.

Vancouver:

Muir DCW. Duality in convex programming. [Internet] [Masters thesis]. University of British Columbia; 1966. [cited 2021 Apr 13]. Available from: http://hdl.handle.net/2429/37031.

Council of Science Editors:

Muir DCW. Duality in convex programming. [Masters Thesis]. University of British Columbia; 1966. Available from: http://hdl.handle.net/2429/37031


University of British Columbia

6. Tsou, C. Anthony. Determination of reservoir daily operation policies by stochastic dynamic programming.

Degree: Master of Applied Science - MASc, Civil Engineering, 1970, University of British Columbia

 Reservoir operation policies are often formulated deterministically on the basis of critical flow hydrology. However, if a dynamic river daily flow forecast system is available… (more)

Subjects/Keywords: Programming (Mathematics)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Tsou, C. A. (1970). Determination of reservoir daily operation policies by stochastic dynamic programming. (Masters Thesis). University of British Columbia. Retrieved from http://hdl.handle.net/2429/34707

Chicago Manual of Style (16th Edition):

Tsou, C Anthony. “Determination of reservoir daily operation policies by stochastic dynamic programming.” 1970. Masters Thesis, University of British Columbia. Accessed April 13, 2021. http://hdl.handle.net/2429/34707.

MLA Handbook (7th Edition):

Tsou, C Anthony. “Determination of reservoir daily operation policies by stochastic dynamic programming.” 1970. Web. 13 Apr 2021.

Vancouver:

Tsou CA. Determination of reservoir daily operation policies by stochastic dynamic programming. [Internet] [Masters thesis]. University of British Columbia; 1970. [cited 2021 Apr 13]. Available from: http://hdl.handle.net/2429/34707.

Council of Science Editors:

Tsou CA. Determination of reservoir daily operation policies by stochastic dynamic programming. [Masters Thesis]. University of British Columbia; 1970. Available from: http://hdl.handle.net/2429/34707


Colorado School of Mines

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

Degree: PhD, Economics and Business, 2014, 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. (2014). 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.” 2014. Doctoral Dissertation, Colorado School of Mines. Accessed April 13, 2021. http://hdl.handle.net/11124/505.

MLA Handbook (7th Edition):

Tarvin, David Antony. “Benders decomposition: an integer-programming extension with further computational enhancements.” 2014. Web. 13 Apr 2021.

Vancouver:

Tarvin DA. Benders decomposition: an integer-programming extension with further computational enhancements. [Internet] [Doctoral dissertation]. Colorado School of Mines; 2014. [cited 2021 Apr 13]. 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; 2014. Available from: http://hdl.handle.net/11124/505


University of Waterloo

8. Sremac, Stefan. Error Bounds and Singularity Degree in Semidefinite Programming.

Degree: 2020, University of Waterloo

 An important process in optimization is to determine the quality of a proposed solution. This usually entails calculation of the distance of a proposed solution… (more)

Subjects/Keywords: semidefinite programming; optimization; error bounds; singularity degree; mathematical programming; convex optimization; conic optimization; Semidefinite programming; Combinatorial optimization; Programming (Mathematics); Convex programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sremac, S. (2020). Error Bounds and Singularity Degree in Semidefinite Programming. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/15583

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):

Sremac, Stefan. “Error Bounds and Singularity Degree in Semidefinite Programming.” 2020. Thesis, University of Waterloo. Accessed April 13, 2021. http://hdl.handle.net/10012/15583.

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

MLA Handbook (7th Edition):

Sremac, Stefan. “Error Bounds and Singularity Degree in Semidefinite Programming.” 2020. Web. 13 Apr 2021.

Vancouver:

Sremac S. Error Bounds and Singularity Degree in Semidefinite Programming. [Internet] [Thesis]. University of Waterloo; 2020. [cited 2021 Apr 13]. Available from: http://hdl.handle.net/10012/15583.

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

Council of Science Editors:

Sremac S. Error Bounds and Singularity Degree in Semidefinite Programming. [Thesis]. University of Waterloo; 2020. Available from: http://hdl.handle.net/10012/15583

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

9. Agrawal, K M. A study on advanced linear programming problems and models; -.

Degree: Mathematics, 2005, Bundelkhand University

None

References p. 113-129

Advisors/Committee Members: Shrivastava, P N.

Subjects/Keywords: Mathematics; linear programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Agrawal, K. M. (2005). A study on advanced linear programming problems and models; -. (Thesis). Bundelkhand University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/10954

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):

Agrawal, K M. “A study on advanced linear programming problems and models; -.” 2005. Thesis, Bundelkhand University. Accessed April 13, 2021. http://shodhganga.inflibnet.ac.in/handle/10603/10954.

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

MLA Handbook (7th Edition):

Agrawal, K M. “A study on advanced linear programming problems and models; -.” 2005. Web. 13 Apr 2021.

Vancouver:

Agrawal KM. A study on advanced linear programming problems and models; -. [Internet] [Thesis]. Bundelkhand University; 2005. [cited 2021 Apr 13]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/10954.

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

Council of Science Editors:

Agrawal KM. A study on advanced linear programming problems and models; -. [Thesis]. Bundelkhand University; 2005. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/10954

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


Boston University

10. Groeneveld, Richard A. Mathematical methods of linear programming.

Degree: MA, Mathematics, 1963, Boston University

 A complex modern society has presented its managers with the need to solve a variety of optimization problems. The desire to run a firm in… (more)

Subjects/Keywords: Computer programming; Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Groeneveld, R. A. (1963). Mathematical methods of linear programming. (Masters Thesis). Boston University. Retrieved from http://hdl.handle.net/2144/29134

Chicago Manual of Style (16th Edition):

Groeneveld, Richard A. “Mathematical methods of linear programming.” 1963. Masters Thesis, Boston University. Accessed April 13, 2021. http://hdl.handle.net/2144/29134.

MLA Handbook (7th Edition):

Groeneveld, Richard A. “Mathematical methods of linear programming.” 1963. Web. 13 Apr 2021.

Vancouver:

Groeneveld RA. Mathematical methods of linear programming. [Internet] [Masters thesis]. Boston University; 1963. [cited 2021 Apr 13]. Available from: http://hdl.handle.net/2144/29134.

Council of Science Editors:

Groeneveld RA. Mathematical methods of linear programming. [Masters Thesis]. Boston University; 1963. Available from: http://hdl.handle.net/2144/29134


Hong Kong University of Science and Technology

11. Zhao, Shenyang. Exhaustive search by division of solution space into subspaces applied to genetic algorithms and genetic programming.

Degree: 2011, Hong Kong University of Science and Technology

 By dividing the solution space into several subspaces and performing search restricted to individual subspace has the advantage that effort in one subspace will not… (more)

Subjects/Keywords: Genetic algorithms ; Programming (Mathematics) ; Evolutionary computation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhao, S. (2011). Exhaustive search by division of solution space into subspaces applied to genetic algorithms and genetic programming. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-7159 ; https://doi.org/10.14711/thesis-b1136617 ; http://repository.ust.hk/ir/bitstream/1783.1-7159/1/th_redirect.html

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):

Zhao, Shenyang. “Exhaustive search by division of solution space into subspaces applied to genetic algorithms and genetic programming.” 2011. Thesis, Hong Kong University of Science and Technology. Accessed April 13, 2021. http://repository.ust.hk/ir/Record/1783.1-7159 ; https://doi.org/10.14711/thesis-b1136617 ; http://repository.ust.hk/ir/bitstream/1783.1-7159/1/th_redirect.html.

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

MLA Handbook (7th Edition):

Zhao, Shenyang. “Exhaustive search by division of solution space into subspaces applied to genetic algorithms and genetic programming.” 2011. Web. 13 Apr 2021.

Vancouver:

Zhao S. Exhaustive search by division of solution space into subspaces applied to genetic algorithms and genetic programming. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2011. [cited 2021 Apr 13]. Available from: http://repository.ust.hk/ir/Record/1783.1-7159 ; https://doi.org/10.14711/thesis-b1136617 ; http://repository.ust.hk/ir/bitstream/1783.1-7159/1/th_redirect.html.

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

Council of Science Editors:

Zhao S. Exhaustive search by division of solution space into subspaces applied to genetic algorithms and genetic programming. [Thesis]. Hong Kong University of Science and Technology; 2011. Available from: http://repository.ust.hk/ir/Record/1783.1-7159 ; https://doi.org/10.14711/thesis-b1136617 ; http://repository.ust.hk/ir/bitstream/1783.1-7159/1/th_redirect.html

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


University of Hawaii

12. Yeh, Chia-lin Cheng. Factor-product model for beef - a quadratic programming formulation.

Degree: PhD, 2009, University of Hawaii

Typescript.

Bibliography: leaves [116]-119.

vi, 119 l maps, tables

This study proposes an operational model for interregional analysis within a quadratic 'programming framework. The specific… (more)

Subjects/Keywords: Beef; Programming (Mathematics)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Yeh, C. C. (2009). Factor-product model for beef - a quadratic programming formulation. (Doctoral Dissertation). University of Hawaii. Retrieved from http://hdl.handle.net/10125/12142

Chicago Manual of Style (16th Edition):

Yeh, Chia-lin Cheng. “Factor-product model for beef - a quadratic programming formulation.” 2009. Doctoral Dissertation, University of Hawaii. Accessed April 13, 2021. http://hdl.handle.net/10125/12142.

MLA Handbook (7th Edition):

Yeh, Chia-lin Cheng. “Factor-product model for beef - a quadratic programming formulation.” 2009. Web. 13 Apr 2021.

Vancouver:

Yeh CC. Factor-product model for beef - a quadratic programming formulation. [Internet] [Doctoral dissertation]. University of Hawaii; 2009. [cited 2021 Apr 13]. Available from: http://hdl.handle.net/10125/12142.

Council of Science Editors:

Yeh CC. Factor-product model for beef - a quadratic programming formulation. [Doctoral Dissertation]. University of Hawaii; 2009. Available from: http://hdl.handle.net/10125/12142


Massey University

13. Evans, David Anthony. An algorithm for generalised convex quadratic programming.

Degree: Master of Agricultural Science, 1965, Massey University

 The purpose of this thesis is to review work carried out by Professor W. V. Candler of the Department of Agricultural Economics and Farm Management… (more)

Subjects/Keywords: Algorithms; Programming (Mathematics)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Evans, D. A. (1965). An algorithm for generalised convex quadratic programming. (Masters Thesis). Massey University. Retrieved from http://hdl.handle.net/10179/11658

Chicago Manual of Style (16th Edition):

Evans, David Anthony. “An algorithm for generalised convex quadratic programming.” 1965. Masters Thesis, Massey University. Accessed April 13, 2021. http://hdl.handle.net/10179/11658.

MLA Handbook (7th Edition):

Evans, David Anthony. “An algorithm for generalised convex quadratic programming.” 1965. Web. 13 Apr 2021.

Vancouver:

Evans DA. An algorithm for generalised convex quadratic programming. [Internet] [Masters thesis]. Massey University; 1965. [cited 2021 Apr 13]. Available from: http://hdl.handle.net/10179/11658.

Council of Science Editors:

Evans DA. An algorithm for generalised convex quadratic programming. [Masters Thesis]. Massey University; 1965. Available from: http://hdl.handle.net/10179/11658


The Ohio State University

14. Nelson, Larry Dean. On a special class of problems in integer linear programming .

Degree: PhD, Graduate School, 1965, The Ohio State University

Subjects/Keywords: Mathematics; Linear programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Nelson, L. D. (1965). On a special class of problems in integer linear programming . (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1486567232687039

Chicago Manual of Style (16th Edition):

Nelson, Larry Dean. “On a special class of problems in integer linear programming .” 1965. Doctoral Dissertation, The Ohio State University. Accessed April 13, 2021. http://rave.ohiolink.edu/etdc/view?acc_num=osu1486567232687039.

MLA Handbook (7th Edition):

Nelson, Larry Dean. “On a special class of problems in integer linear programming .” 1965. Web. 13 Apr 2021.

Vancouver:

Nelson LD. On a special class of problems in integer linear programming . [Internet] [Doctoral dissertation]. The Ohio State University; 1965. [cited 2021 Apr 13]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1486567232687039.

Council of Science Editors:

Nelson LD. On a special class of problems in integer linear programming . [Doctoral Dissertation]. The Ohio State University; 1965. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1486567232687039


The Ohio State University

15. Wang, Paul Tiing. Bandwidth minimization, reducibility decomposition, and triangularization of sparse matrices.

Degree: PhD, Graduate School, 1973, The Ohio State University

Subjects/Keywords: Mathematics; Computer programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wang, P. T. (1973). Bandwidth minimization, reducibility decomposition, and triangularization of sparse matrices. (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu148674672382833

Chicago Manual of Style (16th Edition):

Wang, Paul Tiing. “Bandwidth minimization, reducibility decomposition, and triangularization of sparse matrices.” 1973. Doctoral Dissertation, The Ohio State University. Accessed April 13, 2021. http://rave.ohiolink.edu/etdc/view?acc_num=osu148674672382833.

MLA Handbook (7th Edition):

Wang, Paul Tiing. “Bandwidth minimization, reducibility decomposition, and triangularization of sparse matrices.” 1973. Web. 13 Apr 2021.

Vancouver:

Wang PT. Bandwidth minimization, reducibility decomposition, and triangularization of sparse matrices. [Internet] [Doctoral dissertation]. The Ohio State University; 1973. [cited 2021 Apr 13]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu148674672382833.

Council of Science Editors:

Wang PT. Bandwidth minimization, reducibility decomposition, and triangularization of sparse matrices. [Doctoral Dissertation]. The Ohio State University; 1973. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu148674672382833


Drexel University

16. Sa˘glam, Ümit. Advanced Optimization and Statistical Methods in Portfolio Optimization and Supply Chain Management.

Degree: 2014, Drexel University

This dissertation is on advanced mathematical programming with applications in portfolio optimization and supply chain management. Specifically, this research started with modeling and solving large… (more)

Subjects/Keywords: Business administration; Programming (Mathematics); Business logistics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sa˘glam, . (2014). Advanced Optimization and Statistical Methods in Portfolio Optimization and Supply Chain Management. (Thesis). Drexel University. Retrieved from http://hdl.handle.net/1860/4566

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):

Sa˘glam, Ümit. “Advanced Optimization and Statistical Methods in Portfolio Optimization and Supply Chain Management.” 2014. Thesis, Drexel University. Accessed April 13, 2021. http://hdl.handle.net/1860/4566.

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

MLA Handbook (7th Edition):

Sa˘glam, Ümit. “Advanced Optimization and Statistical Methods in Portfolio Optimization and Supply Chain Management.” 2014. Web. 13 Apr 2021.

Vancouver:

Sa˘glam . Advanced Optimization and Statistical Methods in Portfolio Optimization and Supply Chain Management. [Internet] [Thesis]. Drexel University; 2014. [cited 2021 Apr 13]. Available from: http://hdl.handle.net/1860/4566.

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

Council of Science Editors:

Sa˘glam . Advanced Optimization and Statistical Methods in Portfolio Optimization and Supply Chain Management. [Thesis]. Drexel University; 2014. Available from: http://hdl.handle.net/1860/4566

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


The Ohio State University

17. Brown, Edward A. Algorithms for the hand-computation solution of the transhipment problem and maximum flow in a restricted network .

Degree: PhD, Graduate School, 1959, The Ohio State University

Subjects/Keywords: Mathematics; Linear programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Brown, E. A. (1959). Algorithms for the hand-computation solution of the transhipment problem and maximum flow in a restricted network . (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu148647331033023

Chicago Manual of Style (16th Edition):

Brown, Edward A. “Algorithms for the hand-computation solution of the transhipment problem and maximum flow in a restricted network .” 1959. Doctoral Dissertation, The Ohio State University. Accessed April 13, 2021. http://rave.ohiolink.edu/etdc/view?acc_num=osu148647331033023.

MLA Handbook (7th Edition):

Brown, Edward A. “Algorithms for the hand-computation solution of the transhipment problem and maximum flow in a restricted network .” 1959. Web. 13 Apr 2021.

Vancouver:

Brown EA. Algorithms for the hand-computation solution of the transhipment problem and maximum flow in a restricted network . [Internet] [Doctoral dissertation]. The Ohio State University; 1959. [cited 2021 Apr 13]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu148647331033023.

Council of Science Editors:

Brown EA. Algorithms for the hand-computation solution of the transhipment problem and maximum flow in a restricted network . [Doctoral Dissertation]. The Ohio State University; 1959. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu148647331033023


Texas State University – San Marcos

18. Mukka, Hari Santhosh Manikanta Kumar. Customized Data Compression: Automatically Synthesizing Effective Data Compression and Decompression Algorithms.

Degree: MS, Computer Science, 2014, Texas State University – San Marcos

 With the exponential increase in the amount of data humans are generating, there is a progressive need for developing effective high-speed data compression techniques. However,… (more)

Subjects/Keywords: Genetic; Exhaustive; Computer science; Algorithms; Programming (Mathematics)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mukka, H. S. M. K. (2014). Customized Data Compression: Automatically Synthesizing Effective Data Compression and Decompression Algorithms. (Masters Thesis). Texas State University – San Marcos. Retrieved from https://digital.library.txstate.edu/handle/10877/5379

Chicago Manual of Style (16th Edition):

Mukka, Hari Santhosh Manikanta Kumar. “Customized Data Compression: Automatically Synthesizing Effective Data Compression and Decompression Algorithms.” 2014. Masters Thesis, Texas State University – San Marcos. Accessed April 13, 2021. https://digital.library.txstate.edu/handle/10877/5379.

MLA Handbook (7th Edition):

Mukka, Hari Santhosh Manikanta Kumar. “Customized Data Compression: Automatically Synthesizing Effective Data Compression and Decompression Algorithms.” 2014. Web. 13 Apr 2021.

Vancouver:

Mukka HSMK. Customized Data Compression: Automatically Synthesizing Effective Data Compression and Decompression Algorithms. [Internet] [Masters thesis]. Texas State University – San Marcos; 2014. [cited 2021 Apr 13]. Available from: https://digital.library.txstate.edu/handle/10877/5379.

Council of Science Editors:

Mukka HSMK. Customized Data Compression: Automatically Synthesizing Effective Data Compression and Decompression Algorithms. [Masters Thesis]. Texas State University – San Marcos; 2014. Available from: https://digital.library.txstate.edu/handle/10877/5379


Montana State University

19. Arora, Jagdish Kumar. Dynamic programming using region-limiting strategies for optimization of multidimensional nonlinear processes.

Degree: PhD, College of Engineering, 1971, Montana State University

Subjects/Keywords: Programming (Mathematics); Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Arora, J. K. (1971). Dynamic programming using region-limiting strategies for optimization of multidimensional nonlinear processes. (Doctoral Dissertation). Montana State University. Retrieved from https://scholarworks.montana.edu/xmlui/handle/1/4091

Chicago Manual of Style (16th Edition):

Arora, Jagdish Kumar. “Dynamic programming using region-limiting strategies for optimization of multidimensional nonlinear processes.” 1971. Doctoral Dissertation, Montana State University. Accessed April 13, 2021. https://scholarworks.montana.edu/xmlui/handle/1/4091.

MLA Handbook (7th Edition):

Arora, Jagdish Kumar. “Dynamic programming using region-limiting strategies for optimization of multidimensional nonlinear processes.” 1971. Web. 13 Apr 2021.

Vancouver:

Arora JK. Dynamic programming using region-limiting strategies for optimization of multidimensional nonlinear processes. [Internet] [Doctoral dissertation]. Montana State University; 1971. [cited 2021 Apr 13]. Available from: https://scholarworks.montana.edu/xmlui/handle/1/4091.

Council of Science Editors:

Arora JK. Dynamic programming using region-limiting strategies for optimization of multidimensional nonlinear processes. [Doctoral Dissertation]. Montana State University; 1971. Available from: https://scholarworks.montana.edu/xmlui/handle/1/4091


University of Colorado

20. Gronski, Jessica. Non-Convex Optimization and Applications to Bilinear Programming and Super-Resolution Imaging.

Degree: PhD, Applied Mathematics, 2019, University of Colorado

  Bilinear programs and Phase Retrieval are two instances of nonconvex problems that arise in engineering and physical applications, and both occur with their fundamental… (more)

Subjects/Keywords: nonconvex optimization; bilinear programming; quadratic programming; super-resolution imaging; Applied Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gronski, J. (2019). Non-Convex Optimization and Applications to Bilinear Programming and Super-Resolution Imaging. (Doctoral Dissertation). University of Colorado. Retrieved from https://scholar.colorado.edu/appm_gradetds/142

Chicago Manual of Style (16th Edition):

Gronski, Jessica. “Non-Convex Optimization and Applications to Bilinear Programming and Super-Resolution Imaging.” 2019. Doctoral Dissertation, University of Colorado. Accessed April 13, 2021. https://scholar.colorado.edu/appm_gradetds/142.

MLA Handbook (7th Edition):

Gronski, Jessica. “Non-Convex Optimization and Applications to Bilinear Programming and Super-Resolution Imaging.” 2019. Web. 13 Apr 2021.

Vancouver:

Gronski J. Non-Convex Optimization and Applications to Bilinear Programming and Super-Resolution Imaging. [Internet] [Doctoral dissertation]. University of Colorado; 2019. [cited 2021 Apr 13]. Available from: https://scholar.colorado.edu/appm_gradetds/142.

Council of Science Editors:

Gronski J. Non-Convex Optimization and Applications to Bilinear Programming and Super-Resolution Imaging. [Doctoral Dissertation]. University of Colorado; 2019. Available from: https://scholar.colorado.edu/appm_gradetds/142


Georgia Tech

21. Steffy, Daniel E. Topics in exact precision mathematical programming.

Degree: PhD, Algorithms, Combinatorics, and Optimization, 2011, Georgia Tech

 The focus of this dissertation is the advancement of theory and computation related to exact precision mathematical programming. Optimization software based on floating-point arithmetic can… (more)

Subjects/Keywords: Linear programming; Mixed-integer programming; Exact computation; Symbolic computation; Linear algebra; Programming (Mathematics); Mathematical optimization; Linear programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Steffy, D. E. (2011). Topics in exact precision mathematical programming. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/39639

Chicago Manual of Style (16th Edition):

Steffy, Daniel E. “Topics in exact precision mathematical programming.” 2011. Doctoral Dissertation, Georgia Tech. Accessed April 13, 2021. http://hdl.handle.net/1853/39639.

MLA Handbook (7th Edition):

Steffy, Daniel E. “Topics in exact precision mathematical programming.” 2011. Web. 13 Apr 2021.

Vancouver:

Steffy DE. Topics in exact precision mathematical programming. [Internet] [Doctoral dissertation]. Georgia Tech; 2011. [cited 2021 Apr 13]. Available from: http://hdl.handle.net/1853/39639.

Council of Science Editors:

Steffy DE. Topics in exact precision mathematical programming. [Doctoral Dissertation]. Georgia Tech; 2011. Available from: http://hdl.handle.net/1853/39639


University of California – Berkeley

22. Voroninski, Vladislav. PhaseLift: A Novel Methodology for Phase Retrieval.

Degree: Mathematics, 2013, University of California – Berkeley

 In many physical settings, it is difficult or impossible to measure the phase of a signal. The problem is then to recover a signal from… (more)

Subjects/Keywords: Mathematics; Applied mathematics; convex programming; matrix completion; phase retrieval; random matrices

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Voroninski, V. (2013). PhaseLift: A Novel Methodology for Phase Retrieval. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/5wq5c4bp

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):

Voroninski, Vladislav. “PhaseLift: A Novel Methodology for Phase Retrieval.” 2013. Thesis, University of California – Berkeley. Accessed April 13, 2021. http://www.escholarship.org/uc/item/5wq5c4bp.

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

MLA Handbook (7th Edition):

Voroninski, Vladislav. “PhaseLift: A Novel Methodology for Phase Retrieval.” 2013. Web. 13 Apr 2021.

Vancouver:

Voroninski V. PhaseLift: A Novel Methodology for Phase Retrieval. [Internet] [Thesis]. University of California – Berkeley; 2013. [cited 2021 Apr 13]. Available from: http://www.escholarship.org/uc/item/5wq5c4bp.

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

Council of Science Editors:

Voroninski V. PhaseLift: A Novel Methodology for Phase Retrieval. [Thesis]. University of California – Berkeley; 2013. Available from: http://www.escholarship.org/uc/item/5wq5c4bp

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


University of Arizona

23. Owens, Frank Enos, 1931-. Numerical techniques for fitting nonlinear, implicit equations to empirical data .

Degree: 1967, University of Arizona

Subjects/Keywords: Computer science  – Mathematics.; Programming (Mathematics)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Owens, Frank Enos, 1. (1967). Numerical techniques for fitting nonlinear, implicit equations to empirical data . (Masters Thesis). University of Arizona. Retrieved from http://hdl.handle.net/10150/318605

Chicago Manual of Style (16th Edition):

Owens, Frank Enos, 1931-. “Numerical techniques for fitting nonlinear, implicit equations to empirical data .” 1967. Masters Thesis, University of Arizona. Accessed April 13, 2021. http://hdl.handle.net/10150/318605.

MLA Handbook (7th Edition):

Owens, Frank Enos, 1931-. “Numerical techniques for fitting nonlinear, implicit equations to empirical data .” 1967. Web. 13 Apr 2021.

Vancouver:

Owens, Frank Enos 1. Numerical techniques for fitting nonlinear, implicit equations to empirical data . [Internet] [Masters thesis]. University of Arizona; 1967. [cited 2021 Apr 13]. Available from: http://hdl.handle.net/10150/318605.

Council of Science Editors:

Owens, Frank Enos 1. Numerical techniques for fitting nonlinear, implicit equations to empirical data . [Masters Thesis]. University of Arizona; 1967. Available from: http://hdl.handle.net/10150/318605


University of British Columbia

24. Vaessen, Willem. Covering relaxation methods for solving the zero-one positive polynomial programming problem.

Degree: MS- MSc, Computer Science, 1981, University of British Columbia

 Covering relaxation algorithms were first developed by Granot et al for solving positive 0-1 polynomial programming (PP) problems which maximize a linear objective function in… (more)

Subjects/Keywords: Relaxation methods (Mathematics); Programming (Mathematics)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Vaessen, W. (1981). Covering relaxation methods for solving the zero-one positive polynomial programming problem. (Masters Thesis). University of British Columbia. Retrieved from http://hdl.handle.net/2429/22700

Chicago Manual of Style (16th Edition):

Vaessen, Willem. “Covering relaxation methods for solving the zero-one positive polynomial programming problem.” 1981. Masters Thesis, University of British Columbia. Accessed April 13, 2021. http://hdl.handle.net/2429/22700.

MLA Handbook (7th Edition):

Vaessen, Willem. “Covering relaxation methods for solving the zero-one positive polynomial programming problem.” 1981. Web. 13 Apr 2021.

Vancouver:

Vaessen W. Covering relaxation methods for solving the zero-one positive polynomial programming problem. [Internet] [Masters thesis]. University of British Columbia; 1981. [cited 2021 Apr 13]. Available from: http://hdl.handle.net/2429/22700.

Council of Science Editors:

Vaessen W. Covering relaxation methods for solving the zero-one positive polynomial programming problem. [Masters Thesis]. University of British Columbia; 1981. Available from: http://hdl.handle.net/2429/22700


Western Kentucky University

25. Cheng, Gang. Analyzing and Solving Non-Linear Stochastic Dynamic Models on Non-Periodic Discrete Time Domains.

Degree: MS, Department of Mathematics, 2013, Western Kentucky University

  Stochastic dynamic programming is a recursive method for solving sequential or multistage decision problems. It helps economists and mathematicians construct and solve a huge… (more)

Subjects/Keywords: Dynamic Programming; Stochastic Programming; Stochastic Control Theory; Stochastic Differential Equations; Stochastic Analysis; Martingales (Mathematics); Analysis; Applied Mathematics; Mathematics; Statistics and Probability

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cheng, G. (2013). Analyzing and Solving Non-Linear Stochastic Dynamic Models on Non-Periodic Discrete Time Domains. (Masters Thesis). Western Kentucky University. Retrieved from https://digitalcommons.wku.edu/theses/1236

Chicago Manual of Style (16th Edition):

Cheng, Gang. “Analyzing and Solving Non-Linear Stochastic Dynamic Models on Non-Periodic Discrete Time Domains.” 2013. Masters Thesis, Western Kentucky University. Accessed April 13, 2021. https://digitalcommons.wku.edu/theses/1236.

MLA Handbook (7th Edition):

Cheng, Gang. “Analyzing and Solving Non-Linear Stochastic Dynamic Models on Non-Periodic Discrete Time Domains.” 2013. Web. 13 Apr 2021.

Vancouver:

Cheng G. Analyzing and Solving Non-Linear Stochastic Dynamic Models on Non-Periodic Discrete Time Domains. [Internet] [Masters thesis]. Western Kentucky University; 2013. [cited 2021 Apr 13]. Available from: https://digitalcommons.wku.edu/theses/1236.

Council of Science Editors:

Cheng G. Analyzing and Solving Non-Linear Stochastic Dynamic Models on Non-Periodic Discrete Time Domains. [Masters Thesis]. Western Kentucky University; 2013. Available from: https://digitalcommons.wku.edu/theses/1236


Virginia Commonwealth University

26. Snellings, Christopher. Effective Network Partitioning to Find MIP Solutions to the Train Dispatching Problem.

Degree: MS, Mathematical Sciences, 2013, Virginia Commonwealth University

 Each year the Railway Applications Section (RAS) of the Institution for Operations Research and the Management Sciences (INFORMS) posits a research problem to the world… (more)

Subjects/Keywords: Mixed Integer Programming MIP Train Dispatching Problem TDP Linear Programming LP; Physical Sciences and Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Snellings, C. (2013). Effective Network Partitioning to Find MIP Solutions to the Train Dispatching Problem. (Thesis). Virginia Commonwealth University. Retrieved from https://doi.org/10.25772/SYTB-M126 ; https://scholarscompass.vcu.edu/etd/3285

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):

Snellings, Christopher. “Effective Network Partitioning to Find MIP Solutions to the Train Dispatching Problem.” 2013. Thesis, Virginia Commonwealth University. Accessed April 13, 2021. https://doi.org/10.25772/SYTB-M126 ; https://scholarscompass.vcu.edu/etd/3285.

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

MLA Handbook (7th Edition):

Snellings, Christopher. “Effective Network Partitioning to Find MIP Solutions to the Train Dispatching Problem.” 2013. Web. 13 Apr 2021.

Vancouver:

Snellings C. Effective Network Partitioning to Find MIP Solutions to the Train Dispatching Problem. [Internet] [Thesis]. Virginia Commonwealth University; 2013. [cited 2021 Apr 13]. Available from: https://doi.org/10.25772/SYTB-M126 ; https://scholarscompass.vcu.edu/etd/3285.

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

Council of Science Editors:

Snellings C. Effective Network Partitioning to Find MIP Solutions to the Train Dispatching Problem. [Thesis]. Virginia Commonwealth University; 2013. Available from: https://doi.org/10.25772/SYTB-M126 ; https://scholarscompass.vcu.edu/etd/3285

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


University of Colorado

27. Gronski, Jessica. Non-Convex Optimization and Applications to Bilinear Programming and Super-Resolution Imaging.

Degree: PhD, 2019, University of Colorado

  Bilinear programs and Phase Retrieval are two instances of nonconvex problems that arise in engineering and physical applications, and both occur with their fundamental… (more)

Subjects/Keywords: bilinear programming; non-convex optimization; quadratic programming; super-resolution imaging; Applied Mathematics; Computer Sciences; Optics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gronski, J. (2019). Non-Convex Optimization and Applications to Bilinear Programming and Super-Resolution Imaging. (Doctoral Dissertation). University of Colorado. Retrieved from https://scholar.colorado.edu/appm_gradetds/154

Chicago Manual of Style (16th Edition):

Gronski, Jessica. “Non-Convex Optimization and Applications to Bilinear Programming and Super-Resolution Imaging.” 2019. Doctoral Dissertation, University of Colorado. Accessed April 13, 2021. https://scholar.colorado.edu/appm_gradetds/154.

MLA Handbook (7th Edition):

Gronski, Jessica. “Non-Convex Optimization and Applications to Bilinear Programming and Super-Resolution Imaging.” 2019. Web. 13 Apr 2021.

Vancouver:

Gronski J. Non-Convex Optimization and Applications to Bilinear Programming and Super-Resolution Imaging. [Internet] [Doctoral dissertation]. University of Colorado; 2019. [cited 2021 Apr 13]. Available from: https://scholar.colorado.edu/appm_gradetds/154.

Council of Science Editors:

Gronski J. Non-Convex Optimization and Applications to Bilinear Programming and Super-Resolution Imaging. [Doctoral Dissertation]. University of Colorado; 2019. Available from: https://scholar.colorado.edu/appm_gradetds/154


Georgia Tech

28. Li, Yaxian. Lower bounds for integer programming problems.

Degree: PhD, Industrial and Systems Engineering, 2013, Georgia Tech

 Solving real world problems with mixed integer programming (MIP) involves efforts in modeling and efficient algorithms. To solve a minimization MIP problem, a lower bound… (more)

Subjects/Keywords: Lower bounds; Integer programming problems; Multi-dimensional knapsack problem; Algorithms; Knapsack problem (Mathematics); Integer programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Li, Y. (2013). Lower bounds for integer programming problems. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/48959

Chicago Manual of Style (16th Edition):

Li, Yaxian. “Lower bounds for integer programming problems.” 2013. Doctoral Dissertation, Georgia Tech. Accessed April 13, 2021. http://hdl.handle.net/1853/48959.

MLA Handbook (7th Edition):

Li, Yaxian. “Lower bounds for integer programming problems.” 2013. Web. 13 Apr 2021.

Vancouver:

Li Y. Lower bounds for integer programming problems. [Internet] [Doctoral dissertation]. Georgia Tech; 2013. [cited 2021 Apr 13]. Available from: http://hdl.handle.net/1853/48959.

Council of Science Editors:

Li Y. Lower bounds for integer programming problems. [Doctoral Dissertation]. Georgia Tech; 2013. Available from: http://hdl.handle.net/1853/48959


University of Stirling

29. Haraldsson, Saemundur Oskar. Genetic Improvement of Software: From Program Landscapes to the Automatic Improvement of a Live System.

Degree: PhD, 2017, University of Stirling

 In today’s technology driven society, software is becoming increasingly important in more areas of our lives. The domain of software extends beyond the obvious domain… (more)

Subjects/Keywords: Software Engineering; Automatic Programming; Bug fixing; Computer science Mathematics; Automatic programming (Computer science); Software engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Haraldsson, S. O. (2017). Genetic Improvement of Software: From Program Landscapes to the Automatic Improvement of a Live System. (Doctoral Dissertation). University of Stirling. Retrieved from http://hdl.handle.net/1893/26007

Chicago Manual of Style (16th Edition):

Haraldsson, Saemundur Oskar. “Genetic Improvement of Software: From Program Landscapes to the Automatic Improvement of a Live System.” 2017. Doctoral Dissertation, University of Stirling. Accessed April 13, 2021. http://hdl.handle.net/1893/26007.

MLA Handbook (7th Edition):

Haraldsson, Saemundur Oskar. “Genetic Improvement of Software: From Program Landscapes to the Automatic Improvement of a Live System.” 2017. Web. 13 Apr 2021.

Vancouver:

Haraldsson SO. Genetic Improvement of Software: From Program Landscapes to the Automatic Improvement of a Live System. [Internet] [Doctoral dissertation]. University of Stirling; 2017. [cited 2021 Apr 13]. Available from: http://hdl.handle.net/1893/26007.

Council of Science Editors:

Haraldsson SO. Genetic Improvement of Software: From Program Landscapes to the Automatic Improvement of a Live System. [Doctoral Dissertation]. University of Stirling; 2017. Available from: http://hdl.handle.net/1893/26007


Northeastern University

30. Papavasileiou, Vasilis. Mathematical programming modulo theories.

Degree: PhD, Computer Science Program, 2015, Northeastern University

 We present the Mathematical Programming Modulo Theories (MPMT) constraint solving framework. MPMT enhances Mathematical Programming by integrating techniques from the field of Automated Reasoning, e.g.,… (more)

Subjects/Keywords: constraint solving; mathematical programming; optimization; satisfiability modulo theories; Programming (Mathematics); Moduli theory; Mathematical models; Constraint programming (Computer science); Mathematical optimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Papavasileiou, V. (2015). Mathematical programming modulo theories. (Doctoral Dissertation). Northeastern University. Retrieved from http://hdl.handle.net/2047/D20194113

Chicago Manual of Style (16th Edition):

Papavasileiou, Vasilis. “Mathematical programming modulo theories.” 2015. Doctoral Dissertation, Northeastern University. Accessed April 13, 2021. http://hdl.handle.net/2047/D20194113.

MLA Handbook (7th Edition):

Papavasileiou, Vasilis. “Mathematical programming modulo theories.” 2015. Web. 13 Apr 2021.

Vancouver:

Papavasileiou V. Mathematical programming modulo theories. [Internet] [Doctoral dissertation]. Northeastern University; 2015. [cited 2021 Apr 13]. Available from: http://hdl.handle.net/2047/D20194113.

Council of Science Editors:

Papavasileiou V. Mathematical programming modulo theories. [Doctoral Dissertation]. Northeastern University; 2015. Available from: http://hdl.handle.net/2047/D20194113

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

.