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

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

Search Limiters

Last 2 Years | English Only

Degrees

Levels

Languages

Country

▼ Search Limiters


Anna University

1. 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 January 18, 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. 18 Jan 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 Jan 18]. 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


Penn State University

2. 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 January 18, 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. 18 Jan 2019.

Vancouver:

Janakiraman S. TRUCK ROUTING PROBLEM IN DISTRIBUTION OF GASOLINE TO GAS STATIONS. [Internet] [Masters thesis]. Penn State University; 2010. [cited 2019 Jan 18]. 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


University of Waterloo

3. 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 January 18, 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. 18 Jan 2019.

Vancouver:

Xavier AS. Computing with Multi-Row Intersection Cuts. [Internet] [Thesis]. University of Waterloo; 2017. [cited 2019 Jan 18]. 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

4. 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 January 18, 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. 18 Jan 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 Jan 18]. 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


University of Toronto

5. 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 January 18, 2019. http://hdl.handle.net/1807/68562.

MLA Handbook (7th Edition):

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

Vancouver:

Michael M. Generalized Combinatorial Auction for Mixed Integer Linear Programming. [Internet] [Masters thesis]. University of Toronto; 2014. [cited 2019 Jan 18]. 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


University of Alberta

6. Milad, Khaki. Economic Dispatch using Advanced Dynamic Thermal Rating.

Degree: MS, Department of Electrical and Computer Engineering, 2011, University of Alberta

 Scientific and technology advances in electrical engineering and increasing demand for electrical energy have led to extensive research in power industry and formation of new… (more)

Subjects/Keywords: Ampacity; Linear Programming; DTR; Thermal Rating; Economic Dispatch; Mixed Integer Programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Milad, K. (2011). Economic Dispatch using Advanced Dynamic Thermal Rating. (Masters Thesis). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/cr56n1231

Chicago Manual of Style (16th Edition):

Milad, Khaki. “Economic Dispatch using Advanced Dynamic Thermal Rating.” 2011. Masters Thesis, University of Alberta. Accessed January 18, 2019. https://era.library.ualberta.ca/files/cr56n1231.

MLA Handbook (7th Edition):

Milad, Khaki. “Economic Dispatch using Advanced Dynamic Thermal Rating.” 2011. Web. 18 Jan 2019.

Vancouver:

Milad K. Economic Dispatch using Advanced Dynamic Thermal Rating. [Internet] [Masters thesis]. University of Alberta; 2011. [cited 2019 Jan 18]. Available from: https://era.library.ualberta.ca/files/cr56n1231.

Council of Science Editors:

Milad K. Economic Dispatch using Advanced Dynamic Thermal Rating. [Masters Thesis]. University of Alberta; 2011. Available from: https://era.library.ualberta.ca/files/cr56n1231


Georgia Tech

7. 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 January 18, 2019. http://hdl.handle.net/1853/39639.

MLA Handbook (7th Edition):

Steffy, Daniel E. “Topics in exact precision mathematical programming.” 2011. Web. 18 Jan 2019.

Vancouver:

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


Georgia Tech

8. Toriello, Alejandro. Time decomposition of multi-period supply chain models.

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

 Many supply chain problems involve discrete decisions in a dynamic environment. The inventory routing problem is an example that combines the dynamic control of inventory… (more)

Subjects/Keywords: Integer programming; Supply chain management; Dynamic programming; Transportation science; Inventory management; Business logistics; Linear programming; Mathematical optimization; Integer programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Toriello, A. (2010). Time decomposition of multi-period supply chain models. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/42704

Chicago Manual of Style (16th Edition):

Toriello, Alejandro. “Time decomposition of multi-period supply chain models.” 2010. Doctoral Dissertation, Georgia Tech. Accessed January 18, 2019. http://hdl.handle.net/1853/42704.

MLA Handbook (7th Edition):

Toriello, Alejandro. “Time decomposition of multi-period supply chain models.” 2010. Web. 18 Jan 2019.

Vancouver:

Toriello A. Time decomposition of multi-period supply chain models. [Internet] [Doctoral dissertation]. Georgia Tech; 2010. [cited 2019 Jan 18]. Available from: http://hdl.handle.net/1853/42704.

Council of Science Editors:

Toriello A. Time decomposition of multi-period supply chain models. [Doctoral Dissertation]. Georgia Tech; 2010. Available from: http://hdl.handle.net/1853/42704


Texas A&M University

9. Benavides Serrano, Alberto J. Mathematical Programming Formulations for the Optimal Placement of Imperfect Detectors with Applications to Flammable Gas Detection and Mitigation Systems.

Degree: 2014, Texas A&M University

 The placement of detectors in mitigation systems is a difficult problem usually addressed in the industry via qualitative and semiquantative approaches. Simplifications are used to… (more)

Subjects/Keywords: Gas Detection; Process Safety; Detector Placement; Stochastic Programming; Mixed-Integer Linear Programming; Mixed-Integer NonLinear Programming; Unavailability; Reliability; Backup Coverage; Voting

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Benavides Serrano, A. J. (2014). Mathematical Programming Formulations for the Optimal Placement of Imperfect Detectors with Applications to Flammable Gas Detection and Mitigation Systems. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/153985

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

Benavides Serrano, Alberto J. “Mathematical Programming Formulations for the Optimal Placement of Imperfect Detectors with Applications to Flammable Gas Detection and Mitigation Systems.” 2014. Thesis, Texas A&M University. Accessed January 18, 2019. http://hdl.handle.net/1969.1/153985.

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

MLA Handbook (7th Edition):

Benavides Serrano, Alberto J. “Mathematical Programming Formulations for the Optimal Placement of Imperfect Detectors with Applications to Flammable Gas Detection and Mitigation Systems.” 2014. Web. 18 Jan 2019.

Vancouver:

Benavides Serrano AJ. Mathematical Programming Formulations for the Optimal Placement of Imperfect Detectors with Applications to Flammable Gas Detection and Mitigation Systems. [Internet] [Thesis]. Texas A&M University; 2014. [cited 2019 Jan 18]. Available from: http://hdl.handle.net/1969.1/153985.

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

Council of Science Editors:

Benavides Serrano AJ. Mathematical Programming Formulations for the Optimal Placement of Imperfect Detectors with Applications to Flammable Gas Detection and Mitigation Systems. [Thesis]. Texas A&M University; 2014. Available from: http://hdl.handle.net/1969.1/153985

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


Brunel University

10. Al Reeshi, Mohammad Ahmad. Industrial engineering applications in metrology : job scheduling, calibration interval and average outgoing quality.

Degree: PhD, 2013, Brunel University

 This research deals with the optimization of metrology and calibration problems. The optimization involved here is the application scientifically sound operations research techniques to help… (more)

Subjects/Keywords: 389; Optimization; Mixed integer programing; Linear programming; Operational research

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Al Reeshi, M. A. (2013). Industrial engineering applications in metrology : job scheduling, calibration interval and average outgoing quality. (Doctoral Dissertation). Brunel University. Retrieved from http://bura.brunel.ac.uk/handle/2438/7610 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.575684

Chicago Manual of Style (16th Edition):

Al Reeshi, Mohammad Ahmad. “Industrial engineering applications in metrology : job scheduling, calibration interval and average outgoing quality.” 2013. Doctoral Dissertation, Brunel University. Accessed January 18, 2019. http://bura.brunel.ac.uk/handle/2438/7610 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.575684.

MLA Handbook (7th Edition):

Al Reeshi, Mohammad Ahmad. “Industrial engineering applications in metrology : job scheduling, calibration interval and average outgoing quality.” 2013. Web. 18 Jan 2019.

Vancouver:

Al Reeshi MA. Industrial engineering applications in metrology : job scheduling, calibration interval and average outgoing quality. [Internet] [Doctoral dissertation]. Brunel University; 2013. [cited 2019 Jan 18]. Available from: http://bura.brunel.ac.uk/handle/2438/7610 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.575684.

Council of Science Editors:

Al Reeshi MA. Industrial engineering applications in metrology : job scheduling, calibration interval and average outgoing quality. [Doctoral Dissertation]. Brunel University; 2013. Available from: http://bura.brunel.ac.uk/handle/2438/7610 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.575684


University of Alberta

11. Wang, Yali. Application of ILP-based Heuristic and Dantzig-Wolfe Decomposition to Solve the Multi-period Survivable Network Augmentation Problem.

Degree: MS, Department of Mechanical Engineering, 2016, University of Alberta

 Multi-period planning is a cost efficient method for designing backbone networks and has been widely used for many years. To ensure the quality of the… (more)

Subjects/Keywords: Multi-period network planning; Integer linear programming; Shared backup path protection

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wang, Y. (2016). Application of ILP-based Heuristic and Dantzig-Wolfe Decomposition to Solve the Multi-period Survivable Network Augmentation Problem. (Masters Thesis). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/cfx719m65m

Chicago Manual of Style (16th Edition):

Wang, Yali. “Application of ILP-based Heuristic and Dantzig-Wolfe Decomposition to Solve the Multi-period Survivable Network Augmentation Problem.” 2016. Masters Thesis, University of Alberta. Accessed January 18, 2019. https://era.library.ualberta.ca/files/cfx719m65m.

MLA Handbook (7th Edition):

Wang, Yali. “Application of ILP-based Heuristic and Dantzig-Wolfe Decomposition to Solve the Multi-period Survivable Network Augmentation Problem.” 2016. Web. 18 Jan 2019.

Vancouver:

Wang Y. Application of ILP-based Heuristic and Dantzig-Wolfe Decomposition to Solve the Multi-period Survivable Network Augmentation Problem. [Internet] [Masters thesis]. University of Alberta; 2016. [cited 2019 Jan 18]. Available from: https://era.library.ualberta.ca/files/cfx719m65m.

Council of Science Editors:

Wang Y. Application of ILP-based Heuristic and Dantzig-Wolfe Decomposition to Solve the Multi-period Survivable Network Augmentation Problem. [Masters Thesis]. University of Alberta; 2016. Available from: https://era.library.ualberta.ca/files/cfx719m65m


Univerzitet u Beogradu

12. Dražić, Zorica M., 1983-. Modifikacije metode promenljivih okolina i njihove primene za rešavanje problema raspoređivanja prenosa datoteka.

Degree: Matematički fakultet, 2017, Univerzitet u Beogradu

Racunarstvo - Optimizacija / Computer Science - Optimization

Metoda promenljivih okolina se u praksi pokazala vrlo uspesnom za resavanje pro- blema diskretne i kontinualne optimizacije.… (more)

Subjects/Keywords: continual optimization; combinatorial optimization; variable neighborhood search; integer linear programming; metaheuristics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Dražić, Zorica M., 1. (2017). Modifikacije metode promenljivih okolina i njihove primene za rešavanje problema raspoređivanja prenosa datoteka. (Thesis). Univerzitet u Beogradu. Retrieved from https://fedorabg.bg.ac.rs/fedora/get/o:15561/bdef:Content/get

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

Dražić, Zorica M., 1983-. “Modifikacije metode promenljivih okolina i njihove primene za rešavanje problema raspoređivanja prenosa datoteka.” 2017. Thesis, Univerzitet u Beogradu. Accessed January 18, 2019. https://fedorabg.bg.ac.rs/fedora/get/o:15561/bdef:Content/get.

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

MLA Handbook (7th Edition):

Dražić, Zorica M., 1983-. “Modifikacije metode promenljivih okolina i njihove primene za rešavanje problema raspoređivanja prenosa datoteka.” 2017. Web. 18 Jan 2019.

Vancouver:

Dražić, Zorica M. 1. Modifikacije metode promenljivih okolina i njihove primene za rešavanje problema raspoređivanja prenosa datoteka. [Internet] [Thesis]. Univerzitet u Beogradu; 2017. [cited 2019 Jan 18]. Available from: https://fedorabg.bg.ac.rs/fedora/get/o:15561/bdef:Content/get.

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

Council of Science Editors:

Dražić, Zorica M. 1. Modifikacije metode promenljivih okolina i njihove primene za rešavanje problema raspoređivanja prenosa datoteka. [Thesis]. Univerzitet u Beogradu; 2017. Available from: https://fedorabg.bg.ac.rs/fedora/get/o:15561/bdef:Content/get

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


Linköping University

13. Pettersson, Magnus. On SIMD code generation for the CELL SPE processor.

Degree: PELAB - Programming Environment Laboratory, 2010, Linköping University

  This thesis project will attempt to answer the question if it is possible to gain performance by using SIMD instructions when generating code for… (more)

Subjects/Keywords: SIMD; code generation; integer linear programming; Computer Sciences; Datavetenskap (datalogi)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pettersson, M. (2010). On SIMD code generation for the CELL SPE processor. (Thesis). Linköping University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-60320

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

Pettersson, Magnus. “On SIMD code generation for the CELL SPE processor.” 2010. Thesis, Linköping University. Accessed January 18, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-60320.

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

MLA Handbook (7th Edition):

Pettersson, Magnus. “On SIMD code generation for the CELL SPE processor.” 2010. Web. 18 Jan 2019.

Vancouver:

Pettersson M. On SIMD code generation for the CELL SPE processor. [Internet] [Thesis]. Linköping University; 2010. [cited 2019 Jan 18]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-60320.

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

Council of Science Editors:

Pettersson M. On SIMD code generation for the CELL SPE processor. [Thesis]. Linköping University; 2010. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-60320

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

14. Wang, Kai. Analytical, Theoretical and Empirical Advances in Genome-Scale Algorithmics.

Degree: 2015, University of Tennessee – Knoxville

 Ever-increasing amounts of complex biological data continue to come on line daily. Examples include proteomic, transcriptomic, genomic and metabolomic data generated by a plethora of… (more)

Subjects/Keywords: differential coefficient of variation; differential entropy; paraclique; satisfiability; integer linear programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wang, K. (2015). Analytical, Theoretical and Empirical Advances in Genome-Scale Algorithmics. (Doctoral Dissertation). University of Tennessee – Knoxville. Retrieved from https://trace.tennessee.edu/utk_graddiss/3479

Chicago Manual of Style (16th Edition):

Wang, Kai. “Analytical, Theoretical and Empirical Advances in Genome-Scale Algorithmics.” 2015. Doctoral Dissertation, University of Tennessee – Knoxville. Accessed January 18, 2019. https://trace.tennessee.edu/utk_graddiss/3479.

MLA Handbook (7th Edition):

Wang, Kai. “Analytical, Theoretical and Empirical Advances in Genome-Scale Algorithmics.” 2015. Web. 18 Jan 2019.

Vancouver:

Wang K. Analytical, Theoretical and Empirical Advances in Genome-Scale Algorithmics. [Internet] [Doctoral dissertation]. University of Tennessee – Knoxville; 2015. [cited 2019 Jan 18]. Available from: https://trace.tennessee.edu/utk_graddiss/3479.

Council of Science Editors:

Wang K. Analytical, Theoretical and Empirical Advances in Genome-Scale Algorithmics. [Doctoral Dissertation]. University of Tennessee – Knoxville; 2015. Available from: https://trace.tennessee.edu/utk_graddiss/3479


Universidade Nova

15. Mingote, Luís Pedro Canas Ferreira. Solving colored nonograms.

Degree: 2009, Universidade Nova

Trabalho apresentado no âmbito do Mestrado em Engenharia Informática, como requisito parcial para obtenção do grau de Mestre em Engenharia Informática

In this thesis we… (more)

Subjects/Keywords: Nonogram; Paint-by-numbers; ILP; Integer linear programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mingote, L. P. C. F. (2009). Solving colored nonograms. (Thesis). Universidade Nova. Retrieved from http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/2388

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

Mingote, Luís Pedro Canas Ferreira. “Solving colored nonograms.” 2009. Thesis, Universidade Nova. Accessed January 18, 2019. http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/2388.

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

MLA Handbook (7th Edition):

Mingote, Luís Pedro Canas Ferreira. “Solving colored nonograms.” 2009. Web. 18 Jan 2019.

Vancouver:

Mingote LPCF. Solving colored nonograms. [Internet] [Thesis]. Universidade Nova; 2009. [cited 2019 Jan 18]. Available from: http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/2388.

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

Council of Science Editors:

Mingote LPCF. Solving colored nonograms. [Thesis]. Universidade Nova; 2009. Available from: http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/2388

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

16. Johansson, Sara. A Time-Evolving Optimization Model for an Intermodal Distribution Supply Chain Network:!A Case Study at a Healthcare Company.

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

  Enticed by the promise of larger sales and better access to customers, consumer goods compa- nies (CGCs) are increasingly looking to evade traditional retailers… (more)

Subjects/Keywords: Optimization; Mixed-Integer Linear Programming; Supply Chain; Distribution Network; Sensitivity Analysis.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Johansson, S. (2016). A Time-Evolving Optimization Model for an Intermodal Distribution Supply Chain Network:!A Case Study at a Healthcare Company. (Thesis). Umeå University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-122796

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

Johansson, Sara. “A Time-Evolving Optimization Model for an Intermodal Distribution Supply Chain Network:!A Case Study at a Healthcare Company.” 2016. Thesis, Umeå University. Accessed January 18, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-122796.

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

MLA Handbook (7th Edition):

Johansson, Sara. “A Time-Evolving Optimization Model for an Intermodal Distribution Supply Chain Network:!A Case Study at a Healthcare Company.” 2016. Web. 18 Jan 2019.

Vancouver:

Johansson S. A Time-Evolving Optimization Model for an Intermodal Distribution Supply Chain Network:!A Case Study at a Healthcare Company. [Internet] [Thesis]. Umeå University; 2016. [cited 2019 Jan 18]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-122796.

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

Council of Science Editors:

Johansson S. A Time-Evolving Optimization Model for an Intermodal Distribution Supply Chain Network:!A Case Study at a Healthcare Company. [Thesis]. Umeå University; 2016. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-122796

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


Princeton University

17. Zhu, Charlie Shucheng. Advances in Fault Diagnosis Automation for Silicon Prototypes .

Degree: PhD, 2016, Princeton University

 In the past decades, the growing complexity of modern computer chips has been presenting great challenges to integrated circuit (IC) designers. One of the biggest… (more)

Subjects/Keywords: Fault Diagnosis; Formal Verification; Integer Linear Programming; Machine Learning; Satisfiability; VLSI

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhu, C. S. (2016). Advances in Fault Diagnosis Automation for Silicon Prototypes . (Doctoral Dissertation). Princeton University. Retrieved from http://arks.princeton.edu/ark:/88435/dsp018336h431p

Chicago Manual of Style (16th Edition):

Zhu, Charlie Shucheng. “Advances in Fault Diagnosis Automation for Silicon Prototypes .” 2016. Doctoral Dissertation, Princeton University. Accessed January 18, 2019. http://arks.princeton.edu/ark:/88435/dsp018336h431p.

MLA Handbook (7th Edition):

Zhu, Charlie Shucheng. “Advances in Fault Diagnosis Automation for Silicon Prototypes .” 2016. Web. 18 Jan 2019.

Vancouver:

Zhu CS. Advances in Fault Diagnosis Automation for Silicon Prototypes . [Internet] [Doctoral dissertation]. Princeton University; 2016. [cited 2019 Jan 18]. Available from: http://arks.princeton.edu/ark:/88435/dsp018336h431p.

Council of Science Editors:

Zhu CS. Advances in Fault Diagnosis Automation for Silicon Prototypes . [Doctoral Dissertation]. Princeton University; 2016. Available from: http://arks.princeton.edu/ark:/88435/dsp018336h431p


University of Texas – Austin

18. -3724-0839. Zero-One Integer Linear Programming for program synthesis: 0-1 Integer Linear Programming for program synthesis.

Degree: Computer Sciences, 2018, University of Texas – Austin

 Program synthesis techniques generate code automatically for a given specification, while code reuse techniques adapt existing code to suit the user's requirements. These methods can… (more)

Subjects/Keywords: Program synthesis; Code reuse; ILP; Integer Linear Programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

-3724-0839. (2018). Zero-One Integer Linear Programming for program synthesis: 0-1 Integer Linear Programming for program synthesis. (Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/68193

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

Chicago Manual of Style (16th Edition):

-3724-0839. “Zero-One Integer Linear Programming for program synthesis: 0-1 Integer Linear Programming for program synthesis.” 2018. Thesis, University of Texas – Austin. Accessed January 18, 2019. http://hdl.handle.net/2152/68193.

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

MLA Handbook (7th Edition):

-3724-0839. “Zero-One Integer Linear Programming for program synthesis: 0-1 Integer Linear Programming for program synthesis.” 2018. Web. 18 Jan 2019.

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

Vancouver:

-3724-0839. Zero-One Integer Linear Programming for program synthesis: 0-1 Integer Linear Programming for program synthesis. [Internet] [Thesis]. University of Texas – Austin; 2018. [cited 2019 Jan 18]. Available from: http://hdl.handle.net/2152/68193.

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

Council of Science Editors:

-3724-0839. Zero-One Integer Linear Programming for program synthesis: 0-1 Integer Linear Programming for program synthesis. [Thesis]. University of Texas – Austin; 2018. Available from: http://hdl.handle.net/2152/68193

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

19. Carvalho, Éden de Rezende. Biodiesel: análise e dimensionamento da rede logística no Brasil usando programação linear.

Degree: Mestrado, Engenharia de Sistemas Logísticos, 2008, University of São Paulo

Neste trabalho foi desenvolvido um modelo de programação linear inteira mista para localização das instalações da rede logística do biodiesel no Brasil, de forma a… (more)

Subjects/Keywords: Alternative fuels; Biodiesel; Combustíveis alternativos; Facilities location; Logistics; Mixed integer linear programming; Programação linear

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Carvalho, . d. R. (2008). Biodiesel: análise e dimensionamento da rede logística no Brasil usando programação linear. (Masters Thesis). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/3/3148/tde-12112008-123903/ ;

Chicago Manual of Style (16th Edition):

Carvalho, Éden de Rezende. “Biodiesel: análise e dimensionamento da rede logística no Brasil usando programação linear.” 2008. Masters Thesis, University of São Paulo. Accessed January 18, 2019. http://www.teses.usp.br/teses/disponiveis/3/3148/tde-12112008-123903/ ;.

MLA Handbook (7th Edition):

Carvalho, Éden de Rezende. “Biodiesel: análise e dimensionamento da rede logística no Brasil usando programação linear.” 2008. Web. 18 Jan 2019.

Vancouver:

Carvalho dR. Biodiesel: análise e dimensionamento da rede logística no Brasil usando programação linear. [Internet] [Masters thesis]. University of São Paulo; 2008. [cited 2019 Jan 18]. Available from: http://www.teses.usp.br/teses/disponiveis/3/3148/tde-12112008-123903/ ;.

Council of Science Editors:

Carvalho dR. Biodiesel: análise e dimensionamento da rede logística no Brasil usando programação linear. [Masters Thesis]. University of São Paulo; 2008. Available from: http://www.teses.usp.br/teses/disponiveis/3/3148/tde-12112008-123903/ ;


Technical University of Lisbon

20. Afonso, Tiago Mendes. Escalonamento de pacientes num serviço hospitalar de radioterapia.

Degree: 2017, Technical University of Lisbon

Mestrado em Métodos Quantitativos para a Decisão Económica e Empresarial

O tema do presente Trabalho de Final de Mestrado é a otimização do escalonamento de… (more)

Subjects/Keywords: Escalonamento; Radioterapia; Modelos de Programação Linear Inteira; Scheduling; Radiotherapy; Integer Linear Programming Models

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Afonso, T. M. (2017). Escalonamento de pacientes num serviço hospitalar de radioterapia. (Thesis). Technical University of Lisbon. Retrieved from https://www.rcaap.pt/detail.jsp?id=oai:www.repository.utl.pt:10400.5/15597

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

Afonso, Tiago Mendes. “Escalonamento de pacientes num serviço hospitalar de radioterapia.” 2017. Thesis, Technical University of Lisbon. Accessed January 18, 2019. https://www.rcaap.pt/detail.jsp?id=oai:www.repository.utl.pt:10400.5/15597.

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

MLA Handbook (7th Edition):

Afonso, Tiago Mendes. “Escalonamento de pacientes num serviço hospitalar de radioterapia.” 2017. Web. 18 Jan 2019.

Vancouver:

Afonso TM. Escalonamento de pacientes num serviço hospitalar de radioterapia. [Internet] [Thesis]. Technical University of Lisbon; 2017. [cited 2019 Jan 18]. Available from: https://www.rcaap.pt/detail.jsp?id=oai:www.repository.utl.pt:10400.5/15597.

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

Council of Science Editors:

Afonso TM. Escalonamento de pacientes num serviço hospitalar de radioterapia. [Thesis]. Technical University of Lisbon; 2017. Available from: https://www.rcaap.pt/detail.jsp?id=oai:www.repository.utl.pt:10400.5/15597

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


Virginia Commonwealth University

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

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

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

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

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

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

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

Chicago Manual of Style (16th Edition):

Snellings, Christopher. “Effective Network Partitioning to Find MIP Solutions to the Train Dispatching Problem.” 2013. Thesis, Virginia Commonwealth University. Accessed January 18, 2019. https://scholarscompass.vcu.edu/etd/3285.

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

MLA Handbook (7th Edition):

Snellings, Christopher. “Effective Network Partitioning to Find MIP Solutions to the Train Dispatching Problem.” 2013. Web. 18 Jan 2019.

Vancouver:

Snellings C. Effective Network Partitioning to Find MIP Solutions to the Train Dispatching Problem. [Internet] [Thesis]. Virginia Commonwealth University; 2013. [cited 2019 Jan 18]. Available from: https://scholarscompass.vcu.edu/etd/3285.

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

Council of Science Editors:

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

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


Simon Fraser University

22. Prakash, Shiv. Guiding design decisions in RT-level logic synthesis.

Degree: 1987, Simon Fraser University

Subjects/Keywords: Linear programming.; Integer programming.; Logic design.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Prakash, S. (1987). Guiding design decisions in RT-level logic synthesis. (Thesis). Simon Fraser University. Retrieved from http://summit.sfu.ca/item/5310

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

Prakash, Shiv. “Guiding design decisions in RT-level logic synthesis.” 1987. Thesis, Simon Fraser University. Accessed January 18, 2019. http://summit.sfu.ca/item/5310.

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

MLA Handbook (7th Edition):

Prakash, Shiv. “Guiding design decisions in RT-level logic synthesis.” 1987. Web. 18 Jan 2019.

Vancouver:

Prakash S. Guiding design decisions in RT-level logic synthesis. [Internet] [Thesis]. Simon Fraser University; 1987. [cited 2019 Jan 18]. Available from: http://summit.sfu.ca/item/5310.

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

Council of Science Editors:

Prakash S. Guiding design decisions in RT-level logic synthesis. [Thesis]. Simon Fraser University; 1987. Available from: http://summit.sfu.ca/item/5310

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


Brunel University

23. Nejadi, Fahimeh. Investigation on integration of sustainable manufacturing and mathematical programming for technology selection and capacity planning.

Degree: PhD, 2016, Brunel University

 Concerns about energy supply and climate change have been driving companies towards more sustainable manufacturing while they are looking on the economic side as well.… (more)

Subjects/Keywords: 658.5; Goal programming; Sensitivity analysis; Mixed integer-linear goal programming; Cost optimisation; Machine learning algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Nejadi, F. (2016). Investigation on integration of sustainable manufacturing and mathematical programming for technology selection and capacity planning. (Doctoral Dissertation). Brunel University. Retrieved from http://bura.brunel.ac.uk/handle/2438/12748 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.687651

Chicago Manual of Style (16th Edition):

Nejadi, Fahimeh. “Investigation on integration of sustainable manufacturing and mathematical programming for technology selection and capacity planning.” 2016. Doctoral Dissertation, Brunel University. Accessed January 18, 2019. http://bura.brunel.ac.uk/handle/2438/12748 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.687651.

MLA Handbook (7th Edition):

Nejadi, Fahimeh. “Investigation on integration of sustainable manufacturing and mathematical programming for technology selection and capacity planning.” 2016. Web. 18 Jan 2019.

Vancouver:

Nejadi F. Investigation on integration of sustainable manufacturing and mathematical programming for technology selection and capacity planning. [Internet] [Doctoral dissertation]. Brunel University; 2016. [cited 2019 Jan 18]. Available from: http://bura.brunel.ac.uk/handle/2438/12748 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.687651.

Council of Science Editors:

Nejadi F. Investigation on integration of sustainable manufacturing and mathematical programming for technology selection and capacity planning. [Doctoral Dissertation]. Brunel University; 2016. Available from: http://bura.brunel.ac.uk/handle/2438/12748 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.687651


University of Edinburgh

24. Hamilton, Daniel. Decomposition and diet problems.

Degree: 2010, University of Edinburgh

 The purpose of this thesis is to efficiently solve real life problems. We study LPs. We study an NLP and an MINLP based on what… (more)

Subjects/Keywords: 519; decomposition; diet problem; optimisation; pooling problem; non-linear programming; simplex method; integer programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hamilton, D. (2010). Decomposition and diet problems. (Doctoral Dissertation). University of Edinburgh. Retrieved from http://hdl.handle.net/1842/3798

Chicago Manual of Style (16th Edition):

Hamilton, Daniel. “Decomposition and diet problems.” 2010. Doctoral Dissertation, University of Edinburgh. Accessed January 18, 2019. http://hdl.handle.net/1842/3798.

MLA Handbook (7th Edition):

Hamilton, Daniel. “Decomposition and diet problems.” 2010. Web. 18 Jan 2019.

Vancouver:

Hamilton D. Decomposition and diet problems. [Internet] [Doctoral dissertation]. University of Edinburgh; 2010. [cited 2019 Jan 18]. Available from: http://hdl.handle.net/1842/3798.

Council of Science Editors:

Hamilton D. Decomposition and diet problems. [Doctoral Dissertation]. University of Edinburgh; 2010. Available from: http://hdl.handle.net/1842/3798


Brunel University

25. Arbex Valle, Cristiano. Portfolio optimisation models.

Degree: PhD, 2013, Brunel University

 In this thesis we consider three different problems in the domain of portfolio optimisation. The first problem we consider is that of selecting an Absolute… (more)

Subjects/Keywords: 519.7; Absolute return portfolios; Market neutral portfolios; Exchange - traded funds; Integer programming; Non linear programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Arbex Valle, C. (2013). Portfolio optimisation models. (Doctoral Dissertation). Brunel University. Retrieved from http://bura.brunel.ac.uk/handle/2438/10343 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.642435

Chicago Manual of Style (16th Edition):

Arbex Valle, Cristiano. “Portfolio optimisation models.” 2013. Doctoral Dissertation, Brunel University. Accessed January 18, 2019. http://bura.brunel.ac.uk/handle/2438/10343 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.642435.

MLA Handbook (7th Edition):

Arbex Valle, Cristiano. “Portfolio optimisation models.” 2013. Web. 18 Jan 2019.

Vancouver:

Arbex Valle C. Portfolio optimisation models. [Internet] [Doctoral dissertation]. Brunel University; 2013. [cited 2019 Jan 18]. Available from: http://bura.brunel.ac.uk/handle/2438/10343 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.642435.

Council of Science Editors:

Arbex Valle C. Portfolio optimisation models. [Doctoral Dissertation]. Brunel University; 2013. Available from: http://bura.brunel.ac.uk/handle/2438/10343 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.642435


University of Hong Kong

26. 朱紫君; Chu, Chi-kwan. Polynomial time algorithms for linear and integer programming.

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

published_or_final_version

Mathematics

Master

Master of Philosophy

Advisors/Committee Members: Zang, W.

Subjects/Keywords: Algorithms.; Linear programming.; Integer programming.; Polynomials.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

朱紫君; Chu, C. (2000). Polynomial time algorithms for linear and integer programming. (Masters Thesis). University of Hong Kong. Retrieved from Chu, C. [朱紫君]. (2000). Polynomial time algorithms for linear and integer programming. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b3122430 ; http://dx.doi.org/10.5353/th_b3122430 ; http://hdl.handle.net/10722/33787

Chicago Manual of Style (16th Edition):

朱紫君; Chu, Chi-kwan. “Polynomial time algorithms for linear and integer programming.” 2000. Masters Thesis, University of Hong Kong. Accessed January 18, 2019. Chu, C. [朱紫君]. (2000). Polynomial time algorithms for linear and integer programming. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b3122430 ; http://dx.doi.org/10.5353/th_b3122430 ; http://hdl.handle.net/10722/33787.

MLA Handbook (7th Edition):

朱紫君; Chu, Chi-kwan. “Polynomial time algorithms for linear and integer programming.” 2000. Web. 18 Jan 2019.

Vancouver:

朱紫君; Chu C. Polynomial time algorithms for linear and integer programming. [Internet] [Masters thesis]. University of Hong Kong; 2000. [cited 2019 Jan 18]. Available from: Chu, C. [朱紫君]. (2000). Polynomial time algorithms for linear and integer programming. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b3122430 ; http://dx.doi.org/10.5353/th_b3122430 ; http://hdl.handle.net/10722/33787.

Council of Science Editors:

朱紫君; Chu C. Polynomial time algorithms for linear and integer programming. [Masters Thesis]. University of Hong Kong; 2000. Available from: Chu, C. [朱紫君]. (2000). Polynomial time algorithms for linear and integer programming. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b3122430 ; http://dx.doi.org/10.5353/th_b3122430 ; http://hdl.handle.net/10722/33787


University of Waterloo

27. Dhaliwal, Gurjot. Optimization Models and Algorithms for Workforce Scheduling with Uncertain Demand.

Degree: 2012, University of Waterloo

 A workforce plan states the number of workers required at any point in time. Efficient workforce plans can help companies achieve their organizational goals while… (more)

Subjects/Keywords: Optimization; Algorithms; Workforce Scheduling; Robust Optimization; Non-Linear Programming; Mixed Integer Programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Dhaliwal, G. (2012). Optimization Models and Algorithms for Workforce Scheduling with Uncertain Demand. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/6500

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

Dhaliwal, Gurjot. “Optimization Models and Algorithms for Workforce Scheduling with Uncertain Demand.” 2012. Thesis, University of Waterloo. Accessed January 18, 2019. http://hdl.handle.net/10012/6500.

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

MLA Handbook (7th Edition):

Dhaliwal, Gurjot. “Optimization Models and Algorithms for Workforce Scheduling with Uncertain Demand.” 2012. Web. 18 Jan 2019.

Vancouver:

Dhaliwal G. Optimization Models and Algorithms for Workforce Scheduling with Uncertain Demand. [Internet] [Thesis]. University of Waterloo; 2012. [cited 2019 Jan 18]. Available from: http://hdl.handle.net/10012/6500.

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

Council of Science Editors:

Dhaliwal G. Optimization Models and Algorithms for Workforce Scheduling with Uncertain Demand. [Thesis]. University of Waterloo; 2012. Available from: http://hdl.handle.net/10012/6500

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


North-West University

28. Pieters, Dewald Philip. A decision support system for selecting IT audit areas using a capital budgeting approach / Dewald Philip Pieters .

Degree: 2015, North-West University

 Internal audit departments strive to control risk within an organization. To do this they choose specific audit areas to include in an audit plan. In… (more)

Subjects/Keywords: IT audit plan; Capital budgeting; Linear programming; Integer programming; Heuristics; Decision support system (DSS)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pieters, D. P. (2015). A decision support system for selecting IT audit areas using a capital budgeting approach / Dewald Philip Pieters . (Thesis). North-West University. Retrieved from http://hdl.handle.net/10394/15502

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

Pieters, Dewald Philip. “A decision support system for selecting IT audit areas using a capital budgeting approach / Dewald Philip Pieters .” 2015. Thesis, North-West University. Accessed January 18, 2019. http://hdl.handle.net/10394/15502.

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

MLA Handbook (7th Edition):

Pieters, Dewald Philip. “A decision support system for selecting IT audit areas using a capital budgeting approach / Dewald Philip Pieters .” 2015. Web. 18 Jan 2019.

Vancouver:

Pieters DP. A decision support system for selecting IT audit areas using a capital budgeting approach / Dewald Philip Pieters . [Internet] [Thesis]. North-West University; 2015. [cited 2019 Jan 18]. Available from: http://hdl.handle.net/10394/15502.

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

Council of Science Editors:

Pieters DP. A decision support system for selecting IT audit areas using a capital budgeting approach / Dewald Philip Pieters . [Thesis]. North-West University; 2015. Available from: http://hdl.handle.net/10394/15502

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


University of Florida

29. Stripling, John. Optimal Personnel Scheduling under Uncertainty using Conditional Value-at-Risk with Application to Hospital Pharmacist Timetable Assignment Problems.

Degree: M.E., Industrial and Systems Engineering, 2010, University of Florida

 Mathematical optimization has become an indispensable tool in many organizations to drive improved efficiencies. There are many techniques to optimize processes mathematically in order to… (more)

Subjects/Keywords: Demand schedule; Hospitals; Integer programming; Integers; Linear programming; Mathematical variables; Mathematics; Pharmacies; Pharmacists; Scheduling

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Stripling, J. (2010). Optimal Personnel Scheduling under Uncertainty using Conditional Value-at-Risk with Application to Hospital Pharmacist Timetable Assignment Problems. (Masters Thesis). University of Florida. Retrieved from http://ufdc.ufl.edu/UFE0042306

Chicago Manual of Style (16th Edition):

Stripling, John. “Optimal Personnel Scheduling under Uncertainty using Conditional Value-at-Risk with Application to Hospital Pharmacist Timetable Assignment Problems.” 2010. Masters Thesis, University of Florida. Accessed January 18, 2019. http://ufdc.ufl.edu/UFE0042306.

MLA Handbook (7th Edition):

Stripling, John. “Optimal Personnel Scheduling under Uncertainty using Conditional Value-at-Risk with Application to Hospital Pharmacist Timetable Assignment Problems.” 2010. Web. 18 Jan 2019.

Vancouver:

Stripling J. Optimal Personnel Scheduling under Uncertainty using Conditional Value-at-Risk with Application to Hospital Pharmacist Timetable Assignment Problems. [Internet] [Masters thesis]. University of Florida; 2010. [cited 2019 Jan 18]. Available from: http://ufdc.ufl.edu/UFE0042306.

Council of Science Editors:

Stripling J. Optimal Personnel Scheduling under Uncertainty using Conditional Value-at-Risk with Application to Hospital Pharmacist Timetable Assignment Problems. [Masters Thesis]. University of Florida; 2010. Available from: http://ufdc.ufl.edu/UFE0042306


EPFL

30. Wang, Xinchao. Tracking Interacting Objects in Image Sequences.

Degree: 2015, EPFL

 Object tracking in image sequences is a key challenge in computer vision. Its goal is to follow objects that move or evolve over time while… (more)

Subjects/Keywords: tracking; detection; interaction; multi-object tracking; network flow programming; mixed integer programming; linear programming; dynamic programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wang, X. (2015). Tracking Interacting Objects in Image Sequences. (Thesis). EPFL. Retrieved from http://infoscience.epfl.ch/record/209133

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

Wang, Xinchao. “Tracking Interacting Objects in Image Sequences.” 2015. Thesis, EPFL. Accessed January 18, 2019. http://infoscience.epfl.ch/record/209133.

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

MLA Handbook (7th Edition):

Wang, Xinchao. “Tracking Interacting Objects in Image Sequences.” 2015. Web. 18 Jan 2019.

Vancouver:

Wang X. Tracking Interacting Objects in Image Sequences. [Internet] [Thesis]. EPFL; 2015. [cited 2019 Jan 18]. Available from: http://infoscience.epfl.ch/record/209133.

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

Council of Science Editors:

Wang X. Tracking Interacting Objects in Image Sequences. [Thesis]. EPFL; 2015. Available from: http://infoscience.epfl.ch/record/209133

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

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

.