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

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

Search Limiters

Last 2 Years | English Only

Degrees

Levels

Languages

Country

▼ Search Limiters


Virginia Tech

1. Gupta, Aparna. Finding Succinct Representations For Clusters.

Degree: MS, Computer Science and Applications, 2019, Virginia Tech

 Improving the explainability of results from machine learning methods has become an important research goal. Clustering is a commonly used Machine Learning technique which is… (more)

Subjects/Keywords: clustering; integer programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gupta, A. (2019). Finding Succinct Representations For Clusters. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/91388

Chicago Manual of Style (16th Edition):

Gupta, Aparna. “Finding Succinct Representations For Clusters.” 2019. Masters Thesis, Virginia Tech. Accessed December 07, 2019. http://hdl.handle.net/10919/91388.

MLA Handbook (7th Edition):

Gupta, Aparna. “Finding Succinct Representations For Clusters.” 2019. Web. 07 Dec 2019.

Vancouver:

Gupta A. Finding Succinct Representations For Clusters. [Internet] [Masters thesis]. Virginia Tech; 2019. [cited 2019 Dec 07]. Available from: http://hdl.handle.net/10919/91388.

Council of Science Editors:

Gupta A. Finding Succinct Representations For Clusters. [Masters Thesis]. Virginia Tech; 2019. Available from: http://hdl.handle.net/10919/91388


Penn State University

2. Thein, Michael William. An In Depth Analysis of Sudoku with Focus in Integer and Constraint Programming.

Degree: MS, Industrial Engineering, 2014, Penn State University

 We analyze sudoku in detail. We study sudoku as it pertains to computational complexity, graph coloring, and various programming methods that can be used to… (more)

Subjects/Keywords: Sudoku; Integer Programming; Constraint Programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Thein, M. W. (2014). An In Depth Analysis of Sudoku with Focus in Integer and Constraint Programming. (Masters Thesis). Penn State University. Retrieved from https://etda.libraries.psu.edu/catalog/21272

Chicago Manual of Style (16th Edition):

Thein, Michael William. “An In Depth Analysis of Sudoku with Focus in Integer and Constraint Programming.” 2014. Masters Thesis, Penn State University. Accessed December 07, 2019. https://etda.libraries.psu.edu/catalog/21272.

MLA Handbook (7th Edition):

Thein, Michael William. “An In Depth Analysis of Sudoku with Focus in Integer and Constraint Programming.” 2014. Web. 07 Dec 2019.

Vancouver:

Thein MW. An In Depth Analysis of Sudoku with Focus in Integer and Constraint Programming. [Internet] [Masters thesis]. Penn State University; 2014. [cited 2019 Dec 07]. Available from: https://etda.libraries.psu.edu/catalog/21272.

Council of Science Editors:

Thein MW. An In Depth Analysis of Sudoku with Focus in Integer and Constraint Programming. [Masters Thesis]. Penn State University; 2014. Available from: https://etda.libraries.psu.edu/catalog/21272


Dalhousie University

3. Zhou, Jun. ANALYSIS OF A MINE-MILL PRODUCTION SYSTEM USING SIMULATION AND INTEGER PROGRAMMING.

Degree: Master of Applied Science, Department of Industrial Engineering, 2010, Dalhousie University

 Mine-mill production faces several operational difficulties, such as fluctuations in ore delivery from mines, random failure of machines, usage of stockpiles and storage bins, and… (more)

Subjects/Keywords: Simulation; Integer Programming; Mill Planning

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhou, J. (2010). ANALYSIS OF A MINE-MILL PRODUCTION SYSTEM USING SIMULATION AND INTEGER PROGRAMMING. (Masters Thesis). Dalhousie University. Retrieved from http://hdl.handle.net/10222/13162

Chicago Manual of Style (16th Edition):

Zhou, Jun. “ANALYSIS OF A MINE-MILL PRODUCTION SYSTEM USING SIMULATION AND INTEGER PROGRAMMING.” 2010. Masters Thesis, Dalhousie University. Accessed December 07, 2019. http://hdl.handle.net/10222/13162.

MLA Handbook (7th Edition):

Zhou, Jun. “ANALYSIS OF A MINE-MILL PRODUCTION SYSTEM USING SIMULATION AND INTEGER PROGRAMMING.” 2010. Web. 07 Dec 2019.

Vancouver:

Zhou J. ANALYSIS OF A MINE-MILL PRODUCTION SYSTEM USING SIMULATION AND INTEGER PROGRAMMING. [Internet] [Masters thesis]. Dalhousie University; 2010. [cited 2019 Dec 07]. Available from: http://hdl.handle.net/10222/13162.

Council of Science Editors:

Zhou J. ANALYSIS OF A MINE-MILL PRODUCTION SYSTEM USING SIMULATION AND INTEGER PROGRAMMING. [Masters Thesis]. Dalhousie University; 2010. Available from: http://hdl.handle.net/10222/13162


Georgia Tech

4. Gu, Zonghao. Lifted cover inequalities for 0-1 and mixed 0-1 integer programs.

Degree: PhD, Industrial engineering, 1995, Georgia Tech

Subjects/Keywords: Integer programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gu, Z. (1995). Lifted cover inequalities for 0-1 and mixed 0-1 integer programs. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/32781

Chicago Manual of Style (16th Edition):

Gu, Zonghao. “Lifted cover inequalities for 0-1 and mixed 0-1 integer programs.” 1995. Doctoral Dissertation, Georgia Tech. Accessed December 07, 2019. http://hdl.handle.net/1853/32781.

MLA Handbook (7th Edition):

Gu, Zonghao. “Lifted cover inequalities for 0-1 and mixed 0-1 integer programs.” 1995. Web. 07 Dec 2019.

Vancouver:

Gu Z. Lifted cover inequalities for 0-1 and mixed 0-1 integer programs. [Internet] [Doctoral dissertation]. Georgia Tech; 1995. [cited 2019 Dec 07]. Available from: http://hdl.handle.net/1853/32781.

Council of Science Editors:

Gu Z. Lifted cover inequalities for 0-1 and mixed 0-1 integer programs. [Doctoral Dissertation]. Georgia Tech; 1995. Available from: http://hdl.handle.net/1853/32781


Oregon State University

5. Battilega, John Anthony. Computational improvements to Benders decomposition for generalized fixed charge problems.

Degree: PhD, Mathematics, 1973, Oregon State University

 A computationally efficient algorithm has been developed for determining exact or approximate solutions for large scale generalized fixed charge problems. This algorithm is based on… (more)

Subjects/Keywords: Integer programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Battilega, J. A. (1973). Computational improvements to Benders decomposition for generalized fixed charge problems. (Doctoral Dissertation). Oregon State University. Retrieved from http://hdl.handle.net/1957/17018

Chicago Manual of Style (16th Edition):

Battilega, John Anthony. “Computational improvements to Benders decomposition for generalized fixed charge problems.” 1973. Doctoral Dissertation, Oregon State University. Accessed December 07, 2019. http://hdl.handle.net/1957/17018.

MLA Handbook (7th Edition):

Battilega, John Anthony. “Computational improvements to Benders decomposition for generalized fixed charge problems.” 1973. Web. 07 Dec 2019.

Vancouver:

Battilega JA. Computational improvements to Benders decomposition for generalized fixed charge problems. [Internet] [Doctoral dissertation]. Oregon State University; 1973. [cited 2019 Dec 07]. Available from: http://hdl.handle.net/1957/17018.

Council of Science Editors:

Battilega JA. Computational improvements to Benders decomposition for generalized fixed charge problems. [Doctoral Dissertation]. Oregon State University; 1973. Available from: http://hdl.handle.net/1957/17018


McGill University

6. Gzara, Fatma. Large scale integer programming : a novel solution method and application.

Degree: PhD, Faculty of Management., 2003, McGill University

Integer programming is a powerful modeling tool for a variety of decision making problems such as in telecommunications network design and in routing and scheduling.… (more)

Subjects/Keywords: Integer programming.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gzara, F. (2003). Large scale integer programming : a novel solution method and application. (Doctoral Dissertation). McGill University. Retrieved from http://digitool.library.mcgill.ca/thesisfile84254.pdf

Chicago Manual of Style (16th Edition):

Gzara, Fatma. “Large scale integer programming : a novel solution method and application.” 2003. Doctoral Dissertation, McGill University. Accessed December 07, 2019. http://digitool.library.mcgill.ca/thesisfile84254.pdf.

MLA Handbook (7th Edition):

Gzara, Fatma. “Large scale integer programming : a novel solution method and application.” 2003. Web. 07 Dec 2019.

Vancouver:

Gzara F. Large scale integer programming : a novel solution method and application. [Internet] [Doctoral dissertation]. McGill University; 2003. [cited 2019 Dec 07]. Available from: http://digitool.library.mcgill.ca/thesisfile84254.pdf.

Council of Science Editors:

Gzara F. Large scale integer programming : a novel solution method and application. [Doctoral Dissertation]. McGill University; 2003. Available from: http://digitool.library.mcgill.ca/thesisfile84254.pdf


University of Waterloo

7. White, John Lincoln. A New Class of Cycle Inequality for the Time-Dependent Traveling Salesman Problem.

Degree: 2010, University of Waterloo

 The Time-Dependent Traveling Salesman Problem is a generalization of the well-known Traveling Salesman Problem, where the cost for travel between two nodes is dependent on… (more)

Subjects/Keywords: Integer Programming; Traveling Salesman Problem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

White, J. L. (2010). A New Class of Cycle Inequality for the Time-Dependent Traveling Salesman Problem. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/5543

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

White, John Lincoln. “A New Class of Cycle Inequality for the Time-Dependent Traveling Salesman Problem.” 2010. Thesis, University of Waterloo. Accessed December 07, 2019. http://hdl.handle.net/10012/5543.

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

MLA Handbook (7th Edition):

White, John Lincoln. “A New Class of Cycle Inequality for the Time-Dependent Traveling Salesman Problem.” 2010. Web. 07 Dec 2019.

Vancouver:

White JL. A New Class of Cycle Inequality for the Time-Dependent Traveling Salesman Problem. [Internet] [Thesis]. University of Waterloo; 2010. [cited 2019 Dec 07]. Available from: http://hdl.handle.net/10012/5543.

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

Council of Science Editors:

White JL. A New Class of Cycle Inequality for the Time-Dependent Traveling Salesman Problem. [Thesis]. University of Waterloo; 2010. Available from: http://hdl.handle.net/10012/5543

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


Colorado State University

8. Heine, Matthew Alan. Constrained optimization model for partitioning students into cooperative learning groups, A.

Degree: MS(M.S.), Mathematics, 2016, Colorado State University

 The problem of the constrained partitioning of a set using quantitative relationships amongst the elements is considered. An approach based on constrained integer programming is… (more)

Subjects/Keywords: Integer Programming; Cooperative Learning; Partitioning

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Heine, M. A. (2016). Constrained optimization model for partitioning students into cooperative learning groups, A. (Masters Thesis). Colorado State University. Retrieved from http://hdl.handle.net/10217/173460

Chicago Manual of Style (16th Edition):

Heine, Matthew Alan. “Constrained optimization model for partitioning students into cooperative learning groups, A.” 2016. Masters Thesis, Colorado State University. Accessed December 07, 2019. http://hdl.handle.net/10217/173460.

MLA Handbook (7th Edition):

Heine, Matthew Alan. “Constrained optimization model for partitioning students into cooperative learning groups, A.” 2016. Web. 07 Dec 2019.

Vancouver:

Heine MA. Constrained optimization model for partitioning students into cooperative learning groups, A. [Internet] [Masters thesis]. Colorado State University; 2016. [cited 2019 Dec 07]. Available from: http://hdl.handle.net/10217/173460.

Council of Science Editors:

Heine MA. Constrained optimization model for partitioning students into cooperative learning groups, A. [Masters Thesis]. Colorado State University; 2016. Available from: http://hdl.handle.net/10217/173460


Georgia Tech

9. Angulo Olivares, Gustavo, I. Integer programming approaches for semicontinuous and stochastic optimization.

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

 This thesis concerns the application of mixed-integer programming techniques to solve special classes of network flow problems and stochastic integer programs. We draw tools from… (more)

Subjects/Keywords: Integer programming; Stochastic programming; Forbidden vertices; Mathematical optimization; Dynamic programming; Integer programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Angulo Olivares, Gustavo, I. (2014). Integer programming approaches for semicontinuous and stochastic optimization. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/51862

Chicago Manual of Style (16th Edition):

Angulo Olivares, Gustavo, I. “Integer programming approaches for semicontinuous and stochastic optimization.” 2014. Doctoral Dissertation, Georgia Tech. Accessed December 07, 2019. http://hdl.handle.net/1853/51862.

MLA Handbook (7th Edition):

Angulo Olivares, Gustavo, I. “Integer programming approaches for semicontinuous and stochastic optimization.” 2014. Web. 07 Dec 2019.

Vancouver:

Angulo Olivares, Gustavo I. Integer programming approaches for semicontinuous and stochastic optimization. [Internet] [Doctoral dissertation]. Georgia Tech; 2014. [cited 2019 Dec 07]. Available from: http://hdl.handle.net/1853/51862.

Council of Science Editors:

Angulo Olivares, Gustavo I. Integer programming approaches for semicontinuous and stochastic optimization. [Doctoral Dissertation]. Georgia Tech; 2014. Available from: http://hdl.handle.net/1853/51862


University of Toronto

10. Michael, Mark. Generalized Combinatorial Auction for Mixed Integer Linear Programming.

Degree: 2014, University of Toronto

Mixed integer linear programming is an invaluable tool for solving some of the toughest problems in operations research. Since the integer nature of these problems… (more)

Subjects/Keywords: column generation; combinatorial auctions; combinatorial optimization; integer programming; linear programming; mixed integer programming; 0796

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Michael, M. (2014). Generalized Combinatorial Auction for Mixed Integer Linear Programming. (Masters Thesis). University of Toronto. Retrieved from http://hdl.handle.net/1807/68562

Chicago Manual of Style (16th Edition):

Michael, Mark. “Generalized Combinatorial Auction for Mixed Integer Linear Programming.” 2014. Masters Thesis, University of Toronto. Accessed December 07, 2019. http://hdl.handle.net/1807/68562.

MLA Handbook (7th Edition):

Michael, Mark. “Generalized Combinatorial Auction for Mixed Integer Linear Programming.” 2014. Web. 07 Dec 2019.

Vancouver:

Michael M. Generalized Combinatorial Auction for Mixed Integer Linear Programming. [Internet] [Masters thesis]. University of Toronto; 2014. [cited 2019 Dec 07]. Available from: http://hdl.handle.net/1807/68562.

Council of Science Editors:

Michael M. Generalized Combinatorial Auction for Mixed Integer Linear Programming. [Masters Thesis]. University of Toronto; 2014. Available from: http://hdl.handle.net/1807/68562


Georgia Tech

11. Vielma Centeno, Juan Pablo. Mixed integer programming approaches for nonlinear and stochastic programming.

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

 In this thesis we study how to solve some nonconvex optimization problems by using methods that capitalize on the success of Linear Programming (LP) based… (more)

Subjects/Keywords: Mixed integer programming; Stochastic programming; Mathematical optimization; Nonconvex programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Vielma Centeno, J. P. (2009). Mixed integer programming approaches for nonlinear and stochastic programming. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/29624

Chicago Manual of Style (16th Edition):

Vielma Centeno, Juan Pablo. “Mixed integer programming approaches for nonlinear and stochastic programming.” 2009. Doctoral Dissertation, Georgia Tech. Accessed December 07, 2019. http://hdl.handle.net/1853/29624.

MLA Handbook (7th Edition):

Vielma Centeno, Juan Pablo. “Mixed integer programming approaches for nonlinear and stochastic programming.” 2009. Web. 07 Dec 2019.

Vancouver:

Vielma Centeno JP. Mixed integer programming approaches for nonlinear and stochastic programming. [Internet] [Doctoral dissertation]. Georgia Tech; 2009. [cited 2019 Dec 07]. Available from: http://hdl.handle.net/1853/29624.

Council of Science Editors:

Vielma Centeno JP. Mixed integer programming approaches for nonlinear and stochastic programming. [Doctoral Dissertation]. Georgia Tech; 2009. Available from: http://hdl.handle.net/1853/29624


Anna University

12. 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 December 07, 2019. 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. 07 Dec 2019.

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 2019 Dec 07]. 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


University of Nairobi

13. Mulongo, Abiud, W. A Two Layer Mixed Integer Programming Model for Dynamic Composite Webservice Selection in Virtual Organizations Inspired by Layering as Optimization Decomposition .

Degree: 2016, University of Nairobi

 The key motivation for virtual organizations (VOs) is the need for business agility against a highly volatile and globally competitive market. The agility includes the… (more)

Subjects/Keywords: A Two Layer Mixed Integer Programming Model

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mulongo, Abiud, W. (2016). A Two Layer Mixed Integer Programming Model for Dynamic Composite Webservice Selection in Virtual Organizations Inspired by Layering as Optimization Decomposition . (Thesis). University of Nairobi. Retrieved from http://hdl.handle.net/11295/98299

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

Mulongo, Abiud, W. “A Two Layer Mixed Integer Programming Model for Dynamic Composite Webservice Selection in Virtual Organizations Inspired by Layering as Optimization Decomposition .” 2016. Thesis, University of Nairobi. Accessed December 07, 2019. http://hdl.handle.net/11295/98299.

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

MLA Handbook (7th Edition):

Mulongo, Abiud, W. “A Two Layer Mixed Integer Programming Model for Dynamic Composite Webservice Selection in Virtual Organizations Inspired by Layering as Optimization Decomposition .” 2016. Web. 07 Dec 2019.

Vancouver:

Mulongo, Abiud W. A Two Layer Mixed Integer Programming Model for Dynamic Composite Webservice Selection in Virtual Organizations Inspired by Layering as Optimization Decomposition . [Internet] [Thesis]. University of Nairobi; 2016. [cited 2019 Dec 07]. Available from: http://hdl.handle.net/11295/98299.

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

Council of Science Editors:

Mulongo, Abiud W. A Two Layer Mixed Integer Programming Model for Dynamic Composite Webservice Selection in Virtual Organizations Inspired by Layering as Optimization Decomposition . [Thesis]. University of Nairobi; 2016. Available from: http://hdl.handle.net/11295/98299

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


Penn State University

14. Janakiraman, Swagath. TRUCK ROUTING PROBLEM IN DISTRIBUTION OF GASOLINE TO GAS STATIONS.

Degree: MS, Industrial Engineering, 2010, Penn State University

 This thesis aims at finding a daily routing plan for a fleet of vehicles delivering gasoline to gas stations for an oil company, satisfying all… (more)

Subjects/Keywords: Mixed Linear Integer Programming; Vehicle Routing; MATLAB

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Janakiraman, S. (2010). TRUCK ROUTING PROBLEM IN DISTRIBUTION OF GASOLINE TO GAS STATIONS. (Masters Thesis). Penn State University. Retrieved from https://etda.libraries.psu.edu/catalog/10619

Chicago Manual of Style (16th Edition):

Janakiraman, Swagath. “TRUCK ROUTING PROBLEM IN DISTRIBUTION OF GASOLINE TO GAS STATIONS.” 2010. Masters Thesis, Penn State University. Accessed December 07, 2019. https://etda.libraries.psu.edu/catalog/10619.

MLA Handbook (7th Edition):

Janakiraman, Swagath. “TRUCK ROUTING PROBLEM IN DISTRIBUTION OF GASOLINE TO GAS STATIONS.” 2010. Web. 07 Dec 2019.

Vancouver:

Janakiraman S. TRUCK ROUTING PROBLEM IN DISTRIBUTION OF GASOLINE TO GAS STATIONS. [Internet] [Masters thesis]. Penn State University; 2010. [cited 2019 Dec 07]. Available from: https://etda.libraries.psu.edu/catalog/10619.

Council of Science Editors:

Janakiraman S. TRUCK ROUTING PROBLEM IN DISTRIBUTION OF GASOLINE TO GAS STATIONS. [Masters Thesis]. Penn State University; 2010. Available from: https://etda.libraries.psu.edu/catalog/10619


McGill University

15. Desai, Bipin C. A parallel processing system to solve the 0-1 programming problem.

Degree: PhD, Department of Electrical Engineering, 1977, McGill University

Subjects/Keywords: Integer programming.; Algorithms.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Desai, B. C. (1977). A parallel processing system to solve the 0-1 programming problem. (Doctoral Dissertation). McGill University. Retrieved from http://digitool.library.mcgill.ca/thesisfile76170.pdf

Chicago Manual of Style (16th Edition):

Desai, Bipin C. “A parallel processing system to solve the 0-1 programming problem.” 1977. Doctoral Dissertation, McGill University. Accessed December 07, 2019. http://digitool.library.mcgill.ca/thesisfile76170.pdf.

MLA Handbook (7th Edition):

Desai, Bipin C. “A parallel processing system to solve the 0-1 programming problem.” 1977. Web. 07 Dec 2019.

Vancouver:

Desai BC. A parallel processing system to solve the 0-1 programming problem. [Internet] [Doctoral dissertation]. McGill University; 1977. [cited 2019 Dec 07]. Available from: http://digitool.library.mcgill.ca/thesisfile76170.pdf.

Council of Science Editors:

Desai BC. A parallel processing system to solve the 0-1 programming problem. [Doctoral Dissertation]. McGill University; 1977. Available from: http://digitool.library.mcgill.ca/thesisfile76170.pdf


Universitat de Valencia

16. Martínez Sykora, Antonio. Nesting Problems : Exact and Heuristic Algorithms .

Degree: 2013, Universitat de Valencia

 Nesting problems are two-dimensional cutting and packing problems involving irregular shapes. This thesis is focused on real applications on Nesting problems such as the garment… (more)

Subjects/Keywords: integer programming; nesting; cutting and packing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Martínez Sykora, A. (2013). Nesting Problems : Exact and Heuristic Algorithms . (Doctoral Dissertation). Universitat de Valencia. Retrieved from http://hdl.handle.net/10550/29003

Chicago Manual of Style (16th Edition):

Martínez Sykora, Antonio. “Nesting Problems : Exact and Heuristic Algorithms .” 2013. Doctoral Dissertation, Universitat de Valencia. Accessed December 07, 2019. http://hdl.handle.net/10550/29003.

MLA Handbook (7th Edition):

Martínez Sykora, Antonio. “Nesting Problems : Exact and Heuristic Algorithms .” 2013. Web. 07 Dec 2019.

Vancouver:

Martínez Sykora A. Nesting Problems : Exact and Heuristic Algorithms . [Internet] [Doctoral dissertation]. Universitat de Valencia; 2013. [cited 2019 Dec 07]. Available from: http://hdl.handle.net/10550/29003.

Council of Science Editors:

Martínez Sykora A. Nesting Problems : Exact and Heuristic Algorithms . [Doctoral Dissertation]. Universitat de Valencia; 2013. Available from: http://hdl.handle.net/10550/29003

17. Becker, Kyle William. Optimizing defensive alignments in baseball through integer programming and simulation.

Degree: MS, Department of Industrial & Manufacturing Systems Engineering, 2009, Kansas State University

 Baseball is an incredibly complex game where the managers of the baseball teams have numerous decisions to make. The managers are in control of the… (more)

Subjects/Keywords: baseball; integer programming; Engineering, Industrial (0546)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Becker, K. W. (2009). Optimizing defensive alignments in baseball through integer programming and simulation. (Masters Thesis). Kansas State University. Retrieved from http://hdl.handle.net/2097/2345

Chicago Manual of Style (16th Edition):

Becker, Kyle William. “Optimizing defensive alignments in baseball through integer programming and simulation.” 2009. Masters Thesis, Kansas State University. Accessed December 07, 2019. http://hdl.handle.net/2097/2345.

MLA Handbook (7th Edition):

Becker, Kyle William. “Optimizing defensive alignments in baseball through integer programming and simulation.” 2009. Web. 07 Dec 2019.

Vancouver:

Becker KW. Optimizing defensive alignments in baseball through integer programming and simulation. [Internet] [Masters thesis]. Kansas State University; 2009. [cited 2019 Dec 07]. Available from: http://hdl.handle.net/2097/2345.

Council of Science Editors:

Becker KW. Optimizing defensive alignments in baseball through integer programming and simulation. [Masters Thesis]. Kansas State University; 2009. Available from: http://hdl.handle.net/2097/2345

18. Van Dijk, S.M. Decomposition methods and rolling horizon approach for the yard crane scheduling problem:.

Degree: 2015, Delft University of Technology

 Yard crane scheduling is one of the operational optimization problems that arise in a port container terminal. Multiple cranes have to store containers in the… (more)

Subjects/Keywords: Yard Crane; Mixed Integer Linear Programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Van Dijk, S. M. (2015). Decomposition methods and rolling horizon approach for the yard crane scheduling problem:. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:2f22057e-3676-4103-8f22-021a2a4e01ba

Chicago Manual of Style (16th Edition):

Van Dijk, S M. “Decomposition methods and rolling horizon approach for the yard crane scheduling problem:.” 2015. Masters Thesis, Delft University of Technology. Accessed December 07, 2019. http://resolver.tudelft.nl/uuid:2f22057e-3676-4103-8f22-021a2a4e01ba.

MLA Handbook (7th Edition):

Van Dijk, S M. “Decomposition methods and rolling horizon approach for the yard crane scheduling problem:.” 2015. Web. 07 Dec 2019.

Vancouver:

Van Dijk SM. Decomposition methods and rolling horizon approach for the yard crane scheduling problem:. [Internet] [Masters thesis]. Delft University of Technology; 2015. [cited 2019 Dec 07]. Available from: http://resolver.tudelft.nl/uuid:2f22057e-3676-4103-8f22-021a2a4e01ba.

Council of Science Editors:

Van Dijk SM. Decomposition methods and rolling horizon approach for the yard crane scheduling problem:. [Masters Thesis]. Delft University of Technology; 2015. Available from: http://resolver.tudelft.nl/uuid:2f22057e-3676-4103-8f22-021a2a4e01ba


Mississippi State University

19. Pirim, Harun. A MINIMUM SPANNING TREE BASED CLUSTERING ALGORITHM FOR HIGH THROUGHPUT BIOLOGICAL DATA.

Degree: PhD, Industrial and Systems Engineering, 2011, Mississippi State University

  A new minimum spanning tree (MST) based heuristic for clustering biological data is proposed. The heuristic uses MSTs to generate initial solutions and applies… (more)

Subjects/Keywords: optimization; heuristics; networks; integer programming; clustering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pirim, H. (2011). A MINIMUM SPANNING TREE BASED CLUSTERING ALGORITHM FOR HIGH THROUGHPUT BIOLOGICAL DATA. (Doctoral Dissertation). Mississippi State University. Retrieved from http://sun.library.msstate.edu/ETD-db/theses/available/etd-03022011-155156/ ;

Chicago Manual of Style (16th Edition):

Pirim, Harun. “A MINIMUM SPANNING TREE BASED CLUSTERING ALGORITHM FOR HIGH THROUGHPUT BIOLOGICAL DATA.” 2011. Doctoral Dissertation, Mississippi State University. Accessed December 07, 2019. http://sun.library.msstate.edu/ETD-db/theses/available/etd-03022011-155156/ ;.

MLA Handbook (7th Edition):

Pirim, Harun. “A MINIMUM SPANNING TREE BASED CLUSTERING ALGORITHM FOR HIGH THROUGHPUT BIOLOGICAL DATA.” 2011. Web. 07 Dec 2019.

Vancouver:

Pirim H. A MINIMUM SPANNING TREE BASED CLUSTERING ALGORITHM FOR HIGH THROUGHPUT BIOLOGICAL DATA. [Internet] [Doctoral dissertation]. Mississippi State University; 2011. [cited 2019 Dec 07]. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-03022011-155156/ ;.

Council of Science Editors:

Pirim H. A MINIMUM SPANNING TREE BASED CLUSTERING ALGORITHM FOR HIGH THROUGHPUT BIOLOGICAL DATA. [Doctoral Dissertation]. Mississippi State University; 2011. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-03022011-155156/ ;


University of Tennessee – Knoxville

20. Shukla, Mohit. Optimizing Cash Flows and Minimizing Simultaneous Turnovers in Operating Room Scheduling.

Degree: MS, Industrial Engineering, 2016, University of Tennessee – Knoxville

  Currently, the scheduling of surgical suites follows either an open booking or block booking framework. Under block booking, medical departments (or surgeons) that provide… (more)

Subjects/Keywords: OR; Block Scheduling; Integer Programming; Operational Research

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Shukla, M. (2016). Optimizing Cash Flows and Minimizing Simultaneous Turnovers in Operating Room Scheduling. (Thesis). University of Tennessee – Knoxville. Retrieved from https://trace.tennessee.edu/utk_gradthes/3811

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

Shukla, Mohit. “Optimizing Cash Flows and Minimizing Simultaneous Turnovers in Operating Room Scheduling.” 2016. Thesis, University of Tennessee – Knoxville. Accessed December 07, 2019. https://trace.tennessee.edu/utk_gradthes/3811.

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

MLA Handbook (7th Edition):

Shukla, Mohit. “Optimizing Cash Flows and Minimizing Simultaneous Turnovers in Operating Room Scheduling.” 2016. Web. 07 Dec 2019.

Vancouver:

Shukla M. Optimizing Cash Flows and Minimizing Simultaneous Turnovers in Operating Room Scheduling. [Internet] [Thesis]. University of Tennessee – Knoxville; 2016. [cited 2019 Dec 07]. Available from: https://trace.tennessee.edu/utk_gradthes/3811.

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

Council of Science Editors:

Shukla M. Optimizing Cash Flows and Minimizing Simultaneous Turnovers in Operating Room Scheduling. [Thesis]. University of Tennessee – Knoxville; 2016. Available from: https://trace.tennessee.edu/utk_gradthes/3811

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


Colorado School of Mines

21. King, Barry W. Using integer programming for strategic underground and open pit-to-underground scheduling.

Degree: PhD, Mechanical Engineering, 2016, Colorado School of Mines

 We introduce a new integer programming formulation to solve the underground project scheduling problem, which we define as determining the time period in which to… (more)

Subjects/Keywords: Integer programming; Mine scheduling; Underground mine scheduling

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

King, B. W. (2016). Using integer programming for strategic underground and open pit-to-underground scheduling. (Doctoral Dissertation). Colorado School of Mines. Retrieved from http://hdl.handle.net/11124/170081

Chicago Manual of Style (16th Edition):

King, Barry W. “Using integer programming for strategic underground and open pit-to-underground scheduling.” 2016. Doctoral Dissertation, Colorado School of Mines. Accessed December 07, 2019. http://hdl.handle.net/11124/170081.

MLA Handbook (7th Edition):

King, Barry W. “Using integer programming for strategic underground and open pit-to-underground scheduling.” 2016. Web. 07 Dec 2019.

Vancouver:

King BW. Using integer programming for strategic underground and open pit-to-underground scheduling. [Internet] [Doctoral dissertation]. Colorado School of Mines; 2016. [cited 2019 Dec 07]. Available from: http://hdl.handle.net/11124/170081.

Council of Science Editors:

King BW. Using integer programming for strategic underground and open pit-to-underground scheduling. [Doctoral Dissertation]. Colorado School of Mines; 2016. Available from: http://hdl.handle.net/11124/170081


Kansas State University

22. Newell, Sarah. Optimizing daily fantasy sports contests through stochastic integer programming.

Degree: MS, Department of Industrial & Manufacturing Systems Engineering, 2017, Kansas State University

 The possibility of becoming a millionaire attracts over 200,000 daily fantasy sports (DFS) contest entries each Sunday of the NFL season. Millions of people play… (more)

Subjects/Keywords: Optimization; Stochastic integer programming; Fantasy sports

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Newell, S. (2017). Optimizing daily fantasy sports contests through stochastic integer programming. (Masters Thesis). Kansas State University. Retrieved from http://hdl.handle.net/2097/35393

Chicago Manual of Style (16th Edition):

Newell, Sarah. “Optimizing daily fantasy sports contests through stochastic integer programming.” 2017. Masters Thesis, Kansas State University. Accessed December 07, 2019. http://hdl.handle.net/2097/35393.

MLA Handbook (7th Edition):

Newell, Sarah. “Optimizing daily fantasy sports contests through stochastic integer programming.” 2017. Web. 07 Dec 2019.

Vancouver:

Newell S. Optimizing daily fantasy sports contests through stochastic integer programming. [Internet] [Masters thesis]. Kansas State University; 2017. [cited 2019 Dec 07]. Available from: http://hdl.handle.net/2097/35393.

Council of Science Editors:

Newell S. Optimizing daily fantasy sports contests through stochastic integer programming. [Masters Thesis]. Kansas State University; 2017. Available from: http://hdl.handle.net/2097/35393


Kansas State University

23. Verschelden, Lucas George. Integrated optimization and simulation models for the locomotive refueling system configuration problem.

Degree: MS, Department of Industrial and Manufacturing Systems Engineering, 2017, Kansas State University

 Locomotives in the U.S. use over 3 billion gallons of fuel each year and faster refueling can increase rail network capacity without the infrastructure cost… (more)

Subjects/Keywords: Train; Integer programming; Simulation; Scheduling; Locomotive; Refueling

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Verschelden, L. G. (2017). Integrated optimization and simulation models for the locomotive refueling system configuration problem. (Masters Thesis). Kansas State University. Retrieved from http://hdl.handle.net/2097/38222

Chicago Manual of Style (16th Edition):

Verschelden, Lucas George. “Integrated optimization and simulation models for the locomotive refueling system configuration problem.” 2017. Masters Thesis, Kansas State University. Accessed December 07, 2019. http://hdl.handle.net/2097/38222.

MLA Handbook (7th Edition):

Verschelden, Lucas George. “Integrated optimization and simulation models for the locomotive refueling system configuration problem.” 2017. Web. 07 Dec 2019.

Vancouver:

Verschelden LG. Integrated optimization and simulation models for the locomotive refueling system configuration problem. [Internet] [Masters thesis]. Kansas State University; 2017. [cited 2019 Dec 07]. Available from: http://hdl.handle.net/2097/38222.

Council of Science Editors:

Verschelden LG. Integrated optimization and simulation models for the locomotive refueling system configuration problem. [Masters Thesis]. Kansas State University; 2017. Available from: http://hdl.handle.net/2097/38222


University of Waterloo

24. Yang, Shenghao. Split Cuts From Sparse Disjunctions.

Degree: 2019, University of Waterloo

 Cutting planes are one of the major techniques used in solving Mixed-Integer Linear Programming (MIP) models. Various types of cuts have long been exploited by… (more)

Subjects/Keywords: mixed-integer programming; split cuts; sparsity; decomposition

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Yang, S. (2019). Split Cuts From Sparse Disjunctions. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/14363

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

Yang, Shenghao. “Split Cuts From Sparse Disjunctions.” 2019. Thesis, University of Waterloo. Accessed December 07, 2019. http://hdl.handle.net/10012/14363.

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

MLA Handbook (7th Edition):

Yang, Shenghao. “Split Cuts From Sparse Disjunctions.” 2019. Web. 07 Dec 2019.

Vancouver:

Yang S. Split Cuts From Sparse Disjunctions. [Internet] [Thesis]. University of Waterloo; 2019. [cited 2019 Dec 07]. Available from: http://hdl.handle.net/10012/14363.

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

Council of Science Editors:

Yang S. Split Cuts From Sparse Disjunctions. [Thesis]. University of Waterloo; 2019. Available from: http://hdl.handle.net/10012/14363

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


University of Waterloo

25. Xavier, Alinson Santos. Computing with Multi-Row Intersection Cuts.

Degree: 2017, University of Waterloo

 Cutting planes are one of the main techniques currently used to solve large-scale Mixed-Integer Linear Programming (MIP) models. Many important cuts used in practice, such… (more)

Subjects/Keywords: mixed-integer linear programming; cutting planes; optimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Xavier, A. S. (2017). Computing with Multi-Row Intersection Cuts. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/11901

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

Xavier, Alinson Santos. “Computing with Multi-Row Intersection Cuts.” 2017. Thesis, University of Waterloo. Accessed December 07, 2019. http://hdl.handle.net/10012/11901.

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

MLA Handbook (7th Edition):

Xavier, Alinson Santos. “Computing with Multi-Row Intersection Cuts.” 2017. Web. 07 Dec 2019.

Vancouver:

Xavier AS. Computing with Multi-Row Intersection Cuts. [Internet] [Thesis]. University of Waterloo; 2017. [cited 2019 Dec 07]. Available from: http://hdl.handle.net/10012/11901.

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

Council of Science Editors:

Xavier AS. Computing with Multi-Row Intersection Cuts. [Thesis]. University of Waterloo; 2017. Available from: http://hdl.handle.net/10012/11901

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


University of Illinois – Urbana-Champaign

26. Nelli, Rajesh B. Impacts of demand response resources on scheduling and prices in day-ahead electricity markets.

Degree: MS, 1200, 2010, University of Illinois – Urbana-Champaign

 This thesis addresses the explicit representation of demand-side resources as participants in the day-ahead electricity markets and assesses their impacts on schedul- ing and prices.… (more)

Subjects/Keywords: Unit Commitment; Demand Response; Mixed-Integer Programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Nelli, R. B. (2010). Impacts of demand response resources on scheduling and prices in day-ahead electricity markets. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/16146

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

Nelli, Rajesh B. “Impacts of demand response resources on scheduling and prices in day-ahead electricity markets.” 2010. Thesis, University of Illinois – Urbana-Champaign. Accessed December 07, 2019. http://hdl.handle.net/2142/16146.

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

MLA Handbook (7th Edition):

Nelli, Rajesh B. “Impacts of demand response resources on scheduling and prices in day-ahead electricity markets.” 2010. Web. 07 Dec 2019.

Vancouver:

Nelli RB. Impacts of demand response resources on scheduling and prices in day-ahead electricity markets. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2010. [cited 2019 Dec 07]. Available from: http://hdl.handle.net/2142/16146.

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

Council of Science Editors:

Nelli RB. Impacts of demand response resources on scheduling and prices in day-ahead electricity markets. [Thesis]. University of Illinois – Urbana-Champaign; 2010. Available from: http://hdl.handle.net/2142/16146

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


Rochester Institute of Technology

27. Agarwal, Akshit. Balancing Medical Resident Education and Workload while Ensuring Quality Patient Care.

Degree: MS, Industrial and Systems Engineering, 2016, Rochester Institute of Technology

  Medical residency is a requirement for medical professionals to practice medicine. Residency programs in internal medicine lasts 3 years and require residents to undergo… (more)

Subjects/Keywords: Mathematical optimization; Mixed integer programming; Resident scheduling

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Agarwal, A. (2016). Balancing Medical Resident Education and Workload while Ensuring Quality Patient Care. (Masters Thesis). Rochester Institute of Technology. Retrieved from https://scholarworks.rit.edu/theses/8987

Chicago Manual of Style (16th Edition):

Agarwal, Akshit. “Balancing Medical Resident Education and Workload while Ensuring Quality Patient Care.” 2016. Masters Thesis, Rochester Institute of Technology. Accessed December 07, 2019. https://scholarworks.rit.edu/theses/8987.

MLA Handbook (7th Edition):

Agarwal, Akshit. “Balancing Medical Resident Education and Workload while Ensuring Quality Patient Care.” 2016. Web. 07 Dec 2019.

Vancouver:

Agarwal A. Balancing Medical Resident Education and Workload while Ensuring Quality Patient Care. [Internet] [Masters thesis]. Rochester Institute of Technology; 2016. [cited 2019 Dec 07]. Available from: https://scholarworks.rit.edu/theses/8987.

Council of Science Editors:

Agarwal A. Balancing Medical Resident Education and Workload while Ensuring Quality Patient Care. [Masters Thesis]. Rochester Institute of Technology; 2016. Available from: https://scholarworks.rit.edu/theses/8987


Texas A&M University

28. Kim, Changkyu. An Integrated Modelling and Optimization Approach for Hydrogen Energy Network.

Degree: MS, Energy, 2017, Texas A&M University

 Issues related to global warming have moved hydrogen into the spotlight as a promising energy carrier. As hydrogen is considered as a promising energy carrier… (more)

Subjects/Keywords: Hydrogen; Strategic modelling; Superstructure; Mixed-integer programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kim, C. (2017). An Integrated Modelling and Optimization Approach for Hydrogen Energy Network. (Masters Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/165869

Chicago Manual of Style (16th Edition):

Kim, Changkyu. “An Integrated Modelling and Optimization Approach for Hydrogen Energy Network.” 2017. Masters Thesis, Texas A&M University. Accessed December 07, 2019. http://hdl.handle.net/1969.1/165869.

MLA Handbook (7th Edition):

Kim, Changkyu. “An Integrated Modelling and Optimization Approach for Hydrogen Energy Network.” 2017. Web. 07 Dec 2019.

Vancouver:

Kim C. An Integrated Modelling and Optimization Approach for Hydrogen Energy Network. [Internet] [Masters thesis]. Texas A&M University; 2017. [cited 2019 Dec 07]. Available from: http://hdl.handle.net/1969.1/165869.

Council of Science Editors:

Kim C. An Integrated Modelling and Optimization Approach for Hydrogen Energy Network. [Masters Thesis]. Texas A&M University; 2017. Available from: http://hdl.handle.net/1969.1/165869


Georgia Tech

29. 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 December 07, 2019. http://hdl.handle.net/1853/48959.

MLA Handbook (7th Edition):

Li, Yaxian. “Lower bounds for integer programming problems.” 2013. Web. 07 Dec 2019.

Vancouver:

Li Y. Lower bounds for integer programming problems. [Internet] [Doctoral dissertation]. Georgia Tech; 2013. [cited 2019 Dec 07]. 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


Georgia Tech

30. Hewitt, Michael R. Integer programming based search.

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

 When integer programming (IP) models are used in operational situations there is a need to consider the tradeoff between the conflicting goals of solution quality… (more)

Subjects/Keywords: Freight transportation; Column generation; Integer programming; Heuristics; Integer programming; Relaxation methods (Mathematics); Freight and freightage

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hewitt, M. R. (2009). Integer programming based search. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/31641

Chicago Manual of Style (16th Edition):

Hewitt, Michael R. “Integer programming based search.” 2009. Doctoral Dissertation, Georgia Tech. Accessed December 07, 2019. http://hdl.handle.net/1853/31641.

MLA Handbook (7th Edition):

Hewitt, Michael R. “Integer programming based search.” 2009. Web. 07 Dec 2019.

Vancouver:

Hewitt MR. Integer programming based search. [Internet] [Doctoral dissertation]. Georgia Tech; 2009. [cited 2019 Dec 07]. Available from: http://hdl.handle.net/1853/31641.

Council of Science Editors:

Hewitt MR. Integer programming based search. [Doctoral Dissertation]. Georgia Tech; 2009. Available from: http://hdl.handle.net/1853/31641

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

.