Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(Location problems Programming ). Showing records 1 – 30 of 20761 total matches.

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

Search Limiters

Last 2 Years | English Only

Degrees

Levels

Languages

Country

▼ Search Limiters


University of Hong Kong

1. 洪媛媛.; Hong, Yuanyaun. Localization for wireless sensor networks of diversified topologies.

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

published_or_final_version

Electrical and Electronic Engineering

Master

Master of Philosophy

Subjects/Keywords: Wireless sensor networks.; Location problems (Programming)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

洪媛媛.; Hong, Y. (2010). Localization for wireless sensor networks of diversified topologies. (Masters Thesis). University of Hong Kong. Retrieved from Hong, Y. [洪媛媛]. (2010). Localization for wireless sensor networks of diversified topologies. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b4516159 ; http://dx.doi.org/10.5353/th_b4516159 ; http://hdl.handle.net/10722/131767

Chicago Manual of Style (16th Edition):

洪媛媛.; Hong, Yuanyaun. “Localization for wireless sensor networks of diversified topologies.” 2010. Masters Thesis, University of Hong Kong. Accessed October 19, 2019. Hong, Y. [洪媛媛]. (2010). Localization for wireless sensor networks of diversified topologies. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b4516159 ; http://dx.doi.org/10.5353/th_b4516159 ; http://hdl.handle.net/10722/131767.

MLA Handbook (7th Edition):

洪媛媛.; Hong, Yuanyaun. “Localization for wireless sensor networks of diversified topologies.” 2010. Web. 19 Oct 2019.

Vancouver:

洪媛媛.; Hong Y. Localization for wireless sensor networks of diversified topologies. [Internet] [Masters thesis]. University of Hong Kong; 2010. [cited 2019 Oct 19]. Available from: Hong, Y. [洪媛媛]. (2010). Localization for wireless sensor networks of diversified topologies. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b4516159 ; http://dx.doi.org/10.5353/th_b4516159 ; http://hdl.handle.net/10722/131767.

Council of Science Editors:

洪媛媛.; Hong Y. Localization for wireless sensor networks of diversified topologies. [Masters Thesis]. University of Hong Kong; 2010. Available from: Hong, Y. [洪媛媛]. (2010). Localization for wireless sensor networks of diversified topologies. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b4516159 ; http://dx.doi.org/10.5353/th_b4516159 ; http://hdl.handle.net/10722/131767


University of Hong Kong

2. Qiao, Dapeng. Solutions for wireless sensor network localization.

Degree: PhD, 2012, University of Hong Kong

 Wireless sensor network localization opens the door to many location based applications. In this thesis, some solutions obtained from localization algorithms are investigated. There are… (more)

Subjects/Keywords: Wireless sensor networks.; Location problems (Programming)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Qiao, D. (2012). Solutions for wireless sensor network localization. (Doctoral Dissertation). University of Hong Kong. Retrieved from Qiao, D. [乔大鹏]. (2012). Solutions for wireless sensor network localization. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b4784953 ; http://dx.doi.org/10.5353/th_b4784953 ; http://hdl.handle.net/10722/174511

Chicago Manual of Style (16th Edition):

Qiao, Dapeng. “Solutions for wireless sensor network localization.” 2012. Doctoral Dissertation, University of Hong Kong. Accessed October 19, 2019. Qiao, D. [乔大鹏]. (2012). Solutions for wireless sensor network localization. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b4784953 ; http://dx.doi.org/10.5353/th_b4784953 ; http://hdl.handle.net/10722/174511.

MLA Handbook (7th Edition):

Qiao, Dapeng. “Solutions for wireless sensor network localization.” 2012. Web. 19 Oct 2019.

Vancouver:

Qiao D. Solutions for wireless sensor network localization. [Internet] [Doctoral dissertation]. University of Hong Kong; 2012. [cited 2019 Oct 19]. Available from: Qiao, D. [乔大鹏]. (2012). Solutions for wireless sensor network localization. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b4784953 ; http://dx.doi.org/10.5353/th_b4784953 ; http://hdl.handle.net/10722/174511.

Council of Science Editors:

Qiao D. Solutions for wireless sensor network localization. [Doctoral Dissertation]. University of Hong Kong; 2012. Available from: Qiao, D. [乔大鹏]. (2012). Solutions for wireless sensor network localization. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b4784953 ; http://dx.doi.org/10.5353/th_b4784953 ; http://hdl.handle.net/10722/174511


Cornell University

3. Nagarajan, Chandrashekhar. Algorithms for Locating Facilities under Uncertainties .

Degree: 2008, Cornell University

 One of the main challenges in the area of discrete optimization is to find efficient and effective ways of solving problems that arise in day-to-day… (more)

Subjects/Keywords: Algorithms; Approximation; Optimization; Location Problems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Nagarajan, C. (2008). Algorithms for Locating Facilities under Uncertainties . (Thesis). Cornell University. Retrieved from http://hdl.handle.net/1813/11387

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

Chicago Manual of Style (16th Edition):

Nagarajan, Chandrashekhar. “Algorithms for Locating Facilities under Uncertainties .” 2008. Thesis, Cornell University. Accessed October 19, 2019. http://hdl.handle.net/1813/11387.

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

MLA Handbook (7th Edition):

Nagarajan, Chandrashekhar. “Algorithms for Locating Facilities under Uncertainties .” 2008. Web. 19 Oct 2019.

Vancouver:

Nagarajan C. Algorithms for Locating Facilities under Uncertainties . [Internet] [Thesis]. Cornell University; 2008. [cited 2019 Oct 19]. Available from: http://hdl.handle.net/1813/11387.

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

Council of Science Editors:

Nagarajan C. Algorithms for Locating Facilities under Uncertainties . [Thesis]. Cornell University; 2008. Available from: http://hdl.handle.net/1813/11387

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

4. Ahmadian, Sara. Approximation Algorithms for Clustering and Facility Location Problems.

Degree: 2017, University of Waterloo

 Facility location problems arise in a wide range of applications such as plant or warehouse location problems, cache placement problems, and network design problems, and… (more)

Subjects/Keywords: Approximation algorithms; Facility location problems; Clustering; Mobile facility location problem; Min-load k-facility location; Lower-bounded clustering with outliers; Lower-bounded clustering; Clustering with outliers; Local search algorithm; Primal-dual algorithm; Linear-programming rounding

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ahmadian, S. (2017). Approximation Algorithms for Clustering and Facility Location Problems. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/11640

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

Chicago Manual of Style (16th Edition):

Ahmadian, Sara. “Approximation Algorithms for Clustering and Facility Location Problems.” 2017. Thesis, University of Waterloo. Accessed October 19, 2019. http://hdl.handle.net/10012/11640.

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

MLA Handbook (7th Edition):

Ahmadian, Sara. “Approximation Algorithms for Clustering and Facility Location Problems.” 2017. Web. 19 Oct 2019.

Vancouver:

Ahmadian S. Approximation Algorithms for Clustering and Facility Location Problems. [Internet] [Thesis]. University of Waterloo; 2017. [cited 2019 Oct 19]. Available from: http://hdl.handle.net/10012/11640.

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

Council of Science Editors:

Ahmadian S. Approximation Algorithms for Clustering and Facility Location Problems. [Thesis]. University of Waterloo; 2017. Available from: http://hdl.handle.net/10012/11640

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


University of Alberta

5. Alam, Md. Noor-E-. Advanced Integer Linear Programming Techniques for Large Scale Grid-Based Location Problems.

Degree: PhD, Department of Mechanical Engineering, 2013, University of Alberta

 Many real-world facility location problems can be approximated by a grid-based system of small sized cells, which can then be used to model a heterogeneous… (more)

Subjects/Keywords: Grid-Based Location Problems (GBLPs); Relax-and-Fix-Based Decomposition (RFBD); Integer linear Programming (ILP); Large-Scale Optimization; Partition-and-Fix-Based Decomposition (PFBD)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Alam, M. N. (2013). Advanced Integer Linear Programming Techniques for Large Scale Grid-Based Location Problems. (Doctoral Dissertation). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/xs55md387

Chicago Manual of Style (16th Edition):

Alam, Md Noor-E-. “Advanced Integer Linear Programming Techniques for Large Scale Grid-Based Location Problems.” 2013. Doctoral Dissertation, University of Alberta. Accessed October 19, 2019. https://era.library.ualberta.ca/files/xs55md387.

MLA Handbook (7th Edition):

Alam, Md Noor-E-. “Advanced Integer Linear Programming Techniques for Large Scale Grid-Based Location Problems.” 2013. Web. 19 Oct 2019.

Vancouver:

Alam MN. Advanced Integer Linear Programming Techniques for Large Scale Grid-Based Location Problems. [Internet] [Doctoral dissertation]. University of Alberta; 2013. [cited 2019 Oct 19]. Available from: https://era.library.ualberta.ca/files/xs55md387.

Council of Science Editors:

Alam MN. Advanced Integer Linear Programming Techniques for Large Scale Grid-Based Location Problems. [Doctoral Dissertation]. University of Alberta; 2013. Available from: https://era.library.ualberta.ca/files/xs55md387


Université de Montréal

6. Khuong, Paul Virak. Lagrangian-informed mixed integer programming reformulations .

Degree: 2014, Université de Montréal

 La programmation linéaire en nombres entiers est une approche robuste qui permet de résoudre rapidement de grandes instances de problèmes d'optimisation discrète. Toutefois, les problèmes… (more)

Subjects/Keywords: Recherche opérationnelle; Optimisation discrète; Relaxation lagrangienne; Programmation en nombres entiers; Problèmes de localisation; Operations research; Discrete optimisation; Lagrangian relaxation; Mixed integer programming; Location problems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Khuong, P. V. (2014). Lagrangian-informed mixed integer programming reformulations . (Thesis). Université de Montréal. Retrieved from http://hdl.handle.net/1866/10538

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

Chicago Manual of Style (16th Edition):

Khuong, Paul Virak. “Lagrangian-informed mixed integer programming reformulations .” 2014. Thesis, Université de Montréal. Accessed October 19, 2019. http://hdl.handle.net/1866/10538.

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

MLA Handbook (7th Edition):

Khuong, Paul Virak. “Lagrangian-informed mixed integer programming reformulations .” 2014. Web. 19 Oct 2019.

Vancouver:

Khuong PV. Lagrangian-informed mixed integer programming reformulations . [Internet] [Thesis]. Université de Montréal; 2014. [cited 2019 Oct 19]. Available from: http://hdl.handle.net/1866/10538.

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

Council of Science Editors:

Khuong PV. Lagrangian-informed mixed integer programming reformulations . [Thesis]. Université de Montréal; 2014. Available from: http://hdl.handle.net/1866/10538

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


Université Catholique de Louvain

7. Berouayel, Aladin. An R script for single allocation hub location problems.

Degree: 2016, Université Catholique de Louvain

The contribution of this thesis is an R script that provides the optimal hub location and non-hub node allocation to the hubs for several discrete… (more)

Subjects/Keywords: single allocation Hub location problems; R script

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Berouayel, A. (2016). An R script for single allocation hub location problems. (Thesis). Université Catholique de Louvain. Retrieved from http://hdl.handle.net/2078.1/thesis:7111

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

Chicago Manual of Style (16th Edition):

Berouayel, Aladin. “An R script for single allocation hub location problems.” 2016. Thesis, Université Catholique de Louvain. Accessed October 19, 2019. http://hdl.handle.net/2078.1/thesis:7111.

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

MLA Handbook (7th Edition):

Berouayel, Aladin. “An R script for single allocation hub location problems.” 2016. Web. 19 Oct 2019.

Vancouver:

Berouayel A. An R script for single allocation hub location problems. [Internet] [Thesis]. Université Catholique de Louvain; 2016. [cited 2019 Oct 19]. Available from: http://hdl.handle.net/2078.1/thesis:7111.

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

Council of Science Editors:

Berouayel A. An R script for single allocation hub location problems. [Thesis]. Université Catholique de Louvain; 2016. Available from: http://hdl.handle.net/2078.1/thesis:7111

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


Pontifical Catholic University of Rio de Janeiro

8. MARCOS LOPES BRITTO. [en] APPLICATION OF MULTIPERIOD UNCAPACITATED HUB LOCATION MODEL FOR EQUIPMENT PHYSICAL DISTRIBUTION OF A SATELLITE TELECOMMUNICATIONS COMPANY: A CASE STUDY.

Degree: 2018, Pontifical Catholic University of Rio de Janeiro

[pt] A relação entre as atividades logísticas desempenhadas nas empresas de telecomunicações e sua prestação de serviço parece, para o público em geral, estarem desassociadas.… (more)

Subjects/Keywords: [pt] TELECOMUNICACOES; [en] TELECOMUNICATIONS; [pt] LOGISTICA; [en] LOGISTICS; [pt] PROBLEMAS DE LOCALIZACAO; [en] LOCATION PROBLEMS; [pt] PROGRAMACAO INTEIRA MISTA; [en] MIXED INTEGER PROGRAMMING; [pt] PROBLEMA DE LOCALIZACAO NAO-CAPACITADA; [en] UNCAPACITATED HUB LOCATION PROBLEM; [pt] ESTUDO DE CASO ESTOCASTICO; [en] CASE STUDY STOCHASTIC

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

BRITTO, M. L. (2018). [en] APPLICATION OF MULTIPERIOD UNCAPACITATED HUB LOCATION MODEL FOR EQUIPMENT PHYSICAL DISTRIBUTION OF A SATELLITE TELECOMMUNICATIONS COMPANY: A CASE STUDY. (Thesis). Pontifical Catholic University of Rio de Janeiro. Retrieved from http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=33638

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

Chicago Manual of Style (16th Edition):

BRITTO, MARCOS LOPES. “[en] APPLICATION OF MULTIPERIOD UNCAPACITATED HUB LOCATION MODEL FOR EQUIPMENT PHYSICAL DISTRIBUTION OF A SATELLITE TELECOMMUNICATIONS COMPANY: A CASE STUDY.” 2018. Thesis, Pontifical Catholic University of Rio de Janeiro. Accessed October 19, 2019. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=33638.

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

MLA Handbook (7th Edition):

BRITTO, MARCOS LOPES. “[en] APPLICATION OF MULTIPERIOD UNCAPACITATED HUB LOCATION MODEL FOR EQUIPMENT PHYSICAL DISTRIBUTION OF A SATELLITE TELECOMMUNICATIONS COMPANY: A CASE STUDY.” 2018. Web. 19 Oct 2019.

Vancouver:

BRITTO ML. [en] APPLICATION OF MULTIPERIOD UNCAPACITATED HUB LOCATION MODEL FOR EQUIPMENT PHYSICAL DISTRIBUTION OF A SATELLITE TELECOMMUNICATIONS COMPANY: A CASE STUDY. [Internet] [Thesis]. Pontifical Catholic University of Rio de Janeiro; 2018. [cited 2019 Oct 19]. Available from: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=33638.

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

Council of Science Editors:

BRITTO ML. [en] APPLICATION OF MULTIPERIOD UNCAPACITATED HUB LOCATION MODEL FOR EQUIPMENT PHYSICAL DISTRIBUTION OF A SATELLITE TELECOMMUNICATIONS COMPANY: A CASE STUDY. [Thesis]. Pontifical Catholic University of Rio de Janeiro; 2018. Available from: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=33638

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


University of Lethbridge

9. University of Lethbridge. Faculty of Arts and Science. Minsum sink location and evacuation problem on dynamic cycle networks .

Degree: 2018, University of Lethbridge

 In this thesis, we study 1-sink location and k-sink evacuation problem on dynamic cycle networks. We consider the 1-sink location problem is to find the… (more)

Subjects/Keywords: dynamic cycle networks; evacuation problem; facility location problems; minsum sink; sink location; Dissertations, Academic

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Science, U. o. L. F. o. A. a. (2018). Minsum sink location and evacuation problem on dynamic cycle networks . (Thesis). University of Lethbridge. Retrieved from http://hdl.handle.net/10133/5451

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

Chicago Manual of Style (16th Edition):

Science, University of Lethbridge. Faculty of Arts and. “Minsum sink location and evacuation problem on dynamic cycle networks .” 2018. Thesis, University of Lethbridge. Accessed October 19, 2019. http://hdl.handle.net/10133/5451.

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

MLA Handbook (7th Edition):

Science, University of Lethbridge. Faculty of Arts and. “Minsum sink location and evacuation problem on dynamic cycle networks .” 2018. Web. 19 Oct 2019.

Vancouver:

Science UoLFoAa. Minsum sink location and evacuation problem on dynamic cycle networks . [Internet] [Thesis]. University of Lethbridge; 2018. [cited 2019 Oct 19]. Available from: http://hdl.handle.net/10133/5451.

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

Council of Science Editors:

Science UoLFoAa. Minsum sink location and evacuation problem on dynamic cycle networks . [Thesis]. University of Lethbridge; 2018. Available from: http://hdl.handle.net/10133/5451

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


Univerzitet u Beogradu

10. Đenić, Aleksandar D. Rešavanje diskretnih lokacijskih problema primenom metode promenljivih okolina.

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

računarstvo-računarska inteligencija / computer science-computational intelligence

Predmet ovog rada je analiza i re²avanje dva diskretna lokacijska problema: problema odreživanja lokacija autobuskih terminala (engl. Bus Terminal… (more)

Subjects/Keywords: Facility Location Problems; Bus Terminal Location Problem; Longterm Care Facility Location Problem; Combinatorial Optimization; Metaheuristics; Parallelization; Variable Neighborhood Search

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Đenić, A. D. (2018). Rešavanje diskretnih lokacijskih problema primenom metode promenljivih okolina. (Thesis). Univerzitet u Beogradu. Retrieved from https://fedorabg.bg.ac.rs/fedora/get/o:18332/bdef:Content/get

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

Chicago Manual of Style (16th Edition):

Đenić, Aleksandar D. “Rešavanje diskretnih lokacijskih problema primenom metode promenljivih okolina.” 2018. Thesis, Univerzitet u Beogradu. Accessed October 19, 2019. https://fedorabg.bg.ac.rs/fedora/get/o:18332/bdef:Content/get.

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

MLA Handbook (7th Edition):

Đenić, Aleksandar D. “Rešavanje diskretnih lokacijskih problema primenom metode promenljivih okolina.” 2018. Web. 19 Oct 2019.

Vancouver:

Đenić AD. Rešavanje diskretnih lokacijskih problema primenom metode promenljivih okolina. [Internet] [Thesis]. Univerzitet u Beogradu; 2018. [cited 2019 Oct 19]. Available from: https://fedorabg.bg.ac.rs/fedora/get/o:18332/bdef:Content/get.

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

Council of Science Editors:

Đenić AD. Rešavanje diskretnih lokacijskih problema primenom metode promenljivih okolina. [Thesis]. Univerzitet u Beogradu; 2018. Available from: https://fedorabg.bg.ac.rs/fedora/get/o:18332/bdef:Content/get

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


University of Hong Kong

11. U, Leong-Hou. Matching problems in large databases.

Degree: PhD, 2010, University of Hong Kong

published_or_final_version

Computer Science

Doctoral

Doctor of Philosophy

Advisors/Committee Members: Mamoulis, N.

Subjects/Keywords: Assignment problems (Programming)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

U, L. (2010). Matching problems in large databases. (Doctoral Dissertation). University of Hong Kong. Retrieved from U, L. H. [余亮豪]. (2010). Matching problems in large databases. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b4391048 ; http://dx.doi.org/10.5353/th_b4391048 ; http://hdl.handle.net/10722/61072

Chicago Manual of Style (16th Edition):

U, Leong-Hou. “Matching problems in large databases.” 2010. Doctoral Dissertation, University of Hong Kong. Accessed October 19, 2019. U, L. H. [余亮豪]. (2010). Matching problems in large databases. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b4391048 ; http://dx.doi.org/10.5353/th_b4391048 ; http://hdl.handle.net/10722/61072.

MLA Handbook (7th Edition):

U, Leong-Hou. “Matching problems in large databases.” 2010. Web. 19 Oct 2019.

Vancouver:

U L. Matching problems in large databases. [Internet] [Doctoral dissertation]. University of Hong Kong; 2010. [cited 2019 Oct 19]. Available from: U, L. H. [余亮豪]. (2010). Matching problems in large databases. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b4391048 ; http://dx.doi.org/10.5353/th_b4391048 ; http://hdl.handle.net/10722/61072.

Council of Science Editors:

U L. Matching problems in large databases. [Doctoral Dissertation]. University of Hong Kong; 2010. Available from: U, L. H. [余亮豪]. (2010). Matching problems in large databases. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b4391048 ; http://dx.doi.org/10.5353/th_b4391048 ; http://hdl.handle.net/10722/61072

12. Kalaitzis, Christos. Applications of Strong Convex Relaxations to Allocation Problems.

Degree: 2017, EPFL

 Approximation algorithms are a commonly used tool for designing efficient algorithmic solutions for intractable problems, at the expense of the quality of the output solution.… (more)

Subjects/Keywords: Approximation Algorithms; Linear Programming; NP-hard problems; Allocation Problems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kalaitzis, C. (2017). Applications of Strong Convex Relaxations to Allocation Problems. (Thesis). EPFL. Retrieved from http://infoscience.epfl.ch/record/226171

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

Chicago Manual of Style (16th Edition):

Kalaitzis, Christos. “Applications of Strong Convex Relaxations to Allocation Problems.” 2017. Thesis, EPFL. Accessed October 19, 2019. http://infoscience.epfl.ch/record/226171.

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

MLA Handbook (7th Edition):

Kalaitzis, Christos. “Applications of Strong Convex Relaxations to Allocation Problems.” 2017. Web. 19 Oct 2019.

Vancouver:

Kalaitzis C. Applications of Strong Convex Relaxations to Allocation Problems. [Internet] [Thesis]. EPFL; 2017. [cited 2019 Oct 19]. Available from: http://infoscience.epfl.ch/record/226171.

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

Council of Science Editors:

Kalaitzis C. Applications of Strong Convex Relaxations to Allocation Problems. [Thesis]. EPFL; 2017. Available from: http://infoscience.epfl.ch/record/226171

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

13. Espinoza García, Juan Carlos. Robust optimization for discrete structures and non-linear impact of uncertainty : Gouverner ou être gouverné ? : L'agence en conseil de vote, un acteur en construction dans la gouvernance d'entreprise.

Degree: Docteur es, Sciences de gestion, 2017, Cergy-Pontoise, Ecole supérieure des sciences économiques et commerciales

L’objectif de cette thèse est de proposer des solutions efficaces à des problèmes de décision qui ont un impact sur la vie des citoyens, et… (more)

Subjects/Keywords: Optimisation robust; Modèles de choix; Robust optimization; Location problems; Choice models

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Espinoza García, J. C. (2017). Robust optimization for discrete structures and non-linear impact of uncertainty : Gouverner ou être gouverné ? : L'agence en conseil de vote, un acteur en construction dans la gouvernance d'entreprise. (Doctoral Dissertation). Cergy-Pontoise, Ecole supérieure des sciences économiques et commerciales. Retrieved from http://www.theses.fr/2017ESEC0004

Chicago Manual of Style (16th Edition):

Espinoza García, Juan Carlos. “Robust optimization for discrete structures and non-linear impact of uncertainty : Gouverner ou être gouverné ? : L'agence en conseil de vote, un acteur en construction dans la gouvernance d'entreprise.” 2017. Doctoral Dissertation, Cergy-Pontoise, Ecole supérieure des sciences économiques et commerciales. Accessed October 19, 2019. http://www.theses.fr/2017ESEC0004.

MLA Handbook (7th Edition):

Espinoza García, Juan Carlos. “Robust optimization for discrete structures and non-linear impact of uncertainty : Gouverner ou être gouverné ? : L'agence en conseil de vote, un acteur en construction dans la gouvernance d'entreprise.” 2017. Web. 19 Oct 2019.

Vancouver:

Espinoza García JC. Robust optimization for discrete structures and non-linear impact of uncertainty : Gouverner ou être gouverné ? : L'agence en conseil de vote, un acteur en construction dans la gouvernance d'entreprise. [Internet] [Doctoral dissertation]. Cergy-Pontoise, Ecole supérieure des sciences économiques et commerciales; 2017. [cited 2019 Oct 19]. Available from: http://www.theses.fr/2017ESEC0004.

Council of Science Editors:

Espinoza García JC. Robust optimization for discrete structures and non-linear impact of uncertainty : Gouverner ou être gouverné ? : L'agence en conseil de vote, un acteur en construction dans la gouvernance d'entreprise. [Doctoral Dissertation]. Cergy-Pontoise, Ecole supérieure des sciences économiques et commerciales; 2017. Available from: http://www.theses.fr/2017ESEC0004


McMaster University

14. Canbolat, Mustafa Serdal. New Formulations and Approaches to Facility Location Problems in the Presence of Barriers.

Degree: PhD, 2010, McMaster University

This dissertation examines the facility location problems in the presence of barrier regions and consists basically of four essays exploring new problems. Despite the… (more)

Subjects/Keywords: management science; formulation; approach; facility location problems; barriers

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Canbolat, M. S. (2010). New Formulations and Approaches to Facility Location Problems in the Presence of Barriers. (Doctoral Dissertation). McMaster University. Retrieved from http://hdl.handle.net/11375/18978

Chicago Manual of Style (16th Edition):

Canbolat, Mustafa Serdal. “New Formulations and Approaches to Facility Location Problems in the Presence of Barriers.” 2010. Doctoral Dissertation, McMaster University. Accessed October 19, 2019. http://hdl.handle.net/11375/18978.

MLA Handbook (7th Edition):

Canbolat, Mustafa Serdal. “New Formulations and Approaches to Facility Location Problems in the Presence of Barriers.” 2010. Web. 19 Oct 2019.

Vancouver:

Canbolat MS. New Formulations and Approaches to Facility Location Problems in the Presence of Barriers. [Internet] [Doctoral dissertation]. McMaster University; 2010. [cited 2019 Oct 19]. Available from: http://hdl.handle.net/11375/18978.

Council of Science Editors:

Canbolat MS. New Formulations and Approaches to Facility Location Problems in the Presence of Barriers. [Doctoral Dissertation]. McMaster University; 2010. Available from: http://hdl.handle.net/11375/18978

15. Gianessi, Paolo. Optimisation Stratégique et tactique en logistique urbaine : Solving strategic and tactical optimization problems in city logistics.

Degree: Docteur es, Informatique, 2014, Paris 13

L'efficacité du transport des marchandises en ville est un sujet complexe préoccupant les autorités locales depuis de nombreuses années. Les enjeux sont immenses, une meilleure… (more)

Subjects/Keywords: Problèmes de localisation et routage; Location and routing problems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gianessi, P. (2014). Optimisation Stratégique et tactique en logistique urbaine : Solving strategic and tactical optimization problems in city logistics. (Doctoral Dissertation). Paris 13. Retrieved from http://www.theses.fr/2014PA132036

Chicago Manual of Style (16th Edition):

Gianessi, Paolo. “Optimisation Stratégique et tactique en logistique urbaine : Solving strategic and tactical optimization problems in city logistics.” 2014. Doctoral Dissertation, Paris 13. Accessed October 19, 2019. http://www.theses.fr/2014PA132036.

MLA Handbook (7th Edition):

Gianessi, Paolo. “Optimisation Stratégique et tactique en logistique urbaine : Solving strategic and tactical optimization problems in city logistics.” 2014. Web. 19 Oct 2019.

Vancouver:

Gianessi P. Optimisation Stratégique et tactique en logistique urbaine : Solving strategic and tactical optimization problems in city logistics. [Internet] [Doctoral dissertation]. Paris 13; 2014. [cited 2019 Oct 19]. Available from: http://www.theses.fr/2014PA132036.

Council of Science Editors:

Gianessi P. Optimisation Stratégique et tactique en logistique urbaine : Solving strategic and tactical optimization problems in city logistics. [Doctoral Dissertation]. Paris 13; 2014. Available from: http://www.theses.fr/2014PA132036


Univerzitet u Beogradu

16. Ratković, Branislava V., 1979-. Modeli za rešavanje problema lociranja resursa u sistemima povratne logistike.

Degree: Saobraćajni fakultet, 2016, Univerzitet u Beogradu

Saobraćajno inženjerstvo - Rukovanje materijalom i eko-logistika / Transport and traffic engineering - Material handling and eco-logistics

Problem sa kojim se suočava današnje društvo je… (more)

Subjects/Keywords: reverse logistics; location routing problem; linear programming; heuristics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ratković, Branislava V., 1. (2016). Modeli za rešavanje problema lociranja resursa u sistemima povratne logistike. (Thesis). Univerzitet u Beogradu. Retrieved from https://fedorabg.bg.ac.rs/fedora/get/o:12255/bdef:Content/get

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

Chicago Manual of Style (16th Edition):

Ratković, Branislava V., 1979-. “Modeli za rešavanje problema lociranja resursa u sistemima povratne logistike.” 2016. Thesis, Univerzitet u Beogradu. Accessed October 19, 2019. https://fedorabg.bg.ac.rs/fedora/get/o:12255/bdef:Content/get.

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

MLA Handbook (7th Edition):

Ratković, Branislava V., 1979-. “Modeli za rešavanje problema lociranja resursa u sistemima povratne logistike.” 2016. Web. 19 Oct 2019.

Vancouver:

Ratković, Branislava V. 1. Modeli za rešavanje problema lociranja resursa u sistemima povratne logistike. [Internet] [Thesis]. Univerzitet u Beogradu; 2016. [cited 2019 Oct 19]. Available from: https://fedorabg.bg.ac.rs/fedora/get/o:12255/bdef:Content/get.

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

Council of Science Editors:

Ratković, Branislava V. 1. Modeli za rešavanje problema lociranja resursa u sistemima povratne logistike. [Thesis]. Univerzitet u Beogradu; 2016. Available from: https://fedorabg.bg.ac.rs/fedora/get/o:12255/bdef:Content/get

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


Hong Kong University of Science and Technology

17. Chen, Lu. Scalable maps of random dots for middle-scale locative mobile games.

Degree: 2013, Hong Kong University of Science and Technology

 Locative games, or location-based games, are very popular nowadays because of theirunique playing experience. They are being mostly explored for large-scale spaces, such as urban… (more)

Subjects/Keywords: Mobile games; Programming; Location-based services; Augmented reality

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chen, L. (2013). Scalable maps of random dots for middle-scale locative mobile games. (Thesis). Hong Kong University of Science and Technology. Retrieved from https://doi.org/10.14711/thesis-b1240236 ; http://repository.ust.hk/ir/bitstream/1783.1-7979/1/th_redirect.html

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

Chicago Manual of Style (16th Edition):

Chen, Lu. “Scalable maps of random dots for middle-scale locative mobile games.” 2013. Thesis, Hong Kong University of Science and Technology. Accessed October 19, 2019. https://doi.org/10.14711/thesis-b1240236 ; http://repository.ust.hk/ir/bitstream/1783.1-7979/1/th_redirect.html.

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

MLA Handbook (7th Edition):

Chen, Lu. “Scalable maps of random dots for middle-scale locative mobile games.” 2013. Web. 19 Oct 2019.

Vancouver:

Chen L. Scalable maps of random dots for middle-scale locative mobile games. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2013. [cited 2019 Oct 19]. Available from: https://doi.org/10.14711/thesis-b1240236 ; http://repository.ust.hk/ir/bitstream/1783.1-7979/1/th_redirect.html.

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

Council of Science Editors:

Chen L. Scalable maps of random dots for middle-scale locative mobile games. [Thesis]. Hong Kong University of Science and Technology; 2013. Available from: https://doi.org/10.14711/thesis-b1240236 ; http://repository.ust.hk/ir/bitstream/1783.1-7979/1/th_redirect.html

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


Montana State University

18. Valderrama, Alfredo Roque. Effect of parameter ranges upon choice between centralized and decentralized facilities.

Degree: College of Engineering, 1968, Montana State University

Subjects/Keywords: Linear programming.; Industrial location.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Valderrama, A. R. (1968). Effect of parameter ranges upon choice between centralized and decentralized facilities. (Thesis). Montana State University. Retrieved from https://scholarworks.montana.edu/xmlui/handle/1/6250

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

Chicago Manual of Style (16th Edition):

Valderrama, Alfredo Roque. “Effect of parameter ranges upon choice between centralized and decentralized facilities.” 1968. Thesis, Montana State University. Accessed October 19, 2019. https://scholarworks.montana.edu/xmlui/handle/1/6250.

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

MLA Handbook (7th Edition):

Valderrama, Alfredo Roque. “Effect of parameter ranges upon choice between centralized and decentralized facilities.” 1968. Web. 19 Oct 2019.

Vancouver:

Valderrama AR. Effect of parameter ranges upon choice between centralized and decentralized facilities. [Internet] [Thesis]. Montana State University; 1968. [cited 2019 Oct 19]. Available from: https://scholarworks.montana.edu/xmlui/handle/1/6250.

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

Council of Science Editors:

Valderrama AR. Effect of parameter ranges upon choice between centralized and decentralized facilities. [Thesis]. Montana State University; 1968. Available from: https://scholarworks.montana.edu/xmlui/handle/1/6250

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


University of Waterloo

19. Zvereva, Margarita. Mathematical Programming Formulations of the Planar Facility Location Problem.

Degree: 2007, University of Waterloo

 The facility location problem is the task of optimally placing a given number of facilities in a certain subset of the plane. In this thesis,… (more)

Subjects/Keywords: facility location; semidefinite programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zvereva, M. (2007). Mathematical Programming Formulations of the Planar Facility Location Problem. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/3283

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

Chicago Manual of Style (16th Edition):

Zvereva, Margarita. “Mathematical Programming Formulations of the Planar Facility Location Problem.” 2007. Thesis, University of Waterloo. Accessed October 19, 2019. http://hdl.handle.net/10012/3283.

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

MLA Handbook (7th Edition):

Zvereva, Margarita. “Mathematical Programming Formulations of the Planar Facility Location Problem.” 2007. Web. 19 Oct 2019.

Vancouver:

Zvereva M. Mathematical Programming Formulations of the Planar Facility Location Problem. [Internet] [Thesis]. University of Waterloo; 2007. [cited 2019 Oct 19]. Available from: http://hdl.handle.net/10012/3283.

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

Council of Science Editors:

Zvereva M. Mathematical Programming Formulations of the Planar Facility Location Problem. [Thesis]. University of Waterloo; 2007. Available from: http://hdl.handle.net/10012/3283

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


EPFL

20. Bazzi, Abbas. Strengths and Limitations of Linear Programming Relaxations.

Degree: 2017, EPFL

 Many of the currently best-known approximation algorithms for NP-hard optimization problems are based on Linear Programming (LP) and Semi-definite Programming (SDP) relaxations. Given its power,… (more)

Subjects/Keywords: Linear Programming; Approximation Algorithms; Integrality Gap; Graph Problems; Knapsack Problem; Scheduling Problems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bazzi, A. (2017). Strengths and Limitations of Linear Programming Relaxations. (Thesis). EPFL. Retrieved from http://infoscience.epfl.ch/record/231945

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

Chicago Manual of Style (16th Edition):

Bazzi, Abbas. “Strengths and Limitations of Linear Programming Relaxations.” 2017. Thesis, EPFL. Accessed October 19, 2019. http://infoscience.epfl.ch/record/231945.

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

MLA Handbook (7th Edition):

Bazzi, Abbas. “Strengths and Limitations of Linear Programming Relaxations.” 2017. Web. 19 Oct 2019.

Vancouver:

Bazzi A. Strengths and Limitations of Linear Programming Relaxations. [Internet] [Thesis]. EPFL; 2017. [cited 2019 Oct 19]. Available from: http://infoscience.epfl.ch/record/231945.

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

Council of Science Editors:

Bazzi A. Strengths and Limitations of Linear Programming Relaxations. [Thesis]. EPFL; 2017. Available from: http://infoscience.epfl.ch/record/231945

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

21. Jain, Vikas Kumar. On some aspects of multi objective mathematical programming;.

Degree: Mathematics, 2014, Jaypee University of Engineering and Technology, Guna

The thesis comprises seven chapters and the gist of each chapter is given below: newlineThe first chapter is an introductory one and contains a brief… (more)

Subjects/Keywords: Multi objective mathematical programming; Non differentiable multi objective control Problems; Vector-valued variational problems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Jain, V. K. (2014). On some aspects of multi objective mathematical programming;. (Thesis). Jaypee University of Engineering and Technology, Guna. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/18187

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

Chicago Manual of Style (16th Edition):

Jain, Vikas Kumar. “On some aspects of multi objective mathematical programming;.” 2014. Thesis, Jaypee University of Engineering and Technology, Guna. Accessed October 19, 2019. http://shodhganga.inflibnet.ac.in/handle/10603/18187.

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

MLA Handbook (7th Edition):

Jain, Vikas Kumar. “On some aspects of multi objective mathematical programming;.” 2014. Web. 19 Oct 2019.

Vancouver:

Jain VK. On some aspects of multi objective mathematical programming;. [Internet] [Thesis]. Jaypee University of Engineering and Technology, Guna; 2014. [cited 2019 Oct 19]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/18187.

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

Council of Science Editors:

Jain VK. On some aspects of multi objective mathematical programming;. [Thesis]. Jaypee University of Engineering and Technology, Guna; 2014. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/18187

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


Australian National University

22. Bertoli, Francesco. Tactical Problems in Vehicle Routing Applications .

Degree: 2018, Australian National University

 The class of Vehicle Routing Problems (VRPs) is one the most studied topics in the Operations Research community. The vast majority of the published papers… (more)

Subjects/Keywords: Vehicle Routing Problems; Tactical Problems; Operations Research; Mathematical Programming; Metaheuristic; Discrete Optimization; Discrete Optimisation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bertoli, F. (2018). Tactical Problems in Vehicle Routing Applications . (Thesis). Australian National University. Retrieved from http://hdl.handle.net/1885/146047

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

Chicago Manual of Style (16th Edition):

Bertoli, Francesco. “Tactical Problems in Vehicle Routing Applications .” 2018. Thesis, Australian National University. Accessed October 19, 2019. http://hdl.handle.net/1885/146047.

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

MLA Handbook (7th Edition):

Bertoli, Francesco. “Tactical Problems in Vehicle Routing Applications .” 2018. Web. 19 Oct 2019.

Vancouver:

Bertoli F. Tactical Problems in Vehicle Routing Applications . [Internet] [Thesis]. Australian National University; 2018. [cited 2019 Oct 19]. Available from: http://hdl.handle.net/1885/146047.

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

Council of Science Editors:

Bertoli F. Tactical Problems in Vehicle Routing Applications . [Thesis]. Australian National University; 2018. Available from: http://hdl.handle.net/1885/146047

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


Georgia Tech

23. Li, Yaxian. Lower bounds for integer programming problems.

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

 Solving real world problems with mixed integer programming (MIP) involves efforts in modeling and efficient algorithms. To solve a minimization MIP problem, a lower bound… (more)

Subjects/Keywords: Lower bounds; Integer programming problems; Multi-dimensional knapsack problem; Algorithms; Knapsack problem (Mathematics); Integer programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Li, Y. (2013). Lower bounds for integer programming problems. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/48959

Chicago Manual of Style (16th Edition):

Li, Yaxian. “Lower bounds for integer programming problems.” 2013. Doctoral Dissertation, Georgia Tech. Accessed October 19, 2019. http://hdl.handle.net/1853/48959.

MLA Handbook (7th Edition):

Li, Yaxian. “Lower bounds for integer programming problems.” 2013. Web. 19 Oct 2019.

Vancouver:

Li Y. Lower bounds for integer programming problems. [Internet] [Doctoral dissertation]. Georgia Tech; 2013. [cited 2019 Oct 19]. Available from: http://hdl.handle.net/1853/48959.

Council of Science Editors:

Li Y. Lower bounds for integer programming problems. [Doctoral Dissertation]. Georgia Tech; 2013. Available from: http://hdl.handle.net/1853/48959


Brno University of Technology

24. Zetka, Petr. Programový systém pro řešení úloh dynamického programování .

Degree: 2011, Brno University of Technology

 Diplomová práce se zabývá tvorbou programového systému pro řešení úloh dynamického programování na počítači. V teoretické části práce je popsáno dynamické programování jako nástroj pro… (more)

Subjects/Keywords: Optimalizace; dynamické programování; úlohy dynamického programování; C#.; Optimization; dynamic programming; dynamic programming problems; C#.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zetka, P. (2011). Programový systém pro řešení úloh dynamického programování . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/8159

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

Chicago Manual of Style (16th Edition):

Zetka, Petr. “Programový systém pro řešení úloh dynamického programování .” 2011. Thesis, Brno University of Technology. Accessed October 19, 2019. http://hdl.handle.net/11012/8159.

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

MLA Handbook (7th Edition):

Zetka, Petr. “Programový systém pro řešení úloh dynamického programování .” 2011. Web. 19 Oct 2019.

Vancouver:

Zetka P. Programový systém pro řešení úloh dynamického programování . [Internet] [Thesis]. Brno University of Technology; 2011. [cited 2019 Oct 19]. Available from: http://hdl.handle.net/11012/8159.

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

Council of Science Editors:

Zetka P. Programový systém pro řešení úloh dynamického programování . [Thesis]. Brno University of Technology; 2011. Available from: http://hdl.handle.net/11012/8159

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


The Ohio State University

25. Wei, Hu. SOLVING CONTINUOUS SPACE LOCATION PROBLEMS.

Degree: PhD, Geography, 2008, The Ohio State University

  The focus of this research is on location problems where potential facility sites are to be located in continuous space and demand is assumed… (more)

Subjects/Keywords: Geography; Operations Research; Continuous space location problems; p-center problem; coverage maximization; Voronoi diagram heuristic

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wei, H. (2008). SOLVING CONTINUOUS SPACE LOCATION PROBLEMS. (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1205514715

Chicago Manual of Style (16th Edition):

Wei, Hu. “SOLVING CONTINUOUS SPACE LOCATION PROBLEMS.” 2008. Doctoral Dissertation, The Ohio State University. Accessed October 19, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=osu1205514715.

MLA Handbook (7th Edition):

Wei, Hu. “SOLVING CONTINUOUS SPACE LOCATION PROBLEMS.” 2008. Web. 19 Oct 2019.

Vancouver:

Wei H. SOLVING CONTINUOUS SPACE LOCATION PROBLEMS. [Internet] [Doctoral dissertation]. The Ohio State University; 2008. [cited 2019 Oct 19]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1205514715.

Council of Science Editors:

Wei H. SOLVING CONTINUOUS SPACE LOCATION PROBLEMS. [Doctoral Dissertation]. The Ohio State University; 2008. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1205514715


University of Arkansas

26. Medal, Hugh. Locating and Protecting Facilities Subject to Random Disruptions and Attacks.

Degree: PhD, 2012, University of Arkansas

  Recent events such as the 2011 Tohoku earthquake and tsunami in Japan have revealed the vulnerability of networks such as supply chains to disruptive… (more)

Subjects/Keywords: Applied sciences; Facility location; Interdiction; Mixed-integer programming; Stochastic programming; Supply chain disruptions; Industrial Engineering; Information Security; Operational Research

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Medal, H. (2012). Locating and Protecting Facilities Subject to Random Disruptions and Attacks. (Doctoral Dissertation). University of Arkansas. Retrieved from https://scholarworks.uark.edu/etd/448

Chicago Manual of Style (16th Edition):

Medal, Hugh. “Locating and Protecting Facilities Subject to Random Disruptions and Attacks.” 2012. Doctoral Dissertation, University of Arkansas. Accessed October 19, 2019. https://scholarworks.uark.edu/etd/448.

MLA Handbook (7th Edition):

Medal, Hugh. “Locating and Protecting Facilities Subject to Random Disruptions and Attacks.” 2012. Web. 19 Oct 2019.

Vancouver:

Medal H. Locating and Protecting Facilities Subject to Random Disruptions and Attacks. [Internet] [Doctoral dissertation]. University of Arkansas; 2012. [cited 2019 Oct 19]. Available from: https://scholarworks.uark.edu/etd/448.

Council of Science Editors:

Medal H. Locating and Protecting Facilities Subject to Random Disruptions and Attacks. [Doctoral Dissertation]. University of Arkansas; 2012. Available from: https://scholarworks.uark.edu/etd/448


University of Florida

27. Khalil, Mohammad. On the Linear Programming and Group Relaxations of the Uncapacitated Facility Location Problem.

Degree: MS, Industrial and Systems Engineering, 2010, University of Florida

 The uncapacitated facility location problem (UFLP) is a classical problem in the Operations Research community that has been studied extensively. Various approaches have been proposed… (more)

Subjects/Keywords: Absolute value; Algorithms; Customers; Determinants; Integer programming; Integers; Linear programming; Mathematics; Matrices; Optimal solutions; facility, group, location, relaxations, uncapacitated

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Khalil, M. (2010). On the Linear Programming and Group Relaxations of the Uncapacitated Facility Location Problem. (Masters Thesis). University of Florida. Retrieved from http://ufdc.ufl.edu/UFE0042232

Chicago Manual of Style (16th Edition):

Khalil, Mohammad. “On the Linear Programming and Group Relaxations of the Uncapacitated Facility Location Problem.” 2010. Masters Thesis, University of Florida. Accessed October 19, 2019. http://ufdc.ufl.edu/UFE0042232.

MLA Handbook (7th Edition):

Khalil, Mohammad. “On the Linear Programming and Group Relaxations of the Uncapacitated Facility Location Problem.” 2010. Web. 19 Oct 2019.

Vancouver:

Khalil M. On the Linear Programming and Group Relaxations of the Uncapacitated Facility Location Problem. [Internet] [Masters thesis]. University of Florida; 2010. [cited 2019 Oct 19]. Available from: http://ufdc.ufl.edu/UFE0042232.

Council of Science Editors:

Khalil M. On the Linear Programming and Group Relaxations of the Uncapacitated Facility Location Problem. [Masters Thesis]. University of Florida; 2010. Available from: http://ufdc.ufl.edu/UFE0042232


New Jersey Institute of Technology

28. Khan, Mohammad A. Context-aware collaborative storage and programming for mobile users.

Degree: PhD, Computer Science, 2016, New Jersey Institute of Technology

  Since people generate and access most digital content from mobile devices, novel innovative mobile apps and services are possible. Most people are interested in… (more)

Subjects/Keywords: Mobile users' collaboration; Mobile cloud programming; Collaborative social network; Location-time based programming; Social network centrality; Dynamic groups; Computer Sciences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Khan, M. A. (2016). Context-aware collaborative storage and programming for mobile users. (Doctoral Dissertation). New Jersey Institute of Technology. Retrieved from https://digitalcommons.njit.edu/dissertations/95

Chicago Manual of Style (16th Edition):

Khan, Mohammad A. “Context-aware collaborative storage and programming for mobile users.” 2016. Doctoral Dissertation, New Jersey Institute of Technology. Accessed October 19, 2019. https://digitalcommons.njit.edu/dissertations/95.

MLA Handbook (7th Edition):

Khan, Mohammad A. “Context-aware collaborative storage and programming for mobile users.” 2016. Web. 19 Oct 2019.

Vancouver:

Khan MA. Context-aware collaborative storage and programming for mobile users. [Internet] [Doctoral dissertation]. New Jersey Institute of Technology; 2016. [cited 2019 Oct 19]. Available from: https://digitalcommons.njit.edu/dissertations/95.

Council of Science Editors:

Khan MA. Context-aware collaborative storage and programming for mobile users. [Doctoral Dissertation]. New Jersey Institute of Technology; 2016. Available from: https://digitalcommons.njit.edu/dissertations/95

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

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

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

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

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

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

Chicago Manual of Style (16th Edition):

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

MLA Handbook (7th Edition):

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

Vancouver:

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

Council of Science Editors:

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


Texas A&M University

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

Degree: 2014, Texas A&M University

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

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

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

Chicago Manual of Style (16th Edition):

Han, Xue. “Healthcare Facility Location and Capacity Configuration under Stochastic Demand.” 2014. Thesis, Texas A&M University. Accessed October 19, 2019. http://hdl.handle.net/1969.1/153954.

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

MLA Handbook (7th Edition):

Han, Xue. “Healthcare Facility Location and Capacity Configuration under Stochastic Demand.” 2014. Web. 19 Oct 2019.

Vancouver:

Han X. Healthcare Facility Location and Capacity Configuration under Stochastic Demand. [Internet] [Thesis]. Texas A&M University; 2014. [cited 2019 Oct 19]. Available from: http://hdl.handle.net/1969.1/153954.

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

Council of Science Editors:

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

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

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

.