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:(Greedy heuristic). Showing records 1 – 21 of 21 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


Delft University of Technology

1. Bellan, Daniele (author). Optimal Cost Prediction in the Vehicle Routing Problem Through Supervised Learning.

Degree: 2018, Delft University of Technology

Machine learning techniques aim to train a model in such a way that it can approximate complex dynamics like the vehicle routing problem. In the… (more)

Subjects/Keywords: Pick-up and Delivery Problem; cost prediction; neural networks; greedy heuristic

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bellan, D. (. (2018). Optimal Cost Prediction in the Vehicle Routing Problem Through Supervised Learning. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:4461e3dd-0ba3-4d18-a9dc-88c31b43a36f

Chicago Manual of Style (16th Edition):

Bellan, Daniele (author). “Optimal Cost Prediction in the Vehicle Routing Problem Through Supervised Learning.” 2018. Masters Thesis, Delft University of Technology. Accessed October 30, 2020. http://resolver.tudelft.nl/uuid:4461e3dd-0ba3-4d18-a9dc-88c31b43a36f.

MLA Handbook (7th Edition):

Bellan, Daniele (author). “Optimal Cost Prediction in the Vehicle Routing Problem Through Supervised Learning.” 2018. Web. 30 Oct 2020.

Vancouver:

Bellan D(. Optimal Cost Prediction in the Vehicle Routing Problem Through Supervised Learning. [Internet] [Masters thesis]. Delft University of Technology; 2018. [cited 2020 Oct 30]. Available from: http://resolver.tudelft.nl/uuid:4461e3dd-0ba3-4d18-a9dc-88c31b43a36f.

Council of Science Editors:

Bellan D(. Optimal Cost Prediction in the Vehicle Routing Problem Through Supervised Learning. [Masters Thesis]. Delft University of Technology; 2018. Available from: http://resolver.tudelft.nl/uuid:4461e3dd-0ba3-4d18-a9dc-88c31b43a36f

2. Lundquist, Josefin. An optimization model using the Assignment Problem to manage the location of parts : Master Thesis at the engine assembly at Scania CV AB.

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

  A key challenge for manufacturing companies is to store parts in an efficient way atthe lowest cost possible. As the demand of differentiated products… (more)

Subjects/Keywords: Inventory optimization; Integer programming; Generalized assignment problem; Combinatorial optimization; Greedy heuristic; Constructive algorithm; Mathematics; Matematik

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lundquist, J. (2017). An optimization model using the Assignment Problem to manage the location of parts : Master Thesis at the engine assembly at Scania CV AB. (Thesis). Umeå University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-137825

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

Lundquist, Josefin. “An optimization model using the Assignment Problem to manage the location of parts : Master Thesis at the engine assembly at Scania CV AB.” 2017. Thesis, Umeå University. Accessed October 30, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-137825.

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

MLA Handbook (7th Edition):

Lundquist, Josefin. “An optimization model using the Assignment Problem to manage the location of parts : Master Thesis at the engine assembly at Scania CV AB.” 2017. Web. 30 Oct 2020.

Vancouver:

Lundquist J. An optimization model using the Assignment Problem to manage the location of parts : Master Thesis at the engine assembly at Scania CV AB. [Internet] [Thesis]. Umeå University; 2017. [cited 2020 Oct 30]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-137825.

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

Council of Science Editors:

Lundquist J. An optimization model using the Assignment Problem to manage the location of parts : Master Thesis at the engine assembly at Scania CV AB. [Thesis]. Umeå University; 2017. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-137825

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


Delft University of Technology

3. Tilli, Federico (author). Greedy Wind Farm Layout Optimization Using Pre-Averaged Losses.

Degree: 2019, Delft University of Technology

 Wind turbine placement in a wind farm can be optimized to limit power losses due to wakes and improve the economic value of the plant.… (more)

Subjects/Keywords: Wind energy; Wind farm layout optimization; Greedy heuristic; Annual energy production assessment

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Tilli, F. (. (2019). Greedy Wind Farm Layout Optimization Using Pre-Averaged Losses. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:4b118ae1-536d-4e0b-a30b-d88ba818c918

Chicago Manual of Style (16th Edition):

Tilli, Federico (author). “Greedy Wind Farm Layout Optimization Using Pre-Averaged Losses.” 2019. Masters Thesis, Delft University of Technology. Accessed October 30, 2020. http://resolver.tudelft.nl/uuid:4b118ae1-536d-4e0b-a30b-d88ba818c918.

MLA Handbook (7th Edition):

Tilli, Federico (author). “Greedy Wind Farm Layout Optimization Using Pre-Averaged Losses.” 2019. Web. 30 Oct 2020.

Vancouver:

Tilli F(. Greedy Wind Farm Layout Optimization Using Pre-Averaged Losses. [Internet] [Masters thesis]. Delft University of Technology; 2019. [cited 2020 Oct 30]. Available from: http://resolver.tudelft.nl/uuid:4b118ae1-536d-4e0b-a30b-d88ba818c918.

Council of Science Editors:

Tilli F(. Greedy Wind Farm Layout Optimization Using Pre-Averaged Losses. [Masters Thesis]. Delft University of Technology; 2019. Available from: http://resolver.tudelft.nl/uuid:4b118ae1-536d-4e0b-a30b-d88ba818c918


Michigan Technological University

4. McCorkle, Colin G. TANK SIZING AND OPTIMIZING LOOP PLACEMENT IN A BRANCHED WATER DISTRIBUTION SYSTEM.

Degree: MS, Department of Civil and Environmental Engineering, 2014, Michigan Technological University

  More than eighteen percent of the world’s population lives without reliable access to clean water, forced to walk long distances to get small amounts… (more)

Subjects/Keywords: clean water; water distribution system; Boajibu; Sierra Leone; Adaptive Greedy Heuristic Loop Addition Selection Algorithm (AGHLASA); Environmental Engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

McCorkle, C. G. (2014). TANK SIZING AND OPTIMIZING LOOP PLACEMENT IN A BRANCHED WATER DISTRIBUTION SYSTEM. (Masters Thesis). Michigan Technological University. Retrieved from http://digitalcommons.mtu.edu/etds/831

Chicago Manual of Style (16th Edition):

McCorkle, Colin G. “TANK SIZING AND OPTIMIZING LOOP PLACEMENT IN A BRANCHED WATER DISTRIBUTION SYSTEM.” 2014. Masters Thesis, Michigan Technological University. Accessed October 30, 2020. http://digitalcommons.mtu.edu/etds/831.

MLA Handbook (7th Edition):

McCorkle, Colin G. “TANK SIZING AND OPTIMIZING LOOP PLACEMENT IN A BRANCHED WATER DISTRIBUTION SYSTEM.” 2014. Web. 30 Oct 2020.

Vancouver:

McCorkle CG. TANK SIZING AND OPTIMIZING LOOP PLACEMENT IN A BRANCHED WATER DISTRIBUTION SYSTEM. [Internet] [Masters thesis]. Michigan Technological University; 2014. [cited 2020 Oct 30]. Available from: http://digitalcommons.mtu.edu/etds/831.

Council of Science Editors:

McCorkle CG. TANK SIZING AND OPTIMIZING LOOP PLACEMENT IN A BRANCHED WATER DISTRIBUTION SYSTEM. [Masters Thesis]. Michigan Technological University; 2014. Available from: http://digitalcommons.mtu.edu/etds/831

5. Phan, Raksmey. Méthodes exactes et approchées par partition en cliques de graphes : Exact and approximation methods by clique partition of graphs.

Degree: Docteur es, Informatique, 2013, Université Blaise-Pascale, Clermont-Ferrand II

Cette thèse se déroule au sein du projet ToDo (Time versus Optimality in discrete Optimization ANR 09-EMER-010) financé par l'Agence Nationale de la Recherche. Nous… (more)

Subjects/Keywords: Exact; Approximation; Heuristique gloutonne; Indépendant dominant; Vertex cover; Conflits; Exact; Approximation; Greedy Heuristic; Independent Dominating; Vertex Cover; Conflicts

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Phan, R. (2013). Méthodes exactes et approchées par partition en cliques de graphes : Exact and approximation methods by clique partition of graphs. (Doctoral Dissertation). Université Blaise-Pascale, Clermont-Ferrand II. Retrieved from http://www.theses.fr/2013CLF22396

Chicago Manual of Style (16th Edition):

Phan, Raksmey. “Méthodes exactes et approchées par partition en cliques de graphes : Exact and approximation methods by clique partition of graphs.” 2013. Doctoral Dissertation, Université Blaise-Pascale, Clermont-Ferrand II. Accessed October 30, 2020. http://www.theses.fr/2013CLF22396.

MLA Handbook (7th Edition):

Phan, Raksmey. “Méthodes exactes et approchées par partition en cliques de graphes : Exact and approximation methods by clique partition of graphs.” 2013. Web. 30 Oct 2020.

Vancouver:

Phan R. Méthodes exactes et approchées par partition en cliques de graphes : Exact and approximation methods by clique partition of graphs. [Internet] [Doctoral dissertation]. Université Blaise-Pascale, Clermont-Ferrand II; 2013. [cited 2020 Oct 30]. Available from: http://www.theses.fr/2013CLF22396.

Council of Science Editors:

Phan R. Méthodes exactes et approchées par partition en cliques de graphes : Exact and approximation methods by clique partition of graphs. [Doctoral Dissertation]. Université Blaise-Pascale, Clermont-Ferrand II; 2013. Available from: http://www.theses.fr/2013CLF22396


KTH

6. Fredriksson, Bastian. The Monk Problem : Verifier, heuristics and graph decompositions for a pursuit-evasion problem with a node-located evader.

Degree: Computer Science and Communication (CSC), 2015, KTH

This paper concerns a specific pursuit-evasion problem with a node-located evader which we call the monk problem. First, we propose a way of verifying… (more)

Subjects/Keywords: graph decomposition; strongly connected component; pursuit-evasion; search number; el-system; formal grammar; greedy heuristic; Computer Sciences; Datavetenskap (datalogi)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Fredriksson, B. (2015). The Monk Problem : Verifier, heuristics and graph decompositions for a pursuit-evasion problem with a node-located evader. (Thesis). KTH. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-166442

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

Fredriksson, Bastian. “The Monk Problem : Verifier, heuristics and graph decompositions for a pursuit-evasion problem with a node-located evader.” 2015. Thesis, KTH. Accessed October 30, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-166442.

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

MLA Handbook (7th Edition):

Fredriksson, Bastian. “The Monk Problem : Verifier, heuristics and graph decompositions for a pursuit-evasion problem with a node-located evader.” 2015. Web. 30 Oct 2020.

Vancouver:

Fredriksson B. The Monk Problem : Verifier, heuristics and graph decompositions for a pursuit-evasion problem with a node-located evader. [Internet] [Thesis]. KTH; 2015. [cited 2020 Oct 30]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-166442.

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

Council of Science Editors:

Fredriksson B. The Monk Problem : Verifier, heuristics and graph decompositions for a pursuit-evasion problem with a node-located evader. [Thesis]. KTH; 2015. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-166442

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

7. Hossain, Mohammad Forhad. Spanning Tree Approach On The Snow Cleaning Problem.

Degree: Computer Engineering, 2010, Dalarna University

  Snow cleaning is one of the important tasks in the winter time in Sweden. Every year government spends huge amount money for snow cleaning… (more)

Subjects/Keywords: Snow Cleaning; Minimum Spanning Tree; Heuristic; prim’s algorithm; Greedy Algorithm.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hossain, M. F. (2010). Spanning Tree Approach On The Snow Cleaning Problem. (Thesis). Dalarna University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:du-4847

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

Hossain, Mohammad Forhad. “Spanning Tree Approach On The Snow Cleaning Problem.” 2010. Thesis, Dalarna University. Accessed October 30, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:du-4847.

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

MLA Handbook (7th Edition):

Hossain, Mohammad Forhad. “Spanning Tree Approach On The Snow Cleaning Problem.” 2010. Web. 30 Oct 2020.

Vancouver:

Hossain MF. Spanning Tree Approach On The Snow Cleaning Problem. [Internet] [Thesis]. Dalarna University; 2010. [cited 2020 Oct 30]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:du-4847.

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

Council of Science Editors:

Hossain MF. Spanning Tree Approach On The Snow Cleaning Problem. [Thesis]. Dalarna University; 2010. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:du-4847

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

8. Lee, Jinho, doctor of operations research and industrial engineering. Stochastic Optimization Models for Rapid Detection of Viruses in Cellphone Networks.

Degree: PhD, Operations Research and Industrial Engineering, 2012, University of Texas – Austin

 We develop a class of models to represent the dynamics of a virus spreading in a cellphone network, employing a taxonomy that includes five key… (more)

Subjects/Keywords: Submodularity; Greedy heuristic; Down-sampling procedure; Monte Carlo approximation

…2.2.2 Submodularity and Greedy Heuristic . . . . . . . . . 2.3 Minimizing Expected Detection… …Lazy Greedy Heuristic . . . . . . . . . . . . . . . . . 2.5 Related Results… …heuristic, “T” for the greedy solution from the TN11C spread model, “R” for the greedy solution… …Submodularity and Greedy Heuristic Our function f defined in model (2.1) is a real-valued… …x29; is NP-hard [41]. A greedy heuristic to solve model (2.5) works as… 

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lee, Jinho, d. o. o. r. a. i. e. (2012). Stochastic Optimization Models for Rapid Detection of Viruses in Cellphone Networks. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/ETD-UT-2012-08-5924

Chicago Manual of Style (16th Edition):

Lee, Jinho, doctor of operations research and industrial engineering. “Stochastic Optimization Models for Rapid Detection of Viruses in Cellphone Networks.” 2012. Doctoral Dissertation, University of Texas – Austin. Accessed October 30, 2020. http://hdl.handle.net/2152/ETD-UT-2012-08-5924.

MLA Handbook (7th Edition):

Lee, Jinho, doctor of operations research and industrial engineering. “Stochastic Optimization Models for Rapid Detection of Viruses in Cellphone Networks.” 2012. Web. 30 Oct 2020.

Vancouver:

Lee, Jinho dooraie. Stochastic Optimization Models for Rapid Detection of Viruses in Cellphone Networks. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2012. [cited 2020 Oct 30]. Available from: http://hdl.handle.net/2152/ETD-UT-2012-08-5924.

Council of Science Editors:

Lee, Jinho dooraie. Stochastic Optimization Models for Rapid Detection of Viruses in Cellphone Networks. [Doctoral Dissertation]. University of Texas – Austin; 2012. Available from: http://hdl.handle.net/2152/ETD-UT-2012-08-5924


Indian Institute of Science

9. Mathirajan, M. Heuristic Scheduling Algorithms For Parallel Heterogeneous Batch Processors.

Degree: PhD, Faculty of Engineering, 2006, Indian Institute of Science

 In the last decade, market pressures for greater variety of products forced a gradual shift from continuous manufacturing to batch manufacturing in various industries. Consequently… (more)

Subjects/Keywords: Metal Manufacturing; Heuristic Algorithms; Scheduling; Multiple Batch Processors; Batch Processor Scheduling; Greedy Heuristics; Steel Foundry; Mathematical Programming Based Heuristic Algorithm (MPHA); In-compatible Families

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mathirajan, M. (2006). Heuristic Scheduling Algorithms For Parallel Heterogeneous Batch Processors. (Doctoral Dissertation). Indian Institute of Science. Retrieved from http://etd.iisc.ac.in/handle/2005/196

Chicago Manual of Style (16th Edition):

Mathirajan, M. “Heuristic Scheduling Algorithms For Parallel Heterogeneous Batch Processors.” 2006. Doctoral Dissertation, Indian Institute of Science. Accessed October 30, 2020. http://etd.iisc.ac.in/handle/2005/196.

MLA Handbook (7th Edition):

Mathirajan, M. “Heuristic Scheduling Algorithms For Parallel Heterogeneous Batch Processors.” 2006. Web. 30 Oct 2020.

Vancouver:

Mathirajan M. Heuristic Scheduling Algorithms For Parallel Heterogeneous Batch Processors. [Internet] [Doctoral dissertation]. Indian Institute of Science; 2006. [cited 2020 Oct 30]. Available from: http://etd.iisc.ac.in/handle/2005/196.

Council of Science Editors:

Mathirajan M. Heuristic Scheduling Algorithms For Parallel Heterogeneous Batch Processors. [Doctoral Dissertation]. Indian Institute of Science; 2006. Available from: http://etd.iisc.ac.in/handle/2005/196


Rochester Institute of Technology

10. Dennie, Joshua. Efficient job scheduling for a cellular manufacturing environment.

Degree: 2006, Rochester Institute of Technology

 An important aspect of any manufacturing environment is efficient job scheduling. With an increase in manufacturing facilities focused on producing goods with a cellular manufacturing… (more)

Subjects/Keywords: Assign; Cellular; Efficient; Greedy; Heuristic; Job; Language; Manufacturing; Mathematical; Model; Optimization; Problem; Programming; Scheduling

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Dennie, J. (2006). Efficient job scheduling for a cellular manufacturing environment. (Thesis). Rochester Institute of Technology. Retrieved from https://scholarworks.rit.edu/theses/749

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

Dennie, Joshua. “Efficient job scheduling for a cellular manufacturing environment.” 2006. Thesis, Rochester Institute of Technology. Accessed October 30, 2020. https://scholarworks.rit.edu/theses/749.

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

MLA Handbook (7th Edition):

Dennie, Joshua. “Efficient job scheduling for a cellular manufacturing environment.” 2006. Web. 30 Oct 2020.

Vancouver:

Dennie J. Efficient job scheduling for a cellular manufacturing environment. [Internet] [Thesis]. Rochester Institute of Technology; 2006. [cited 2020 Oct 30]. Available from: https://scholarworks.rit.edu/theses/749.

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

Council of Science Editors:

Dennie J. Efficient job scheduling for a cellular manufacturing environment. [Thesis]. Rochester Institute of Technology; 2006. Available from: https://scholarworks.rit.edu/theses/749

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


University of Cincinnati

11. THELAPURATH, SHRINATH. DESIGN OF HEURISTICS FOR CONGESTION CONTROL IN 3-DIMENSIONAL ROUTING FOR MULTI-CHIP MODULES.

Degree: MS, Engineering : Computer Engineering, 2001, University of Cincinnati

 This thesis presents the design and implementation of a fast greedy heuristic router for multichip module designs. The router divides the design in to regions… (more)

Subjects/Keywords: Computer Science; congestion removal techniques; memory utilization; speed of execution; region splitting; greedy heuristic approach

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

THELAPURATH, S. (2001). DESIGN OF HEURISTICS FOR CONGESTION CONTROL IN 3-DIMENSIONAL ROUTING FOR MULTI-CHIP MODULES. (Masters Thesis). University of Cincinnati. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=ucin981478715

Chicago Manual of Style (16th Edition):

THELAPURATH, SHRINATH. “DESIGN OF HEURISTICS FOR CONGESTION CONTROL IN 3-DIMENSIONAL ROUTING FOR MULTI-CHIP MODULES.” 2001. Masters Thesis, University of Cincinnati. Accessed October 30, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=ucin981478715.

MLA Handbook (7th Edition):

THELAPURATH, SHRINATH. “DESIGN OF HEURISTICS FOR CONGESTION CONTROL IN 3-DIMENSIONAL ROUTING FOR MULTI-CHIP MODULES.” 2001. Web. 30 Oct 2020.

Vancouver:

THELAPURATH S. DESIGN OF HEURISTICS FOR CONGESTION CONTROL IN 3-DIMENSIONAL ROUTING FOR MULTI-CHIP MODULES. [Internet] [Masters thesis]. University of Cincinnati; 2001. [cited 2020 Oct 30]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ucin981478715.

Council of Science Editors:

THELAPURATH S. DESIGN OF HEURISTICS FOR CONGESTION CONTROL IN 3-DIMENSIONAL ROUTING FOR MULTI-CHIP MODULES. [Masters Thesis]. University of Cincinnati; 2001. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ucin981478715


Ohio University

12. Aboelfotoh, Aaya H. F. Optimizing the Multi-Objective Order Batching Problem for Warehouses with Cluster Picking.

Degree: MS, Industrial and Systems Engineering (Engineering and Technology), 2019, Ohio University

 This thesis defines different variants of the cluster-picking order batching problem (OBP) and proposes several problem-solving techniques to solve the problems. The basic OBP is… (more)

Subjects/Keywords: Industrial Engineering; Operations Research; Engineering; Order Batching; Order Batching Problem; Order Picking; Cluster Picking; Wave Picking; S-Shape; Total Distance; Aisle Congestion; Multiple Intervals; Optimization; Mathematical Model; Differential Evolution; Greedy Heuristic

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Aboelfotoh, A. H. F. (2019). Optimizing the Multi-Objective Order Batching Problem for Warehouses with Cluster Picking. (Masters Thesis). Ohio University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1564663802880513

Chicago Manual of Style (16th Edition):

Aboelfotoh, Aaya H F. “Optimizing the Multi-Objective Order Batching Problem for Warehouses with Cluster Picking.” 2019. Masters Thesis, Ohio University. Accessed October 30, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1564663802880513.

MLA Handbook (7th Edition):

Aboelfotoh, Aaya H F. “Optimizing the Multi-Objective Order Batching Problem for Warehouses with Cluster Picking.” 2019. Web. 30 Oct 2020.

Vancouver:

Aboelfotoh AHF. Optimizing the Multi-Objective Order Batching Problem for Warehouses with Cluster Picking. [Internet] [Masters thesis]. Ohio University; 2019. [cited 2020 Oct 30]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1564663802880513.

Council of Science Editors:

Aboelfotoh AHF. Optimizing the Multi-Objective Order Batching Problem for Warehouses with Cluster Picking. [Masters Thesis]. Ohio University; 2019. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1564663802880513

13. Yu, Xilin. Computing Robinson-Foulds supertree for two trees.

Degree: MS, Computer Science, 2019, University of Illinois – Urbana-Champaign

 Supertree problems are important in phylogeny estimation. Supertree construction takes in a set of input trees on subsets of species and aims to find a… (more)

Subjects/Keywords: Phylogeny estimation; Supertree problem; Robinson-Foulds Supertree; Polynomial time algorithm; NP-hardness; Greedy heuristic; Divide-and-conquer

…binary. Finally, we present GreedyRFS, a simple greedy heuristic for RFS that operates by… …Figure 3.1 to 3.3. Furthermore, Exact-RFS-2 is the basis for GreedyRFS, a greedy heuristic we… …seen as a heuristic for the Maximum Likelihood Supertree problem [12, 13], and… …heuristic [10, 11, 15, 16] or solves a constrained version of the problem [17]… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Yu, X. (2019). Computing Robinson-Foulds supertree for two trees. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/105698

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

Yu, Xilin. “Computing Robinson-Foulds supertree for two trees.” 2019. Thesis, University of Illinois – Urbana-Champaign. Accessed October 30, 2020. http://hdl.handle.net/2142/105698.

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

MLA Handbook (7th Edition):

Yu, Xilin. “Computing Robinson-Foulds supertree for two trees.” 2019. Web. 30 Oct 2020.

Vancouver:

Yu X. Computing Robinson-Foulds supertree for two trees. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2019. [cited 2020 Oct 30]. Available from: http://hdl.handle.net/2142/105698.

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

Council of Science Editors:

Yu X. Computing Robinson-Foulds supertree for two trees. [Thesis]. University of Illinois – Urbana-Champaign; 2019. Available from: http://hdl.handle.net/2142/105698

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

14. Akhundov, Najmaddin. Optimal Location, Patient Routing, and Capacity Decisions for Endoscopy Clinical Network in Western Ontario: A Simulation-based Optimization Approach.

Degree: 2015, University of Waterloo

 Thousands of Canadians die or suffer from colorectal cancer (CRC) every year. Unawareness of risk factors and the lack of sufficient screening capacity contributes to… (more)

Subjects/Keywords: Health Care Delivery; Simulation-based Optimization; Location-allocation Analysis; Discrete-event Simulation; Cancer Screening; Colonoscopy; Flexible- sigmoidoscopy; Gastroscopy; Simulated Annealing; Greedy Heuristic

…53 viii 5.11 Heuristic results when all process times at the maximum level… …54 5.12 Heuristic results when all process times at the minimum level… …times under a certain threshold. We introduce and compare three heuristic methods to find the… …heuristic to solve maximum coverage location problem (MCLP) with limited capacity within… …a greedy dropping, a tabu search, and branch and bound ε-optima method. Rahmati et al… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Akhundov, N. (2015). Optimal Location, Patient Routing, and Capacity Decisions for Endoscopy Clinical Network in Western Ontario: A Simulation-based Optimization Approach. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/9391

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

Akhundov, Najmaddin. “Optimal Location, Patient Routing, and Capacity Decisions for Endoscopy Clinical Network in Western Ontario: A Simulation-based Optimization Approach.” 2015. Thesis, University of Waterloo. Accessed October 30, 2020. http://hdl.handle.net/10012/9391.

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

MLA Handbook (7th Edition):

Akhundov, Najmaddin. “Optimal Location, Patient Routing, and Capacity Decisions for Endoscopy Clinical Network in Western Ontario: A Simulation-based Optimization Approach.” 2015. Web. 30 Oct 2020.

Vancouver:

Akhundov N. Optimal Location, Patient Routing, and Capacity Decisions for Endoscopy Clinical Network in Western Ontario: A Simulation-based Optimization Approach. [Internet] [Thesis]. University of Waterloo; 2015. [cited 2020 Oct 30]. Available from: http://hdl.handle.net/10012/9391.

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

Council of Science Editors:

Akhundov N. Optimal Location, Patient Routing, and Capacity Decisions for Endoscopy Clinical Network in Western Ontario: A Simulation-based Optimization Approach. [Thesis]. University of Waterloo; 2015. Available from: http://hdl.handle.net/10012/9391

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

15. Koulinas, Georgios. Ανάπτυξη υπερευρετικών αλγορίθμων για τον χρονοπρογραμματισμό έργων.

Degree: 2013, Democritus University of Thrace (DUTH); Δημοκρίτειο Πανεπιστήμιο Θράκης (ΔΠΘ)

This doctoral thesis aims to develop hyper-heuristic algorithms for treating project management problems. The thesis is organized into eight chapters. Chapter 1 is an introduction… (more)

Subjects/Keywords: Διοίκηση έργων; Χρονοπρογραμματισμός έργων; Πρόβλημα προγραμματισμού έργων με περιορισμένους πόρους; Πρόβλημα εξισορρόπησης πόρου; Πρόβλημα κόστους διαθεσιμότητας/ επένδυσης πόρου; Υπερευρετικός αλγόριθμος; GRASP; Γενετικός αλγόριθμος; Αλγόριθμος βελτιστοποίησης σμήνους σωματιδίων; Αλγόριθμος προσομοιωμένης ανόπτησης; Αλγόριθμος αποδοχής κατωφλίου; Αλγόριθμος απαγορευμένης έρευνας; Project management; Project scheduling; Resource constrained project scheduling problem; Resource leveling problem; Resource availability cost problem/ resource investment problem; Hyper-heuristic algorithms; Greedy randomized adaptive search procedure; Genetic algorithm; Particle swarm optimization; Simulated annealing; Threshold accepting; Tabu search.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Koulinas, G. (2013). Ανάπτυξη υπερευρετικών αλγορίθμων για τον χρονοπρογραμματισμό έργων. (Thesis). Democritus University of Thrace (DUTH); Δημοκρίτειο Πανεπιστήμιο Θράκης (ΔΠΘ). Retrieved from http://hdl.handle.net/10442/hedi/31565

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

Koulinas, Georgios. “Ανάπτυξη υπερευρετικών αλγορίθμων για τον χρονοπρογραμματισμό έργων.” 2013. Thesis, Democritus University of Thrace (DUTH); Δημοκρίτειο Πανεπιστήμιο Θράκης (ΔΠΘ). Accessed October 30, 2020. http://hdl.handle.net/10442/hedi/31565.

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

MLA Handbook (7th Edition):

Koulinas, Georgios. “Ανάπτυξη υπερευρετικών αλγορίθμων για τον χρονοπρογραμματισμό έργων.” 2013. Web. 30 Oct 2020.

Vancouver:

Koulinas G. Ανάπτυξη υπερευρετικών αλγορίθμων για τον χρονοπρογραμματισμό έργων. [Internet] [Thesis]. Democritus University of Thrace (DUTH); Δημοκρίτειο Πανεπιστήμιο Θράκης (ΔΠΘ); 2013. [cited 2020 Oct 30]. Available from: http://hdl.handle.net/10442/hedi/31565.

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

Council of Science Editors:

Koulinas G. Ανάπτυξη υπερευρετικών αλγορίθμων για τον χρονοπρογραμματισμό έργων. [Thesis]. Democritus University of Thrace (DUTH); Δημοκρίτειο Πανεπιστήμιο Θράκης (ΔΠΘ); 2013. Available from: http://hdl.handle.net/10442/hedi/31565

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


Virginia Tech

16. Kim, Seon Ki. Branch-and-Price Method for Stochastic Generalized Assignment Problem, Hospital Staff Scheduling Problem and Stochastic Short-Term Personnel Planning Problem.

Degree: PhD, Industrial and Systems Engineering, 2009, Virginia Tech

 The work presented in this dissertation has been focused on exploiting the branch-and-price (BNP) method for the solution of various stochastic mixed integer programming problems… (more)

Subjects/Keywords: Stochastic Hospital Staff Scheduling Problem; Hospital Staff Scheduling Problem; Dual Stabilization Technique; Stochastic Short-Term Personnel Planning Problem; Greedy Heuristic; Stochastic Generalized Assignment Problem; Branch-and-Cut Method; Branch-and-Price Method; Monte Carlo Method; Stochastic Programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kim, S. K. (2009). Branch-and-Price Method for Stochastic Generalized Assignment Problem, Hospital Staff Scheduling Problem and Stochastic Short-Term Personnel Planning Problem. (Doctoral Dissertation). Virginia Tech. Retrieved from http://hdl.handle.net/10919/37487

Chicago Manual of Style (16th Edition):

Kim, Seon Ki. “Branch-and-Price Method for Stochastic Generalized Assignment Problem, Hospital Staff Scheduling Problem and Stochastic Short-Term Personnel Planning Problem.” 2009. Doctoral Dissertation, Virginia Tech. Accessed October 30, 2020. http://hdl.handle.net/10919/37487.

MLA Handbook (7th Edition):

Kim, Seon Ki. “Branch-and-Price Method for Stochastic Generalized Assignment Problem, Hospital Staff Scheduling Problem and Stochastic Short-Term Personnel Planning Problem.” 2009. Web. 30 Oct 2020.

Vancouver:

Kim SK. Branch-and-Price Method for Stochastic Generalized Assignment Problem, Hospital Staff Scheduling Problem and Stochastic Short-Term Personnel Planning Problem. [Internet] [Doctoral dissertation]. Virginia Tech; 2009. [cited 2020 Oct 30]. Available from: http://hdl.handle.net/10919/37487.

Council of Science Editors:

Kim SK. Branch-and-Price Method for Stochastic Generalized Assignment Problem, Hospital Staff Scheduling Problem and Stochastic Short-Term Personnel Planning Problem. [Doctoral Dissertation]. Virginia Tech; 2009. Available from: http://hdl.handle.net/10919/37487


Indian Institute of Science

17. Vashistha, Sumit. Energy Efficient Scheduling Of Sensing Activity In Wireless Sensor Networks Using Information Coverage.

Degree: MSc Engg, Faculty of Engineering, 2009, Indian Institute of Science

 Network lifetime is a key issue in wireless sensor networks where sensor nodes, distributed typically in remote/hostile sensing areas, are powered by finite energy batteries… (more)

Subjects/Keywords: Wireless Communication Networks; Network Sensing - Scheduling; Information Coverage Algorithm; Optimum Scheduling; Information Coverage; Sensor Nodes; Wireless Sensor Networks; Point Targets; Disjoint Set of Information Covers (DSIC); Exhaustive-Greedy-Equalized Heuristic (EGEH); Full Area Information Covers (FAIC); Localized Algorithm; Communication Engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Vashistha, S. (2009). Energy Efficient Scheduling Of Sensing Activity In Wireless Sensor Networks Using Information Coverage. (Masters Thesis). Indian Institute of Science. Retrieved from http://etd.iisc.ac.in/handle/2005/598

Chicago Manual of Style (16th Edition):

Vashistha, Sumit. “Energy Efficient Scheduling Of Sensing Activity In Wireless Sensor Networks Using Information Coverage.” 2009. Masters Thesis, Indian Institute of Science. Accessed October 30, 2020. http://etd.iisc.ac.in/handle/2005/598.

MLA Handbook (7th Edition):

Vashistha, Sumit. “Energy Efficient Scheduling Of Sensing Activity In Wireless Sensor Networks Using Information Coverage.” 2009. Web. 30 Oct 2020.

Vancouver:

Vashistha S. Energy Efficient Scheduling Of Sensing Activity In Wireless Sensor Networks Using Information Coverage. [Internet] [Masters thesis]. Indian Institute of Science; 2009. [cited 2020 Oct 30]. Available from: http://etd.iisc.ac.in/handle/2005/598.

Council of Science Editors:

Vashistha S. Energy Efficient Scheduling Of Sensing Activity In Wireless Sensor Networks Using Information Coverage. [Masters Thesis]. Indian Institute of Science; 2009. Available from: http://etd.iisc.ac.in/handle/2005/598


Brno University of Technology

18. Jágr, Petr. Hledání nejkratších cest grafem: The Shortest Graph's Pahts Finding.

Degree: 2020, Brno University of Technology

 The aim of this thesis is finding, comparing and implementation of algorithms for finding the shortest paths between each of pairs of nodes in a… (more)

Subjects/Keywords: algoritmus; asymptotické vyjádření složitosti; Bellman-Fordův algoritmus; cesta; Dijkstrův algoritmus; dynamické programování; Floyd-Warshallův algoritmus; genetické algoritmy; heuristické algoritmy; hladové algoritmy; Java; nejkratší cesta; neorientovaný graf; ohodnocený graf; Omega; Omikron; orientovaný graf; paralelní algoritmy; plánování trasy; pravidelný graf; rekurzivní algoritmy; rozděl a panuj; sled; smyčka; souvislý graf; stupeň vrcholu; tah; teorie grafů; Theta; algorithm; asymptotic notation; Bellman-Ford algorithm; complete graph; degree of a vertex; Dijkstra's algorithm; directed graph; divide and conquer algorithms; dynamic programming; Floyd-Warshall algorithm; genetic algorithms; graph teory; greedy algorithms; heuristic algorithms; Java; loop; move; Omega; Omicron; paralel algorithms; path; path planning; recursive algorithms; regular graph; sequence; the shortest path; Theta; undirected graph; weighted graph

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Jágr, P. (2020). Hledání nejkratších cest grafem: The Shortest Graph's Pahts Finding. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/187854

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

Jágr, Petr. “Hledání nejkratších cest grafem: The Shortest Graph's Pahts Finding.” 2020. Thesis, Brno University of Technology. Accessed October 30, 2020. http://hdl.handle.net/11012/187854.

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

MLA Handbook (7th Edition):

Jágr, Petr. “Hledání nejkratších cest grafem: The Shortest Graph's Pahts Finding.” 2020. Web. 30 Oct 2020.

Vancouver:

Jágr P. Hledání nejkratších cest grafem: The Shortest Graph's Pahts Finding. [Internet] [Thesis]. Brno University of Technology; 2020. [cited 2020 Oct 30]. Available from: http://hdl.handle.net/11012/187854.

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

Council of Science Editors:

Jágr P. Hledání nejkratších cest grafem: The Shortest Graph's Pahts Finding. [Thesis]. Brno University of Technology; 2020. Available from: http://hdl.handle.net/11012/187854

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


Brno University of Technology

19. Jágr, Petr. Hledání nejkratších cest grafem: The Shortest Graph's Pahts Finding.

Degree: 2019, Brno University of Technology

 The aim of this thesis is finding, comparing and implementation of algorithms for finding the shortest paths between each of pairs of nodes in a… (more)

Subjects/Keywords: algoritmus; asymptotické vyjádření složitosti; Bellman-Fordův algoritmus; cesta; Dijkstrův algoritmus; dynamické programování; Floyd-Warshallův algoritmus; genetické algoritmy; heuristické algoritmy; hladové algoritmy; Java; nejkratší cesta; neorientovaný graf; ohodnocený graf; Omega; Omikron; orientovaný graf; paralelní algoritmy; plánování trasy; pravidelný graf; rekurzivní algoritmy; rozděl a panuj; sled; smyčka; souvislý graf; stupeň vrcholu; tah; teorie grafů; Theta; algorithm; asymptotic notation; Bellman-Ford algorithm; complete graph; degree of a vertex; Dijkstra's algorithm; directed graph; divide and conquer algorithms; dynamic programming; Floyd-Warshall algorithm; genetic algorithms; graph teory; greedy algorithms; heuristic algorithms; Java; loop; move; Omega; Omicron; paralel algorithms; path; path planning; recursive algorithms; regular graph; sequence; the shortest path; Theta; undirected graph; weighted graph

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Jágr, P. (2019). Hledání nejkratších cest grafem: The Shortest Graph's Pahts Finding. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/56214

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

Jágr, Petr. “Hledání nejkratších cest grafem: The Shortest Graph's Pahts Finding.” 2019. Thesis, Brno University of Technology. Accessed October 30, 2020. http://hdl.handle.net/11012/56214.

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

MLA Handbook (7th Edition):

Jágr, Petr. “Hledání nejkratších cest grafem: The Shortest Graph's Pahts Finding.” 2019. Web. 30 Oct 2020.

Vancouver:

Jágr P. Hledání nejkratších cest grafem: The Shortest Graph's Pahts Finding. [Internet] [Thesis]. Brno University of Technology; 2019. [cited 2020 Oct 30]. Available from: http://hdl.handle.net/11012/56214.

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

Council of Science Editors:

Jágr P. Hledání nejkratších cest grafem: The Shortest Graph's Pahts Finding. [Thesis]. Brno University of Technology; 2019. Available from: http://hdl.handle.net/11012/56214

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


Georgia Tech

20. Song, Jin-Hwa. Inventory Routing Investigations.

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

 The elimination of distribution inefficiencies, occurring due to the timing of customers' orders is an important reason for companies to introduce vendor managed inventory programs.… (more)

Subjects/Keywords: Logistics; Randomized greedy heuristic; Branch-and-cut; Vendor managed inventory resupply; Delivery cover cuts; Delivery pattern; Pattern selection LP; Base delivery pattern; Inventory routing problem; Performance measurment; IRP-CM; Continuous moves; Inventory control Computer simulation; Physical distribution of goods; Mathematical optimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Song, J. (2004). Inventory Routing Investigations. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/5028

Chicago Manual of Style (16th Edition):

Song, Jin-Hwa. “Inventory Routing Investigations.” 2004. Doctoral Dissertation, Georgia Tech. Accessed October 30, 2020. http://hdl.handle.net/1853/5028.

MLA Handbook (7th Edition):

Song, Jin-Hwa. “Inventory Routing Investigations.” 2004. Web. 30 Oct 2020.

Vancouver:

Song J. Inventory Routing Investigations. [Internet] [Doctoral dissertation]. Georgia Tech; 2004. [cited 2020 Oct 30]. Available from: http://hdl.handle.net/1853/5028.

Council of Science Editors:

Song J. Inventory Routing Investigations. [Doctoral Dissertation]. Georgia Tech; 2004. Available from: http://hdl.handle.net/1853/5028


Virginia Tech

21. Lu, Qifeng. Bivariate Best First Searches to Process Category Based Queries in a Graph for Trip Planning Applications in Transportation.

Degree: PhD, Civil Engineering, 2009, Virginia Tech

 With the technological advancement in computer science, Geographic Information Science (GIScience), and transportation, more and more complex path finding queries including category based queries are… (more)

Subjects/Keywords: state graph space; O*-MST; Geographic Information Science; C*- Dijkstra; O*-Greedy; O*-Dijkstra; O*-SCDMST; trip planning; category based queries; O*; Geographic Information System; admissible; L#; transportation network; logistics; multivariate; Bivariate; best first search; CSTQ; C*; consistent; path; heuristic; optimization; state graph; graph; OSTQ; C*-P

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lu, Q. (2009). Bivariate Best First Searches to Process Category Based Queries in a Graph for Trip Planning Applications in Transportation. (Doctoral Dissertation). Virginia Tech. Retrieved from http://hdl.handle.net/10919/26444

Chicago Manual of Style (16th Edition):

Lu, Qifeng. “Bivariate Best First Searches to Process Category Based Queries in a Graph for Trip Planning Applications in Transportation.” 2009. Doctoral Dissertation, Virginia Tech. Accessed October 30, 2020. http://hdl.handle.net/10919/26444.

MLA Handbook (7th Edition):

Lu, Qifeng. “Bivariate Best First Searches to Process Category Based Queries in a Graph for Trip Planning Applications in Transportation.” 2009. Web. 30 Oct 2020.

Vancouver:

Lu Q. Bivariate Best First Searches to Process Category Based Queries in a Graph for Trip Planning Applications in Transportation. [Internet] [Doctoral dissertation]. Virginia Tech; 2009. [cited 2020 Oct 30]. Available from: http://hdl.handle.net/10919/26444.

Council of Science Editors:

Lu Q. Bivariate Best First Searches to Process Category Based Queries in a Graph for Trip Planning Applications in Transportation. [Doctoral Dissertation]. Virginia Tech; 2009. Available from: http://hdl.handle.net/10919/26444

.