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:(Branch AND Price). Showing records 1 – 30 of 63 total matches.

[1] [2] [3]

Search Limiters

Last 2 Years | English Only

Degrees

Country

▼ Search Limiters

1. Gérard, Matthieu. Heuristiques basées sur la génération de colonnes pour un problème de planification du personnel : Column generation based heuristics for a staff scheduling problem.

Degree: Docteur es, Informatique, 2015, Université Lille I – Sciences et Technologies

Le travail de ce mémoire apporte une brique fonctionnelle et théorique dans l'élaboration d'un outil informatique générique pour la planification automatisée et optimisée d'une équipe… (more)

Subjects/Keywords: Génération de colonnes; Branch-And-Price; 006.33

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gérard, M. (2015). Heuristiques basées sur la génération de colonnes pour un problème de planification du personnel : Column generation based heuristics for a staff scheduling problem. (Doctoral Dissertation). Université Lille I – Sciences et Technologies. Retrieved from http://www.theses.fr/2015LIL10186

Chicago Manual of Style (16th Edition):

Gérard, Matthieu. “Heuristiques basées sur la génération de colonnes pour un problème de planification du personnel : Column generation based heuristics for a staff scheduling problem.” 2015. Doctoral Dissertation, Université Lille I – Sciences et Technologies. Accessed October 25, 2020. http://www.theses.fr/2015LIL10186.

MLA Handbook (7th Edition):

Gérard, Matthieu. “Heuristiques basées sur la génération de colonnes pour un problème de planification du personnel : Column generation based heuristics for a staff scheduling problem.” 2015. Web. 25 Oct 2020.

Vancouver:

Gérard M. Heuristiques basées sur la génération de colonnes pour un problème de planification du personnel : Column generation based heuristics for a staff scheduling problem. [Internet] [Doctoral dissertation]. Université Lille I – Sciences et Technologies; 2015. [cited 2020 Oct 25]. Available from: http://www.theses.fr/2015LIL10186.

Council of Science Editors:

Gérard M. Heuristiques basées sur la génération de colonnes pour un problème de planification du personnel : Column generation based heuristics for a staff scheduling problem. [Doctoral Dissertation]. Université Lille I – Sciences et Technologies; 2015. Available from: http://www.theses.fr/2015LIL10186


Texas A&M University

2. Marzouk, Ahmed Mohamed Badr Aly. The Slim Branch and Price Method with an Application to the Hamiltonian p-median Problem.

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

 The main objective of this dissertation is to present a new exact optimization method, the Slim Branch and Price (SBP) method, which is an improvement… (more)

Subjects/Keywords: Slim Branch and Price; Branch and Price; integer programming; combinatorial optimization; Hamiltonian p-median Problem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Marzouk, A. M. B. A. (2016). The Slim Branch and Price Method with an Application to the Hamiltonian p-median Problem. (Doctoral Dissertation). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/158668

Chicago Manual of Style (16th Edition):

Marzouk, Ahmed Mohamed Badr Aly. “The Slim Branch and Price Method with an Application to the Hamiltonian p-median Problem.” 2016. Doctoral Dissertation, Texas A&M University. Accessed October 25, 2020. http://hdl.handle.net/1969.1/158668.

MLA Handbook (7th Edition):

Marzouk, Ahmed Mohamed Badr Aly. “The Slim Branch and Price Method with an Application to the Hamiltonian p-median Problem.” 2016. Web. 25 Oct 2020.

Vancouver:

Marzouk AMBA. The Slim Branch and Price Method with an Application to the Hamiltonian p-median Problem. [Internet] [Doctoral dissertation]. Texas A&M University; 2016. [cited 2020 Oct 25]. Available from: http://hdl.handle.net/1969.1/158668.

Council of Science Editors:

Marzouk AMBA. The Slim Branch and Price Method with an Application to the Hamiltonian p-median Problem. [Doctoral Dissertation]. Texas A&M University; 2016. Available from: http://hdl.handle.net/1969.1/158668

3. Seixas, Michel Povlovitsch. Heuristic and exact methods applied to a rich vehicle routing and scheduling problem.

Degree: PhD, Engenharia Naval e Oceânica, 2013, University of São Paulo

This study considers a vehicle routing problem with time windows, accessibility restrictions on customers and a fleet that is heterogeneous with regard to capacity, average… (more)

Subjects/Keywords: Branch-and-price; Branch-and-price; Busca tabu; Column generation; Dynamic programming; Geração de colunas; Programação dinâmica; Roteirização; Routing; Tabu search

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Seixas, M. P. (2013). Heuristic and exact methods applied to a rich vehicle routing and scheduling problem. (Doctoral Dissertation). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/3/3135/tde-09072014-111258/ ;

Chicago Manual of Style (16th Edition):

Seixas, Michel Povlovitsch. “Heuristic and exact methods applied to a rich vehicle routing and scheduling problem.” 2013. Doctoral Dissertation, University of São Paulo. Accessed October 25, 2020. http://www.teses.usp.br/teses/disponiveis/3/3135/tde-09072014-111258/ ;.

MLA Handbook (7th Edition):

Seixas, Michel Povlovitsch. “Heuristic and exact methods applied to a rich vehicle routing and scheduling problem.” 2013. Web. 25 Oct 2020.

Vancouver:

Seixas MP. Heuristic and exact methods applied to a rich vehicle routing and scheduling problem. [Internet] [Doctoral dissertation]. University of São Paulo; 2013. [cited 2020 Oct 25]. Available from: http://www.teses.usp.br/teses/disponiveis/3/3135/tde-09072014-111258/ ;.

Council of Science Editors:

Seixas MP. Heuristic and exact methods applied to a rich vehicle routing and scheduling problem. [Doctoral Dissertation]. University of São Paulo; 2013. Available from: http://www.teses.usp.br/teses/disponiveis/3/3135/tde-09072014-111258/ ;

4. Duarte, António J.S.T. Sistema de planeamento fino da produção com sequenciamento de lotes e agendamento de máquinas.

Degree: 2000, Instituto Politécnico de Bragança

Este trabalho é dedicado ao planeamento operacional, especificamente ao planeamento da produção em máquinas paralelas. O problema estudado é completamente preemptivo: qualquer tarefa pode ser… (more)

Subjects/Keywords: Branch-and-price; Sequenciamento

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Duarte, A. J. S. T. (2000). Sistema de planeamento fino da produção com sequenciamento de lotes e agendamento de máquinas. (Thesis). Instituto Politécnico de Bragança. Retrieved from http://www.rcaap.pt/detail.jsp?id=oai:bibliotecadigital.ipb.pt:10198/1628

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

Duarte, António J S T. “Sistema de planeamento fino da produção com sequenciamento de lotes e agendamento de máquinas.” 2000. Thesis, Instituto Politécnico de Bragança. Accessed October 25, 2020. http://www.rcaap.pt/detail.jsp?id=oai:bibliotecadigital.ipb.pt:10198/1628.

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

MLA Handbook (7th Edition):

Duarte, António J S T. “Sistema de planeamento fino da produção com sequenciamento de lotes e agendamento de máquinas.” 2000. Web. 25 Oct 2020.

Vancouver:

Duarte AJST. Sistema de planeamento fino da produção com sequenciamento de lotes e agendamento de máquinas. [Internet] [Thesis]. Instituto Politécnico de Bragança; 2000. [cited 2020 Oct 25]. Available from: http://www.rcaap.pt/detail.jsp?id=oai:bibliotecadigital.ipb.pt:10198/1628.

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

Council of Science Editors:

Duarte AJST. Sistema de planeamento fino da produção com sequenciamento de lotes e agendamento de máquinas. [Thesis]. Instituto Politécnico de Bragança; 2000. Available from: http://www.rcaap.pt/detail.jsp?id=oai:bibliotecadigital.ipb.pt:10198/1628

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


University of Newcastle

5. Ruther, Sebastian. Integrated aircraft routing, crew pairing, and tail assignment.

Degree: PhD, 2013, University of Newcastle

Research Doctorate - Doctor of Philosophy (PhD)

Airline scheduling is the process of scheduling available aircraft and crews such that all flights that an airline… (more)

Subjects/Keywords: airline scheduling; aircraft routing; crew pairing; tail assignment; branch-and-price

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ruther, S. (2013). Integrated aircraft routing, crew pairing, and tail assignment. (Doctoral Dissertation). University of Newcastle. Retrieved from http://hdl.handle.net/1959.13/1038800

Chicago Manual of Style (16th Edition):

Ruther, Sebastian. “Integrated aircraft routing, crew pairing, and tail assignment.” 2013. Doctoral Dissertation, University of Newcastle. Accessed October 25, 2020. http://hdl.handle.net/1959.13/1038800.

MLA Handbook (7th Edition):

Ruther, Sebastian. “Integrated aircraft routing, crew pairing, and tail assignment.” 2013. Web. 25 Oct 2020.

Vancouver:

Ruther S. Integrated aircraft routing, crew pairing, and tail assignment. [Internet] [Doctoral dissertation]. University of Newcastle; 2013. [cited 2020 Oct 25]. Available from: http://hdl.handle.net/1959.13/1038800.

Council of Science Editors:

Ruther S. Integrated aircraft routing, crew pairing, and tail assignment. [Doctoral Dissertation]. University of Newcastle; 2013. Available from: http://hdl.handle.net/1959.13/1038800


Delft University of Technology

6. Korte, Johanna (author). An Aircraft and Schedule Integrated Approach to Improve Cockpit Crew Pairings.

Degree: 2019, Delft University of Technology

For airlines, crew costs make up the second largest expense, behind fuel costs. Because these costs are very high, there is a large potential gain… (more)

Subjects/Keywords: Aviation; Integer Linear Programming; Branch-and-Price; Crew Pairing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Korte, J. (. (2019). An Aircraft and Schedule Integrated Approach to Improve Cockpit Crew Pairings. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:f6d4dd49-a215-4220-8d6d-f5d53f375287

Chicago Manual of Style (16th Edition):

Korte, Johanna (author). “An Aircraft and Schedule Integrated Approach to Improve Cockpit Crew Pairings.” 2019. Masters Thesis, Delft University of Technology. Accessed October 25, 2020. http://resolver.tudelft.nl/uuid:f6d4dd49-a215-4220-8d6d-f5d53f375287.

MLA Handbook (7th Edition):

Korte, Johanna (author). “An Aircraft and Schedule Integrated Approach to Improve Cockpit Crew Pairings.” 2019. Web. 25 Oct 2020.

Vancouver:

Korte J(. An Aircraft and Schedule Integrated Approach to Improve Cockpit Crew Pairings. [Internet] [Masters thesis]. Delft University of Technology; 2019. [cited 2020 Oct 25]. Available from: http://resolver.tudelft.nl/uuid:f6d4dd49-a215-4220-8d6d-f5d53f375287.

Council of Science Editors:

Korte J(. An Aircraft and Schedule Integrated Approach to Improve Cockpit Crew Pairings. [Masters Thesis]. Delft University of Technology; 2019. Available from: http://resolver.tudelft.nl/uuid:f6d4dd49-a215-4220-8d6d-f5d53f375287

7. Marcos Antonio Pereira. Um método branch-and-price para problemas de localização de ρ-medianas.

Degree: 2005, Instituto Nacional de Pesquisas Espaciais

Este trabalho apresenta a implementação de um algoritmo branch-and-price para resolver problemas de localização de facilidades baseados no modelo matemático do problema de p-medianas. A… (more)

Subjects/Keywords: COMPUTAÇÃO APLICADA; Localização de facilidades; Branch and Price; Relaxação lagrangeana/surrogate; COMPUTER SCIENCE; Combinatorial Optimization; Facility Location; Branch and Price; Otimização combinatória; Lagrangean/Surrogate Relaxation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pereira, M. A. (2005). Um método branch-and-price para problemas de localização de ρ-medianas. (Thesis). Instituto Nacional de Pesquisas Espaciais. Retrieved from http://urlib.net/sid.inpe.br/jeferson/2005/06.02.11.37

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

Pereira, Marcos Antonio. “Um método branch-and-price para problemas de localização de ρ-medianas.” 2005. Thesis, Instituto Nacional de Pesquisas Espaciais. Accessed October 25, 2020. http://urlib.net/sid.inpe.br/jeferson/2005/06.02.11.37.

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

MLA Handbook (7th Edition):

Pereira, Marcos Antonio. “Um método branch-and-price para problemas de localização de ρ-medianas.” 2005. Web. 25 Oct 2020.

Vancouver:

Pereira MA. Um método branch-and-price para problemas de localização de ρ-medianas. [Internet] [Thesis]. Instituto Nacional de Pesquisas Espaciais; 2005. [cited 2020 Oct 25]. Available from: http://urlib.net/sid.inpe.br/jeferson/2005/06.02.11.37.

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

Council of Science Editors:

Pereira MA. Um método branch-and-price para problemas de localização de ρ-medianas. [Thesis]. Instituto Nacional de Pesquisas Espaciais; 2005. Available from: http://urlib.net/sid.inpe.br/jeferson/2005/06.02.11.37

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

8. Munari Junior, Pedro Augusto. Theoretical and computational issues for improving the performance of linear optimization methods.

Degree: PhD, Ciências de Computação e Matemática Computacional, 2013, University of São Paulo

Linear optimization tools are used to solve many problems that arise in our day-to-day lives. The linear optimization models and methodologies help to find, for… (more)

Subjects/Keywords: Branch-and-price; Branch-and-price; Columm generation; Geração de colunas; Interior point methods; Linear optimization; Métodos de pontos interiores; Métodos tipo simplex; Otimização linear; Simplex type methods

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Munari Junior, P. A. (2013). Theoretical and computational issues for improving the performance of linear optimization methods. (Doctoral Dissertation). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/55/55134/tde-16042013-101426/ ;

Chicago Manual of Style (16th Edition):

Munari Junior, Pedro Augusto. “Theoretical and computational issues for improving the performance of linear optimization methods.” 2013. Doctoral Dissertation, University of São Paulo. Accessed October 25, 2020. http://www.teses.usp.br/teses/disponiveis/55/55134/tde-16042013-101426/ ;.

MLA Handbook (7th Edition):

Munari Junior, Pedro Augusto. “Theoretical and computational issues for improving the performance of linear optimization methods.” 2013. Web. 25 Oct 2020.

Vancouver:

Munari Junior PA. Theoretical and computational issues for improving the performance of linear optimization methods. [Internet] [Doctoral dissertation]. University of São Paulo; 2013. [cited 2020 Oct 25]. Available from: http://www.teses.usp.br/teses/disponiveis/55/55134/tde-16042013-101426/ ;.

Council of Science Editors:

Munari Junior PA. Theoretical and computational issues for improving the performance of linear optimization methods. [Doctoral Dissertation]. University of São Paulo; 2013. Available from: http://www.teses.usp.br/teses/disponiveis/55/55134/tde-16042013-101426/ ;

9. Santos, Lana Mara Rodrigues dos. Programação de rotação de culturas - modelos e métodos de solução.

Degree: PhD, Ciências de Computação e Matemática Computacional, 2009, University of São Paulo

Nas últimas décadas, diversas propostas de técnicas e de processos visando aumentar a sustentabilidade da agricultura ganharam evidência. Tais propostas geram novos modelos de planejamento… (more)

Subjects/Keywords: Branch-and-Price; Branch-and-Price; Column generation; Crop rotation; Geração de colunas; Integer programming; Linear programming; Programação inteira; Programação linear; Rotação de culturas

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Santos, L. M. R. d. (2009). Programação de rotação de culturas - modelos e métodos de solução. (Doctoral Dissertation). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/55/55134/tde-09062009-110129/ ;

Chicago Manual of Style (16th Edition):

Santos, Lana Mara Rodrigues dos. “Programação de rotação de culturas - modelos e métodos de solução.” 2009. Doctoral Dissertation, University of São Paulo. Accessed October 25, 2020. http://www.teses.usp.br/teses/disponiveis/55/55134/tde-09062009-110129/ ;.

MLA Handbook (7th Edition):

Santos, Lana Mara Rodrigues dos. “Programação de rotação de culturas - modelos e métodos de solução.” 2009. Web. 25 Oct 2020.

Vancouver:

Santos LMRd. Programação de rotação de culturas - modelos e métodos de solução. [Internet] [Doctoral dissertation]. University of São Paulo; 2009. [cited 2020 Oct 25]. Available from: http://www.teses.usp.br/teses/disponiveis/55/55134/tde-09062009-110129/ ;.

Council of Science Editors:

Santos LMRd. Programação de rotação de culturas - modelos e métodos de solução. [Doctoral Dissertation]. University of São Paulo; 2009. Available from: http://www.teses.usp.br/teses/disponiveis/55/55134/tde-09062009-110129/ ;

10. Zehendner, Elisabeth. Operations management at container terminals using advanced information technologies : Gestion des opérations dans les terminaux à conteneurs à l’aide de technologies de l’information avancées.

Degree: Docteur es, Génie Industriel, 2013, Saint-Etienne, EMSE

Les terminaux à conteneurs utilisent les nouvelles technologies (EDI, RFID et GPS) pour échanger des données avec leurs partenaires, pour localiser les conteneurs et leurs… (more)

Subjects/Keywords: Allocation de ressources; Problème de flot; Repositionnements de conteneurs; Branch and Price; Optimisation dynamique; Ressource Allocation problem; Network Flow Problem; Container relocation problem; Branch and price; Dynamic optimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zehendner, E. (2013). Operations management at container terminals using advanced information technologies : Gestion des opérations dans les terminaux à conteneurs à l’aide de technologies de l’information avancées. (Doctoral Dissertation). Saint-Etienne, EMSE. Retrieved from http://www.theses.fr/2013EMSE0714

Chicago Manual of Style (16th Edition):

Zehendner, Elisabeth. “Operations management at container terminals using advanced information technologies : Gestion des opérations dans les terminaux à conteneurs à l’aide de technologies de l’information avancées.” 2013. Doctoral Dissertation, Saint-Etienne, EMSE. Accessed October 25, 2020. http://www.theses.fr/2013EMSE0714.

MLA Handbook (7th Edition):

Zehendner, Elisabeth. “Operations management at container terminals using advanced information technologies : Gestion des opérations dans les terminaux à conteneurs à l’aide de technologies de l’information avancées.” 2013. Web. 25 Oct 2020.

Vancouver:

Zehendner E. Operations management at container terminals using advanced information technologies : Gestion des opérations dans les terminaux à conteneurs à l’aide de technologies de l’information avancées. [Internet] [Doctoral dissertation]. Saint-Etienne, EMSE; 2013. [cited 2020 Oct 25]. Available from: http://www.theses.fr/2013EMSE0714.

Council of Science Editors:

Zehendner E. Operations management at container terminals using advanced information technologies : Gestion des opérations dans les terminaux à conteneurs à l’aide de technologies de l’information avancées. [Doctoral Dissertation]. Saint-Etienne, EMSE; 2013. Available from: http://www.theses.fr/2013EMSE0714


University of Vienna

11. Prishchepo, Elena A. Branch-and-Price Algorithm for the Team Orienteering Problem with Time-Dependent Rewards.

Degree: 2017, University of Vienna

Das Team Orienteering Problem mit zeitabhängigen Belohnungen (Team Orienteering Problem with Time-Dependent Rewards (TOPwTDR)) ist eine Erweiterung des klassischen Team Orienteering Problems, bei der der… (more)

Subjects/Keywords: 85.06 Unternehmensführung; 85.99 Betriebswirtschaft: Sonstiges; Branch-and-Price / Team Orienteering Problem / Column Generation / exakte Methode / zeitabhängigen Belohnungen; Branch-and-Price / team orienteering problem / column generation / exact method / time-dependent reward

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Prishchepo, E. A. (2017). Branch-and-Price Algorithm for the Team Orienteering Problem with Time-Dependent Rewards. (Thesis). University of Vienna. Retrieved from http://othes.univie.ac.at/47458/

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

Prishchepo, Elena A. “Branch-and-Price Algorithm for the Team Orienteering Problem with Time-Dependent Rewards.” 2017. Thesis, University of Vienna. Accessed October 25, 2020. http://othes.univie.ac.at/47458/.

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

MLA Handbook (7th Edition):

Prishchepo, Elena A. “Branch-and-Price Algorithm for the Team Orienteering Problem with Time-Dependent Rewards.” 2017. Web. 25 Oct 2020.

Vancouver:

Prishchepo EA. Branch-and-Price Algorithm for the Team Orienteering Problem with Time-Dependent Rewards. [Internet] [Thesis]. University of Vienna; 2017. [cited 2020 Oct 25]. Available from: http://othes.univie.ac.at/47458/.

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

Council of Science Editors:

Prishchepo EA. Branch-and-Price Algorithm for the Team Orienteering Problem with Time-Dependent Rewards. [Thesis]. University of Vienna; 2017. Available from: http://othes.univie.ac.at/47458/

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


Universidade do Rio Grande do Sul

12. Moura, Leonardo Fernando dos Santos. Branch & price for the virtual network embedding problem.

Degree: 2015, Universidade do Rio Grande do Sul

Virtualization allows one or more virtual networks to share physical infrastructures. The Virtual Network Embedding problem (VNEP) is one of the main challenges in the… (more)

Subjects/Keywords: Rede virtual; Branch & price; Sistemas embarcados; Virtual network embedding; Network virtualization; Exact algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Moura, L. F. d. S. (2015). Branch & price for the virtual network embedding problem. (Thesis). Universidade do Rio Grande do Sul. Retrieved from http://hdl.handle.net/10183/115213

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

Moura, Leonardo Fernando dos Santos. “Branch & price for the virtual network embedding problem.” 2015. Thesis, Universidade do Rio Grande do Sul. Accessed October 25, 2020. http://hdl.handle.net/10183/115213.

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

MLA Handbook (7th Edition):

Moura, Leonardo Fernando dos Santos. “Branch & price for the virtual network embedding problem.” 2015. Web. 25 Oct 2020.

Vancouver:

Moura LFdS. Branch & price for the virtual network embedding problem. [Internet] [Thesis]. Universidade do Rio Grande do Sul; 2015. [cited 2020 Oct 25]. Available from: http://hdl.handle.net/10183/115213.

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

Council of Science Editors:

Moura LFdS. Branch & price for the virtual network embedding problem. [Thesis]. Universidade do Rio Grande do Sul; 2015. Available from: http://hdl.handle.net/10183/115213

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


Universiteit Utrecht

13. Hillebrand, A. Separating a polygonal environment into a multi-layered environment.

Degree: 2012, Universiteit Utrecht

 Path planning is the field of computer science devoted to finding efficient and/or realistic methods used to navigate characters through virtual environments. The Explicit Corridor… (more)

Subjects/Keywords: Multi-layered environment; Explicit Corridor Map; Branch & Price; Local search; Genetic algorithm; MULTICUT; Graphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hillebrand, A. (2012). Separating a polygonal environment into a multi-layered environment. (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/259132

Chicago Manual of Style (16th Edition):

Hillebrand, A. “Separating a polygonal environment into a multi-layered environment.” 2012. Masters Thesis, Universiteit Utrecht. Accessed October 25, 2020. http://dspace.library.uu.nl:8080/handle/1874/259132.

MLA Handbook (7th Edition):

Hillebrand, A. “Separating a polygonal environment into a multi-layered environment.” 2012. Web. 25 Oct 2020.

Vancouver:

Hillebrand A. Separating a polygonal environment into a multi-layered environment. [Internet] [Masters thesis]. Universiteit Utrecht; 2012. [cited 2020 Oct 25]. Available from: http://dspace.library.uu.nl:8080/handle/1874/259132.

Council of Science Editors:

Hillebrand A. Separating a polygonal environment into a multi-layered environment. [Masters Thesis]. Universiteit Utrecht; 2012. Available from: http://dspace.library.uu.nl:8080/handle/1874/259132


Universidade do Rio Grande do Sul

14. Friske, Marcelo Wuttig. A branch-and-price algorith, for a compressor scheduling problem.

Degree: 2016, Universidade do Rio Grande do Sul

This work presents the study and application of a branch-and-price algorithm for solving a compressor scheduling problem. The problem is related to oil production and… (more)

Subjects/Keywords: Compressor scheduling problem; Geoinformática; Branch-and-price; Algoritmos; Column generation; Piecewiselinear formulation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Friske, M. W. (2016). A branch-and-price algorith, for a compressor scheduling problem. (Thesis). Universidade do Rio Grande do Sul. Retrieved from http://hdl.handle.net/10183/140804

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

Friske, Marcelo Wuttig. “A branch-and-price algorith, for a compressor scheduling problem.” 2016. Thesis, Universidade do Rio Grande do Sul. Accessed October 25, 2020. http://hdl.handle.net/10183/140804.

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

MLA Handbook (7th Edition):

Friske, Marcelo Wuttig. “A branch-and-price algorith, for a compressor scheduling problem.” 2016. Web. 25 Oct 2020.

Vancouver:

Friske MW. A branch-and-price algorith, for a compressor scheduling problem. [Internet] [Thesis]. Universidade do Rio Grande do Sul; 2016. [cited 2020 Oct 25]. Available from: http://hdl.handle.net/10183/140804.

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

Council of Science Editors:

Friske MW. A branch-and-price algorith, for a compressor scheduling problem. [Thesis]. Universidade do Rio Grande do Sul; 2016. Available from: http://hdl.handle.net/10183/140804

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


University of Waterloo

15. Yildiz, Burak Can. Models and Solution Methods for the Pallet Loading Problem.

Degree: 2018, University of Waterloo

 The three-dimensional bin packing problem (3DBPP) seeks to find the minimum number of bins to pack a finite number of rectangular boxes. It has a… (more)

Subjects/Keywords: 3D Bin Packing; Pallet Loading; Warehousing; Branch-and-Price; Column Generation; Layering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Yildiz, B. C. (2018). Models and Solution Methods for the Pallet Loading Problem. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/13243

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

Yildiz, Burak Can. “Models and Solution Methods for the Pallet Loading Problem.” 2018. Thesis, University of Waterloo. Accessed October 25, 2020. http://hdl.handle.net/10012/13243.

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

MLA Handbook (7th Edition):

Yildiz, Burak Can. “Models and Solution Methods for the Pallet Loading Problem.” 2018. Web. 25 Oct 2020.

Vancouver:

Yildiz BC. Models and Solution Methods for the Pallet Loading Problem. [Internet] [Thesis]. University of Waterloo; 2018. [cited 2020 Oct 25]. Available from: http://hdl.handle.net/10012/13243.

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

Council of Science Editors:

Yildiz BC. Models and Solution Methods for the Pallet Loading Problem. [Thesis]. University of Waterloo; 2018. Available from: http://hdl.handle.net/10012/13243

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


University of Waterloo

16. Ugur, Yildiz. Data Driven Efficiency for E-Warehousing: Descriptive and Prescriptive Analytics.

Degree: 2018, University of Waterloo

 Based on data provided by a warehouse logistics management company, we analyze the warehousing operation and its major processes of order picking and order consolidation.… (more)

Subjects/Keywords: E-warehousing; Data-driven optimization; Data analytics; Branch and price; Simulated Annealing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ugur, Y. (2018). Data Driven Efficiency for E-Warehousing: Descriptive and Prescriptive Analytics. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/13330

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

Ugur, Yildiz. “Data Driven Efficiency for E-Warehousing: Descriptive and Prescriptive Analytics.” 2018. Thesis, University of Waterloo. Accessed October 25, 2020. http://hdl.handle.net/10012/13330.

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

MLA Handbook (7th Edition):

Ugur, Yildiz. “Data Driven Efficiency for E-Warehousing: Descriptive and Prescriptive Analytics.” 2018. Web. 25 Oct 2020.

Vancouver:

Ugur Y. Data Driven Efficiency for E-Warehousing: Descriptive and Prescriptive Analytics. [Internet] [Thesis]. University of Waterloo; 2018. [cited 2020 Oct 25]. Available from: http://hdl.handle.net/10012/13330.

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

Council of Science Editors:

Ugur Y. Data Driven Efficiency for E-Warehousing: Descriptive and Prescriptive Analytics. [Thesis]. University of Waterloo; 2018. Available from: http://hdl.handle.net/10012/13330

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

17. Rahmani, Nastaran. Planning and routing via decomposition approaches : Planification et Routage via les Approches de Décomposition.

Degree: Docteur es, Mathematiques appliquées, 2014, Bordeaux

Problèmes de tournées de véhicules statiques et déterministes ne peuvent pas être utilisés dans de nombreux systémes de la vieréelle, du fait que les données… (more)

Subjects/Keywords: Dial-a-ride problème; Programmation dynamique; Branch-andprice; Optimisation dynamique; Optimisation robuste; Dial-a-ride problem; Dynamic programming; Branch-and-price; Dynamic optimization; Robust optimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Rahmani, N. (2014). Planning and routing via decomposition approaches : Planification et Routage via les Approches de Décomposition. (Doctoral Dissertation). Bordeaux. Retrieved from http://www.theses.fr/2014BORD0141

Chicago Manual of Style (16th Edition):

Rahmani, Nastaran. “Planning and routing via decomposition approaches : Planification et Routage via les Approches de Décomposition.” 2014. Doctoral Dissertation, Bordeaux. Accessed October 25, 2020. http://www.theses.fr/2014BORD0141.

MLA Handbook (7th Edition):

Rahmani, Nastaran. “Planning and routing via decomposition approaches : Planification et Routage via les Approches de Décomposition.” 2014. Web. 25 Oct 2020.

Vancouver:

Rahmani N. Planning and routing via decomposition approaches : Planification et Routage via les Approches de Décomposition. [Internet] [Doctoral dissertation]. Bordeaux; 2014. [cited 2020 Oct 25]. Available from: http://www.theses.fr/2014BORD0141.

Council of Science Editors:

Rahmani N. Planning and routing via decomposition approaches : Planification et Routage via les Approches de Décomposition. [Doctoral Dissertation]. Bordeaux; 2014. Available from: http://www.theses.fr/2014BORD0141

18. Magnouche, Youcef. The multi-terminal vertex separator problem : Complexity, Polyhedra and Algorithms : Le problème du séparateur de poids minimum : Complexité, Polyèdres et Algorithmes.

Degree: Docteur es, Informatique, 2017, Paris Sciences et Lettres (ComUE)

Étant donné un graphe G = (V U T, E), tel que V U T représente l'ensemble des sommets où T est un ensemble de… (more)

Subjects/Keywords: Optimisation combinatoire; Polytope; Facette; Coupes et branchements; Génération de colonnes; Composition de polyèdres; Combinatorial optimization; Polytope; Facet; Branch-And-Cut algorithm; Branch-And-Price algorithm; Composition of polyhedra; 003

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Magnouche, Y. (2017). The multi-terminal vertex separator problem : Complexity, Polyhedra and Algorithms : Le problème du séparateur de poids minimum : Complexité, Polyèdres et Algorithmes. (Doctoral Dissertation). Paris Sciences et Lettres (ComUE). Retrieved from http://www.theses.fr/2017PSLED020

Chicago Manual of Style (16th Edition):

Magnouche, Youcef. “The multi-terminal vertex separator problem : Complexity, Polyhedra and Algorithms : Le problème du séparateur de poids minimum : Complexité, Polyèdres et Algorithmes.” 2017. Doctoral Dissertation, Paris Sciences et Lettres (ComUE). Accessed October 25, 2020. http://www.theses.fr/2017PSLED020.

MLA Handbook (7th Edition):

Magnouche, Youcef. “The multi-terminal vertex separator problem : Complexity, Polyhedra and Algorithms : Le problème du séparateur de poids minimum : Complexité, Polyèdres et Algorithmes.” 2017. Web. 25 Oct 2020.

Vancouver:

Magnouche Y. The multi-terminal vertex separator problem : Complexity, Polyhedra and Algorithms : Le problème du séparateur de poids minimum : Complexité, Polyèdres et Algorithmes. [Internet] [Doctoral dissertation]. Paris Sciences et Lettres (ComUE); 2017. [cited 2020 Oct 25]. Available from: http://www.theses.fr/2017PSLED020.

Council of Science Editors:

Magnouche Y. The multi-terminal vertex separator problem : Complexity, Polyhedra and Algorithms : Le problème du séparateur de poids minimum : Complexité, Polyèdres et Algorithmes. [Doctoral Dissertation]. Paris Sciences et Lettres (ComUE); 2017. Available from: http://www.theses.fr/2017PSLED020

19. Duarte, António J.S.T. Aplicação de algoritmos de partição e geração de colunas ao agendamento de máquinas paralelas.

Degree: 2005, Instituto Politécnico de Bragança

No presente trabalho é proposto um algoritmo para resolver de forma exacta um problema de programação de máquinas paralelas idênticas, com tarefas maleáveis sujeitas a… (more)

Subjects/Keywords: Branch-and-price; Sequenciamento; Geração de colunas

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Duarte, A. J. S. T. (2005). Aplicação de algoritmos de partição e geração de colunas ao agendamento de máquinas paralelas. (Thesis). Instituto Politécnico de Bragança. Retrieved from http://www.rcaap.pt/detail.jsp?id=oai:bibliotecadigital.ipb.pt:10198/1479

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

Duarte, António J S T. “Aplicação de algoritmos de partição e geração de colunas ao agendamento de máquinas paralelas.” 2005. Thesis, Instituto Politécnico de Bragança. Accessed October 25, 2020. http://www.rcaap.pt/detail.jsp?id=oai:bibliotecadigital.ipb.pt:10198/1479.

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

MLA Handbook (7th Edition):

Duarte, António J S T. “Aplicação de algoritmos de partição e geração de colunas ao agendamento de máquinas paralelas.” 2005. Web. 25 Oct 2020.

Vancouver:

Duarte AJST. Aplicação de algoritmos de partição e geração de colunas ao agendamento de máquinas paralelas. [Internet] [Thesis]. Instituto Politécnico de Bragança; 2005. [cited 2020 Oct 25]. Available from: http://www.rcaap.pt/detail.jsp?id=oai:bibliotecadigital.ipb.pt:10198/1479.

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

Council of Science Editors:

Duarte AJST. Aplicação de algoritmos de partição e geração de colunas ao agendamento de máquinas paralelas. [Thesis]. Instituto Politécnico de Bragança; 2005. Available from: http://www.rcaap.pt/detail.jsp?id=oai:bibliotecadigital.ipb.pt:10198/1479

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


Universiteit Utrecht

20. Tönissen, D.D. The Size Robust Multiple Knapsack Problem.

Degree: 2013, Universiteit Utrecht

 In this thesis we investigate the size robust multiple knapsack problem. The differences with the standard knapsack problem are, that there is more than one… (more)

Subjects/Keywords: Size Robust Multiple Knapsacks; Recoverable Robustness; Branch and Price; Column Generation; Separate Recovery Decomposition; Combined Recovery Decomposition.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Tönissen, D. D. (2013). The Size Robust Multiple Knapsack Problem. (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/286944

Chicago Manual of Style (16th Edition):

Tönissen, D D. “The Size Robust Multiple Knapsack Problem.” 2013. Masters Thesis, Universiteit Utrecht. Accessed October 25, 2020. http://dspace.library.uu.nl:8080/handle/1874/286944.

MLA Handbook (7th Edition):

Tönissen, D D. “The Size Robust Multiple Knapsack Problem.” 2013. Web. 25 Oct 2020.

Vancouver:

Tönissen DD. The Size Robust Multiple Knapsack Problem. [Internet] [Masters thesis]. Universiteit Utrecht; 2013. [cited 2020 Oct 25]. Available from: http://dspace.library.uu.nl:8080/handle/1874/286944.

Council of Science Editors:

Tönissen DD. The Size Robust Multiple Knapsack Problem. [Masters Thesis]. Universiteit Utrecht; 2013. Available from: http://dspace.library.uu.nl:8080/handle/1874/286944


McMaster University

21. Chen, Qianqian. Capacity Expansion of Electric Vehicle Charging Network: Model, Algorithms and A Case Study.

Degree: MSc, 2019, McMaster University

Governments in many counties are taking measures to promote electric vehicles. An important strategy is to build enough charging infrastructures so as to alleviate drivers’… (more)

Subjects/Keywords: multi-stage stochastic integer programming; logit choice model; facility location; capacity expansion; electric vehicle charging network; branch-and-price

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chen, Q. (2019). Capacity Expansion of Electric Vehicle Charging Network: Model, Algorithms and A Case Study. (Masters Thesis). McMaster University. Retrieved from http://hdl.handle.net/11375/24972

Chicago Manual of Style (16th Edition):

Chen, Qianqian. “Capacity Expansion of Electric Vehicle Charging Network: Model, Algorithms and A Case Study.” 2019. Masters Thesis, McMaster University. Accessed October 25, 2020. http://hdl.handle.net/11375/24972.

MLA Handbook (7th Edition):

Chen, Qianqian. “Capacity Expansion of Electric Vehicle Charging Network: Model, Algorithms and A Case Study.” 2019. Web. 25 Oct 2020.

Vancouver:

Chen Q. Capacity Expansion of Electric Vehicle Charging Network: Model, Algorithms and A Case Study. [Internet] [Masters thesis]. McMaster University; 2019. [cited 2020 Oct 25]. Available from: http://hdl.handle.net/11375/24972.

Council of Science Editors:

Chen Q. Capacity Expansion of Electric Vehicle Charging Network: Model, Algorithms and A Case Study. [Masters Thesis]. McMaster University; 2019. Available from: http://hdl.handle.net/11375/24972


University of Toronto

22. Tam, Johnny Wing-Yiu. Vehicle Routing Approaches for Solving an Order Cutoff Assignment Problem.

Degree: 2011, University of Toronto

We define an order cutoff for a retailer as a time in the day such that orders sent to the depot before this point will… (more)

Subjects/Keywords: distance constrained vehicle routing problem; branch-and-price; column generation; mixed integer programming; constraint programming; order cutoff assignment problem; 0546

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Tam, J. W. (2011). Vehicle Routing Approaches for Solving an Order Cutoff Assignment Problem. (Masters Thesis). University of Toronto. Retrieved from http://hdl.handle.net/1807/31461

Chicago Manual of Style (16th Edition):

Tam, Johnny Wing-Yiu. “Vehicle Routing Approaches for Solving an Order Cutoff Assignment Problem.” 2011. Masters Thesis, University of Toronto. Accessed October 25, 2020. http://hdl.handle.net/1807/31461.

MLA Handbook (7th Edition):

Tam, Johnny Wing-Yiu. “Vehicle Routing Approaches for Solving an Order Cutoff Assignment Problem.” 2011. Web. 25 Oct 2020.

Vancouver:

Tam JW. Vehicle Routing Approaches for Solving an Order Cutoff Assignment Problem. [Internet] [Masters thesis]. University of Toronto; 2011. [cited 2020 Oct 25]. Available from: http://hdl.handle.net/1807/31461.

Council of Science Editors:

Tam JW. Vehicle Routing Approaches for Solving an Order Cutoff Assignment Problem. [Masters Thesis]. University of Toronto; 2011. Available from: http://hdl.handle.net/1807/31461

23. E. Tresoldi. LOCATION AND ROUTING PROBLEMS: A UNIFIED APPROACH.

Degree: 2012, Università degli Studi di Milano

 This thesis is about location and routing problems. We propose a unified algorithmic approach, based on the branch-and-cut-and-price paradigm, for the exact solution of general… (more)

Subjects/Keywords: Operations Ressearch; Branch-and-cut-and-price; Column Generation; Location; Routing; Settore INF/01 - Informatica; Settore MAT/09 - Ricerca Operativa

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Tresoldi, E. (2012). LOCATION AND ROUTING PROBLEMS: A UNIFIED APPROACH. (Thesis). Università degli Studi di Milano. Retrieved from http://hdl.handle.net/2434/172439

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

Tresoldi, E.. “LOCATION AND ROUTING PROBLEMS: A UNIFIED APPROACH.” 2012. Thesis, Università degli Studi di Milano. Accessed October 25, 2020. http://hdl.handle.net/2434/172439.

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

MLA Handbook (7th Edition):

Tresoldi, E.. “LOCATION AND ROUTING PROBLEMS: A UNIFIED APPROACH.” 2012. Web. 25 Oct 2020.

Vancouver:

Tresoldi E. LOCATION AND ROUTING PROBLEMS: A UNIFIED APPROACH. [Internet] [Thesis]. Università degli Studi di Milano; 2012. [cited 2020 Oct 25]. Available from: http://hdl.handle.net/2434/172439.

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

Council of Science Editors:

Tresoldi E. LOCATION AND ROUTING PROBLEMS: A UNIFIED APPROACH. [Thesis]. Università degli Studi di Milano; 2012. Available from: http://hdl.handle.net/2434/172439

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

24. Rottner, Cécile. Aspects combinatoires du Unit Commitment Problem : Combinatorial aspects of the Unit Commitment Problem.

Degree: Docteur es, Informatique, 2018, Sorbonne université

Le Min-up/min-down Unit Commitment Problem (MUCP) consiste à trouver un plan de production de coût minimum pour un ensemble d’unités de production électrique sur un… (more)

Subjects/Keywords: Optimisation combinatoire; Unit Commitment Problem; Polytope; Symétries; Branch & price & cut; Combinatorial optimization; Unit Commitment Problem; Symmetry-breaking; 519.64

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Rottner, C. (2018). Aspects combinatoires du Unit Commitment Problem : Combinatorial aspects of the Unit Commitment Problem. (Doctoral Dissertation). Sorbonne université. Retrieved from http://www.theses.fr/2018SORUS272

Chicago Manual of Style (16th Edition):

Rottner, Cécile. “Aspects combinatoires du Unit Commitment Problem : Combinatorial aspects of the Unit Commitment Problem.” 2018. Doctoral Dissertation, Sorbonne université. Accessed October 25, 2020. http://www.theses.fr/2018SORUS272.

MLA Handbook (7th Edition):

Rottner, Cécile. “Aspects combinatoires du Unit Commitment Problem : Combinatorial aspects of the Unit Commitment Problem.” 2018. Web. 25 Oct 2020.

Vancouver:

Rottner C. Aspects combinatoires du Unit Commitment Problem : Combinatorial aspects of the Unit Commitment Problem. [Internet] [Doctoral dissertation]. Sorbonne université; 2018. [cited 2020 Oct 25]. Available from: http://www.theses.fr/2018SORUS272.

Council of Science Editors:

Rottner C. Aspects combinatoires du Unit Commitment Problem : Combinatorial aspects of the Unit Commitment Problem. [Doctoral Dissertation]. Sorbonne université; 2018. Available from: http://www.theses.fr/2018SORUS272

25. Novák Antonín. Metody efektivního prohledávání stavového prostoru v rozvrhování zdravotních sester s využitím branch-and-price přístupu .

Degree: Czech University of Technology

 Tato práce popisuje exaktní algoritmus pro problem rozvrhování zdravotních sester založený na obecné dekompoziční metodě Branch and Price. Popsaný přístup zvládá širokou škálu měkkých omezení… (more)

Subjects/Keywords: problém zdravotních sester; branch and price; kombinatorická optimalizace

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Antonín, N. (n.d.). Metody efektivního prohledávání stavového prostoru v rozvrhování zdravotních sester s využitím branch-and-price přístupu . (Thesis). Czech University of Technology. Retrieved from http://hdl.handle.net/10467/61725

Note: this citation may be lacking information needed for this citation format:
No year of publication.
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Antonín, Novák. “Metody efektivního prohledávání stavového prostoru v rozvrhování zdravotních sester s využitím branch-and-price přístupu .” Thesis, Czech University of Technology. Accessed October 25, 2020. http://hdl.handle.net/10467/61725.

Note: this citation may be lacking information needed for this citation format:
No year of publication.
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Antonín, Novák. “Metody efektivního prohledávání stavového prostoru v rozvrhování zdravotních sester s využitím branch-and-price přístupu .” Web. 25 Oct 2020.

Note: this citation may be lacking information needed for this citation format:
No year of publication.

Vancouver:

Antonín N. Metody efektivního prohledávání stavového prostoru v rozvrhování zdravotních sester s využitím branch-and-price přístupu . [Internet] [Thesis]. Czech University of Technology; [cited 2020 Oct 25]. Available from: http://hdl.handle.net/10467/61725.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
No year of publication.

Council of Science Editors:

Antonín N. Metody efektivního prohledávání stavového prostoru v rozvrhování zdravotních sester s využitím branch-and-price přístupu . [Thesis]. Czech University of Technology; Available from: http://hdl.handle.net/10467/61725

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
No year of publication.


University of Arkansas

26. Delgado-Hidalgo, Liliana. Barge Prioritization, Assignment, and Scheduling During Inland Waterway Disruption Responses.

Degree: PhD, 2018, University of Arkansas

  Inland waterways face natural and man-made disruptions that may affect navigation and infrastructure operations leading to barge traffic disruptions and economic losses. This dissertation… (more)

Subjects/Keywords: Branch-and-Price; Cargo Prioritization; Disruption Response; Freight Transportation; Inland Waterways; Integer Programming; Industrial Engineering; Operational Research; Transportation Engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Delgado-Hidalgo, L. (2018). Barge Prioritization, Assignment, and Scheduling During Inland Waterway Disruption Responses. (Doctoral Dissertation). University of Arkansas. Retrieved from https://scholarworks.uark.edu/etd/2852

Chicago Manual of Style (16th Edition):

Delgado-Hidalgo, Liliana. “Barge Prioritization, Assignment, and Scheduling During Inland Waterway Disruption Responses.” 2018. Doctoral Dissertation, University of Arkansas. Accessed October 25, 2020. https://scholarworks.uark.edu/etd/2852.

MLA Handbook (7th Edition):

Delgado-Hidalgo, Liliana. “Barge Prioritization, Assignment, and Scheduling During Inland Waterway Disruption Responses.” 2018. Web. 25 Oct 2020.

Vancouver:

Delgado-Hidalgo L. Barge Prioritization, Assignment, and Scheduling During Inland Waterway Disruption Responses. [Internet] [Doctoral dissertation]. University of Arkansas; 2018. [cited 2020 Oct 25]. Available from: https://scholarworks.uark.edu/etd/2852.

Council of Science Editors:

Delgado-Hidalgo L. Barge Prioritization, Assignment, and Scheduling During Inland Waterway Disruption Responses. [Doctoral Dissertation]. University of Arkansas; 2018. Available from: https://scholarworks.uark.edu/etd/2852


Pontifical Catholic University of Rio de Janeiro

27. GABRIEL ANDRE HOMSI. [en] SHIP ROUTING AND SPEED OPTIMIZATION WITH HETEROGENEOUS FUEL CONSUMPTION PROFILES.

Degree: 2018, Pontifical Catholic University of Rio de Janeiro

[pt] A indústria de transporte marítimo é essencial para o comércio internacional. No entanto, no despertar da crise financeira de 2008, essa indústria foi severamente… (more)

Subjects/Keywords: [pt] META-HEURISTICAS; [en] META-HEURISTICS; [pt] TRANSPORTE; [en] TRANSPORT; [pt] OTIMIZACAO CONVEXA; [en] CONVEX OPTIMIZATION; [pt] ROTEAMENTO DE NAVIOS; [en] SHIP ROUTING; [pt] BRANCH-AND-PRICE; [en] BRANCH-AND-PRICE; [pt] OTIMIZACAO DE VELOCIDADE; [en] SPEED OPTIMIZATION

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

HOMSI, G. A. (2018). [en] SHIP ROUTING AND SPEED OPTIMIZATION WITH HETEROGENEOUS FUEL CONSUMPTION PROFILES. (Thesis). Pontifical Catholic University of Rio de Janeiro. Retrieved from http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=34172

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

HOMSI, GABRIEL ANDRE. “[en] SHIP ROUTING AND SPEED OPTIMIZATION WITH HETEROGENEOUS FUEL CONSUMPTION PROFILES.” 2018. Thesis, Pontifical Catholic University of Rio de Janeiro. Accessed October 25, 2020. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=34172.

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

MLA Handbook (7th Edition):

HOMSI, GABRIEL ANDRE. “[en] SHIP ROUTING AND SPEED OPTIMIZATION WITH HETEROGENEOUS FUEL CONSUMPTION PROFILES.” 2018. Web. 25 Oct 2020.

Vancouver:

HOMSI GA. [en] SHIP ROUTING AND SPEED OPTIMIZATION WITH HETEROGENEOUS FUEL CONSUMPTION PROFILES. [Internet] [Thesis]. Pontifical Catholic University of Rio de Janeiro; 2018. [cited 2020 Oct 25]. Available from: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=34172.

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

Council of Science Editors:

HOMSI GA. [en] SHIP ROUTING AND SPEED OPTIMIZATION WITH HETEROGENEOUS FUEL CONSUMPTION PROFILES. [Thesis]. Pontifical Catholic University of Rio de Janeiro; 2018. Available from: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=34172

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


Université Montpellier II

28. Hernandez, Florent. Méthodes de résolution exactes pour le problème de routage de véhicules avec fenêtres de temps et routes multiples : Exact methods to solve the Multi-Trip Vehicle Routing Problem with Time Windows.

Degree: Docteur es, Informatique, 2010, Université Montpellier II

Le problème de routage de véhicules avec fenêtres de temps et routes multiples (MTVRPTW) est une généralisation du problème de routage de véhicules avec fenêtres… (more)

Subjects/Keywords: Problème de routage de véhicules; Génération de Colonnes; Routes multiples; Fenêtre de temps; Programmation dynamique; Branch and Price; Vehicle routing problem; Column Generation; Multi-Trip; Time windows; Dynamic programming; Branch and Price

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hernandez, F. (2010). Méthodes de résolution exactes pour le problème de routage de véhicules avec fenêtres de temps et routes multiples : Exact methods to solve the Multi-Trip Vehicle Routing Problem with Time Windows. (Doctoral Dissertation). Université Montpellier II. Retrieved from http://www.theses.fr/2010MON20215

Chicago Manual of Style (16th Edition):

Hernandez, Florent. “Méthodes de résolution exactes pour le problème de routage de véhicules avec fenêtres de temps et routes multiples : Exact methods to solve the Multi-Trip Vehicle Routing Problem with Time Windows.” 2010. Doctoral Dissertation, Université Montpellier II. Accessed October 25, 2020. http://www.theses.fr/2010MON20215.

MLA Handbook (7th Edition):

Hernandez, Florent. “Méthodes de résolution exactes pour le problème de routage de véhicules avec fenêtres de temps et routes multiples : Exact methods to solve the Multi-Trip Vehicle Routing Problem with Time Windows.” 2010. Web. 25 Oct 2020.

Vancouver:

Hernandez F. Méthodes de résolution exactes pour le problème de routage de véhicules avec fenêtres de temps et routes multiples : Exact methods to solve the Multi-Trip Vehicle Routing Problem with Time Windows. [Internet] [Doctoral dissertation]. Université Montpellier II; 2010. [cited 2020 Oct 25]. Available from: http://www.theses.fr/2010MON20215.

Council of Science Editors:

Hernandez F. Méthodes de résolution exactes pour le problème de routage de véhicules avec fenêtres de temps et routes multiples : Exact methods to solve the Multi-Trip Vehicle Routing Problem with Time Windows. [Doctoral Dissertation]. Université Montpellier II; 2010. Available from: http://www.theses.fr/2010MON20215


Pontifical Catholic University of Rio de Janeiro

29. RAFAEL MARTINELLI PINTO. [en] EXACT ALGORITHMS FOR ARC AND NODE ROUTING PROBLEMS.

Degree: 2017, Pontifical Catholic University of Rio de Janeiro

[pt] Os problemas de roteamento estão entre os problemas combinatórios mais difíceis de encontrar limites melhores do que os existentes ou de provar novas soluções… (more)

Subjects/Keywords: [pt] PROGRAMACAO INTEIRA; [en] INTER LINEAR PROGRAMMIN; [pt] GERACAO DE COLUNAS; [en] COLUMN GERERATION; [pt] PROBLEMAS DE ROTEAMENTO; [en] ROUTING PROBLEMS; [pt] BRANCH-CUT-AND-PRICE; [en] BRANCH-CUT-AND-PRICE; [pt] SEPARACAO DE CORTES; [en] CUT SEPARATION

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

PINTO, R. M. (2017). [en] EXACT ALGORITHMS FOR ARC AND NODE ROUTING PROBLEMS. (Thesis). Pontifical Catholic University of Rio de Janeiro. Retrieved from http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=28746

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

PINTO, RAFAEL MARTINELLI. “[en] EXACT ALGORITHMS FOR ARC AND NODE ROUTING PROBLEMS.” 2017. Thesis, Pontifical Catholic University of Rio de Janeiro. Accessed October 25, 2020. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=28746.

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

MLA Handbook (7th Edition):

PINTO, RAFAEL MARTINELLI. “[en] EXACT ALGORITHMS FOR ARC AND NODE ROUTING PROBLEMS.” 2017. Web. 25 Oct 2020.

Vancouver:

PINTO RM. [en] EXACT ALGORITHMS FOR ARC AND NODE ROUTING PROBLEMS. [Internet] [Thesis]. Pontifical Catholic University of Rio de Janeiro; 2017. [cited 2020 Oct 25]. Available from: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=28746.

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

Council of Science Editors:

PINTO RM. [en] EXACT ALGORITHMS FOR ARC AND NODE ROUTING PROBLEMS. [Thesis]. Pontifical Catholic University of Rio de Janeiro; 2017. Available from: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=28746

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

30. FABIAN ARTURO CASTILLA PENARANDA. [en] VEHICLE ROUTING PROBLEMS WITH TIME WINDOWS AND EXACT SYNCHRONIZATION CONSTRAINTS.

Degree: 2014, Pontifical Catholic University of Rio de Janeiro

[pt] Uma generalização do problema de roteamento de veículos (VRP) presente em aplicações práticas em portos e operações em minas é o objeto desta dissertação.… (more)

Subjects/Keywords: [pt] PROGRAMACAO INTEIRA; [en] INTER LINEAR PROGRAMMIN; [pt] GERACAO DE COLUNAS; [en] COLUMN GERERATION; [pt] ROTEAMENTO DE VEICULOS; [en] VEHICLE ROUTING; [pt] JANELA DE TEMPO; [en] TIME WINDOW; [pt] RESTRICOES DE SINCRONIZACAO; [en] SYNCRONIZATION CONSTRAINTS; [pt] BRANCH AND PRICE; [en] BRANCH AND PRICE

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

PENARANDA, F. A. C. (2014). [en] VEHICLE ROUTING PROBLEMS WITH TIME WINDOWS AND EXACT SYNCHRONIZATION CONSTRAINTS. (Thesis). Pontifical Catholic University of Rio de Janeiro. Retrieved from http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=23834

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

PENARANDA, FABIAN ARTURO CASTILLA. “[en] VEHICLE ROUTING PROBLEMS WITH TIME WINDOWS AND EXACT SYNCHRONIZATION CONSTRAINTS.” 2014. Thesis, Pontifical Catholic University of Rio de Janeiro. Accessed October 25, 2020. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=23834.

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

MLA Handbook (7th Edition):

PENARANDA, FABIAN ARTURO CASTILLA. “[en] VEHICLE ROUTING PROBLEMS WITH TIME WINDOWS AND EXACT SYNCHRONIZATION CONSTRAINTS.” 2014. Web. 25 Oct 2020.

Vancouver:

PENARANDA FAC. [en] VEHICLE ROUTING PROBLEMS WITH TIME WINDOWS AND EXACT SYNCHRONIZATION CONSTRAINTS. [Internet] [Thesis]. Pontifical Catholic University of Rio de Janeiro; 2014. [cited 2020 Oct 25]. Available from: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=23834.

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

Council of Science Editors:

PENARANDA FAC. [en] VEHICLE ROUTING PROBLEMS WITH TIME WINDOWS AND EXACT SYNCHRONIZATION CONSTRAINTS. [Thesis]. Pontifical Catholic University of Rio de Janeiro; 2014. Available from: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=23834

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

[1] [2] [3]

.