Advanced search options

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

You searched for `+publisher:"Rutgers University" +contributor:("Boros, Endre")`

.
Showing records 1 – 25 of
25 total matches.

▼ Search Limiters

Rutgers University

1. Rudolf, Gábor, 1979-. New results in optimization with functional constraints:.

Degree: PhD, Operations Research, 2009, Rutgers University

URL: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000051899

►

We consider optimization problems featuring nonnegativity constraints on functions associated with the decision variables. The first part of the thesis is devoted to the topic… (more)

Subjects/Keywords: Mathematical optimization

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Rudolf, Gábor, 1. (2009). New results in optimization with functional constraints:. (Doctoral Dissertation). Rutgers University. Retrieved from http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000051899

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

Rudolf, Gábor, 1979-. “New results in optimization with functional constraints:.” 2009. Doctoral Dissertation, Rutgers University. Accessed July 21, 2019. http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000051899.

MLA Handbook (7^{th} Edition):

Rudolf, Gábor, 1979-. “New results in optimization with functional constraints:.” 2009. Web. 21 Jul 2019.

Vancouver:

Rudolf, Gábor 1. New results in optimization with functional constraints:. [Internet] [Doctoral dissertation]. Rutgers University; 2009. [cited 2019 Jul 21]. Available from: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000051899.

Council of Science Editors:

Rudolf, Gábor 1. New results in optimization with functional constraints:. [Doctoral Dissertation]. Rutgers University; 2009. Available from: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000051899

Rutgers University

2. Reddy, Anupama Rajasekhara, 1981-. Combinatorial pattern-based survival analysis with applications in biology and medicine:.

Degree: PhD, Operations Research, 2009, Rutgers University

URL: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000051891

►

In the current era of targeted therapies and personalized medicine, survival analysis (predicting survival time of patients) is a very important problem. Survival analysis is… (more)

Subjects/Keywords: Survival analysis (Biometry); Medical statistics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Reddy, Anupama Rajasekhara, 1. (2009). Combinatorial pattern-based survival analysis with applications in biology and medicine:. (Doctoral Dissertation). Rutgers University. Retrieved from http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000051891

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

Reddy, Anupama Rajasekhara, 1981-. “Combinatorial pattern-based survival analysis with applications in biology and medicine:.” 2009. Doctoral Dissertation, Rutgers University. Accessed July 21, 2019. http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000051891.

MLA Handbook (7^{th} Edition):

Reddy, Anupama Rajasekhara, 1981-. “Combinatorial pattern-based survival analysis with applications in biology and medicine:.” 2009. Web. 21 Jul 2019.

Vancouver:

Reddy, Anupama Rajasekhara 1. Combinatorial pattern-based survival analysis with applications in biology and medicine:. [Internet] [Doctoral dissertation]. Rutgers University; 2009. [cited 2019 Jul 21]. Available from: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000051891.

Council of Science Editors:

Reddy, Anupama Rajasekhara 1. Combinatorial pattern-based survival analysis with applications in biology and medicine:. [Doctoral Dissertation]. Rutgers University; 2009. Available from: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000051891

Rutgers University

3. Fan, Ya-Ju, 1978-. Optimization models and algorithms for sample-preserved classification and clustering.

Degree: PhD, Industrial and Systems Engineering, 2010, Rutgers University

URL: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000053024

►

This dissertation presents the development of new optimization models and algorithms for sample-preserved classification and clustering. A sample-preserved method keeps some or all of the… (more)

Subjects/Keywords: Classification – Mathematical models; Algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Fan, Ya-Ju, 1. (2010). Optimization models and algorithms for sample-preserved classification and clustering. (Doctoral Dissertation). Rutgers University. Retrieved from http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000053024

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

Fan, Ya-Ju, 1978-. “Optimization models and algorithms for sample-preserved classification and clustering.” 2010. Doctoral Dissertation, Rutgers University. Accessed July 21, 2019. http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000053024.

MLA Handbook (7^{th} Edition):

Fan, Ya-Ju, 1978-. “Optimization models and algorithms for sample-preserved classification and clustering.” 2010. Web. 21 Jul 2019.

Vancouver:

Fan, Ya-Ju 1. Optimization models and algorithms for sample-preserved classification and clustering. [Internet] [Doctoral dissertation]. Rutgers University; 2010. [cited 2019 Jul 21]. Available from: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000053024.

Council of Science Editors:

Fan, Ya-Ju 1. Optimization models and algorithms for sample-preserved classification and clustering. [Doctoral Dissertation]. Rutgers University; 2010. Available from: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000053024

Rutgers University

4. Zhao, Xiang, 1979-. Multivariate autoregressive modular processes.

Degree: PhD, Operations Research, 2010, Rutgers University

URL: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000053224

►

This thesis defines a new class of vector-valued stochastic processes, called MARM (Multivariate Autoregressive Modular) Processes. It describes the construction of two flavors of MARM… (more)

Subjects/Keywords: Multivariate analysis; Stochastic processes

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Zhao, Xiang, 1. (2010). Multivariate autoregressive modular processes. (Doctoral Dissertation). Rutgers University. Retrieved from http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000053224

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

Zhao, Xiang, 1979-. “Multivariate autoregressive modular processes.” 2010. Doctoral Dissertation, Rutgers University. Accessed July 21, 2019. http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000053224.

MLA Handbook (7^{th} Edition):

Zhao, Xiang, 1979-. “Multivariate autoregressive modular processes.” 2010. Web. 21 Jul 2019.

Vancouver:

Zhao, Xiang 1. Multivariate autoregressive modular processes. [Internet] [Doctoral dissertation]. Rutgers University; 2010. [cited 2019 Jul 21]. Available from: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000053224.

Council of Science Editors:

Zhao, Xiang 1. Multivariate autoregressive modular processes. [Doctoral Dissertation]. Rutgers University; 2010. Available from: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000053224

Rutgers University

5. Collado, Ricardo, 1975-. Scenario decomposition of risk-averse stochastic optimization problems.

Degree: PhD, Operations Research, 2010, Rutgers University

URL: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000056283

►

In the last decade the theory of coherent risk measures established itself as an alternative to expected utility models of risk averse preferences in stochastic… (more)

Subjects/Keywords: Stochastic programming; Decomposition (Mathematics); Risk-return relationships

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Collado, Ricardo, 1. (2010). Scenario decomposition of risk-averse stochastic optimization problems. (Doctoral Dissertation). Rutgers University. Retrieved from http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000056283

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

Collado, Ricardo, 1975-. “Scenario decomposition of risk-averse stochastic optimization problems.” 2010. Doctoral Dissertation, Rutgers University. Accessed July 21, 2019. http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000056283.

MLA Handbook (7^{th} Edition):

Collado, Ricardo, 1975-. “Scenario decomposition of risk-averse stochastic optimization problems.” 2010. Web. 21 Jul 2019.

Vancouver:

Collado, Ricardo 1. Scenario decomposition of risk-averse stochastic optimization problems. [Internet] [Doctoral dissertation]. Rutgers University; 2010. [cited 2019 Jul 21]. Available from: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000056283.

Council of Science Editors:

Collado, Ricardo 1. Scenario decomposition of risk-averse stochastic optimization problems. [Doctoral Dissertation]. Rutgers University; 2010. Available from: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000056283

6. Duhaylongsod, Jose Benedicto B., 1987-. Vendor financing and its impact on vendor's optimal policies.

Degree: MS, Operations Research, 2013, Rutgers University

URL: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000068844

► This research aims to elucidate how vendor financing impacts the business strategy of the vendor and to shed light on the resulting optimal inventory and…
(more)

Subjects/Keywords: Business – Computer programs; Finance

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Duhaylongsod, Jose Benedicto B., 1. (2013). Vendor financing and its impact on vendor's optimal policies. (Masters Thesis). Rutgers University. Retrieved from http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000068844

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

Duhaylongsod, Jose Benedicto B., 1987-. “Vendor financing and its impact on vendor's optimal policies.” 2013. Masters Thesis, Rutgers University. Accessed July 21, 2019. http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000068844.

MLA Handbook (7^{th} Edition):

Duhaylongsod, Jose Benedicto B., 1987-. “Vendor financing and its impact on vendor's optimal policies.” 2013. Web. 21 Jul 2019.

Vancouver:

Duhaylongsod, Jose Benedicto B. 1. Vendor financing and its impact on vendor's optimal policies. [Internet] [Masters thesis]. Rutgers University; 2013. [cited 2019 Jul 21]. Available from: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000068844.

Council of Science Editors:

Duhaylongsod, Jose Benedicto B. 1. Vendor financing and its impact on vendor's optimal policies. [Masters Thesis]. Rutgers University; 2013. Available from: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000068844

7. Fanelli, Santino L., 1982-. Probability of a feasible flow in a stochastic transportation network.

Degree: MS, Operations Research, 2012, Rutgers University

URL: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000064088

► Electricity is one of the main sources of energy relied upon throughout the world today to power our homes, businesses, and other needs. The electric…
(more)

Subjects/Keywords: Stochastic systems; Electric utilities—Management; Operations research

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Fanelli, Santino L., 1. (2012). Probability of a feasible flow in a stochastic transportation network. (Masters Thesis). Rutgers University. Retrieved from http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000064088

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

Fanelli, Santino L., 1982-. “Probability of a feasible flow in a stochastic transportation network.” 2012. Masters Thesis, Rutgers University. Accessed July 21, 2019. http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000064088.

MLA Handbook (7^{th} Edition):

Fanelli, Santino L., 1982-. “Probability of a feasible flow in a stochastic transportation network.” 2012. Web. 21 Jul 2019.

Vancouver:

Fanelli, Santino L. 1. Probability of a feasible flow in a stochastic transportation network. [Internet] [Masters thesis]. Rutgers University; 2012. [cited 2019 Jul 21]. Available from: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000064088.

Council of Science Editors:

Fanelli, Santino L. 1. Probability of a feasible flow in a stochastic transportation network. [Masters Thesis]. Rutgers University; 2012. Available from: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000064088

8. Goldberg, Noam, 1974-. Optimization for sparse and accurate classifiers:.

Degree: PhD, Operations Research, 2010, Rutgers University

URL: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000052113

► Classification and supervised learning problems in general aim to choose a function that best describes a relation between a set of observed attributes and their…
(more)

Subjects/Keywords: Mathematical optimization

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Goldberg, Noam, 1. (2010). Optimization for sparse and accurate classifiers:. (Doctoral Dissertation). Rutgers University. Retrieved from http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000052113

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

Goldberg, Noam, 1974-. “Optimization for sparse and accurate classifiers:.” 2010. Doctoral Dissertation, Rutgers University. Accessed July 21, 2019. http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000052113.

MLA Handbook (7^{th} Edition):

Goldberg, Noam, 1974-. “Optimization for sparse and accurate classifiers:.” 2010. Web. 21 Jul 2019.

Vancouver:

Goldberg, Noam 1. Optimization for sparse and accurate classifiers:. [Internet] [Doctoral dissertation]. Rutgers University; 2010. [cited 2019 Jul 21]. Available from: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000052113.

Council of Science Editors:

Goldberg, Noam 1. Optimization for sparse and accurate classifiers:. [Doctoral Dissertation]. Rutgers University; 2010. Available from: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000052113

9. Neu, David Joseph. Feature selection with applications to text classification.

Degree: Operations Research, 2012, Rutgers University

URL: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000065235

Subjects/Keywords: Heuristic algorithms – Methodology

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Neu, D. J. (2012). Feature selection with applications to text classification. (Thesis). Rutgers University. Retrieved from http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000065235

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

Neu, David Joseph. “Feature selection with applications to text classification.” 2012. Thesis, Rutgers University. Accessed July 21, 2019. http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000065235.

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Neu, David Joseph. “Feature selection with applications to text classification.” 2012. Web. 21 Jul 2019.

Vancouver:

Neu DJ. Feature selection with applications to text classification. [Internet] [Thesis]. Rutgers University; 2012. [cited 2019 Jul 21]. Available from: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000065235.

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

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Neu DJ. Feature selection with applications to text classification. [Thesis]. Rutgers University; 2012. Available from: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000065235

Not specified: Masters Thesis or Doctoral Dissertation

10. Oudalov, Vladimir, 1954-. Two new computer based results in game theory related to combinatorial games and Nash equilibria.

Degree: Operations Research, 2013, Rutgers University

URL: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000067806

Subjects/Keywords: Game theory – Computer programs; Combinatorial analysis

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Oudalov, Vladimir, 1. (2013). Two new computer based results in game theory related to combinatorial games and Nash equilibria. (Thesis). Rutgers University. Retrieved from http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000067806

Not specified: Masters Thesis or Doctoral Dissertation

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

Oudalov, Vladimir, 1954-. “Two new computer based results in game theory related to combinatorial games and Nash equilibria.” 2013. Thesis, Rutgers University. Accessed July 21, 2019. http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000067806.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Oudalov, Vladimir, 1954-. “Two new computer based results in game theory related to combinatorial games and Nash equilibria.” 2013. Web. 21 Jul 2019.

Vancouver:

Oudalov, Vladimir 1. Two new computer based results in game theory related to combinatorial games and Nash equilibria. [Internet] [Thesis]. Rutgers University; 2013. [cited 2019 Jul 21]. Available from: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000067806.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Oudalov, Vladimir 1. Two new computer based results in game theory related to combinatorial games and Nash equilibria. [Thesis]. Rutgers University; 2013. Available from: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000067806

Not specified: Masters Thesis or Doctoral Dissertation

11. Unuvar, Merve, 1985-. New results for optimization in stochastic networks.

Degree: Operations Research, 2012, Rutgers University

URL: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000067007

Subjects/Keywords: Stochastic processes; Structural optimization

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Unuvar, Merve, 1. (2012). New results for optimization in stochastic networks. (Thesis). Rutgers University. Retrieved from http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000067007

Not specified: Masters Thesis or Doctoral Dissertation

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

Unuvar, Merve, 1985-. “New results for optimization in stochastic networks.” 2012. Thesis, Rutgers University. Accessed July 21, 2019. http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000067007.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Unuvar, Merve, 1985-. “New results for optimization in stochastic networks.” 2012. Web. 21 Jul 2019.

Vancouver:

Unuvar, Merve 1. New results for optimization in stochastic networks. [Internet] [Thesis]. Rutgers University; 2012. [cited 2019 Jul 21]. Available from: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000067007.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Unuvar, Merve 1. New results for optimization in stochastic networks. [Thesis]. Rutgers University; 2012. Available from: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000067007

Not specified: Masters Thesis or Doctoral Dissertation

12. Bora, Selim, 1983-. Inventory and scheduling problems in supply chain management.

Degree: Operations Research, 2013, Rutgers University

URL: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000067628

Subjects/Keywords: Business logistics; Inventory control

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Bora, Selim, 1. (2013). Inventory and scheduling problems in supply chain management. (Thesis). Rutgers University. Retrieved from http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000067628

Not specified: Masters Thesis or Doctoral Dissertation

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

Bora, Selim, 1983-. “Inventory and scheduling problems in supply chain management.” 2013. Thesis, Rutgers University. Accessed July 21, 2019. http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000067628.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Bora, Selim, 1983-. “Inventory and scheduling problems in supply chain management.” 2013. Web. 21 Jul 2019.

Vancouver:

Bora, Selim 1. Inventory and scheduling problems in supply chain management. [Internet] [Thesis]. Rutgers University; 2013. [cited 2019 Jul 21]. Available from: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000067628.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Bora, Selim 1. Inventory and scheduling problems in supply chain management. [Thesis]. Rutgers University; 2013. Available from: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000067628

Not specified: Masters Thesis or Doctoral Dissertation

13. Duan, Zhe, 1981-. Emergency modeling in transportation via queuing and game theory.

Degree: Industrial and Systems Engineering, 2013, Rutgers University

URL: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000067761

Subjects/Keywords: Traffic congestion – Management; Emergency management; Game theory – Computer programs; Markov processes

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Duan, Zhe, 1. (2013). Emergency modeling in transportation via queuing and game theory. (Thesis). Rutgers University. Retrieved from http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000067761

Not specified: Masters Thesis or Doctoral Dissertation

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

Duan, Zhe, 1981-. “Emergency modeling in transportation via queuing and game theory.” 2013. Thesis, Rutgers University. Accessed July 21, 2019. http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000067761.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Duan, Zhe, 1981-. “Emergency modeling in transportation via queuing and game theory.” 2013. Web. 21 Jul 2019.

Vancouver:

Duan, Zhe 1. Emergency modeling in transportation via queuing and game theory. [Internet] [Thesis]. Rutgers University; 2013. [cited 2019 Jul 21]. Available from: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000067761.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Duan, Zhe 1. Emergency modeling in transportation via queuing and game theory. [Thesis]. Rutgers University; 2013. Available from: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000067761

Not specified: Masters Thesis or Doctoral Dissertation

14. Cavus, Ozlem, 1981-. Risk-averse control of undiscounted transient Markov models.

Degree: Operations Research, 2012, Rutgers University

URL: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000066646

Subjects/Keywords: Markov processes; Risk assessment

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Cavus, Ozlem, 1. (2012). Risk-averse control of undiscounted transient Markov models. (Thesis). Rutgers University. Retrieved from http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000066646

Not specified: Masters Thesis or Doctoral Dissertation

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

Cavus, Ozlem, 1981-. “Risk-averse control of undiscounted transient Markov models.” 2012. Thesis, Rutgers University. Accessed July 21, 2019. http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000066646.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Cavus, Ozlem, 1981-. “Risk-averse control of undiscounted transient Markov models.” 2012. Web. 21 Jul 2019.

Vancouver:

Cavus, Ozlem 1. Risk-averse control of undiscounted transient Markov models. [Internet] [Thesis]. Rutgers University; 2012. [cited 2019 Jul 21]. Available from: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000066646.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Cavus, Ozlem 1. Risk-averse control of undiscounted transient Markov models. [Thesis]. Rutgers University; 2012. Available from: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000066646

Not specified: Masters Thesis or Doctoral Dissertation

Rutgers University

15. Kaminski, Marcin Jakub. New algorithmic and hardness results for graph partitioning problems.

Degree: PhD, Operations Research, 2007, Rutgers University

URL: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.13472

► In this thesis we study algorithmic aspects of two graph partitioning problems – graph coloring and maximum cut. This is a summary of main results…
(more)

Subjects/Keywords: Graph algorithms; Graph coloring; Graph theory

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kaminski, M. J. (2007). New algorithmic and hardness results for graph partitioning problems. (Doctoral Dissertation). Rutgers University. Retrieved from http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.13472

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

Kaminski, Marcin Jakub. “New algorithmic and hardness results for graph partitioning problems.” 2007. Doctoral Dissertation, Rutgers University. Accessed July 21, 2019. http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.13472.

MLA Handbook (7^{th} Edition):

Kaminski, Marcin Jakub. “New algorithmic and hardness results for graph partitioning problems.” 2007. Web. 21 Jul 2019.

Vancouver:

Kaminski MJ. New algorithmic and hardness results for graph partitioning problems. [Internet] [Doctoral dissertation]. Rutgers University; 2007. [cited 2019 Jul 21]. Available from: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.13472.

Council of Science Editors:

Kaminski MJ. New algorithmic and hardness results for graph partitioning problems. [Doctoral Dissertation]. Rutgers University; 2007. Available from: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.13472

Rutgers University

16. Milanic, Martin. Algorithmic developments and complexity results for finding maximum and exact independent sets in graphs.

Degree: PhD, Operations Research, 2007, Rutgers University

URL: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.13482

► We consider the maximum independent set and maximum weight independent set problems in graphs. As these problems are generally NP-hard, we study their complexity in…
(more)

Subjects/Keywords: Graph algorithms; Graph theory

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Milanic, M. (2007). Algorithmic developments and complexity results for finding maximum and exact independent sets in graphs. (Doctoral Dissertation). Rutgers University. Retrieved from http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.13482

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

Milanic, Martin. “Algorithmic developments and complexity results for finding maximum and exact independent sets in graphs.” 2007. Doctoral Dissertation, Rutgers University. Accessed July 21, 2019. http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.13482.

MLA Handbook (7^{th} Edition):

Milanic, Martin. “Algorithmic developments and complexity results for finding maximum and exact independent sets in graphs.” 2007. Web. 21 Jul 2019.

Vancouver:

Milanic M. Algorithmic developments and complexity results for finding maximum and exact independent sets in graphs. [Internet] [Doctoral dissertation]. Rutgers University; 2007. [cited 2019 Jul 21]. Available from: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.13482.

Council of Science Editors:

Milanic M. Algorithmic developments and complexity results for finding maximum and exact independent sets in graphs. [Doctoral Dissertation]. Rutgers University; 2007. Available from: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.13482

Rutgers University

17. Lozina, Irina I. Composite boolean separators for data analysis with applications in computed tomography and gene expression microarray data.

Degree: PhD, Operations Research, 2007, Rutgers University

URL: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.13481

► An important topic in machine-learning / data-mining is that of analyzing binary datasets. A binary dataset consists of a subset of n-vectors (observations) with binary…
(more)

Subjects/Keywords: Tomography; Data mining; Gene expression

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Lozina, I. I. (2007). Composite boolean separators for data analysis with applications in computed tomography and gene expression microarray data. (Doctoral Dissertation). Rutgers University. Retrieved from http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.13481

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

Lozina, Irina I. “Composite boolean separators for data analysis with applications in computed tomography and gene expression microarray data.” 2007. Doctoral Dissertation, Rutgers University. Accessed July 21, 2019. http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.13481.

MLA Handbook (7^{th} Edition):

Lozina, Irina I. “Composite boolean separators for data analysis with applications in computed tomography and gene expression microarray data.” 2007. Web. 21 Jul 2019.

Vancouver:

Lozina II. Composite boolean separators for data analysis with applications in computed tomography and gene expression microarray data. [Internet] [Doctoral dissertation]. Rutgers University; 2007. [cited 2019 Jul 21]. Available from: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.13481.

Council of Science Editors:

Lozina II. Composite boolean separators for data analysis with applications in computed tomography and gene expression microarray data. [Doctoral Dissertation]. Rutgers University; 2007. Available from: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.13481

Rutgers University

18. Bonates, Tiberius. Optimization in logical analysis of data.

Degree: PhD, Operations Research, 2007, Rutgers University

URL: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.15788

►

Logical Analysis of Data (LAD) is a machine learning/data mining methodology that combines ideas from areas such as Boolean functions, optimization and logic. In this… (more)

Subjects/Keywords: Data mining; Machine learning

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Bonates, T. (2007). Optimization in logical analysis of data. (Doctoral Dissertation). Rutgers University. Retrieved from http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.15788

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

Bonates, Tiberius. “Optimization in logical analysis of data.” 2007. Doctoral Dissertation, Rutgers University. Accessed July 21, 2019. http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.15788.

MLA Handbook (7^{th} Edition):

Bonates, Tiberius. “Optimization in logical analysis of data.” 2007. Web. 21 Jul 2019.

Vancouver:

Bonates T. Optimization in logical analysis of data. [Internet] [Doctoral dissertation]. Rutgers University; 2007. [cited 2019 Jul 21]. Available from: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.15788.

Council of Science Editors:

Bonates T. Optimization in logical analysis of data. [Doctoral Dissertation]. Rutgers University; 2007. Available from: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.15788

Rutgers University

19. Costello, Kevin, 1981-. Ranks of random matrices and graphs.

Degree: PhD, Mathematics, 2007, Rutgers University

URL: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.15810

►

Let Q_n be a random symmetric matrix whose entries on and above the main diagonal are independent random variables (e.g. the adjacency matrix of an… (more)

Subjects/Keywords: Random matrices; Random graphs; Graph theory

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Costello, Kevin, 1. (2007). Ranks of random matrices and graphs. (Doctoral Dissertation). Rutgers University. Retrieved from http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.15810

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

Costello, Kevin, 1981-. “Ranks of random matrices and graphs.” 2007. Doctoral Dissertation, Rutgers University. Accessed July 21, 2019. http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.15810.

MLA Handbook (7^{th} Edition):

Costello, Kevin, 1981-. “Ranks of random matrices and graphs.” 2007. Web. 21 Jul 2019.

Vancouver:

Costello, Kevin 1. Ranks of random matrices and graphs. [Internet] [Doctoral dissertation]. Rutgers University; 2007. [cited 2019 Jul 21]. Available from: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.15810.

Council of Science Editors:

Costello, Kevin 1. Ranks of random matrices and graphs. [Doctoral Dissertation]. Rutgers University; 2007. Available from: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.15810

Rutgers University

20. Iyigun, Cem. Probabilistic distance clustering.

Degree: PhD, Operations Research, 2008, Rutgers University

URL: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.17142

►

We present a new iterative method for probabilistic clustering of data. Given clusters, their centers, and the distances of data points from these centers, the… (more)

Subjects/Keywords: Cluster analysis

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Iyigun, C. (2008). Probabilistic distance clustering. (Doctoral Dissertation). Rutgers University. Retrieved from http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.17142

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

Iyigun, Cem. “Probabilistic distance clustering.” 2008. Doctoral Dissertation, Rutgers University. Accessed July 21, 2019. http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.17142.

MLA Handbook (7^{th} Edition):

Iyigun, Cem. “Probabilistic distance clustering.” 2008. Web. 21 Jul 2019.

Vancouver:

Iyigun C. Probabilistic distance clustering. [Internet] [Doctoral dissertation]. Rutgers University; 2008. [cited 2019 Jul 21]. Available from: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.17142.

Council of Science Editors:

Iyigun C. Probabilistic distance clustering. [Doctoral Dissertation]. Rutgers University; 2008. Available from: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.17142

Rutgers University

21. Subasi, Munevver Mine. New results in probability bounding, a convexity statement and unimodality of multivariate discrete distributions.

Degree: PhD, Operations Research, 2008, Rutgers University

URL: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.17395

►

This report constitutes the Doctoral Dissertation for Munevver Mine Subasi and consists of three topics: sharp bounds for the probability of the union of events… (more)

Subjects/Keywords: Distribution (Probability theory); Multivariate analysis

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Subasi, M. M. (2008). New results in probability bounding, a convexity statement and unimodality of multivariate discrete distributions. (Doctoral Dissertation). Rutgers University. Retrieved from http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.17395

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

Subasi, Munevver Mine. “New results in probability bounding, a convexity statement and unimodality of multivariate discrete distributions.” 2008. Doctoral Dissertation, Rutgers University. Accessed July 21, 2019. http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.17395.

MLA Handbook (7^{th} Edition):

Subasi, Munevver Mine. “New results in probability bounding, a convexity statement and unimodality of multivariate discrete distributions.” 2008. Web. 21 Jul 2019.

Vancouver:

Subasi MM. New results in probability bounding, a convexity statement and unimodality of multivariate discrete distributions. [Internet] [Doctoral dissertation]. Rutgers University; 2008. [cited 2019 Jul 21]. Available from: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.17395.

Council of Science Editors:

Subasi MM. New results in probability bounding, a convexity statement and unimodality of multivariate discrete distributions. [Doctoral Dissertation]. Rutgers University; 2008. Available from: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.17395

Rutgers University

22. Fedzhora, Liliya. A linear programming model for sequential testing.

Degree: PhD, Operations Research, 2008, Rutgers University

URL: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.17466

►

In this study, a linear programming model is formulated that finds an optimal strategy for many decision-making problems that typically arise in homeland security, banking,… (more)

Subjects/Keywords: Decision making; Data mining; Sequential analysis

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Fedzhora, L. (2008). A linear programming model for sequential testing. (Doctoral Dissertation). Rutgers University. Retrieved from http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.17466

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

Fedzhora, Liliya. “A linear programming model for sequential testing.” 2008. Doctoral Dissertation, Rutgers University. Accessed July 21, 2019. http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.17466.

MLA Handbook (7^{th} Edition):

Fedzhora, Liliya. “A linear programming model for sequential testing.” 2008. Web. 21 Jul 2019.

Vancouver:

Fedzhora L. A linear programming model for sequential testing. [Internet] [Doctoral dissertation]. Rutgers University; 2008. [cited 2019 Jul 21]. Available from: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.17466.

Council of Science Editors:

Fedzhora L. A linear programming model for sequential testing. [Doctoral Dissertation]. Rutgers University; 2008. Available from: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.17466

Rutgers University

23. Miller, Naomi Liora. Mean-risk portfolio optimization problems with risk-adjusted measures:.

Degree: PhD, Operations Research, 2008, Rutgers University

URL: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000050460

►

We consider the problem of optimizing a portfolio of finitely many assets whose returns are described by a joint discrete distribution. We formulate the mean-risk… (more)

Subjects/Keywords: Portfolio management – Mathematical models; Risk

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Miller, N. L. (2008). Mean-risk portfolio optimization problems with risk-adjusted measures:. (Doctoral Dissertation). Rutgers University. Retrieved from http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000050460

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

Miller, Naomi Liora. “Mean-risk portfolio optimization problems with risk-adjusted measures:.” 2008. Doctoral Dissertation, Rutgers University. Accessed July 21, 2019. http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000050460.

MLA Handbook (7^{th} Edition):

Miller, Naomi Liora. “Mean-risk portfolio optimization problems with risk-adjusted measures:.” 2008. Web. 21 Jul 2019.

Vancouver:

Miller NL. Mean-risk portfolio optimization problems with risk-adjusted measures:. [Internet] [Doctoral dissertation]. Rutgers University; 2008. [cited 2019 Jul 21]. Available from: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000050460.

Council of Science Editors:

Miller NL. Mean-risk portfolio optimization problems with risk-adjusted measures:. [Doctoral Dissertation]. Rutgers University; 2008. Available from: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000050460

Rutgers University

24. Chou, Chun-An. Mathematical optimization methods for clustering and classification with biological and medical applications.

Degree: Industrial and Systems Engineering, 2011, Rutgers University

URL: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000063358

Subjects/Keywords: Combinatorial optimization; Mathematical optimization

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Chou, C. (2011). Mathematical optimization methods for clustering and classification with biological and medical applications. (Thesis). Rutgers University. Retrieved from http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000063358

Not specified: Masters Thesis or Doctoral Dissertation

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

Chou, Chun-An. “Mathematical optimization methods for clustering and classification with biological and medical applications.” 2011. Thesis, Rutgers University. Accessed July 21, 2019. http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000063358.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Chou, Chun-An. “Mathematical optimization methods for clustering and classification with biological and medical applications.” 2011. Web. 21 Jul 2019.

Vancouver:

Chou C. Mathematical optimization methods for clustering and classification with biological and medical applications. [Internet] [Thesis]. Rutgers University; 2011. [cited 2019 Jul 21]. Available from: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000063358.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Chou C. Mathematical optimization methods for clustering and classification with biological and medical applications. [Thesis]. Rutgers University; 2011. Available from: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000063358

Not specified: Masters Thesis or Doctoral Dissertation

Rutgers University

25. Tavares, Gabriel. New algorithms for Quadratic Unconstrained Binary Optimization (QUBO) with applications in engineering and social sciences.

Degree: PhD, Operations Research, 2008, Rutgers University

URL: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000051095

►

This dissertation investigates the Quadratic Unconstrained Binary Optimization (QUBO) problem, i.e. the problem of minimizing a quadratic function in binary variables. QUBO is studied at… (more)

Subjects/Keywords: Mathematical optimization

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Tavares, G. (2008). New algorithms for Quadratic Unconstrained Binary Optimization (QUBO) with applications in engineering and social sciences. (Doctoral Dissertation). Rutgers University. Retrieved from http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000051095

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

Tavares, Gabriel. “New algorithms for Quadratic Unconstrained Binary Optimization (QUBO) with applications in engineering and social sciences.” 2008. Doctoral Dissertation, Rutgers University. Accessed July 21, 2019. http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000051095.

MLA Handbook (7^{th} Edition):

Tavares, Gabriel. “New algorithms for Quadratic Unconstrained Binary Optimization (QUBO) with applications in engineering and social sciences.” 2008. Web. 21 Jul 2019.

Vancouver:

Tavares G. New algorithms for Quadratic Unconstrained Binary Optimization (QUBO) with applications in engineering and social sciences. [Internet] [Doctoral dissertation]. Rutgers University; 2008. [cited 2019 Jul 21]. Available from: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000051095.

Council of Science Editors:

Tavares G. New algorithms for Quadratic Unconstrained Binary Optimization (QUBO) with applications in engineering and social sciences. [Doctoral Dissertation]. Rutgers University; 2008. Available from: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000051095