Advanced search options

Sorted by: relevance · author · university · date | New search

You searched for `subject:(Mixed integer programming)`

.
Showing records 1 – 30 of
522 total matches.

◁ [1] [2] [3] [4] [5] … [18] ▶

Search Limiters

Dates

- 2017 – 2021 (183)
- 2012 – 2016 (234)
- 2007 – 2011 (92)
- 2002 – 2006 (29)

Universities

- Delft University of Technology (25)
- Georgia Tech (25)
- University of São Paulo (21)
- Pontifical Catholic University of Rio de Janeiro (19)
- Texas A&M University (19)
- Virginia Tech (18)
- National University of Singapore (14)
- University of Texas – Austin (13)
- University of Waterloo (13)
- KTH (12)
- University of Tennessee – Knoxville (11)
- University of Toronto (10)

Department

- Industrial and Systems Engineering (38)
- Industrial Engineering (25)
- Electrical Engineering (11)
- Informatique (11)

Degrees

- PhD (135)
- Docteur es (46)
- MS (42)
- Mestrado (15)

Languages

- English (260)
- Portuguese (51)
- French (27)
- Greek (15)

▼ Search Limiters

Colorado State University

1. Suksavate, Warong. Develop a multi-periods fuel treatments allocation model to fragment landscape high hazard fuel patches.

Degree: MS(M.S.), Forest and Rangeland Stewardship, 2013, Colorado State University

URL: http://hdl.handle.net/10217/80318

► Increased forest fuel loading and continuity have led to more large fires that can potentially cause the loss of property, life and forest resources in…
(more)

Subjects/Keywords: fuel treatment; mixed integer programming

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Suksavate, W. (2013). Develop a multi-periods fuel treatments allocation model to fragment landscape high hazard fuel patches. (Masters Thesis). Colorado State University. Retrieved from http://hdl.handle.net/10217/80318

Chicago Manual of Style (16^{th} Edition):

Suksavate, Warong. “Develop a multi-periods fuel treatments allocation model to fragment landscape high hazard fuel patches.” 2013. Masters Thesis, Colorado State University. Accessed February 26, 2021. http://hdl.handle.net/10217/80318.

MLA Handbook (7^{th} Edition):

Suksavate, Warong. “Develop a multi-periods fuel treatments allocation model to fragment landscape high hazard fuel patches.” 2013. Web. 26 Feb 2021.

Vancouver:

Suksavate W. Develop a multi-periods fuel treatments allocation model to fragment landscape high hazard fuel patches. [Internet] [Masters thesis]. Colorado State University; 2013. [cited 2021 Feb 26]. Available from: http://hdl.handle.net/10217/80318.

Council of Science Editors:

Suksavate W. Develop a multi-periods fuel treatments allocation model to fragment landscape high hazard fuel patches. [Masters Thesis]. Colorado State University; 2013. Available from: http://hdl.handle.net/10217/80318

2.
-2486-1396.
* Mixed*-

Degree: PhD, Electrical and Computer Engineering, 2019, University of Texas – Austin

URL: http://dx.doi.org/10.26153/tsw/5794

► *Mixed* *integer* *programming* (MIP) maximizes (or minimizes) a linear objective *subject* to a set of constraints. In particular, one of the constraints for a MIP…
(more)

Subjects/Keywords: Power system; Mixed-integer programming

Record Details Similar Records

❌

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

APA (6^{th} Edition):

-2486-1396. (2019). Mixed-integer programming in power systems : the interdiction and unit commitment problems. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://dx.doi.org/10.26153/tsw/5794

Note: this citation may be lacking information needed for this citation format:

Author name may be incomplete

Chicago Manual of Style (16^{th} Edition):

-2486-1396. “Mixed-integer programming in power systems : the interdiction and unit commitment problems.” 2019. Doctoral Dissertation, University of Texas – Austin. Accessed February 26, 2021. http://dx.doi.org/10.26153/tsw/5794.

Note: this citation may be lacking information needed for this citation format:

Author name may be incomplete

MLA Handbook (7^{th} Edition):

-2486-1396. “Mixed-integer programming in power systems : the interdiction and unit commitment problems.” 2019. Web. 26 Feb 2021.

Note: this citation may be lacking information needed for this citation format:

Author name may be incomplete

Vancouver:

-2486-1396. Mixed-integer programming in power systems : the interdiction and unit commitment problems. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2019. [cited 2021 Feb 26]. Available from: http://dx.doi.org/10.26153/tsw/5794.

Author name may be incomplete

Council of Science Editors:

-2486-1396. Mixed-integer programming in power systems : the interdiction and unit commitment problems. [Doctoral Dissertation]. University of Texas – Austin; 2019. Available from: http://dx.doi.org/10.26153/tsw/5794

Author name may be incomplete

Delft University of Technology

3. Þorbjarnarson, T. (author). Training Neural Networks with Discrete Optimization Solvers.

Degree: 2020, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:27875d51-672a-4a78-9aad-c44236992518

► Recent work has shown potential in using *Mixed* *Integer* *Programming* (MIP) solvers to optimize certain aspects of neural networks (NN). However little research has gone…
(more)

Subjects/Keywords: Neural Networks; Optimization; Mixed Integer Programming

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Þorbjarnarson, T. (. (2020). Training Neural Networks with Discrete Optimization Solvers. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:27875d51-672a-4a78-9aad-c44236992518

Chicago Manual of Style (16^{th} Edition):

Þorbjarnarson, T (author). “Training Neural Networks with Discrete Optimization Solvers.” 2020. Masters Thesis, Delft University of Technology. Accessed February 26, 2021. http://resolver.tudelft.nl/uuid:27875d51-672a-4a78-9aad-c44236992518.

MLA Handbook (7^{th} Edition):

Þorbjarnarson, T (author). “Training Neural Networks with Discrete Optimization Solvers.” 2020. Web. 26 Feb 2021.

Vancouver:

Þorbjarnarson T(. Training Neural Networks with Discrete Optimization Solvers. [Internet] [Masters thesis]. Delft University of Technology; 2020. [cited 2021 Feb 26]. Available from: http://resolver.tudelft.nl/uuid:27875d51-672a-4a78-9aad-c44236992518.

Council of Science Editors:

Þorbjarnarson T(. Training Neural Networks with Discrete Optimization Solvers. [Masters Thesis]. Delft University of Technology; 2020. Available from: http://resolver.tudelft.nl/uuid:27875d51-672a-4a78-9aad-c44236992518

Rochester Institute of Technology

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

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

URL: https://scholarworks.rit.edu/theses/8987

► 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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

Agarwal, Akshit. “Balancing Medical Resident Education and Workload while Ensuring Quality Patient Care.” 2016. Web. 26 Feb 2021.

Vancouver:

Agarwal A. Balancing Medical Resident Education and Workload while Ensuring Quality Patient Care. [Internet] [Masters thesis]. Rochester Institute of Technology; 2016. [cited 2021 Feb 26]. 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

University of Waterloo

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

Degree: 2019, University of Waterloo

URL: http://hdl.handle.net/10012/14363

► 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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

Yang, Shenghao. “Split Cuts From Sparse Disjunctions.” 2019. Thesis, University of Waterloo. Accessed February 26, 2021. 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 (7^{th} Edition):

Yang, Shenghao. “Split Cuts From Sparse Disjunctions.” 2019. Web. 26 Feb 2021.

Vancouver:

Yang S. Split Cuts From Sparse Disjunctions. [Internet] [Thesis]. University of Waterloo; 2019. [cited 2021 Feb 26]. 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

Not specified: Masters Thesis or Doctoral Dissertation

University of Nairobi

6.
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

URL: http://hdl.handle.net/11295/98299

► 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 Details Similar Records

❌

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

APA (6^{th} 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

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} 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 February 26, 2021. http://hdl.handle.net/11295/98299.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} 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. 26 Feb 2021.

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 2021 Feb 26]. Available from: http://hdl.handle.net/11295/98299.

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

Not specified: Masters Thesis or Doctoral Dissertation

7. Van Dijk, S.M. (author). Decomposition methods and rolling horizon approach for the yard crane scheduling problem.

Degree: 2015, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:2f22057e-3676-4103-8f22-021a2a4e01ba

►

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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

Van Dijk, S M (author). “Decomposition methods and rolling horizon approach for the yard crane scheduling problem.” 2015. Web. 26 Feb 2021.

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 2021 Feb 26]. 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

Delft University of Technology

8.
van der Linden, Koos (author).
Decision diagrams for decomposed *mixed* *integer* linear programs.

Degree: 2017, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:57e43a69-e380-4917-9598-097710379b9f

►

A recent development in the field of discrete optimization is the combined use of (binary) decision diagrams (DD) and branch and bound for optimization. This… (more)

Subjects/Keywords: Decision diagrams; Mixed integer programming; Benders decomposition

Record Details Similar Records

❌

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

APA (6^{th} Edition):

van der Linden, K. (. (2017). Decision diagrams for decomposed mixed integer linear programs. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:57e43a69-e380-4917-9598-097710379b9f

Chicago Manual of Style (16^{th} Edition):

van der Linden, Koos (author). “Decision diagrams for decomposed mixed integer linear programs.” 2017. Masters Thesis, Delft University of Technology. Accessed February 26, 2021. http://resolver.tudelft.nl/uuid:57e43a69-e380-4917-9598-097710379b9f.

MLA Handbook (7^{th} Edition):

van der Linden, Koos (author). “Decision diagrams for decomposed mixed integer linear programs.” 2017. Web. 26 Feb 2021.

Vancouver:

van der Linden K(. Decision diagrams for decomposed mixed integer linear programs. [Internet] [Masters thesis]. Delft University of Technology; 2017. [cited 2021 Feb 26]. Available from: http://resolver.tudelft.nl/uuid:57e43a69-e380-4917-9598-097710379b9f.

Council of Science Editors:

van der Linden K(. Decision diagrams for decomposed mixed integer linear programs. [Masters Thesis]. Delft University of Technology; 2017. Available from: http://resolver.tudelft.nl/uuid:57e43a69-e380-4917-9598-097710379b9f

Georgia Tech

9.
Yang, Yu.
Exploiting structure in *mixed* *integer* *programming*: Branching, cutting planes, and complexity.

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

URL: http://hdl.handle.net/1853/63665

► As a powerful mathematical modeling framework, *mixed* *integer* *programming* (MIP) has seen many industrial applications in areas such as logistics, scheduling, capital budgeting, etc. Tremendous…
(more)

Subjects/Keywords: Mixed integer programming; Branching; Cutting planes; Complexity

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Yang, Y. (2020). Exploiting structure in mixed integer programming: Branching, cutting planes, and complexity. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/63665

Chicago Manual of Style (16^{th} Edition):

Yang, Yu. “Exploiting structure in mixed integer programming: Branching, cutting planes, and complexity.” 2020. Doctoral Dissertation, Georgia Tech. Accessed February 26, 2021. http://hdl.handle.net/1853/63665.

MLA Handbook (7^{th} Edition):

Yang, Yu. “Exploiting structure in mixed integer programming: Branching, cutting planes, and complexity.” 2020. Web. 26 Feb 2021.

Vancouver:

Yang Y. Exploiting structure in mixed integer programming: Branching, cutting planes, and complexity. [Internet] [Doctoral dissertation]. Georgia Tech; 2020. [cited 2021 Feb 26]. Available from: http://hdl.handle.net/1853/63665.

Council of Science Editors:

Yang Y. Exploiting structure in mixed integer programming: Branching, cutting planes, and complexity. [Doctoral Dissertation]. Georgia Tech; 2020. Available from: http://hdl.handle.net/1853/63665

University of Toronto

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

Degree: 2014, University of Toronto

URL: http://hdl.handle.net/1807/68562

►

*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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

Michael, Mark. “Generalized Combinatorial Auction for Mixed Integer Linear Programming.” 2014. Web. 26 Feb 2021.

Vancouver:

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

Texas A&M University

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

Degree: PhD, Chemical Engineering, 2014, Texas A&M University

URL: http://hdl.handle.net/1969.1/153985

► 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 Details Similar Records

❌

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

APA (6^{th} 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. (Doctoral Dissertation). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/153985

Chicago Manual of Style (16^{th} 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. Doctoral Dissertation, Texas A&M University. Accessed February 26, 2021. http://hdl.handle.net/1969.1/153985.

MLA Handbook (7^{th} 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. 26 Feb 2021.

Vancouver:

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

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. [Doctoral Dissertation]. Texas A&M University; 2014. Available from: http://hdl.handle.net/1969.1/153985

RMIT University

12.
Christiansen, J.
Decomposition and duality based approaches to stochastic *integer* * programming*.

Degree: 2018, RMIT University

URL: http://researchbank.rmit.edu.au/view/rmit:162666

► Stochastic *Integer* *Programming* is a variant of Linear *Programming* which incorporates *integer* and stochastic properties (i.e. some variables are discrete, and some properties of the…
(more)

Subjects/Keywords: Fields of Research; Optimisation; Lagrangian duality; Stochastic programming; Mixed-integer programming; Stochastic mixed-integer programming; Lagrange multipliers

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Christiansen, J. (2018). Decomposition and duality based approaches to stochastic integer programming. (Thesis). RMIT University. Retrieved from http://researchbank.rmit.edu.au/view/rmit:162666

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Christiansen, J. “Decomposition and duality based approaches to stochastic integer programming.” 2018. Thesis, RMIT University. Accessed February 26, 2021. http://researchbank.rmit.edu.au/view/rmit:162666.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Christiansen, J. “Decomposition and duality based approaches to stochastic integer programming.” 2018. Web. 26 Feb 2021.

Vancouver:

Christiansen J. Decomposition and duality based approaches to stochastic integer programming. [Internet] [Thesis]. RMIT University; 2018. [cited 2021 Feb 26]. Available from: http://researchbank.rmit.edu.au/view/rmit:162666.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Christiansen J. Decomposition and duality based approaches to stochastic integer programming. [Thesis]. RMIT University; 2018. Available from: http://researchbank.rmit.edu.au/view/rmit:162666

Not specified: Masters Thesis or Doctoral Dissertation

University of Alberta

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

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

URL: https://era.library.ualberta.ca/files/cr56n1231

► 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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

Milad, Khaki. “Economic Dispatch using Advanced Dynamic Thermal Rating.” 2011. Web. 26 Feb 2021.

Vancouver:

Milad K. Economic Dispatch using Advanced Dynamic Thermal Rating. [Internet] [Masters thesis]. University of Alberta; 2011. [cited 2021 Feb 26]. 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

14. Ho, Jonathan L. Stochastic Co-optimization for National Transmission Planning Under Environmental Regulation.

Degree: 2014, Johns Hopkins University

URL: http://jhir.library.jhu.edu/handle/1774.2/37101

► Transmission planners must make investment decisions in response to rapid changes impacting the US electric power system to ensure that power remains affordable and reliable.…
(more)

Subjects/Keywords: Transmission Planning; Co-optimization; Mixed Integer Programming; Stochastic Programming; Uncertianty

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Ho, J. L. (2014). Stochastic Co-optimization for National Transmission Planning Under Environmental Regulation. (Thesis). Johns Hopkins University. Retrieved from http://jhir.library.jhu.edu/handle/1774.2/37101

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Ho, Jonathan L. “Stochastic Co-optimization for National Transmission Planning Under Environmental Regulation.” 2014. Thesis, Johns Hopkins University. Accessed February 26, 2021. http://jhir.library.jhu.edu/handle/1774.2/37101.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Ho, Jonathan L. “Stochastic Co-optimization for National Transmission Planning Under Environmental Regulation.” 2014. Web. 26 Feb 2021.

Vancouver:

Ho JL. Stochastic Co-optimization for National Transmission Planning Under Environmental Regulation. [Internet] [Thesis]. Johns Hopkins University; 2014. [cited 2021 Feb 26]. Available from: http://jhir.library.jhu.edu/handle/1774.2/37101.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Ho JL. Stochastic Co-optimization for National Transmission Planning Under Environmental Regulation. [Thesis]. Johns Hopkins University; 2014. Available from: http://jhir.library.jhu.edu/handle/1774.2/37101

Not specified: Masters Thesis or Doctoral Dissertation

Texas A&M University

15. Yamamoto, Hiromichi. A Heuristic Algorithm for Solving Capacitated Facility Location Problems Using a Greedy-Based Iterative LP Relaxation Procedure.

Degree: MS, Industrial Engineering, 2018, Texas A&M University

URL: http://hdl.handle.net/1969.1/173996

► A new methodology to solve the capacitated facility location problem (CFLP) is presented. This optimization problem can be explicitly formulated and solved as a *mixed*…
(more)

Subjects/Keywords: Capacitated Facility Location Problem; Heuristic; Linear Programming; Mixed Integer Programming

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Yamamoto, H. (2018). A Heuristic Algorithm for Solving Capacitated Facility Location Problems Using a Greedy-Based Iterative LP Relaxation Procedure. (Masters Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/173996

Chicago Manual of Style (16^{th} Edition):

Yamamoto, Hiromichi. “A Heuristic Algorithm for Solving Capacitated Facility Location Problems Using a Greedy-Based Iterative LP Relaxation Procedure.” 2018. Masters Thesis, Texas A&M University. Accessed February 26, 2021. http://hdl.handle.net/1969.1/173996.

MLA Handbook (7^{th} Edition):

Yamamoto, Hiromichi. “A Heuristic Algorithm for Solving Capacitated Facility Location Problems Using a Greedy-Based Iterative LP Relaxation Procedure.” 2018. Web. 26 Feb 2021.

Vancouver:

Yamamoto H. A Heuristic Algorithm for Solving Capacitated Facility Location Problems Using a Greedy-Based Iterative LP Relaxation Procedure. [Internet] [Masters thesis]. Texas A&M University; 2018. [cited 2021 Feb 26]. Available from: http://hdl.handle.net/1969.1/173996.

Council of Science Editors:

Yamamoto H. A Heuristic Algorithm for Solving Capacitated Facility Location Problems Using a Greedy-Based Iterative LP Relaxation Procedure. [Masters Thesis]. Texas A&M University; 2018. Available from: http://hdl.handle.net/1969.1/173996

Penn State University

16.
Wan, Wendian.
Interior point schemes for *mixed*-binary quadratic programs: Computational investigations and applications to unit commitment problems.

Degree: 2015, Penn State University

URL: https://submit-etda.libraries.psu.edu/catalog/26650

► We consider a class of *mixed*-binary quadratic programs, a subclass of *mixed*-*integer* quadratic programs. When the continuous relaxation of such problems is convex, then a…
(more)

Subjects/Keywords: Interior point method; quadratic programming; mixed integer programming

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Wan, W. (2015). Interior point schemes for mixed-binary quadratic programs: Computational investigations and applications to unit commitment problems. (Thesis). Penn State University. Retrieved from https://submit-etda.libraries.psu.edu/catalog/26650

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Wan, Wendian. “Interior point schemes for mixed-binary quadratic programs: Computational investigations and applications to unit commitment problems.” 2015. Thesis, Penn State University. Accessed February 26, 2021. https://submit-etda.libraries.psu.edu/catalog/26650.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Wan, Wendian. “Interior point schemes for mixed-binary quadratic programs: Computational investigations and applications to unit commitment problems.” 2015. Web. 26 Feb 2021.

Vancouver:

Wan W. Interior point schemes for mixed-binary quadratic programs: Computational investigations and applications to unit commitment problems. [Internet] [Thesis]. Penn State University; 2015. [cited 2021 Feb 26]. Available from: https://submit-etda.libraries.psu.edu/catalog/26650.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Wan W. Interior point schemes for mixed-binary quadratic programs: Computational investigations and applications to unit commitment problems. [Thesis]. Penn State University; 2015. Available from: https://submit-etda.libraries.psu.edu/catalog/26650

Not specified: Masters Thesis or Doctoral Dissertation

University of Tennessee – Knoxville

17. Lambert, Lixia He. Supply Chain Optimization and Economic Analysis of Using Industrial Spent Microbial Biomass (SMB) in Agriculture.

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

URL: https://trace.tennessee.edu/utk_gradthes/5161

► This thesis uses a *mixed* *integer* program to minimize the transport and storage cost of delivering spent microbial biomass (SMB), a bio-coproduct resulting from the…
(more)

Subjects/Keywords: Optimization; Mixed Integer Programming; Stochastic Programming; Spent Microbial Biomass; Fertilizer

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Lambert, L. H. (2018). Supply Chain Optimization and Economic Analysis of Using Industrial Spent Microbial Biomass (SMB) in Agriculture. (Thesis). University of Tennessee – Knoxville. Retrieved from https://trace.tennessee.edu/utk_gradthes/5161

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Lambert, Lixia He. “Supply Chain Optimization and Economic Analysis of Using Industrial Spent Microbial Biomass (SMB) in Agriculture.” 2018. Thesis, University of Tennessee – Knoxville. Accessed February 26, 2021. https://trace.tennessee.edu/utk_gradthes/5161.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Lambert, Lixia He. “Supply Chain Optimization and Economic Analysis of Using Industrial Spent Microbial Biomass (SMB) in Agriculture.” 2018. Web. 26 Feb 2021.

Vancouver:

Lambert LH. Supply Chain Optimization and Economic Analysis of Using Industrial Spent Microbial Biomass (SMB) in Agriculture. [Internet] [Thesis]. University of Tennessee – Knoxville; 2018. [cited 2021 Feb 26]. Available from: https://trace.tennessee.edu/utk_gradthes/5161.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Lambert LH. Supply Chain Optimization and Economic Analysis of Using Industrial Spent Microbial Biomass (SMB) in Agriculture. [Thesis]. University of Tennessee – Knoxville; 2018. Available from: https://trace.tennessee.edu/utk_gradthes/5161

Not specified: Masters Thesis or Doctoral Dissertation

18.
Trieu, Long.
Continuous optimization methods for convex *mixed*-*integer* nonlinear * programming*.

Degree: 2015, Technische Universität Dortmund

URL: http://dx.doi.org/10.17877/DE290R-16296

► The topic of this dissertation is the design of fast branch-and-bound algorithms that use intelligently adapted approaches from continuous optimization for solving convex *mixed*-*integer* nonlinear…
(more)

Subjects/Keywords: Mixed integer nonlinear programming; Convex optimization; Quadratic programming; 510

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Trieu, L. (2015). Continuous optimization methods for convex mixed-integer nonlinear programming. (Doctoral Dissertation). Technische Universität Dortmund. Retrieved from http://dx.doi.org/10.17877/DE290R-16296

Chicago Manual of Style (16^{th} Edition):

Trieu, Long. “Continuous optimization methods for convex mixed-integer nonlinear programming.” 2015. Doctoral Dissertation, Technische Universität Dortmund. Accessed February 26, 2021. http://dx.doi.org/10.17877/DE290R-16296.

MLA Handbook (7^{th} Edition):

Trieu, Long. “Continuous optimization methods for convex mixed-integer nonlinear programming.” 2015. Web. 26 Feb 2021.

Vancouver:

Trieu L. Continuous optimization methods for convex mixed-integer nonlinear programming. [Internet] [Doctoral dissertation]. Technische Universität Dortmund; 2015. [cited 2021 Feb 26]. Available from: http://dx.doi.org/10.17877/DE290R-16296.

Council of Science Editors:

Trieu L. Continuous optimization methods for convex mixed-integer nonlinear programming. [Doctoral Dissertation]. Technische Universität Dortmund; 2015. Available from: http://dx.doi.org/10.17877/DE290R-16296

Univerzitet u Beogradu

19. Martinović, Nataša, 1968-. Optimalno raspoređivanje konsultanata na više projekata na osnovu ocene efikasnosti.

Degree: Fakultet organizacionih nauka, 2020, Univerzitet u Beogradu

URL: https://fedorani.ni.ac.rs/fedora/get/o:20946/bdef:Content/get

►

Tehničke nauke - Operaciona istraživanja / Technical sciences - Operational research

Predmet istraživanja ove doktorske disertacije je razvoj novog pristupa selekciji konsultanata i njihovo optimalno… (more)

Subjects/Keywords: efficient assessment plan; data envelopment analysis (DEA); mixed-integer programming; multi-project staff assessment; mixed-integer programming DEA-model

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Martinović, Nataša, 1. (2020). Optimalno raspoređivanje konsultanata na više projekata na osnovu ocene efikasnosti. (Thesis). Univerzitet u Beogradu. Retrieved from https://fedorani.ni.ac.rs/fedora/get/o:20946/bdef:Content/get

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Martinović, Nataša, 1968-. “Optimalno raspoređivanje konsultanata na više projekata na osnovu ocene efikasnosti.” 2020. Thesis, Univerzitet u Beogradu. Accessed February 26, 2021. https://fedorani.ni.ac.rs/fedora/get/o:20946/bdef:Content/get.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Martinović, Nataša, 1968-. “Optimalno raspoređivanje konsultanata na više projekata na osnovu ocene efikasnosti.” 2020. Web. 26 Feb 2021.

Vancouver:

Martinović, Nataša 1. Optimalno raspoređivanje konsultanata na više projekata na osnovu ocene efikasnosti. [Internet] [Thesis]. Univerzitet u Beogradu; 2020. [cited 2021 Feb 26]. Available from: https://fedorani.ni.ac.rs/fedora/get/o:20946/bdef:Content/get.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Martinović, Nataša 1. Optimalno raspoređivanje konsultanata na više projekata na osnovu ocene efikasnosti. [Thesis]. Univerzitet u Beogradu; 2020. Available from: https://fedorani.ni.ac.rs/fedora/get/o:20946/bdef:Content/get

Not specified: Masters Thesis or Doctoral Dissertation

University of Cambridge

20. Al Ismaili, Riham. Optimisation of heat exchanger network maintenance scheduling problems.

Degree: PhD, 2018, University of Cambridge

URL: https://doi.org/10.17863/CAM.27649 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.753459

► This thesis focuses on the challenges that arise from the scheduling of heat exchanger network maintenance problems which undergo fouling and run continuously over time.…
(more)

Subjects/Keywords: 621.402; heat exchanger networks; mixed-integer optimal control problems; maintenance scheduling; fouling; mixed-integer nonlinear programming problems; stochastic programming

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Al Ismaili, R. (2018). Optimisation of heat exchanger network maintenance scheduling problems. (Doctoral Dissertation). University of Cambridge. Retrieved from https://doi.org/10.17863/CAM.27649 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.753459

Chicago Manual of Style (16^{th} Edition):

Al Ismaili, Riham. “Optimisation of heat exchanger network maintenance scheduling problems.” 2018. Doctoral Dissertation, University of Cambridge. Accessed February 26, 2021. https://doi.org/10.17863/CAM.27649 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.753459.

MLA Handbook (7^{th} Edition):

Al Ismaili, Riham. “Optimisation of heat exchanger network maintenance scheduling problems.” 2018. Web. 26 Feb 2021.

Vancouver:

Al Ismaili R. Optimisation of heat exchanger network maintenance scheduling problems. [Internet] [Doctoral dissertation]. University of Cambridge; 2018. [cited 2021 Feb 26]. Available from: https://doi.org/10.17863/CAM.27649 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.753459.

Council of Science Editors:

Al Ismaili R. Optimisation of heat exchanger network maintenance scheduling problems. [Doctoral Dissertation]. University of Cambridge; 2018. Available from: https://doi.org/10.17863/CAM.27649 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.753459

Cornell University

21. Zhao, Tianli. Economic Modeling Of Point-To-Point Source Water Quality Trading In The Upper Passaic Watershed Accounting For Fixed And Variable Costs.

Degree: M.S., Agricultural Economics, Agricultural Economics, 2013, Cornell University

URL: http://hdl.handle.net/1813/34091

► The lack of widespread success in existing water quality trading programs may be attributed, in part, to a limited correspondence between the institutional and hydrologic…
(more)

Subjects/Keywords: Environmental Economics; Mixed Integer Nonlinear Programming; Water Quality Trading

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Zhao, T. (2013). Economic Modeling Of Point-To-Point Source Water Quality Trading In The Upper Passaic Watershed Accounting For Fixed And Variable Costs. (Masters Thesis). Cornell University. Retrieved from http://hdl.handle.net/1813/34091

Chicago Manual of Style (16^{th} Edition):

Zhao, Tianli. “Economic Modeling Of Point-To-Point Source Water Quality Trading In The Upper Passaic Watershed Accounting For Fixed And Variable Costs.” 2013. Masters Thesis, Cornell University. Accessed February 26, 2021. http://hdl.handle.net/1813/34091.

MLA Handbook (7^{th} Edition):

Zhao, Tianli. “Economic Modeling Of Point-To-Point Source Water Quality Trading In The Upper Passaic Watershed Accounting For Fixed And Variable Costs.” 2013. Web. 26 Feb 2021.

Vancouver:

Zhao T. Economic Modeling Of Point-To-Point Source Water Quality Trading In The Upper Passaic Watershed Accounting For Fixed And Variable Costs. [Internet] [Masters thesis]. Cornell University; 2013. [cited 2021 Feb 26]. Available from: http://hdl.handle.net/1813/34091.

Council of Science Editors:

Zhao T. Economic Modeling Of Point-To-Point Source Water Quality Trading In The Upper Passaic Watershed Accounting For Fixed And Variable Costs. [Masters Thesis]. Cornell University; 2013. Available from: http://hdl.handle.net/1813/34091

Texas A&M University

22. Dilaveroglu, Sebnem 1986-. Optimization for Design and Operation of Natural Gas Transmission Networks.

Degree: MS, Industrial Engineering, 2012, Texas A&M University

URL: http://hdl.handle.net/1969.1/148055

► This study addresses the problem of designing a new natural gas transmission network or expanding an existing network while minimizing the total investment and operating…
(more)

Subjects/Keywords: Mixed integer nonlinear programming; Network design; Natural gas

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Dilaveroglu, S. 1. (2012). Optimization for Design and Operation of Natural Gas Transmission Networks. (Masters Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/148055

Chicago Manual of Style (16^{th} Edition):

Dilaveroglu, Sebnem 1986-. “Optimization for Design and Operation of Natural Gas Transmission Networks.” 2012. Masters Thesis, Texas A&M University. Accessed February 26, 2021. http://hdl.handle.net/1969.1/148055.

MLA Handbook (7^{th} Edition):

Dilaveroglu, Sebnem 1986-. “Optimization for Design and Operation of Natural Gas Transmission Networks.” 2012. Web. 26 Feb 2021.

Vancouver:

Dilaveroglu S1. Optimization for Design and Operation of Natural Gas Transmission Networks. [Internet] [Masters thesis]. Texas A&M University; 2012. [cited 2021 Feb 26]. Available from: http://hdl.handle.net/1969.1/148055.

Council of Science Editors:

Dilaveroglu S1. Optimization for Design and Operation of Natural Gas Transmission Networks. [Masters Thesis]. Texas A&M University; 2012. Available from: http://hdl.handle.net/1969.1/148055

McMaster University

23. Tominac, Philip A. GAME THEORETIC APPROACHES TO PETROLEUM REFINERY PRODUCTION PLANNING – A JUSTIFICATION FOR THE ENTERPRISE LEVEL OPTIMIZATION OF PRODUCTION PLANNING.

Degree: PhD, 2017, McMaster University

URL: http://hdl.handle.net/11375/22067

►

This thesis presents frameworks for the optimal strategic production planning of petroleum refineries operating in competition in multiple markets. The game theoretic concept of the… (more)

Subjects/Keywords: Optimization; Production planning; Game theory; Potential game; Mixed Integer Nonlinear Programming

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Tominac, P. A. (2017). GAME THEORETIC APPROACHES TO PETROLEUM REFINERY PRODUCTION PLANNING – A JUSTIFICATION FOR THE ENTERPRISE LEVEL OPTIMIZATION OF PRODUCTION PLANNING. (Doctoral Dissertation). McMaster University. Retrieved from http://hdl.handle.net/11375/22067

Chicago Manual of Style (16^{th} Edition):

Tominac, Philip A. “GAME THEORETIC APPROACHES TO PETROLEUM REFINERY PRODUCTION PLANNING – A JUSTIFICATION FOR THE ENTERPRISE LEVEL OPTIMIZATION OF PRODUCTION PLANNING.” 2017. Doctoral Dissertation, McMaster University. Accessed February 26, 2021. http://hdl.handle.net/11375/22067.

MLA Handbook (7^{th} Edition):

Tominac, Philip A. “GAME THEORETIC APPROACHES TO PETROLEUM REFINERY PRODUCTION PLANNING – A JUSTIFICATION FOR THE ENTERPRISE LEVEL OPTIMIZATION OF PRODUCTION PLANNING.” 2017. Web. 26 Feb 2021.

Vancouver:

Tominac PA. GAME THEORETIC APPROACHES TO PETROLEUM REFINERY PRODUCTION PLANNING – A JUSTIFICATION FOR THE ENTERPRISE LEVEL OPTIMIZATION OF PRODUCTION PLANNING. [Internet] [Doctoral dissertation]. McMaster University; 2017. [cited 2021 Feb 26]. Available from: http://hdl.handle.net/11375/22067.

Council of Science Editors:

Tominac PA. GAME THEORETIC APPROACHES TO PETROLEUM REFINERY PRODUCTION PLANNING – A JUSTIFICATION FOR THE ENTERPRISE LEVEL OPTIMIZATION OF PRODUCTION PLANNING. [Doctoral Dissertation]. McMaster University; 2017. Available from: http://hdl.handle.net/11375/22067

Penn State University

24. Wen, Xingtong. Optimization of an outbound logistic network: a vehicle routing problem.

Degree: 2013, Penn State University

URL: https://submit-etda.libraries.psu.edu/catalog/19243

► Outbound logistics is one of the primary processes of logistics, concentrating on the delivery of finished products to the retailers. As a result, the responsiveness…
(more)

Subjects/Keywords: Mixed Integer Programming Vehicle Routing Problem Freight consol

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Wen, X. (2013). Optimization of an outbound logistic network: a vehicle routing problem. (Thesis). Penn State University. Retrieved from https://submit-etda.libraries.psu.edu/catalog/19243

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Wen, Xingtong. “Optimization of an outbound logistic network: a vehicle routing problem.” 2013. Thesis, Penn State University. Accessed February 26, 2021. https://submit-etda.libraries.psu.edu/catalog/19243.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Wen, Xingtong. “Optimization of an outbound logistic network: a vehicle routing problem.” 2013. Web. 26 Feb 2021.

Vancouver:

Wen X. Optimization of an outbound logistic network: a vehicle routing problem. [Internet] [Thesis]. Penn State University; 2013. [cited 2021 Feb 26]. Available from: https://submit-etda.libraries.psu.edu/catalog/19243.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Wen X. Optimization of an outbound logistic network: a vehicle routing problem. [Thesis]. Penn State University; 2013. Available from: https://submit-etda.libraries.psu.edu/catalog/19243

Not specified: Masters Thesis or Doctoral Dissertation

University of Waterloo

25. Bayley, Tiffany. Lot-Sizing of Several Multi-Product Families.

Degree: 2018, University of Waterloo

URL: http://hdl.handle.net/10012/13133

► Production planning problems and its variants are widely studied in operations management and optimization literature. One variation that has not garnered much attention is the…
(more)

Subjects/Keywords: production planning; decomposition; mixed integer programming; vehicle routing; metaheuristics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Bayley, T. (2018). Lot-Sizing of Several Multi-Product Families. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/13133

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Bayley, Tiffany. “Lot-Sizing of Several Multi-Product Families.” 2018. Thesis, University of Waterloo. Accessed February 26, 2021. http://hdl.handle.net/10012/13133.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Bayley, Tiffany. “Lot-Sizing of Several Multi-Product Families.” 2018. Web. 26 Feb 2021.

Vancouver:

Bayley T. Lot-Sizing of Several Multi-Product Families. [Internet] [Thesis]. University of Waterloo; 2018. [cited 2021 Feb 26]. Available from: http://hdl.handle.net/10012/13133.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Bayley T. Lot-Sizing of Several Multi-Product Families. [Thesis]. University of Waterloo; 2018. Available from: http://hdl.handle.net/10012/13133

Not specified: Masters Thesis or Doctoral Dissertation

University of Newcastle

26. Kapoor, Reena. Scheduling problems arising in coal export supply chains: algorithms and complexity.

Degree: non-terminal) node equals the total capacity of arcs leaving the node; and identical capacities on all arcs. Another factor that has a great impact on the throughput of the coal supply chain is the management of the stockyard, which is the interface between the land portion of the coal supply chain and the ocean portion of the coal supply chain, and where the cargoes get assembled. Given a number of vessels arriving at the port, stockyard management decisions include: assigning a location to each cargo (stockpile, 2015, University of Newcastle

URL: http://hdl.handle.net/1959.13/1310323

►

Research Doctorate - Doctor of Philosophy

A coal supply chain is a highly complex logistics system, comprising of several parties and components, focused on transporting… (more)

Subjects/Keywords: mixed integer programming; computational complexity; approximation algorithm; network optimization; scheduling; routing

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kapoor, R. (2015). Scheduling problems arising in coal export supply chains: algorithms and complexity. (Doctoral Dissertation). University of Newcastle. Retrieved from http://hdl.handle.net/1959.13/1310323

Chicago Manual of Style (16^{th} Edition):

Kapoor, Reena. “Scheduling problems arising in coal export supply chains: algorithms and complexity.” 2015. Doctoral Dissertation, University of Newcastle. Accessed February 26, 2021. http://hdl.handle.net/1959.13/1310323.

MLA Handbook (7^{th} Edition):

Kapoor, Reena. “Scheduling problems arising in coal export supply chains: algorithms and complexity.” 2015. Web. 26 Feb 2021.

Vancouver:

Kapoor R. Scheduling problems arising in coal export supply chains: algorithms and complexity. [Internet] [Doctoral dissertation]. University of Newcastle; 2015. [cited 2021 Feb 26]. Available from: http://hdl.handle.net/1959.13/1310323.

Council of Science Editors:

Kapoor R. Scheduling problems arising in coal export supply chains: algorithms and complexity. [Doctoral Dissertation]. University of Newcastle; 2015. Available from: http://hdl.handle.net/1959.13/1310323

University of Newcastle

27. Kaur, Simranjit. Arc shutdown scheduling in a capacitated network to maximize flow over time.

Degree: PhD, 2015, University of Newcastle

URL: http://hdl.handle.net/1959.13/1310381

►

Research Doctorate - Doctor of Philosophy (PhD)

In this research we focus on a problem in the class of network flow problems in which arc… (more)

Subjects/Keywords: optimization; scheduling; network flows; mixed integer programming; heuristics; computational complexity

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kaur, S. (2015). Arc shutdown scheduling in a capacitated network to maximize flow over time. (Doctoral Dissertation). University of Newcastle. Retrieved from http://hdl.handle.net/1959.13/1310381

Chicago Manual of Style (16^{th} Edition):

Kaur, Simranjit. “Arc shutdown scheduling in a capacitated network to maximize flow over time.” 2015. Doctoral Dissertation, University of Newcastle. Accessed February 26, 2021. http://hdl.handle.net/1959.13/1310381.

MLA Handbook (7^{th} Edition):

Kaur, Simranjit. “Arc shutdown scheduling in a capacitated network to maximize flow over time.” 2015. Web. 26 Feb 2021.

Vancouver:

Kaur S. Arc shutdown scheduling in a capacitated network to maximize flow over time. [Internet] [Doctoral dissertation]. University of Newcastle; 2015. [cited 2021 Feb 26]. Available from: http://hdl.handle.net/1959.13/1310381.

Council of Science Editors:

Kaur S. Arc shutdown scheduling in a capacitated network to maximize flow over time. [Doctoral Dissertation]. University of Newcastle; 2015. Available from: http://hdl.handle.net/1959.13/1310381

University of Toronto

28. Yeo, Alexia. COMBINATORIALLY CONSTRAINED PORTFOLIO OPTIMIZATION USING MESSAGE PASSING ALGORITHMS.

Degree: 2018, University of Toronto

URL: http://hdl.handle.net/1807/89580

►

Portfolio optimization aims to find the optimal investment strategy for a series of assets that results in a minimization of the portfolio's variance. Real life… (more)

Subjects/Keywords: Mixed Integer Programming; Portfolio Optimization; Probabilistic Graphical Model; 0796

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Yeo, A. (2018). COMBINATORIALLY CONSTRAINED PORTFOLIO OPTIMIZATION USING MESSAGE PASSING ALGORITHMS. (Masters Thesis). University of Toronto. Retrieved from http://hdl.handle.net/1807/89580

Chicago Manual of Style (16^{th} Edition):

Yeo, Alexia. “COMBINATORIALLY CONSTRAINED PORTFOLIO OPTIMIZATION USING MESSAGE PASSING ALGORITHMS.” 2018. Masters Thesis, University of Toronto. Accessed February 26, 2021. http://hdl.handle.net/1807/89580.

MLA Handbook (7^{th} Edition):

Yeo, Alexia. “COMBINATORIALLY CONSTRAINED PORTFOLIO OPTIMIZATION USING MESSAGE PASSING ALGORITHMS.” 2018. Web. 26 Feb 2021.

Vancouver:

Yeo A. COMBINATORIALLY CONSTRAINED PORTFOLIO OPTIMIZATION USING MESSAGE PASSING ALGORITHMS. [Internet] [Masters thesis]. University of Toronto; 2018. [cited 2021 Feb 26]. Available from: http://hdl.handle.net/1807/89580.

Council of Science Editors:

Yeo A. COMBINATORIALLY CONSTRAINED PORTFOLIO OPTIMIZATION USING MESSAGE PASSING ALGORITHMS. [Masters Thesis]. University of Toronto; 2018. Available from: http://hdl.handle.net/1807/89580

29. Cardoso, Mónica Glória. Modelo de otimização do espaço livre de armazenagem num silo de cereais.

Degree: 2012, Instituto Politécnico do Porto

URL: http://www.rcaap.pt/detail.jsp?id=oai:recipp.ipp.pt:10400.22/2722

►

Este trabalho baseia-se num caso de estudo real de planeamento de operações de armazenagem num silo rural de cereais, e enquadra-se nos problemas de planeamento… (more)

Subjects/Keywords: Cereals silos planning; Mixed integer programming; Storage optimization; Warehouse storage scheduling

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Cardoso, M. G. (2012). Modelo de otimização do espaço livre de armazenagem num silo de cereais. (Thesis). Instituto Politécnico do Porto. Retrieved from http://www.rcaap.pt/detail.jsp?id=oai:recipp.ipp.pt:10400.22/2722

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Cardoso, Mónica Glória. “Modelo de otimização do espaço livre de armazenagem num silo de cereais.” 2012. Thesis, Instituto Politécnico do Porto. Accessed February 26, 2021. http://www.rcaap.pt/detail.jsp?id=oai:recipp.ipp.pt:10400.22/2722.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Cardoso, Mónica Glória. “Modelo de otimização do espaço livre de armazenagem num silo de cereais.” 2012. Web. 26 Feb 2021.

Vancouver:

Cardoso MG. Modelo de otimização do espaço livre de armazenagem num silo de cereais. [Internet] [Thesis]. Instituto Politécnico do Porto; 2012. [cited 2021 Feb 26]. Available from: http://www.rcaap.pt/detail.jsp?id=oai:recipp.ipp.pt:10400.22/2722.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Cardoso MG. Modelo de otimização do espaço livre de armazenagem num silo de cereais. [Thesis]. Instituto Politécnico do Porto; 2012. Available from: http://www.rcaap.pt/detail.jsp?id=oai:recipp.ipp.pt:10400.22/2722

Not specified: Masters Thesis or Doctoral Dissertation

Delft University of Technology

30. den Ouden, D. (author). David and the vegetable factory: A Two-stage Optimization Model for Generating a Vegetable Factory's Facility Layout Using the Gradient Descent Approach.

Degree: 2020, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:5b853e6d-a705-4116-93f9-064fbaf9b258

►

In this thesis a two-stage model is proposed, combining the idea of a two-stage model from Anjos and Vieira [1] with a gradient descent approach,… (more)

Subjects/Keywords: Facility Layout Problem; Gradient Descent Approach; Layout Optimization; Mixed Integer Programming

Record Details Similar Records

❌

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

APA (6^{th} Edition):

den Ouden, D. (. (2020). David and the vegetable factory: A Two-stage Optimization Model for Generating a Vegetable Factory's Facility Layout Using the Gradient Descent Approach. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:5b853e6d-a705-4116-93f9-064fbaf9b258

Chicago Manual of Style (16^{th} Edition):

den Ouden, D (author). “David and the vegetable factory: A Two-stage Optimization Model for Generating a Vegetable Factory's Facility Layout Using the Gradient Descent Approach.” 2020. Masters Thesis, Delft University of Technology. Accessed February 26, 2021. http://resolver.tudelft.nl/uuid:5b853e6d-a705-4116-93f9-064fbaf9b258.

MLA Handbook (7^{th} Edition):

den Ouden, D (author). “David and the vegetable factory: A Two-stage Optimization Model for Generating a Vegetable Factory's Facility Layout Using the Gradient Descent Approach.” 2020. Web. 26 Feb 2021.

Vancouver:

den Ouden D(. David and the vegetable factory: A Two-stage Optimization Model for Generating a Vegetable Factory's Facility Layout Using the Gradient Descent Approach. [Internet] [Masters thesis]. Delft University of Technology; 2020. [cited 2021 Feb 26]. Available from: http://resolver.tudelft.nl/uuid:5b853e6d-a705-4116-93f9-064fbaf9b258.

Council of Science Editors:

den Ouden D(. David and the vegetable factory: A Two-stage Optimization Model for Generating a Vegetable Factory's Facility Layout Using the Gradient Descent Approach. [Masters Thesis]. Delft University of Technology; 2020. Available from: http://resolver.tudelft.nl/uuid:5b853e6d-a705-4116-93f9-064fbaf9b258