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:(linear programming). Showing records 1 – 30 of 1475 total matches.

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

Search Limiters

Last 2 Years | English Only

Degrees

Levels

Languages

Country

▼ Search Limiters


Rutgers University

1. Yamangil, Emre, 1984-. Valid inequalities for mixed-integer linear programming problems.

Degree: PhD, Operations Research, 2015, Rutgers University

In this work we focus on various cutting-plane methods for Mixed-integer Linear Programming (MILP) problems. It is well-known that MILP is a fundamental hard problem… (more)

Subjects/Keywords: Linear programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Yamangil, Emre, 1. (2015). Valid inequalities for mixed-integer linear programming problems. (Doctoral Dissertation). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/48729/

Chicago Manual of Style (16th Edition):

Yamangil, Emre, 1984-. “Valid inequalities for mixed-integer linear programming problems.” 2015. Doctoral Dissertation, Rutgers University. Accessed April 01, 2020. https://rucore.libraries.rutgers.edu/rutgers-lib/48729/.

MLA Handbook (7th Edition):

Yamangil, Emre, 1984-. “Valid inequalities for mixed-integer linear programming problems.” 2015. Web. 01 Apr 2020.

Vancouver:

Yamangil, Emre 1. Valid inequalities for mixed-integer linear programming problems. [Internet] [Doctoral dissertation]. Rutgers University; 2015. [cited 2020 Apr 01]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/48729/.

Council of Science Editors:

Yamangil, Emre 1. Valid inequalities for mixed-integer linear programming problems. [Doctoral Dissertation]. Rutgers University; 2015. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/48729/

2. Zachi, Juliana Mallia [UNESP]. Problemas de Programação Linear: uma proposta de resolução geométrica para o ensino médio com o uso do GeoGebra.

Degree: 2016, Universidade Estadual Paulista

Neste trabalho são apresentados os fundamentos da Programação Linear, em especial, da Programação Linear Geométrica, instrumento importante de otimização para problemas de Economia, gestão de… (more)

Subjects/Keywords: Programação linear; Programação linear geométrica; Algebra linear; Linear programming; Linear geometric programming; Linear algebra

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zachi, J. M. [. (2016). Problemas de Programação Linear: uma proposta de resolução geométrica para o ensino médio com o uso do GeoGebra. (Thesis). Universidade Estadual Paulista. Retrieved from http://hdl.handle.net/11449/144220

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

Zachi, Juliana Mallia [UNESP]. “Problemas de Programação Linear: uma proposta de resolução geométrica para o ensino médio com o uso do GeoGebra.” 2016. Thesis, Universidade Estadual Paulista. Accessed April 01, 2020. http://hdl.handle.net/11449/144220.

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

MLA Handbook (7th Edition):

Zachi, Juliana Mallia [UNESP]. “Problemas de Programação Linear: uma proposta de resolução geométrica para o ensino médio com o uso do GeoGebra.” 2016. Web. 01 Apr 2020.

Vancouver:

Zachi JM[. Problemas de Programação Linear: uma proposta de resolução geométrica para o ensino médio com o uso do GeoGebra. [Internet] [Thesis]. Universidade Estadual Paulista; 2016. [cited 2020 Apr 01]. Available from: http://hdl.handle.net/11449/144220.

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

Council of Science Editors:

Zachi JM[. Problemas de Programação Linear: uma proposta de resolução geométrica para o ensino médio com o uso do GeoGebra. [Thesis]. Universidade Estadual Paulista; 2016. Available from: http://hdl.handle.net/11449/144220

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


North Carolina State University

3. Yuhasz, George Louis. Berlekamp/Massey Algorithms for Linearly Generated Matrix Sequences.

Degree: PhD, Mathematics, 2009, North Carolina State University

 The Berlekamp/Massey algorithm computes the unique minimal generator of a linearly generated scalar sequence. The matrix generalization of the Berlekamp/Massey algorithm, the Matrix Berlekamp/Massey algorithm,… (more)

Subjects/Keywords: exact linear algebra; linear recurrances; generic programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Yuhasz, G. L. (2009). Berlekamp/Massey Algorithms for Linearly Generated Matrix Sequences. (Doctoral Dissertation). North Carolina State University. Retrieved from http://www.lib.ncsu.edu/resolver/1840.16/3825

Chicago Manual of Style (16th Edition):

Yuhasz, George Louis. “Berlekamp/Massey Algorithms for Linearly Generated Matrix Sequences.” 2009. Doctoral Dissertation, North Carolina State University. Accessed April 01, 2020. http://www.lib.ncsu.edu/resolver/1840.16/3825.

MLA Handbook (7th Edition):

Yuhasz, George Louis. “Berlekamp/Massey Algorithms for Linearly Generated Matrix Sequences.” 2009. Web. 01 Apr 2020.

Vancouver:

Yuhasz GL. Berlekamp/Massey Algorithms for Linearly Generated Matrix Sequences. [Internet] [Doctoral dissertation]. North Carolina State University; 2009. [cited 2020 Apr 01]. Available from: http://www.lib.ncsu.edu/resolver/1840.16/3825.

Council of Science Editors:

Yuhasz GL. Berlekamp/Massey Algorithms for Linearly Generated Matrix Sequences. [Doctoral Dissertation]. North Carolina State University; 2009. Available from: http://www.lib.ncsu.edu/resolver/1840.16/3825


Texas A&M University

4. Park, Myoungkuk. Performance Guarantee of a Sub-Optimal Policy for a Discrete Markov Decision Process and Its Application to a Robotic Surveillance Problem.

Degree: 2014, Texas A&M University

 This dissertation deals with the development and analysis of sub-optimal decision algorithms for a collection of robots that assist a remotely located operator in perimeter… (more)

Subjects/Keywords: Approximate Dynamic programming; Linear programming; patrol problem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Park, M. (2014). Performance Guarantee of a Sub-Optimal Policy for a Discrete Markov Decision Process and Its Application to a Robotic Surveillance Problem. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/152659

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

Park, Myoungkuk. “Performance Guarantee of a Sub-Optimal Policy for a Discrete Markov Decision Process and Its Application to a Robotic Surveillance Problem.” 2014. Thesis, Texas A&M University. Accessed April 01, 2020. http://hdl.handle.net/1969.1/152659.

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

MLA Handbook (7th Edition):

Park, Myoungkuk. “Performance Guarantee of a Sub-Optimal Policy for a Discrete Markov Decision Process and Its Application to a Robotic Surveillance Problem.” 2014. Web. 01 Apr 2020.

Vancouver:

Park M. Performance Guarantee of a Sub-Optimal Policy for a Discrete Markov Decision Process and Its Application to a Robotic Surveillance Problem. [Internet] [Thesis]. Texas A&M University; 2014. [cited 2020 Apr 01]. Available from: http://hdl.handle.net/1969.1/152659.

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

Council of Science Editors:

Park M. Performance Guarantee of a Sub-Optimal Policy for a Discrete Markov Decision Process and Its Application to a Robotic Surveillance Problem. [Thesis]. Texas A&M University; 2014. Available from: http://hdl.handle.net/1969.1/152659

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


Oregon State University

5. Park, Tongkyu. A matrix game approach to linear programming.

Degree: MS, Industrial Engineering, 1979, Oregon State University

 It is the hope and expectation of many specialists in the area of linear programming that a major improvement in solution techniques for handling large-scale… (more)

Subjects/Keywords: Linear programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Park, T. (1979). A matrix game approach to linear programming. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/42784

Chicago Manual of Style (16th Edition):

Park, Tongkyu. “A matrix game approach to linear programming.” 1979. Masters Thesis, Oregon State University. Accessed April 01, 2020. http://hdl.handle.net/1957/42784.

MLA Handbook (7th Edition):

Park, Tongkyu. “A matrix game approach to linear programming.” 1979. Web. 01 Apr 2020.

Vancouver:

Park T. A matrix game approach to linear programming. [Internet] [Masters thesis]. Oregon State University; 1979. [cited 2020 Apr 01]. Available from: http://hdl.handle.net/1957/42784.

Council of Science Editors:

Park T. A matrix game approach to linear programming. [Masters Thesis]. Oregon State University; 1979. Available from: http://hdl.handle.net/1957/42784


Oregon State University

6. Maurer, Roger J. (Roger Joseph), 1962-. A survey of linear programming algorithms.

Degree: MS, Mathematics, 1987, Oregon State University

Linear programming is a recent development in the field of Mathematics having its origin in the past seventy-five years. The purpose of this study was… (more)

Subjects/Keywords: Linear programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Maurer, Roger J. (Roger Joseph), 1. (1987). A survey of linear programming algorithms. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/41653

Chicago Manual of Style (16th Edition):

Maurer, Roger J. (Roger Joseph), 1962-. “A survey of linear programming algorithms.” 1987. Masters Thesis, Oregon State University. Accessed April 01, 2020. http://hdl.handle.net/1957/41653.

MLA Handbook (7th Edition):

Maurer, Roger J. (Roger Joseph), 1962-. “A survey of linear programming algorithms.” 1987. Web. 01 Apr 2020.

Vancouver:

Maurer, Roger J. (Roger Joseph) 1. A survey of linear programming algorithms. [Internet] [Masters thesis]. Oregon State University; 1987. [cited 2020 Apr 01]. Available from: http://hdl.handle.net/1957/41653.

Council of Science Editors:

Maurer, Roger J. (Roger Joseph) 1. A survey of linear programming algorithms. [Masters Thesis]. Oregon State University; 1987. Available from: http://hdl.handle.net/1957/41653


Oregon State University

7. Chakravarty, Jyotirmoy. Implementation of revised simplex Thompson algorithm on a limited core stand alone processor.

Degree: MS, Industrial Engineering, 1976, Oregon State University

 This thesis presents a linear programming package that uses an algorithm and data storage method efficient enough to solve a medium sized linear programming problem… (more)

Subjects/Keywords: Linear programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chakravarty, J. (1976). Implementation of revised simplex Thompson algorithm on a limited core stand alone processor. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/43238

Chicago Manual of Style (16th Edition):

Chakravarty, Jyotirmoy. “Implementation of revised simplex Thompson algorithm on a limited core stand alone processor.” 1976. Masters Thesis, Oregon State University. Accessed April 01, 2020. http://hdl.handle.net/1957/43238.

MLA Handbook (7th Edition):

Chakravarty, Jyotirmoy. “Implementation of revised simplex Thompson algorithm on a limited core stand alone processor.” 1976. Web. 01 Apr 2020.

Vancouver:

Chakravarty J. Implementation of revised simplex Thompson algorithm on a limited core stand alone processor. [Internet] [Masters thesis]. Oregon State University; 1976. [cited 2020 Apr 01]. Available from: http://hdl.handle.net/1957/43238.

Council of Science Editors:

Chakravarty J. Implementation of revised simplex Thompson algorithm on a limited core stand alone processor. [Masters Thesis]. Oregon State University; 1976. Available from: http://hdl.handle.net/1957/43238


Oregon State University

8. Brown, Carol E. HELM, hierarchical environment for linear modeling.

Degree: PhD, Computer Science, 1989, Oregon State University

 Several problems relating to linear programming modeling have been identified: (1) model formulation, validation and explanation are difficult and time consuming; (2) models must be… (more)

Subjects/Keywords: Linear programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Brown, C. E. (1989). HELM, hierarchical environment for linear modeling. (Doctoral Dissertation). Oregon State University. Retrieved from http://hdl.handle.net/1957/38776

Chicago Manual of Style (16th Edition):

Brown, Carol E. “HELM, hierarchical environment for linear modeling.” 1989. Doctoral Dissertation, Oregon State University. Accessed April 01, 2020. http://hdl.handle.net/1957/38776.

MLA Handbook (7th Edition):

Brown, Carol E. “HELM, hierarchical environment for linear modeling.” 1989. Web. 01 Apr 2020.

Vancouver:

Brown CE. HELM, hierarchical environment for linear modeling. [Internet] [Doctoral dissertation]. Oregon State University; 1989. [cited 2020 Apr 01]. Available from: http://hdl.handle.net/1957/38776.

Council of Science Editors:

Brown CE. HELM, hierarchical environment for linear modeling. [Doctoral Dissertation]. Oregon State University; 1989. Available from: http://hdl.handle.net/1957/38776


University of Hong Kong

9. 冯枫; Feng, Feng. The traveling salesman problem and the subtour linear programming.

Degree: M. Phil., 2017, University of Hong Kong

A salesman wishes to make a journey, visiting each of n cities exactly once and finishing at the city he starts from. Suppose that there… (more)

Subjects/Keywords: Linear programming; Traveling salesman problem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

冯枫; Feng, F. (2017). The traveling salesman problem and the subtour linear programming. (Masters Thesis). University of Hong Kong. Retrieved from http://hdl.handle.net/10722/249902

Chicago Manual of Style (16th Edition):

冯枫; Feng, Feng. “The traveling salesman problem and the subtour linear programming.” 2017. Masters Thesis, University of Hong Kong. Accessed April 01, 2020. http://hdl.handle.net/10722/249902.

MLA Handbook (7th Edition):

冯枫; Feng, Feng. “The traveling salesman problem and the subtour linear programming.” 2017. Web. 01 Apr 2020.

Vancouver:

冯枫; Feng F. The traveling salesman problem and the subtour linear programming. [Internet] [Masters thesis]. University of Hong Kong; 2017. [cited 2020 Apr 01]. Available from: http://hdl.handle.net/10722/249902.

Council of Science Editors:

冯枫; Feng F. The traveling salesman problem and the subtour linear programming. [Masters Thesis]. University of Hong Kong; 2017. Available from: http://hdl.handle.net/10722/249902


University of Hong Kong

10. Feng, Li. The complexity of recognizing linear systems with certain integrality properties.

Degree: M. Phil., 2007, University of Hong Kong

abstract

published_or_final_version

Mathematics

Master

Master of Philosophy

Advisors/Committee Members: Zang, W.

Subjects/Keywords: Linear programming.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Feng, L. (2007). The complexity of recognizing linear systems with certain integrality properties. (Masters Thesis). University of Hong Kong. Retrieved from Feng, L. [馮麗]. (2007). The complexity of recognizing linear systems with certain integrality properties. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b3939198 ; http://dx.doi.org/10.5353/th_b3939198 ; http://hdl.handle.net/10722/51874

Chicago Manual of Style (16th Edition):

Feng, Li. “The complexity of recognizing linear systems with certain integrality properties.” 2007. Masters Thesis, University of Hong Kong. Accessed April 01, 2020. Feng, L. [馮麗]. (2007). The complexity of recognizing linear systems with certain integrality properties. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b3939198 ; http://dx.doi.org/10.5353/th_b3939198 ; http://hdl.handle.net/10722/51874.

MLA Handbook (7th Edition):

Feng, Li. “The complexity of recognizing linear systems with certain integrality properties.” 2007. Web. 01 Apr 2020.

Vancouver:

Feng L. The complexity of recognizing linear systems with certain integrality properties. [Internet] [Masters thesis]. University of Hong Kong; 2007. [cited 2020 Apr 01]. Available from: Feng, L. [馮麗]. (2007). The complexity of recognizing linear systems with certain integrality properties. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b3939198 ; http://dx.doi.org/10.5353/th_b3939198 ; http://hdl.handle.net/10722/51874.

Council of Science Editors:

Feng L. The complexity of recognizing linear systems with certain integrality properties. [Masters Thesis]. University of Hong Kong; 2007. Available from: Feng, L. [馮麗]. (2007). The complexity of recognizing linear systems with certain integrality properties. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b3939198 ; http://dx.doi.org/10.5353/th_b3939198 ; http://hdl.handle.net/10722/51874


Oregon State University

11. Nielsen, Darwin B. Economics of federal range use and improvement.

Degree: PhD, Agricultural Economics, 1964, Oregon State University

Subjects/Keywords: Linear programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Nielsen, D. B. (1964). Economics of federal range use and improvement. (Doctoral Dissertation). Oregon State University. Retrieved from http://hdl.handle.net/1957/21204

Chicago Manual of Style (16th Edition):

Nielsen, Darwin B. “Economics of federal range use and improvement.” 1964. Doctoral Dissertation, Oregon State University. Accessed April 01, 2020. http://hdl.handle.net/1957/21204.

MLA Handbook (7th Edition):

Nielsen, Darwin B. “Economics of federal range use and improvement.” 1964. Web. 01 Apr 2020.

Vancouver:

Nielsen DB. Economics of federal range use and improvement. [Internet] [Doctoral dissertation]. Oregon State University; 1964. [cited 2020 Apr 01]. Available from: http://hdl.handle.net/1957/21204.

Council of Science Editors:

Nielsen DB. Economics of federal range use and improvement. [Doctoral Dissertation]. Oregon State University; 1964. Available from: http://hdl.handle.net/1957/21204


Louisiana State University

12. Gottshall, Bryan. Assessing the efficiency of alternative best management practices to reduce nonpoint source pollution in the broiler production region of Louisiana.

Degree: MS, Agricultural Economics, 2013, Louisiana State University

 The Louisiana broiler production region is located in North Central and Northwestern Louisiana. The region consists of twelve parishes in Northwestern and North Central Louisiana.… (more)

Subjects/Keywords: BMP; NPS; Optimization; Linear Programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gottshall, B. (2013). Assessing the efficiency of alternative best management practices to reduce nonpoint source pollution in the broiler production region of Louisiana. (Masters Thesis). Louisiana State University. Retrieved from etd-11122013-153210 ; https://digitalcommons.lsu.edu/gradschool_theses/1783

Chicago Manual of Style (16th Edition):

Gottshall, Bryan. “Assessing the efficiency of alternative best management practices to reduce nonpoint source pollution in the broiler production region of Louisiana.” 2013. Masters Thesis, Louisiana State University. Accessed April 01, 2020. etd-11122013-153210 ; https://digitalcommons.lsu.edu/gradschool_theses/1783.

MLA Handbook (7th Edition):

Gottshall, Bryan. “Assessing the efficiency of alternative best management practices to reduce nonpoint source pollution in the broiler production region of Louisiana.” 2013. Web. 01 Apr 2020.

Vancouver:

Gottshall B. Assessing the efficiency of alternative best management practices to reduce nonpoint source pollution in the broiler production region of Louisiana. [Internet] [Masters thesis]. Louisiana State University; 2013. [cited 2020 Apr 01]. Available from: etd-11122013-153210 ; https://digitalcommons.lsu.edu/gradschool_theses/1783.

Council of Science Editors:

Gottshall B. Assessing the efficiency of alternative best management practices to reduce nonpoint source pollution in the broiler production region of Louisiana. [Masters Thesis]. Louisiana State University; 2013. Available from: etd-11122013-153210 ; https://digitalcommons.lsu.edu/gradschool_theses/1783


University of Victoria

13. Hung, Kuo Kai. Extracting Surface Structural Information from Vibrational Spectra with Linear Programming.

Degree: Department of Computer Science, 2015, University of Victoria

 Vibrational spectra techniques such as IR, Raman and SFG all carry molecular orientation information. Extracting the orientation information from the vibrational spectra often involves creating… (more)

Subjects/Keywords: Vibrational Spectroscopy; Linear Programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hung, K. K. (2015). Extracting Surface Structural Information from Vibrational Spectra with Linear Programming. (Masters Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/6485

Chicago Manual of Style (16th Edition):

Hung, Kuo Kai. “Extracting Surface Structural Information from Vibrational Spectra with Linear Programming.” 2015. Masters Thesis, University of Victoria. Accessed April 01, 2020. http://hdl.handle.net/1828/6485.

MLA Handbook (7th Edition):

Hung, Kuo Kai. “Extracting Surface Structural Information from Vibrational Spectra with Linear Programming.” 2015. Web. 01 Apr 2020.

Vancouver:

Hung KK. Extracting Surface Structural Information from Vibrational Spectra with Linear Programming. [Internet] [Masters thesis]. University of Victoria; 2015. [cited 2020 Apr 01]. Available from: http://hdl.handle.net/1828/6485.

Council of Science Editors:

Hung KK. Extracting Surface Structural Information from Vibrational Spectra with Linear Programming. [Masters Thesis]. University of Victoria; 2015. Available from: http://hdl.handle.net/1828/6485


Montana State University

14. Lai, Haifie Loo. The selection of optimal break points in piecewise linear function analysis.

Degree: College of Engineering, 1973, Montana State University

Subjects/Keywords: Linear programming.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lai, H. L. (1973). The selection of optimal break points in piecewise linear function analysis. (Thesis). Montana State University. Retrieved from https://scholarworks.montana.edu/xmlui/handle/1/5591

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

Lai, Haifie Loo. “The selection of optimal break points in piecewise linear function analysis.” 1973. Thesis, Montana State University. Accessed April 01, 2020. https://scholarworks.montana.edu/xmlui/handle/1/5591.

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

MLA Handbook (7th Edition):

Lai, Haifie Loo. “The selection of optimal break points in piecewise linear function analysis.” 1973. Web. 01 Apr 2020.

Vancouver:

Lai HL. The selection of optimal break points in piecewise linear function analysis. [Internet] [Thesis]. Montana State University; 1973. [cited 2020 Apr 01]. Available from: https://scholarworks.montana.edu/xmlui/handle/1/5591.

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

Council of Science Editors:

Lai HL. The selection of optimal break points in piecewise linear function analysis. [Thesis]. Montana State University; 1973. Available from: https://scholarworks.montana.edu/xmlui/handle/1/5591

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


University of British Columbia

15. Choo, Eng-Ung. Multicriteria linear fractional programming .

Degree: 1981, University of British Columbia

 The object of this thesis is to study the multi-criteria linear fractional programming problems (MLFP). The characterizations of efficiency, weak efficiency and proper efficiency are… (more)

Subjects/Keywords: Linear programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Choo, E. (1981). Multicriteria linear fractional programming . (Thesis). University of British Columbia. Retrieved from http://hdl.handle.net/2429/22727

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

Choo, Eng-Ung. “Multicriteria linear fractional programming .” 1981. Thesis, University of British Columbia. Accessed April 01, 2020. http://hdl.handle.net/2429/22727.

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

MLA Handbook (7th Edition):

Choo, Eng-Ung. “Multicriteria linear fractional programming .” 1981. Web. 01 Apr 2020.

Vancouver:

Choo E. Multicriteria linear fractional programming . [Internet] [Thesis]. University of British Columbia; 1981. [cited 2020 Apr 01]. Available from: http://hdl.handle.net/2429/22727.

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

Council of Science Editors:

Choo E. Multicriteria linear fractional programming . [Thesis]. University of British Columbia; 1981. Available from: http://hdl.handle.net/2429/22727

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


Oregon State University

16. Yates, Thomas Leyba. An integer programming procedure for scheduling instructors.

Degree: MS, Statistics, 1966, Oregon State University

 The purpose of this study is to determine if the problem of scheduling instructors to classes can be formulated as a linear program involving integer… (more)

Subjects/Keywords: Linear programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Yates, T. L. (1966). An integer programming procedure for scheduling instructors. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/47274

Chicago Manual of Style (16th Edition):

Yates, Thomas Leyba. “An integer programming procedure for scheduling instructors.” 1966. Masters Thesis, Oregon State University. Accessed April 01, 2020. http://hdl.handle.net/1957/47274.

MLA Handbook (7th Edition):

Yates, Thomas Leyba. “An integer programming procedure for scheduling instructors.” 1966. Web. 01 Apr 2020.

Vancouver:

Yates TL. An integer programming procedure for scheduling instructors. [Internet] [Masters thesis]. Oregon State University; 1966. [cited 2020 Apr 01]. Available from: http://hdl.handle.net/1957/47274.

Council of Science Editors:

Yates TL. An integer programming procedure for scheduling instructors. [Masters Thesis]. Oregon State University; 1966. Available from: http://hdl.handle.net/1957/47274


Oregon State University

17. Maki, William Richard. Integer programming for optimized facility location.

Degree: MS, Statistics, 1965, Oregon State University

 This thesis presents a general model for the location problem based on integer linear programming with fixed charges. The location problem is concerned with choosing… (more)

Subjects/Keywords: Linear programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Maki, W. R. (1965). Integer programming for optimized facility location. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/48583

Chicago Manual of Style (16th Edition):

Maki, William Richard. “Integer programming for optimized facility location.” 1965. Masters Thesis, Oregon State University. Accessed April 01, 2020. http://hdl.handle.net/1957/48583.

MLA Handbook (7th Edition):

Maki, William Richard. “Integer programming for optimized facility location.” 1965. Web. 01 Apr 2020.

Vancouver:

Maki WR. Integer programming for optimized facility location. [Internet] [Masters thesis]. Oregon State University; 1965. [cited 2020 Apr 01]. Available from: http://hdl.handle.net/1957/48583.

Council of Science Editors:

Maki WR. Integer programming for optimized facility location. [Masters Thesis]. Oregon State University; 1965. Available from: http://hdl.handle.net/1957/48583


Oregon State University

18. Seymore, George E. Interval integer programming.

Degree: PhD, Statistics, 1971, Oregon State University

Subjects/Keywords: Linear programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Seymore, G. E. (1971). Interval integer programming. (Doctoral Dissertation). Oregon State University. Retrieved from http://hdl.handle.net/1957/45207

Chicago Manual of Style (16th Edition):

Seymore, George E. “Interval integer programming.” 1971. Doctoral Dissertation, Oregon State University. Accessed April 01, 2020. http://hdl.handle.net/1957/45207.

MLA Handbook (7th Edition):

Seymore, George E. “Interval integer programming.” 1971. Web. 01 Apr 2020.

Vancouver:

Seymore GE. Interval integer programming. [Internet] [Doctoral dissertation]. Oregon State University; 1971. [cited 2020 Apr 01]. Available from: http://hdl.handle.net/1957/45207.

Council of Science Editors:

Seymore GE. Interval integer programming. [Doctoral Dissertation]. Oregon State University; 1971. Available from: http://hdl.handle.net/1957/45207


Oregon State University

19. Stavrakis, George D. A general linear optimization algorithm based upon labeling and factorizing of basic paths on RPM network.

Degree: PhD, Industrial Engineering, 1980, Oregon State University

 A new method is developed for solving linear optimization problems based on the RPM network modeling technique which represents the primal and the corresponding dual… (more)

Subjects/Keywords: Linear programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Stavrakis, G. D. (1980). A general linear optimization algorithm based upon labeling and factorizing of basic paths on RPM network. (Doctoral Dissertation). Oregon State University. Retrieved from http://hdl.handle.net/1957/42362

Chicago Manual of Style (16th Edition):

Stavrakis, George D. “A general linear optimization algorithm based upon labeling and factorizing of basic paths on RPM network.” 1980. Doctoral Dissertation, Oregon State University. Accessed April 01, 2020. http://hdl.handle.net/1957/42362.

MLA Handbook (7th Edition):

Stavrakis, George D. “A general linear optimization algorithm based upon labeling and factorizing of basic paths on RPM network.” 1980. Web. 01 Apr 2020.

Vancouver:

Stavrakis GD. A general linear optimization algorithm based upon labeling and factorizing of basic paths on RPM network. [Internet] [Doctoral dissertation]. Oregon State University; 1980. [cited 2020 Apr 01]. Available from: http://hdl.handle.net/1957/42362.

Council of Science Editors:

Stavrakis GD. A general linear optimization algorithm based upon labeling and factorizing of basic paths on RPM network. [Doctoral Dissertation]. Oregon State University; 1980. Available from: http://hdl.handle.net/1957/42362


University of Texas – Austin

20. Hayes, Martha Margaret, 1930-. Linear programming with nonlinear parametric objective functions.

Degree: MA, Mathematics, 1956, University of Texas – Austin

Subjects/Keywords: Linear programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hayes, Martha Margaret, 1. (1956). Linear programming with nonlinear parametric objective functions. (Masters Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/61479

Chicago Manual of Style (16th Edition):

Hayes, Martha Margaret, 1930-. “Linear programming with nonlinear parametric objective functions.” 1956. Masters Thesis, University of Texas – Austin. Accessed April 01, 2020. http://hdl.handle.net/2152/61479.

MLA Handbook (7th Edition):

Hayes, Martha Margaret, 1930-. “Linear programming with nonlinear parametric objective functions.” 1956. Web. 01 Apr 2020.

Vancouver:

Hayes, Martha Margaret 1. Linear programming with nonlinear parametric objective functions. [Internet] [Masters thesis]. University of Texas – Austin; 1956. [cited 2020 Apr 01]. Available from: http://hdl.handle.net/2152/61479.

Council of Science Editors:

Hayes, Martha Margaret 1. Linear programming with nonlinear parametric objective functions. [Masters Thesis]. University of Texas – Austin; 1956. Available from: http://hdl.handle.net/2152/61479

21. Morin, Magnus Graf. Optimering av blandning och lagerhållning av avfallsbränsle : Optimering av avfallsbränsleblandning och lagerhållning av importerat avfallsbränsle vid Vattenfalls fjärrvärmeverk i Uppsala.

Degree: Mathematics and Mathematical Statistics, 2014, Umeå University

Fjärrvärmebranschen i Sverige har sedan mitten av 1990-talet varit i en stagnationsfas, där mängden producerad och förbrukad energi i stort sett varit konstant, trots… (more)

Subjects/Keywords: optimization; linear programming; optimering; linjärprogrammering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Morin, M. G. (2014). Optimering av blandning och lagerhållning av avfallsbränsle : Optimering av avfallsbränsleblandning och lagerhållning av importerat avfallsbränsle vid Vattenfalls fjärrvärmeverk i Uppsala. (Thesis). Umeå University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-90521

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

Morin, Magnus Graf. “Optimering av blandning och lagerhållning av avfallsbränsle : Optimering av avfallsbränsleblandning och lagerhållning av importerat avfallsbränsle vid Vattenfalls fjärrvärmeverk i Uppsala.” 2014. Thesis, Umeå University. Accessed April 01, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-90521.

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

MLA Handbook (7th Edition):

Morin, Magnus Graf. “Optimering av blandning och lagerhållning av avfallsbränsle : Optimering av avfallsbränsleblandning och lagerhållning av importerat avfallsbränsle vid Vattenfalls fjärrvärmeverk i Uppsala.” 2014. Web. 01 Apr 2020.

Vancouver:

Morin MG. Optimering av blandning och lagerhållning av avfallsbränsle : Optimering av avfallsbränsleblandning och lagerhållning av importerat avfallsbränsle vid Vattenfalls fjärrvärmeverk i Uppsala. [Internet] [Thesis]. Umeå University; 2014. [cited 2020 Apr 01]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-90521.

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

Council of Science Editors:

Morin MG. Optimering av blandning och lagerhållning av avfallsbränsle : Optimering av avfallsbränsleblandning och lagerhållning av importerat avfallsbränsle vid Vattenfalls fjärrvärmeverk i Uppsala. [Thesis]. Umeå University; 2014. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-90521

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

22. Schmitt, Anthony. Evaluation of inverse reinforcement learning.

Degree: 2019, University of Wisconsin – Whitewater

This file was last viewed in Adobe Acrobat Pro.

Inverse Reinforcement Learning (IRL) is a technique that is concerned with learning the intrinsic reward function… (more)

Subjects/Keywords: Reinforcement learning; Linear programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Schmitt, A. (2019). Evaluation of inverse reinforcement learning. (Thesis). University of Wisconsin – Whitewater. Retrieved from http://digital.library.wisc.edu/1793/79580

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

Schmitt, Anthony. “Evaluation of inverse reinforcement learning.” 2019. Thesis, University of Wisconsin – Whitewater. Accessed April 01, 2020. http://digital.library.wisc.edu/1793/79580.

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

MLA Handbook (7th Edition):

Schmitt, Anthony. “Evaluation of inverse reinforcement learning.” 2019. Web. 01 Apr 2020.

Vancouver:

Schmitt A. Evaluation of inverse reinforcement learning. [Internet] [Thesis]. University of Wisconsin – Whitewater; 2019. [cited 2020 Apr 01]. Available from: http://digital.library.wisc.edu/1793/79580.

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

Council of Science Editors:

Schmitt A. Evaluation of inverse reinforcement learning. [Thesis]. University of Wisconsin – Whitewater; 2019. Available from: http://digital.library.wisc.edu/1793/79580

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


Universidade Federal de Mato Grosso do Sul

23. Abe, Fabio Henrique Noboru. Problema das pseudo-arborescências capacitadas com localização de facilidades .

Degree: 2016, Universidade Federal de Mato Grosso do Sul

 Neste trabalho apresentamos o problema das pseudo-arborescências capacitadas com localização de facilidades, um problema novo e relacionado a dois outros problemas clássicos: o problema do… (more)

Subjects/Keywords: Programação Linear; Heurística; Programação Heurística; Linear Programming; Heuristic; Heuristic Programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Abe, F. H. N. (2016). Problema das pseudo-arborescências capacitadas com localização de facilidades . (Thesis). Universidade Federal de Mato Grosso do Sul. Retrieved from http://repositorio.cbc.ufms.br:8080/jspui/handle/123456789/2887

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

Abe, Fabio Henrique Noboru. “Problema das pseudo-arborescências capacitadas com localização de facilidades .” 2016. Thesis, Universidade Federal de Mato Grosso do Sul. Accessed April 01, 2020. http://repositorio.cbc.ufms.br:8080/jspui/handle/123456789/2887.

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

MLA Handbook (7th Edition):

Abe, Fabio Henrique Noboru. “Problema das pseudo-arborescências capacitadas com localização de facilidades .” 2016. Web. 01 Apr 2020.

Vancouver:

Abe FHN. Problema das pseudo-arborescências capacitadas com localização de facilidades . [Internet] [Thesis]. Universidade Federal de Mato Grosso do Sul; 2016. [cited 2020 Apr 01]. Available from: http://repositorio.cbc.ufms.br:8080/jspui/handle/123456789/2887.

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

Council of Science Editors:

Abe FHN. Problema das pseudo-arborescências capacitadas com localização de facilidades . [Thesis]. Universidade Federal de Mato Grosso do Sul; 2016. Available from: http://repositorio.cbc.ufms.br:8080/jspui/handle/123456789/2887

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


University of Hawaii

24. Larson, Arnold B (Arnold Bendik), 1924-1973; Hogg, H. C (Howard Carl). Linear programming with iterative modification of the objective function and restraints vector.

Degree: 2009, University of Hawaii

Agricultural economics report 81.

Cover title.

"This manual supplements 'An iterative linear programming procedure for estimating patterns of agricultural land use,' by the present authors."… (more)

Subjects/Keywords: Linear programming; Land use  – Mathematical models; Linear programming; Land  – Mathematical models

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Larson, Arnold B (Arnold Bendik), 1924-1973; Hogg, H. C. (. C. (2009). Linear programming with iterative modification of the objective function and restraints vector. (Thesis). University of Hawaii. Retrieved from http://hdl.handle.net/10125/12162

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

Larson, Arnold B (Arnold Bendik), 1924-1973; Hogg, H C (Howard Carl). “Linear programming with iterative modification of the objective function and restraints vector.” 2009. Thesis, University of Hawaii. Accessed April 01, 2020. http://hdl.handle.net/10125/12162.

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

MLA Handbook (7th Edition):

Larson, Arnold B (Arnold Bendik), 1924-1973; Hogg, H C (Howard Carl). “Linear programming with iterative modification of the objective function and restraints vector.” 2009. Web. 01 Apr 2020.

Vancouver:

Larson, Arnold B (Arnold Bendik), 1924-1973; Hogg HC(C. Linear programming with iterative modification of the objective function and restraints vector. [Internet] [Thesis]. University of Hawaii; 2009. [cited 2020 Apr 01]. Available from: http://hdl.handle.net/10125/12162.

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

Council of Science Editors:

Larson, Arnold B (Arnold Bendik), 1924-1973; Hogg HC(C. Linear programming with iterative modification of the objective function and restraints vector. [Thesis]. University of Hawaii; 2009. Available from: http://hdl.handle.net/10125/12162

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


Anna University

25. Nachammai AL. Certain approaches for solving Intuitionistic fuzzy linear Programming problems;.

Degree: Certain approaches for solving Intuitionistic fuzzy linear Programming problems, 2015, Anna University

Linear programming is one of the most important techniques in newlineoperations research The classical Linear Programming Problem LPP is to newlinefind the minimum or maximum… (more)

Subjects/Keywords: Fuzzy Linear Programming; Intuitionistic Fuzzy Linear Programming Problem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

AL, N. (2015). Certain approaches for solving Intuitionistic fuzzy linear Programming problems;. (Thesis). Anna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/43000

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

AL, Nachammai. “Certain approaches for solving Intuitionistic fuzzy linear Programming problems;.” 2015. Thesis, Anna University. Accessed April 01, 2020. http://shodhganga.inflibnet.ac.in/handle/10603/43000.

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

MLA Handbook (7th Edition):

AL, Nachammai. “Certain approaches for solving Intuitionistic fuzzy linear Programming problems;.” 2015. Web. 01 Apr 2020.

Vancouver:

AL N. Certain approaches for solving Intuitionistic fuzzy linear Programming problems;. [Internet] [Thesis]. Anna University; 2015. [cited 2020 Apr 01]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/43000.

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

Council of Science Editors:

AL N. Certain approaches for solving Intuitionistic fuzzy linear Programming problems;. [Thesis]. Anna University; 2015. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/43000

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


Kansas State University

26. Montalvo, Herminigildo Montemayor. Linear Programming : its application in the Philippines.

Degree: 1979, Kansas State University

Subjects/Keywords: AgriculturePhilippines – Linear programming; Linear programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Montalvo, H. M. (1979). Linear Programming : its application in the Philippines. (Thesis). Kansas State University. Retrieved from http://hdl.handle.net/2097/9324

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

Montalvo, Herminigildo Montemayor. “Linear Programming : its application in the Philippines.” 1979. Thesis, Kansas State University. Accessed April 01, 2020. http://hdl.handle.net/2097/9324.

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

MLA Handbook (7th Edition):

Montalvo, Herminigildo Montemayor. “Linear Programming : its application in the Philippines.” 1979. Web. 01 Apr 2020.

Vancouver:

Montalvo HM. Linear Programming : its application in the Philippines. [Internet] [Thesis]. Kansas State University; 1979. [cited 2020 Apr 01]. Available from: http://hdl.handle.net/2097/9324.

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

Council of Science Editors:

Montalvo HM. Linear Programming : its application in the Philippines. [Thesis]. Kansas State University; 1979. Available from: http://hdl.handle.net/2097/9324

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


Georgia Tech

27. 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 01, 2020. http://hdl.handle.net/1853/39639.

MLA Handbook (7th Edition):

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

Vancouver:

Steffy DE. Topics in exact precision mathematical programming. [Internet] [Doctoral dissertation]. Georgia Tech; 2011. [cited 2020 Apr 01]. 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


Anna University

28. Arunkumar N. Optimization technique for multi objective supplier selection with quantity discounts using integer linear programming and meta heuristics;.

Degree: multi objective supplier selection with quantity discounts using integer linear programming and meta heuristics, 2014, Anna University

In todays competitive operating environment it is impossible to newlinesuccessfully produce low cost high quality products without satisfactory newlinevendors Supplier selection is one of the… (more)

Subjects/Keywords: integer linear programming; mechanical engineering; meta heuristics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

N, A. (2014). Optimization technique for multi objective supplier selection with quantity discounts using integer linear programming and meta heuristics;. (Thesis). Anna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/27971

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

N, Arunkumar. “Optimization technique for multi objective supplier selection with quantity discounts using integer linear programming and meta heuristics;.” 2014. Thesis, Anna University. Accessed April 01, 2020. http://shodhganga.inflibnet.ac.in/handle/10603/27971.

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

MLA Handbook (7th Edition):

N, Arunkumar. “Optimization technique for multi objective supplier selection with quantity discounts using integer linear programming and meta heuristics;.” 2014. Web. 01 Apr 2020.

Vancouver:

N A. Optimization technique for multi objective supplier selection with quantity discounts using integer linear programming and meta heuristics;. [Internet] [Thesis]. Anna University; 2014. [cited 2020 Apr 01]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/27971.

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

Council of Science Editors:

N A. Optimization technique for multi objective supplier selection with quantity discounts using integer linear programming and meta heuristics;. [Thesis]. Anna University; 2014. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/27971

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


The Ohio State University

29. Dessouky, Mohamed Ibrahim. The linear programming problem.

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

Subjects/Keywords: Engineering; Linear programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Dessouky, M. I. (1956). The linear programming problem. (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1486393977316046

Chicago Manual of Style (16th Edition):

Dessouky, Mohamed Ibrahim. “The linear programming problem.” 1956. Doctoral Dissertation, The Ohio State University. Accessed April 01, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=osu1486393977316046.

MLA Handbook (7th Edition):

Dessouky, Mohamed Ibrahim. “The linear programming problem.” 1956. Web. 01 Apr 2020.

Vancouver:

Dessouky MI. The linear programming problem. [Internet] [Doctoral dissertation]. The Ohio State University; 1956. [cited 2020 Apr 01]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1486393977316046.

Council of Science Editors:

Dessouky MI. The linear programming problem. [Doctoral Dissertation]. The Ohio State University; 1956. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1486393977316046


The Ohio State University

30. 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 01, 2020. 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. 01 Apr 2020.

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 2020 Apr 01]. 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

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

.