Advanced search options

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

You searched for `subject:(Bilevel stochastic programming problem)`

.
Showing records 1 – 30 of
24904 total matches.

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

Search Limiters

Dates

- 2017 – 2021 (5850)
- 2012 – 2016 (8872)
- 2007 – 2011 (5616)
- 2002 – 2006 (2364)
- 1997 – 2001 (1021)
- 1992 – 1996 (715)
- 1987 – 1991 (603)
- 1982 – 1986 (477)
- 1977 – 1981 (295)
- 1972 – 1976 (333)

Universities

- Brno University of Technology (808)
- ETH Zürich (535)
- Georgia Tech (464)
- Virginia Tech (416)
- University of São Paulo (405)
- University of Florida (388)
- Delft University of Technology (327)
- University of Texas – Austin (322)
- Texas A&M University (312)
- Pontifical Catholic University of Rio de Janeiro (294)
- University of Illinois – Urbana-Champaign (281)
- University of Waterloo (276)
- University of Michigan (274)
- National University of Singapore (263)
- The Ohio State University (249)

Department

- Computer Science (733)
- Mathematics (425)
- Informatique (345)
- Industrial and Systems Engineering (312)
- Electrical and Computer Engineering (271)
- Electrical Engineering (254)
- Psychology (206)
- Mechanical Engineering (204)
- Industrial Engineering (176)
- Civil Engineering (158)
- Mathématiques (152)
- Statistics (118)
- Education (117)
- Applied Mathematics (115)
- Economics (110)

Degrees

- PhD (5676)
- MS (1666)
- Docteur es (1623)
- Master (364)
- Mestrado (247)
- MA (241)
- EdD (94)
- MSin Computer Science (50)
- MSin Engineering (50)
- MEd (41)
- MSc (38)
- MS(M.S.) (35)
- MSc Engg (33)
- M.S (27)
- MSW (22)

Levels

- doctoral (9617)
- masters (3956)
- thesis (393)
- project (63)
- doctor of philosophy ph.d. (49)
- dissertation (34)
- 1 (30)
- doctor of philosophy (ph.d.) (26)

Languages

Country

- US (9635)
- Canada (1685)
- Brazil (1677)
- France (1623)
- Sweden (1318)
- UK (1233)
- Australia (947)
- Czech Republic (814)
- Netherlands (760)
- Greece (669)
- South Africa (550)
- Switzerland (541)
- Portugal (390)
- India (347)
- New Zealand (290)

▼ Search Limiters

Vilnius University

1.
Dumskis,
Valerijonas.
Analysis and application of methods for search of
*stochastic* equilibrium.

Degree: PhD, Informatics Engineering, 2014, Vilnius University

URL: http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2014~D_20140630_153939-93655 ;

►

The research *subject* of the dissertation is the analysis of the model of heterogenous agents and its application for modelling *stochastic* Nash and Stackelberg equilibriums,…
(more)

Subjects/Keywords: Stochastic equilibrium; Stackelberg; Nash equilibriums; Bilevel stochastic programming problem; Stochastinė pusiausvyra; Stakelbergo; Nešo pusiausvyros; Dviejų lygių stochastinis uždavinys

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Dumskis, Valerijonas. (2014). Analysis and application of methods for search of stochastic equilibrium. (Doctoral Dissertation). Vilnius University. Retrieved from http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2014~D_20140630_153939-93655 ;

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

Author name may be incomplete

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

Dumskis, Valerijonas. “Analysis and application of methods for search of stochastic equilibrium.” 2014. Doctoral Dissertation, Vilnius University. Accessed January 17, 2021. http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2014~D_20140630_153939-93655 ;.

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

Author name may be incomplete

MLA Handbook (7^{th} Edition):

Dumskis, Valerijonas. “Analysis and application of methods for search of stochastic equilibrium.” 2014. Web. 17 Jan 2021.

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

Author name may be incomplete

Vancouver:

Dumskis, Valerijonas. Analysis and application of methods for search of stochastic equilibrium. [Internet] [Doctoral dissertation]. Vilnius University; 2014. [cited 2021 Jan 17]. Available from: http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2014~D_20140630_153939-93655 ;.

Author name may be incomplete

Council of Science Editors:

Dumskis, Valerijonas. Analysis and application of methods for search of stochastic equilibrium. [Doctoral Dissertation]. Vilnius University; 2014. Available from: http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2014~D_20140630_153939-93655 ;

Author name may be incomplete

Iowa State University

2. Rahdar, Mohammad. Three essays on multi-level optimization models and applications.

Degree: 2016, Iowa State University

URL: https://lib.dr.iastate.edu/etd/15795

► The general form of a multi-level mathematical *programming* *problem* is a set of nested optimization problems, in which each level controls a series of decision…
(more)

Subjects/Keywords: Algorithm design; bilevel programming problem; Multi-level programming problem; Optimization; Industrial Engineering; Operational Research

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Rahdar, M. (2016). Three essays on multi-level optimization models and applications. (Thesis). Iowa State University. Retrieved from https://lib.dr.iastate.edu/etd/15795

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

Rahdar, Mohammad. “Three essays on multi-level optimization models and applications.” 2016. Thesis, Iowa State University. Accessed January 17, 2021. https://lib.dr.iastate.edu/etd/15795.

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Rahdar, Mohammad. “Three essays on multi-level optimization models and applications.” 2016. Web. 17 Jan 2021.

Vancouver:

Rahdar M. Three essays on multi-level optimization models and applications. [Internet] [Thesis]. Iowa State University; 2016. [cited 2021 Jan 17]. Available from: https://lib.dr.iastate.edu/etd/15795.

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

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Rahdar M. Three essays on multi-level optimization models and applications. [Thesis]. Iowa State University; 2016. Available from: https://lib.dr.iastate.edu/etd/15795

Not specified: Masters Thesis or Doctoral Dissertation

University of Waterloo

3.
Gunter, Joshua.
The complexity of some set-partitioning formulations for the vehicle routing *problem* with *stochastic* demands.

Degree: 2020, University of Waterloo

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

► The capacitated vehicle routing *problem* with *stochastic* demands (CVRPSD) is a variant of the deterministic capacitated vehicle routing *problem* (CVRP). The CVRP consists of planning…
(more)

Subjects/Keywords: vehicle routing problem; stochastic programming; set partitioning

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Gunter, J. (2020). The complexity of some set-partitioning formulations for the vehicle routing problem with stochastic demands. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/16479

Not specified: Masters Thesis or Doctoral Dissertation

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

Gunter, Joshua. “The complexity of some set-partitioning formulations for the vehicle routing problem with stochastic demands.” 2020. Thesis, University of Waterloo. Accessed January 17, 2021. http://hdl.handle.net/10012/16479.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Gunter, Joshua. “The complexity of some set-partitioning formulations for the vehicle routing problem with stochastic demands.” 2020. Web. 17 Jan 2021.

Vancouver:

Gunter J. The complexity of some set-partitioning formulations for the vehicle routing problem with stochastic demands. [Internet] [Thesis]. University of Waterloo; 2020. [cited 2021 Jan 17]. Available from: http://hdl.handle.net/10012/16479.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Gunter J. The complexity of some set-partitioning formulations for the vehicle routing problem with stochastic demands. [Thesis]. University of Waterloo; 2020. Available from: http://hdl.handle.net/10012/16479

Not specified: Masters Thesis or Doctoral Dissertation

University of Southern California

4.
Wu, Teng.
A *stochastic* employment * problem*.

Degree: PhD, Industrial and Systems Engineering, 2013, University of Southern California

URL: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/245624/rec/370

► This dissertation studied a *Stochastic* Assignment *Problem*, called “A *Stochastic* Employment *Problem*(SEP)”. There are n boxes having quota S =(S₁...Sn), that is box i needs…
(more)

Subjects/Keywords: stochastic; assignment problem; sequential decision process; dynamic programming; simulation; optimization; applied probability modeling; stochastic dominance

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Wu, T. (2013). A stochastic employment problem. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/245624/rec/370

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

Wu, Teng. “A stochastic employment problem.” 2013. Doctoral Dissertation, University of Southern California. Accessed January 17, 2021. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/245624/rec/370.

MLA Handbook (7^{th} Edition):

Wu, Teng. “A stochastic employment problem.” 2013. Web. 17 Jan 2021.

Vancouver:

Wu T. A stochastic employment problem. [Internet] [Doctoral dissertation]. University of Southern California; 2013. [cited 2021 Jan 17]. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/245624/rec/370.

Council of Science Editors:

Wu T. A stochastic employment problem. [Doctoral Dissertation]. University of Southern California; 2013. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/245624/rec/370

University of Houston

5. Cho, Jaeyoung. Maritime Vehicle Routing under Uncertainty: Liquefied Natural Gas Shipping and Offshore Pipeline Damage Assessment Problems.

Degree: PhD, Industrial Engineering, University of Houston

URL: http://hdl.handle.net/10657/3579

► Maritime vehicle routing and scheduling *problem* has been studied extensively in the context of risk mitigation. This dissertation addresses three maritime vehicle routing problems and…
(more)

Subjects/Keywords: Vehicle Routing Problem; Stochastic Programming

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Cho, J. (n.d.). Maritime Vehicle Routing under Uncertainty: Liquefied Natural Gas Shipping and Offshore Pipeline Damage Assessment Problems. (Doctoral Dissertation). University of Houston. Retrieved from http://hdl.handle.net/10657/3579

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

No year of publication.

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

Cho, Jaeyoung. “Maritime Vehicle Routing under Uncertainty: Liquefied Natural Gas Shipping and Offshore Pipeline Damage Assessment Problems.” Doctoral Dissertation, University of Houston. Accessed January 17, 2021. http://hdl.handle.net/10657/3579.

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

No year of publication.

MLA Handbook (7^{th} Edition):

Cho, Jaeyoung. “Maritime Vehicle Routing under Uncertainty: Liquefied Natural Gas Shipping and Offshore Pipeline Damage Assessment Problems.” Web. 17 Jan 2021.

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

No year of publication.

Vancouver:

Cho J. Maritime Vehicle Routing under Uncertainty: Liquefied Natural Gas Shipping and Offshore Pipeline Damage Assessment Problems. [Internet] [Doctoral dissertation]. University of Houston; [cited 2021 Jan 17]. Available from: http://hdl.handle.net/10657/3579.

No year of publication.

Council of Science Editors:

Cho J. Maritime Vehicle Routing under Uncertainty: Liquefied Natural Gas Shipping and Offshore Pipeline Damage Assessment Problems. [Doctoral Dissertation]. University of Houston; Available from: http://hdl.handle.net/10657/3579

No year of publication.

University of Edinburgh

6.
Qiang, Feng.
Parallel *problem* generation for structured problems in mathematical * programming*.

Degree: PhD, 2015, University of Edinburgh

URL: http://hdl.handle.net/1842/11688

► The aim of this research is to investigate parallel *problem* generation for structured optimization problems. The result of this research has produced a novel parallel…
(more)

Subjects/Keywords: 519.7; algebraic modelling language; stochastic programming; parallel problem generation; structure exploiting

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Qiang, F. (2015). Parallel problem generation for structured problems in mathematical programming. (Doctoral Dissertation). University of Edinburgh. Retrieved from http://hdl.handle.net/1842/11688

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

Qiang, Feng. “Parallel problem generation for structured problems in mathematical programming.” 2015. Doctoral Dissertation, University of Edinburgh. Accessed January 17, 2021. http://hdl.handle.net/1842/11688.

MLA Handbook (7^{th} Edition):

Qiang, Feng. “Parallel problem generation for structured problems in mathematical programming.” 2015. Web. 17 Jan 2021.

Vancouver:

Qiang F. Parallel problem generation for structured problems in mathematical programming. [Internet] [Doctoral dissertation]. University of Edinburgh; 2015. [cited 2021 Jan 17]. Available from: http://hdl.handle.net/1842/11688.

Council of Science Editors:

Qiang F. Parallel problem generation for structured problems in mathematical programming. [Doctoral Dissertation]. University of Edinburgh; 2015. Available from: http://hdl.handle.net/1842/11688

Brno University of Technology

7. Holešovský, Jan. Modely optimalizace dopravy: Traffic assignment optimization models.

Degree: 2019, Brno University of Technology

URL: http://hdl.handle.net/11012/4629

► The class of network flow problems is one of the traditional applications of mathematical optimization. Such problems are widely applicable for example in logistics to…
(more)

Subjects/Keywords: dopravní problém; toky v sítích; stochastické programování; dvoustupňová optimalizace; dvouúrovňová optimalizace; traffic assignment; network flows; stochastic programming; two-stage optimization; bilevel optimization

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Holešovský, J. (2019). Modely optimalizace dopravy: Traffic assignment optimization models. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/4629

Not specified: Masters Thesis or Doctoral Dissertation

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

Holešovský, Jan. “Modely optimalizace dopravy: Traffic assignment optimization models.” 2019. Thesis, Brno University of Technology. Accessed January 17, 2021. http://hdl.handle.net/11012/4629.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Holešovský, Jan. “Modely optimalizace dopravy: Traffic assignment optimization models.” 2019. Web. 17 Jan 2021.

Vancouver:

Holešovský J. Modely optimalizace dopravy: Traffic assignment optimization models. [Internet] [Thesis]. Brno University of Technology; 2019. [cited 2021 Jan 17]. Available from: http://hdl.handle.net/11012/4629.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Holešovský J. Modely optimalizace dopravy: Traffic assignment optimization models. [Thesis]. Brno University of Technology; 2019. Available from: http://hdl.handle.net/11012/4629

Not specified: Masters Thesis or Doctoral Dissertation

Delft University of Technology

8. Van Tol, M.C.M. (author). Vessel routing for sweeping of marine litter in a port area.

Degree: 2016, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:97bbbf1e-eed8-4f0b-be61-d3f222aab929

►

In literature it is widely accepted that 80% of the marine litter originates from land based sources. Since seaports usually are strategically situated with an… (more)

Subjects/Keywords: marine litter; port; inventory routing problem; mixed integer programming; stochastic programming; simulation

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Van Tol, M. C. M. (. (2016). Vessel routing for sweeping of marine litter in a port area. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:97bbbf1e-eed8-4f0b-be61-d3f222aab929

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

Van Tol, M C M (author). “Vessel routing for sweeping of marine litter in a port area.” 2016. Masters Thesis, Delft University of Technology. Accessed January 17, 2021. http://resolver.tudelft.nl/uuid:97bbbf1e-eed8-4f0b-be61-d3f222aab929.

MLA Handbook (7^{th} Edition):

Van Tol, M C M (author). “Vessel routing for sweeping of marine litter in a port area.” 2016. Web. 17 Jan 2021.

Vancouver:

Van Tol MCM(. Vessel routing for sweeping of marine litter in a port area. [Internet] [Masters thesis]. Delft University of Technology; 2016. [cited 2021 Jan 17]. Available from: http://resolver.tudelft.nl/uuid:97bbbf1e-eed8-4f0b-be61-d3f222aab929.

Council of Science Editors:

Van Tol MCM(. Vessel routing for sweeping of marine litter in a port area. [Masters Thesis]. Delft University of Technology; 2016. Available from: http://resolver.tudelft.nl/uuid:97bbbf1e-eed8-4f0b-be61-d3f222aab929

9.
Lozano, Leonardo.
Exact Algorithms for Mixed-Integer Multilevel *Programming* Problems.

Degree: PhD, Industrial Engineering, 2017, Clemson University

URL: https://tigerprints.clemson.edu/all_dissertations/1998

► We examine multistage optimization problems, in which one or more decision makers solve a sequence of interdependent optimization problems. In each stage the corresponding decision…
(more)

Subjects/Keywords: Bilevel optimization; Integer programming; Interdiction; Multistage optimization; Traveling salesman problem

…*problem* that is parameterized by the leader’s first-stage decisions. *Bilevel* *programming* deals… …Review
We now present developments in *bilevel* *programming*, interdiction, and integer *stochastic*… …Scaparra and Church [2008a] formulate the IMF as a *bilevel* *programming* *problem*
and… …Function-Based Exact
Approach for the *Bilevel*
Mixed-Integer *Programming*
*Problem*
2.1
*Problem*… …stage *stochastic* shortest path *problem* example . . . . . . . . . . . . . . . . . .
2
3
4
4.1…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Lozano, L. (2017). Exact Algorithms for Mixed-Integer Multilevel Programming Problems. (Doctoral Dissertation). Clemson University. Retrieved from https://tigerprints.clemson.edu/all_dissertations/1998

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

Lozano, Leonardo. “Exact Algorithms for Mixed-Integer Multilevel Programming Problems.” 2017. Doctoral Dissertation, Clemson University. Accessed January 17, 2021. https://tigerprints.clemson.edu/all_dissertations/1998.

MLA Handbook (7^{th} Edition):

Lozano, Leonardo. “Exact Algorithms for Mixed-Integer Multilevel Programming Problems.” 2017. Web. 17 Jan 2021.

Vancouver:

Lozano L. Exact Algorithms for Mixed-Integer Multilevel Programming Problems. [Internet] [Doctoral dissertation]. Clemson University; 2017. [cited 2021 Jan 17]. Available from: https://tigerprints.clemson.edu/all_dissertations/1998.

Council of Science Editors:

Lozano L. Exact Algorithms for Mixed-Integer Multilevel Programming Problems. [Doctoral Dissertation]. Clemson University; 2017. Available from: https://tigerprints.clemson.edu/all_dissertations/1998

10. Asimakopoulou, Georgia. Συμβολή στη βέλτιστη διαχείριση διεσπαρμένων ενεργειακών πόρων.

Degree: 2017, National Technical University of Athens (NTUA); Εθνικό Μετσόβιο Πολυτεχνείο (ΕΜΠ)

URL: http://hdl.handle.net/10442/hedi/40411

►

The advent of new types of distributed resources such as flexible loads and local generating units poses significant challenges to the operation of the electricity… (more)

Subjects/Keywords: Διεσπαρμένοι πόροι; Διαχείριση φορτίου; Ιεραρχικό πλαίσιο λήψης αποφάσεων; Διεπίπεδος προγραμματισμός; Μαθηματικός προγραμματισμός με περιορισμούς ισορροπίας; Πρόβλημα μεικτού ακέραιου προγραμματισμού; Distributed resources; Load management; Hierarchical decision making; Bilevel programming; Mathematical programming with equilibrium constraints; Mixed integer programming problem

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Asimakopoulou, G. (2017). Συμβολή στη βέλτιστη διαχείριση διεσπαρμένων ενεργειακών πόρων. (Thesis). National Technical University of Athens (NTUA); Εθνικό Μετσόβιο Πολυτεχνείο (ΕΜΠ). Retrieved from http://hdl.handle.net/10442/hedi/40411

Not specified: Masters Thesis or Doctoral Dissertation

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

Asimakopoulou, Georgia. “Συμβολή στη βέλτιστη διαχείριση διεσπαρμένων ενεργειακών πόρων.” 2017. Thesis, National Technical University of Athens (NTUA); Εθνικό Μετσόβιο Πολυτεχνείο (ΕΜΠ). Accessed January 17, 2021. http://hdl.handle.net/10442/hedi/40411.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Asimakopoulou, Georgia. “Συμβολή στη βέλτιστη διαχείριση διεσπαρμένων ενεργειακών πόρων.” 2017. Web. 17 Jan 2021.

Vancouver:

Asimakopoulou G. Συμβολή στη βέλτιστη διαχείριση διεσπαρμένων ενεργειακών πόρων. [Internet] [Thesis]. National Technical University of Athens (NTUA); Εθνικό Μετσόβιο Πολυτεχνείο (ΕΜΠ); 2017. [cited 2021 Jan 17]. Available from: http://hdl.handle.net/10442/hedi/40411.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Asimakopoulou G. Συμβολή στη βέλτιστη διαχείριση διεσπαρμένων ενεργειακών πόρων. [Thesis]. National Technical University of Athens (NTUA); Εθνικό Μετσόβιο Πολυτεχνείο (ΕΜΠ); 2017. Available from: http://hdl.handle.net/10442/hedi/40411

Not specified: Masters Thesis or Doctoral Dissertation

Texas A&M University

11.
Han, Xue.
Healthcare Facility Location and Capacity Configuration under *Stochastic* Demand.

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

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

► This dissertation addresses two topics. The first topic is strategic dynamic supply chain reconfiguration (DSCR) *problem*, in which the proposed capacity configuration network is employed…
(more)

Subjects/Keywords: Dynamic facility location; Stochastic programming; Resource-constrained shortest path problem; Column generation

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Han, X. (2014). Healthcare Facility Location and Capacity Configuration under Stochastic Demand. (Doctoral Dissertation). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/153954

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

Han, Xue. “Healthcare Facility Location and Capacity Configuration under Stochastic Demand.” 2014. Doctoral Dissertation, Texas A&M University. Accessed January 17, 2021. http://hdl.handle.net/1969.1/153954.

MLA Handbook (7^{th} Edition):

Han, Xue. “Healthcare Facility Location and Capacity Configuration under Stochastic Demand.” 2014. Web. 17 Jan 2021.

Vancouver:

Han X. Healthcare Facility Location and Capacity Configuration under Stochastic Demand. [Internet] [Doctoral dissertation]. Texas A&M University; 2014. [cited 2021 Jan 17]. Available from: http://hdl.handle.net/1969.1/153954.

Council of Science Editors:

Han X. Healthcare Facility Location and Capacity Configuration under Stochastic Demand. [Doctoral Dissertation]. Texas A&M University; 2014. Available from: http://hdl.handle.net/1969.1/153954

University of Southern California

12. Ren, Yingtao. Vehicle routing and resource allocation for health care under uncertainty.

Degree: PhD, Industrial & Systems Engineering, 2011, University of Southern California

URL: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/461025/rec/7819

► In this research, we study optimization models for health care under uncertainty and resource constraints. In particular, we study two problems: Vehicle Routing *Problem* (VRP)…
(more)

Subjects/Keywords: Benders decomposition; infectious disease outbreak; multi-shift vehicle routing problem; smallpox; stochastic programming; vaccine allocation

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Ren, Y. (2011). Vehicle routing and resource allocation for health care under uncertainty. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/461025/rec/7819

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

Ren, Yingtao. “Vehicle routing and resource allocation for health care under uncertainty.” 2011. Doctoral Dissertation, University of Southern California. Accessed January 17, 2021. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/461025/rec/7819.

MLA Handbook (7^{th} Edition):

Ren, Yingtao. “Vehicle routing and resource allocation for health care under uncertainty.” 2011. Web. 17 Jan 2021.

Vancouver:

Ren Y. Vehicle routing and resource allocation for health care under uncertainty. [Internet] [Doctoral dissertation]. University of Southern California; 2011. [cited 2021 Jan 17]. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/461025/rec/7819.

Council of Science Editors:

Ren Y. Vehicle routing and resource allocation for health care under uncertainty. [Doctoral Dissertation]. University of Southern California; 2011. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/461025/rec/7819

George Mason University

13.
Woodaman, Ronald Frederick Alexander.
The Wartime Portfolio Selection * Problem*
.

Degree: 2015, George Mason University

URL: http://hdl.handle.net/1920/9691

► This thesis describes the research conducted to support the optimal selection of a portfolio of military solutions during wartime. During peacetime, the United States military…
(more)

Subjects/Keywords: Operations research; Statistics; Computer science; approximate dynamic programming; dynamic stochastic knapsack problem; multi-objective decision analysis; sequential decision analysis; stochastic integer programming; stochastic optimization

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Woodaman, R. F. A. (2015). The Wartime Portfolio Selection Problem . (Thesis). George Mason University. Retrieved from http://hdl.handle.net/1920/9691

Not specified: Masters Thesis or Doctoral Dissertation

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

Woodaman, Ronald Frederick Alexander. “The Wartime Portfolio Selection Problem .” 2015. Thesis, George Mason University. Accessed January 17, 2021. http://hdl.handle.net/1920/9691.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Woodaman, Ronald Frederick Alexander. “The Wartime Portfolio Selection Problem .” 2015. Web. 17 Jan 2021.

Vancouver:

Woodaman RFA. The Wartime Portfolio Selection Problem . [Internet] [Thesis]. George Mason University; 2015. [cited 2021 Jan 17]. Available from: http://hdl.handle.net/1920/9691.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Woodaman RFA. The Wartime Portfolio Selection Problem . [Thesis]. George Mason University; 2015. Available from: http://hdl.handle.net/1920/9691

Not specified: Masters Thesis or Doctoral Dissertation

14. Lu, Fang, active 21st century. Modeling and optimization for spatial detection to minimize abandonment rate.

Degree: PhD, Operations Research & Industrial Engineering, 2014, University of Texas – Austin

URL: http://hdl.handle.net/2152/25998

► Some oil and gas companies are drilling and developing fields in the Arctic Ocean, which has an environment with sea ice called ice floes. These…
(more)

Subjects/Keywords: Spatial detection; Queues with abandonments; Simulation; Stochastic programming; Multi-stage stochastic facility location problem; Scheduling heuristics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Lu, Fang, a. 2. c. (2014). Modeling and optimization for spatial detection to minimize abandonment rate. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/25998

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

Lu, Fang, active 21st century. “Modeling and optimization for spatial detection to minimize abandonment rate.” 2014. Doctoral Dissertation, University of Texas – Austin. Accessed January 17, 2021. http://hdl.handle.net/2152/25998.

MLA Handbook (7^{th} Edition):

Lu, Fang, active 21st century. “Modeling and optimization for spatial detection to minimize abandonment rate.” 2014. Web. 17 Jan 2021.

Vancouver:

Lu, Fang a2c. Modeling and optimization for spatial detection to minimize abandonment rate. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2014. [cited 2021 Jan 17]. Available from: http://hdl.handle.net/2152/25998.

Council of Science Editors:

Lu, Fang a2c. Modeling and optimization for spatial detection to minimize abandonment rate. [Doctoral Dissertation]. University of Texas – Austin; 2014. Available from: http://hdl.handle.net/2152/25998

University of Maryland

15. Nair, Rahul. Design and Analysis of Vehicle Sharing Programs: A Systems Approach.

Degree: Civil Engineering, 2010, University of Maryland

URL: http://hdl.handle.net/1903/10968

► Transit, touted as a solution to urban mobility problems, cannot match the addictive flexibility of the automobile. 86% of all trips in the U.S. are…
(more)

Subjects/Keywords: Transportation; Urban and Regional Planning; Engineering, Civil; Bicycle sharing; Bilevel programming; Car sharing; Chance constrained programming; Equilibrium network design; Stochastic optimization

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Nair, R. (2010). Design and Analysis of Vehicle Sharing Programs: A Systems Approach. (Thesis). University of Maryland. Retrieved from http://hdl.handle.net/1903/10968

Not specified: Masters Thesis or Doctoral Dissertation

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

Nair, Rahul. “Design and Analysis of Vehicle Sharing Programs: A Systems Approach.” 2010. Thesis, University of Maryland. Accessed January 17, 2021. http://hdl.handle.net/1903/10968.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Nair, Rahul. “Design and Analysis of Vehicle Sharing Programs: A Systems Approach.” 2010. Web. 17 Jan 2021.

Vancouver:

Nair R. Design and Analysis of Vehicle Sharing Programs: A Systems Approach. [Internet] [Thesis]. University of Maryland; 2010. [cited 2021 Jan 17]. Available from: http://hdl.handle.net/1903/10968.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Nair R. Design and Analysis of Vehicle Sharing Programs: A Systems Approach. [Thesis]. University of Maryland; 2010. Available from: http://hdl.handle.net/1903/10968

Not specified: Masters Thesis or Doctoral Dissertation

Lehigh University

16.
Tahernejad, Sahar.
Two-stage Mixed Integer *Stochastic* *Bilevel* Linear Optimization.

Degree: PhD, Industrial Engineering, 2019, Lehigh University

URL: https://preserve.lehigh.edu/etd/5796

This dissertation is concerned with a special case of multistage optimization problems that unifies the multilevel and multistage stochastic optimization classes. We focus on the cases with two stages that are referred to as two-stage mixed integer stocha
*Advisors/Committee Members: Theodore K. Ralphs.*

Subjects/Keywords: Bilevel Optimization; Mixed Integer Optimization; Stochastic Optimization; Industrial Engineering

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Tahernejad, S. (2019). Two-stage Mixed Integer Stochastic Bilevel Linear Optimization. (Doctoral Dissertation). Lehigh University. Retrieved from https://preserve.lehigh.edu/etd/5796

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

Tahernejad, Sahar. “Two-stage Mixed Integer Stochastic Bilevel Linear Optimization.” 2019. Doctoral Dissertation, Lehigh University. Accessed January 17, 2021. https://preserve.lehigh.edu/etd/5796.

MLA Handbook (7^{th} Edition):

Tahernejad, Sahar. “Two-stage Mixed Integer Stochastic Bilevel Linear Optimization.” 2019. Web. 17 Jan 2021.

Vancouver:

Tahernejad S. Two-stage Mixed Integer Stochastic Bilevel Linear Optimization. [Internet] [Doctoral dissertation]. Lehigh University; 2019. [cited 2021 Jan 17]. Available from: https://preserve.lehigh.edu/etd/5796.

Council of Science Editors:

Tahernejad S. Two-stage Mixed Integer Stochastic Bilevel Linear Optimization. [Doctoral Dissertation]. Lehigh University; 2019. Available from: https://preserve.lehigh.edu/etd/5796

Brno University of Technology

17. Rychtář, Adam. Transformace optimalizačních modelů s aplikacemi: Transformations of optimization models with aplications.

Degree: 2019, Brno University of Technology

URL: http://hdl.handle.net/11012/60869

► The thesis deals with recent problems of waste management in the Czech Republic. In connection with the existing software implementation, the author focuses on the…
(more)

Subjects/Keywords: modelování; matematické programování; síťová dopravní úloha; lineární programování; celočíselné programování; stochastické programování; odpadové hospodářství; GAMS; modeling; mathematical programming; network flow problem; linear programming; integer programming; stochastic programming; waste-managment; GAMS

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Rychtář, A. (2019). Transformace optimalizačních modelů s aplikacemi: Transformations of optimization models with aplications. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/60869

Not specified: Masters Thesis or Doctoral Dissertation

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

Rychtář, Adam. “Transformace optimalizačních modelů s aplikacemi: Transformations of optimization models with aplications.” 2019. Thesis, Brno University of Technology. Accessed January 17, 2021. http://hdl.handle.net/11012/60869.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Rychtář, Adam. “Transformace optimalizačních modelů s aplikacemi: Transformations of optimization models with aplications.” 2019. Web. 17 Jan 2021.

Vancouver:

Rychtář A. Transformace optimalizačních modelů s aplikacemi: Transformations of optimization models with aplications. [Internet] [Thesis]. Brno University of Technology; 2019. [cited 2021 Jan 17]. Available from: http://hdl.handle.net/11012/60869.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Rychtář A. Transformace optimalizačních modelů s aplikacemi: Transformations of optimization models with aplications. [Thesis]. Brno University of Technology; 2019. Available from: http://hdl.handle.net/11012/60869

Not specified: Masters Thesis or Doctoral Dissertation

Université Paris-Sud – Paris XI

18. Le Bodic, Pierre. Variantes non standards de problèmes d'optimisation combinatoire : Non-standard variants of combinatorial optimization problems.

Degree: Docteur es, Informatique, 2012, Université Paris-Sud – Paris XI

URL: http://www.theses.fr/2012PA112190

►

Cette thèse est composée de deux parties, chacune portant sur un sous-domaine de l'optimisation combinatoire a priori distant de l'autre. Le premier thème de recherche… (more)

Subjects/Keywords: Programmation biniveau; Programmation stochastique; Problèmes de coupe; Problèmes de couverture; Multicoupe partielle; Coupe multiterminale partielle; Ensemble dominant partiel; Complexité; Approximation; Programmation dynamique; Graphes de largeur d'arbre bornée; Bilevel programming; Stochastic programming; Cut problems; Cover problems; Partial multicut; Partial multiterminal cut; Partial dominating set; Complexity; Approximation; Dynamic programming; Bounded treewidth graphs

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Le Bodic, P. (2012). Variantes non standards de problèmes d'optimisation combinatoire : Non-standard variants of combinatorial optimization problems. (Doctoral Dissertation). Université Paris-Sud – Paris XI. Retrieved from http://www.theses.fr/2012PA112190

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

Le Bodic, Pierre. “Variantes non standards de problèmes d'optimisation combinatoire : Non-standard variants of combinatorial optimization problems.” 2012. Doctoral Dissertation, Université Paris-Sud – Paris XI. Accessed January 17, 2021. http://www.theses.fr/2012PA112190.

MLA Handbook (7^{th} Edition):

Le Bodic, Pierre. “Variantes non standards de problèmes d'optimisation combinatoire : Non-standard variants of combinatorial optimization problems.” 2012. Web. 17 Jan 2021.

Vancouver:

Le Bodic P. Variantes non standards de problèmes d'optimisation combinatoire : Non-standard variants of combinatorial optimization problems. [Internet] [Doctoral dissertation]. Université Paris-Sud – Paris XI; 2012. [cited 2021 Jan 17]. Available from: http://www.theses.fr/2012PA112190.

Council of Science Editors:

Le Bodic P. Variantes non standards de problèmes d'optimisation combinatoire : Non-standard variants of combinatorial optimization problems. [Doctoral Dissertation]. Université Paris-Sud – Paris XI; 2012. Available from: http://www.theses.fr/2012PA112190

Rice University

19.
Becker, Timothy.
* Bilevel* Clique Interdiction and Related Problems.

Degree: PhD, Engineering, 2017, Rice University

URL: http://hdl.handle.net/1911/96109

► I introduce a formulation of the *bilevel* clique interdiction *problem*. Interdiction, a military term, describes the removal of enemy resources. The single level clique interdiction…
(more)

Subjects/Keywords: Graph Theory; Integer Programming; Bilevel Programming; Interdiction; Column Generation; Facets; Valid Inequalities

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Becker, T. (2017). Bilevel Clique Interdiction and Related Problems. (Doctoral Dissertation). Rice University. Retrieved from http://hdl.handle.net/1911/96109

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

Becker, Timothy. “Bilevel Clique Interdiction and Related Problems.” 2017. Doctoral Dissertation, Rice University. Accessed January 17, 2021. http://hdl.handle.net/1911/96109.

MLA Handbook (7^{th} Edition):

Becker, Timothy. “Bilevel Clique Interdiction and Related Problems.” 2017. Web. 17 Jan 2021.

Vancouver:

Becker T. Bilevel Clique Interdiction and Related Problems. [Internet] [Doctoral dissertation]. Rice University; 2017. [cited 2021 Jan 17]. Available from: http://hdl.handle.net/1911/96109.

Council of Science Editors:

Becker T. Bilevel Clique Interdiction and Related Problems. [Doctoral Dissertation]. Rice University; 2017. Available from: http://hdl.handle.net/1911/96109

Colorado School of Mines

20. Steeger, Gregory M. Strategic bidding for price-maker hydroelectric producers.

Degree: PhD, Economics and Business, 2014, Colorado School of Mines

URL: http://hdl.handle.net/11124/486

► Hydropower is arguably the most important and widely used renewable energy source in the world. Deregulation has led to the use of auction-based markets while…
(more)

Subjects/Keywords: mixed-integer linear programming; Benders decomposition; bidding problem; hydroelectric; Lagrangian relaxation; stochastic dual dynamic programming; Water-power – Economic aspects; Linear programming; Deregulation; Algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Steeger, G. M. (2014). Strategic bidding for price-maker hydroelectric producers. (Doctoral Dissertation). Colorado School of Mines. Retrieved from http://hdl.handle.net/11124/486

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

Steeger, Gregory M. “Strategic bidding for price-maker hydroelectric producers.” 2014. Doctoral Dissertation, Colorado School of Mines. Accessed January 17, 2021. http://hdl.handle.net/11124/486.

MLA Handbook (7^{th} Edition):

Steeger, Gregory M. “Strategic bidding for price-maker hydroelectric producers.” 2014. Web. 17 Jan 2021.

Vancouver:

Steeger GM. Strategic bidding for price-maker hydroelectric producers. [Internet] [Doctoral dissertation]. Colorado School of Mines; 2014. [cited 2021 Jan 17]. Available from: http://hdl.handle.net/11124/486.

Council of Science Editors:

Steeger GM. Strategic bidding for price-maker hydroelectric producers. [Doctoral Dissertation]. Colorado School of Mines; 2014. Available from: http://hdl.handle.net/11124/486

21.
Naseh, Mohammad.
Some developments in *stochastic* *programming* and its
applications; -.

Degree: Statistics, 1995, Aligarh Muslim University

URL: http://shodhganga.inflibnet.ac.in/handle/10603/51741

Abstract not available newline newline

Bibliography p. i-vi

Subjects/Keywords: Developments; Stochastic Programming; Applications; Knapsack Problem; Random Variables; Algorithm

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Naseh, M. (1995). Some developments in stochastic programming and its applications; -. (Thesis). Aligarh Muslim University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/51741

Not specified: Masters Thesis or Doctoral Dissertation

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

Naseh, Mohammad. “Some developments in stochastic programming and its applications; -.” 1995. Thesis, Aligarh Muslim University. Accessed January 17, 2021. http://shodhganga.inflibnet.ac.in/handle/10603/51741.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Naseh, Mohammad. “Some developments in stochastic programming and its applications; -.” 1995. Web. 17 Jan 2021.

Vancouver:

Naseh M. Some developments in stochastic programming and its applications; -. [Internet] [Thesis]. Aligarh Muslim University; 1995. [cited 2021 Jan 17]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/51741.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Naseh M. Some developments in stochastic programming and its applications; -. [Thesis]. Aligarh Muslim University; 1995. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/51741

Not specified: Masters Thesis or Doctoral Dissertation

University of Michigan

22.
Donohue, Christopher Joseph.
* Stochastic* network

Degree: PhD, Operations research, 1996, University of Michigan

URL: http://hdl.handle.net/2027.42/129847

► Efficiency in trucking and railroad operations is critically dependent on the optimal distribution of vehicles. This *problem* is known as the Dynamic Vehicle Allocation (DVA)…
(more)

Subjects/Keywords: Allocati; Allocation; Dynamic; Network; Problem; Programming; Stochastic; Vehicle

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Donohue, C. J. (1996). Stochastic network programming and the dynamic vehicle allocation problem. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/129847

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

Donohue, Christopher Joseph. “Stochastic network programming and the dynamic vehicle allocation problem.” 1996. Doctoral Dissertation, University of Michigan. Accessed January 17, 2021. http://hdl.handle.net/2027.42/129847.

MLA Handbook (7^{th} Edition):

Donohue, Christopher Joseph. “Stochastic network programming and the dynamic vehicle allocation problem.” 1996. Web. 17 Jan 2021.

Vancouver:

Donohue CJ. Stochastic network programming and the dynamic vehicle allocation problem. [Internet] [Doctoral dissertation]. University of Michigan; 1996. [cited 2021 Jan 17]. Available from: http://hdl.handle.net/2027.42/129847.

Council of Science Editors:

Donohue CJ. Stochastic network programming and the dynamic vehicle allocation problem. [Doctoral Dissertation]. University of Michigan; 1996. Available from: http://hdl.handle.net/2027.42/129847

University of Michigan

23.
Yen, Joyce Wen-Hwei.
A *stochastic* *programming* formulation of the *stochastic* crew scheduling *problem*.

Degree: PhD, Pure Sciences, 2001, University of Michigan

URL: http://hdl.handle.net/2027.42/124302

► Traditional methods model the billion-dollar airline crew scheduling *problem* as deterministic and do not explicitly include information on potential disruptions. Unfortunately, the effort used to…
(more)

Subjects/Keywords: Airline Crew; Crew Scheduling Problem; Formulation; Stochastic Programming

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Yen, J. W. (2001). A stochastic programming formulation of the stochastic crew scheduling problem. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/124302

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

Yen, Joyce Wen-Hwei. “A stochastic programming formulation of the stochastic crew scheduling problem.” 2001. Doctoral Dissertation, University of Michigan. Accessed January 17, 2021. http://hdl.handle.net/2027.42/124302.

MLA Handbook (7^{th} Edition):

Yen, Joyce Wen-Hwei. “A stochastic programming formulation of the stochastic crew scheduling problem.” 2001. Web. 17 Jan 2021.

Vancouver:

Yen JW. A stochastic programming formulation of the stochastic crew scheduling problem. [Internet] [Doctoral dissertation]. University of Michigan; 2001. [cited 2021 Jan 17]. Available from: http://hdl.handle.net/2027.42/124302.

Council of Science Editors:

Yen JW. A stochastic programming formulation of the stochastic crew scheduling problem. [Doctoral Dissertation]. University of Michigan; 2001. Available from: http://hdl.handle.net/2027.42/124302

Siauliai University

24. Pachomova, Rūta. Stochastinio programavimo modelio finansų planavimui pritaikymas.

Degree: Master, Informatics, 2014, Siauliai University

URL: http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2014~D_20140717_141626-42772 ;

►

Šio darbo tikslas ištirti mažų įmonių padėtį Lietuvos rinkoje, susipažinti su trumpalaikio finansų planavimo problemomis. Sukurti taikomąją programą, kuri padėtų šias problemas spręsti ir pasiūlyti… (more)

Subjects/Keywords: Stochastinis programavimas; Dviejų etapų uždavinys; Trumpalaikis finansų planavimas; Stochastic programming; Two-step problem; Short-term financial planning

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Pachomova, Rūta. (2014). Stochastinio programavimo modelio finansų planavimui pritaikymas. (Masters Thesis). Siauliai University. Retrieved from http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2014~D_20140717_141626-42772 ;

Author name may be incomplete

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

Pachomova, Rūta. “Stochastinio programavimo modelio finansų planavimui pritaikymas.” 2014. Masters Thesis, Siauliai University. Accessed January 17, 2021. http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2014~D_20140717_141626-42772 ;.

Author name may be incomplete

MLA Handbook (7^{th} Edition):

Pachomova, Rūta. “Stochastinio programavimo modelio finansų planavimui pritaikymas.” 2014. Web. 17 Jan 2021.

Author name may be incomplete

Vancouver:

Pachomova, Rūta. Stochastinio programavimo modelio finansų planavimui pritaikymas. [Internet] [Masters thesis]. Siauliai University; 2014. [cited 2021 Jan 17]. Available from: http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2014~D_20140717_141626-42772 ;.

Author name may be incomplete

Council of Science Editors:

Pachomova, Rūta. Stochastinio programavimo modelio finansų planavimui pritaikymas. [Masters Thesis]. Siauliai University; 2014. Available from: http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2014~D_20140717_141626-42772 ;

Author name may be incomplete

Brno University of Technology

25. Šandera, Čeněk. Heuristické algoritmy pro optimalizaci: Heuristic algorithms in optimization.

Degree: 2019, Brno University of Technology

URL: http://hdl.handle.net/11012/25193

► The thesis deals with *stochastic* *programming* and determining probability distributions which cause extreme optimal values (maximal or minimal) of an objective function. The probability distribution…
(more)

Subjects/Keywords: stochastické programování; kvadratické stochastické programování; lineární stochastické programování; heuristické algoritmy; genetické algoritmy; extrémní množiny scénářů; minmax úlohy; problém řízení tavby; stochastic programming; heuristic methods; genetic algorithms; extrem scenario sets; minmax approach; control melting problem; quadratic stochastic programming; linear stochastic programming

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Šandera, . (2019). Heuristické algoritmy pro optimalizaci: Heuristic algorithms in optimization. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/25193

Not specified: Masters Thesis or Doctoral Dissertation

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

Šandera, Čeněk. “Heuristické algoritmy pro optimalizaci: Heuristic algorithms in optimization.” 2019. Thesis, Brno University of Technology. Accessed January 17, 2021. http://hdl.handle.net/11012/25193.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Šandera, Čeněk. “Heuristické algoritmy pro optimalizaci: Heuristic algorithms in optimization.” 2019. Web. 17 Jan 2021.

Vancouver:

Šandera . Heuristické algoritmy pro optimalizaci: Heuristic algorithms in optimization. [Internet] [Thesis]. Brno University of Technology; 2019. [cited 2021 Jan 17]. Available from: http://hdl.handle.net/11012/25193.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Šandera . Heuristické algoritmy pro optimalizaci: Heuristic algorithms in optimization. [Thesis]. Brno University of Technology; 2019. Available from: http://hdl.handle.net/11012/25193

Not specified: Masters Thesis or Doctoral Dissertation

26.
Helal, Nathalie.
An evidential answer for the capacitated vehicle routing *problem* with uncertain demands : Une réponse évidentielle pour le problème de tournée de véhicules avec contrainte de capacité et demandes incertaines.

Degree: Docteur es, Génie Informatique et Automatique, 2017, Université d'Artois

URL: http://www.theses.fr/2017ARTO0208

►

Le problème de tournées de véhicules avec contrainte de capacité est un problème important en optimisation combinatoire. L'objectif du problème est de déterminer l'ensemble des… (more)

Subjects/Keywords: Problème de tournées de véhicules; Demandes incertaines; "Chance constrained programming”; “Stochastic programming with recourse”; Théorie de l’évidence; Vehicle routing problem; Uncertain demands; Chance constrained programming; Stochastic programming with recourse; Evidence theory.; 620; 629.8

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Helal, N. (2017). An evidential answer for the capacitated vehicle routing problem with uncertain demands : Une réponse évidentielle pour le problème de tournée de véhicules avec contrainte de capacité et demandes incertaines. (Doctoral Dissertation). Université d'Artois. Retrieved from http://www.theses.fr/2017ARTO0208

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

Helal, Nathalie. “An evidential answer for the capacitated vehicle routing problem with uncertain demands : Une réponse évidentielle pour le problème de tournée de véhicules avec contrainte de capacité et demandes incertaines.” 2017. Doctoral Dissertation, Université d'Artois. Accessed January 17, 2021. http://www.theses.fr/2017ARTO0208.

MLA Handbook (7^{th} Edition):

Helal, Nathalie. “An evidential answer for the capacitated vehicle routing problem with uncertain demands : Une réponse évidentielle pour le problème de tournée de véhicules avec contrainte de capacité et demandes incertaines.” 2017. Web. 17 Jan 2021.

Vancouver:

Helal N. An evidential answer for the capacitated vehicle routing problem with uncertain demands : Une réponse évidentielle pour le problème de tournée de véhicules avec contrainte de capacité et demandes incertaines. [Internet] [Doctoral dissertation]. Université d'Artois; 2017. [cited 2021 Jan 17]. Available from: http://www.theses.fr/2017ARTO0208.

Council of Science Editors:

Helal N. An evidential answer for the capacitated vehicle routing problem with uncertain demands : Une réponse évidentielle pour le problème de tournée de véhicules avec contrainte de capacité et demandes incertaines. [Doctoral Dissertation]. Université d'Artois; 2017. Available from: http://www.theses.fr/2017ARTO0208

27.
Zey, Bernd.
Solving two-stage *stochastic* network design problems to optimality.

Degree: 2017, Technische Universität Dortmund

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

► The Steiner tree *problem* (STP) is a central and well-studied graph-theoretical combinatorial optimization *problem* which plays an important role in various applications. It can be…
(more)

Subjects/Keywords: Two-stage stochastic network design; Stochastic Steiner tree; Integer linear programming; Fixed parameter tractable; 004; Steiner-Baum; Ganzzahlige lineare Optimierung; Steiner-Problem

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Zey, B. (2017). Solving two-stage stochastic network design problems to optimality. (Doctoral Dissertation). Technische Universität Dortmund. Retrieved from http://dx.doi.org/10.17877/DE290R-18290

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

Zey, Bernd. “Solving two-stage stochastic network design problems to optimality.” 2017. Doctoral Dissertation, Technische Universität Dortmund. Accessed January 17, 2021. http://dx.doi.org/10.17877/DE290R-18290.

MLA Handbook (7^{th} Edition):

Zey, Bernd. “Solving two-stage stochastic network design problems to optimality.” 2017. Web. 17 Jan 2021.

Vancouver:

Zey B. Solving two-stage stochastic network design problems to optimality. [Internet] [Doctoral dissertation]. Technische Universität Dortmund; 2017. [cited 2021 Jan 17]. Available from: http://dx.doi.org/10.17877/DE290R-18290.

Council of Science Editors:

Zey B. Solving two-stage stochastic network design problems to optimality. [Doctoral Dissertation]. Technische Universität Dortmund; 2017. Available from: http://dx.doi.org/10.17877/DE290R-18290

Brno University of Technology

28. Cabalka, Matouš. Pokročilá optimalizace toků v sítích: Advanced Optimization of Network Flows.

Degree: 2019, Brno University of Technology

URL: http://hdl.handle.net/11012/138014

► The master’s thesis focuses on the optimization models in logistics with emphasis on the network interdiction *problem*. The brief introduction is followed by two overview…
(more)

Subjects/Keywords: Matematické programování; lineární programování; toky v sítích; úloha o maximálním toku; duální úloha; úloha o minimálním řezu; úloha napadení sítě; dvoustupňové programování; stochastické programování; GAMS; Mathematical programming; linear programming; network flows; the maximum flow problem; dual problem; the minimum cut problem; network interdiction problem; two-stage programming; stochastic programming; GAMS

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Cabalka, M. (2019). Pokročilá optimalizace toků v sítích: Advanced Optimization of Network Flows. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/138014

Not specified: Masters Thesis or Doctoral Dissertation

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

Cabalka, Matouš. “Pokročilá optimalizace toků v sítích: Advanced Optimization of Network Flows.” 2019. Thesis, Brno University of Technology. Accessed January 17, 2021. http://hdl.handle.net/11012/138014.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Cabalka, Matouš. “Pokročilá optimalizace toků v sítích: Advanced Optimization of Network Flows.” 2019. Web. 17 Jan 2021.

Vancouver:

Cabalka M. Pokročilá optimalizace toků v sítích: Advanced Optimization of Network Flows. [Internet] [Thesis]. Brno University of Technology; 2019. [cited 2021 Jan 17]. Available from: http://hdl.handle.net/11012/138014.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Cabalka M. Pokročilá optimalizace toků v sítích: Advanced Optimization of Network Flows. [Thesis]. Brno University of Technology; 2019. Available from: http://hdl.handle.net/11012/138014

Not specified: Masters Thesis or Doctoral Dissertation

29. Rožnjik Andrea. Optimizacija problema sa stohastičkim ograničenjima tipa jednakosti – kazneni metodi sa promenljivom veličinom uzorka.

Degree: 2019, University of Novi Sad

URL: https://www.cris.uns.ac.rs/DownloadFileServlet/Disertacija153804843966981.pdf?controlNumber=(BISIS)107819&fileName=153804843966981.pdf&id=12029&source=OATD&language=en ; https://www.cris.uns.ac.rs/record.jsf?recordId=107819&source=OATD&language=en

►

U disertaciji je razmatran *problem* stohastičkog programiranja s ograničenjima tipa jednakosti, odnosno *problem* minimizacije s ograničenjima koja su u obliku matematičkog očekivanja. Za rešavanje…
(more)

Subjects/Keywords: problem stohasičkog programiranja, ograničenja tipa jednakosti, SAA aproksimacija, metodi s promenljivom veličinom uzorka, kazneni postupci; stochastic programming problem, equality constraints, sample average approximation, variable sample size methods, penalty methods

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Andrea, R. (2019). Optimizacija problema sa stohastičkim ograničenjima tipa jednakosti – kazneni metodi sa promenljivom veličinom uzorka. (Thesis). University of Novi Sad. Retrieved from https://www.cris.uns.ac.rs/DownloadFileServlet/Disertacija153804843966981.pdf?controlNumber=(BISIS)107819&fileName=153804843966981.pdf&id=12029&source=OATD&language=en ; https://www.cris.uns.ac.rs/record.jsf?recordId=107819&source=OATD&language=en

Not specified: Masters Thesis or Doctoral Dissertation

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

Andrea, Rožnjik. “Optimizacija problema sa stohastičkim ograničenjima tipa jednakosti – kazneni metodi sa promenljivom veličinom uzorka.” 2019. Thesis, University of Novi Sad. Accessed January 17, 2021. https://www.cris.uns.ac.rs/DownloadFileServlet/Disertacija153804843966981.pdf?controlNumber=(BISIS)107819&fileName=153804843966981.pdf&id=12029&source=OATD&language=en ; https://www.cris.uns.ac.rs/record.jsf?recordId=107819&source=OATD&language=en.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Andrea, Rožnjik. “Optimizacija problema sa stohastičkim ograničenjima tipa jednakosti – kazneni metodi sa promenljivom veličinom uzorka.” 2019. Web. 17 Jan 2021.

Vancouver:

Andrea R. Optimizacija problema sa stohastičkim ograničenjima tipa jednakosti – kazneni metodi sa promenljivom veličinom uzorka. [Internet] [Thesis]. University of Novi Sad; 2019. [cited 2021 Jan 17]. Available from: https://www.cris.uns.ac.rs/DownloadFileServlet/Disertacija153804843966981.pdf?controlNumber=(BISIS)107819&fileName=153804843966981.pdf&id=12029&source=OATD&language=en ; https://www.cris.uns.ac.rs/record.jsf?recordId=107819&source=OATD&language=en.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Andrea R. Optimizacija problema sa stohastičkim ograničenjima tipa jednakosti – kazneni metodi sa promenljivom veličinom uzorka. [Thesis]. University of Novi Sad; 2019. Available from: https://www.cris.uns.ac.rs/DownloadFileServlet/Disertacija153804843966981.pdf?controlNumber=(BISIS)107819&fileName=153804843966981.pdf&id=12029&source=OATD&language=en ; https://www.cris.uns.ac.rs/record.jsf?recordId=107819&source=OATD&language=en

Not specified: Masters Thesis or Doctoral Dissertation

RMIT University

30.
Roozbeh, I.
Optimisation approaches for an orienteering *problem* with applications to wildfire management.

Degree: 2019, RMIT University

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

► During uncontrollable wildfires, Incident Management Teams (ITMs) dispatch vehicles for tasks aimed at reducing the hazard to key assets. The deployment plan is complicated by…
(more)

Subjects/Keywords: Fields of Research; orienteering problem; asset protection problem; stochastic programming; adaptive large neighbourhood search; dynamic rerouting; synchronisation constraint; wildfire management; heuristic algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Roozbeh, I. (2019). Optimisation approaches for an orienteering problem with applications to wildfire management. (Thesis). RMIT University. Retrieved from http://researchbank.rmit.edu.au/view/rmit:162938

Not specified: Masters Thesis or Doctoral Dissertation

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

Roozbeh, I. “Optimisation approaches for an orienteering problem with applications to wildfire management.” 2019. Thesis, RMIT University. Accessed January 17, 2021. http://researchbank.rmit.edu.au/view/rmit:162938.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Roozbeh, I. “Optimisation approaches for an orienteering problem with applications to wildfire management.” 2019. Web. 17 Jan 2021.

Vancouver:

Roozbeh I. Optimisation approaches for an orienteering problem with applications to wildfire management. [Internet] [Thesis]. RMIT University; 2019. [cited 2021 Jan 17]. Available from: http://researchbank.rmit.edu.au/view/rmit:162938.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Roozbeh I. Optimisation approaches for an orienteering problem with applications to wildfire management. [Thesis]. RMIT University; 2019. Available from: http://researchbank.rmit.edu.au/view/rmit:162938

Not specified: Masters Thesis or Doctoral Dissertation