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 58 total matches.

[1] [2]

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 June 17, 2019. 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. 17 Jun 2019.

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 2019 Jun 17]. 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 June 17, 2019. 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. 17 Jun 2019.

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 2019 Jun 17]. 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


Université de Montréal

3. Contardo, Claudio. Models and algorithms for the capacitated location-routing problem .

Degree: 2011, Université de Montréal

 Le problème de localisation-routage avec capacités (PLRC) apparaît comme un problème clé dans la conception de réseaux de distribution de marchandises. Il généralisele problème de… (more)

Subjects/Keywords: localisation-routage; géneration de colonnes; heuristiques; location-routing; branch-and-cut; branch-and-price; metaheuristic

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Contardo, C. (2011). Models and algorithms for the capacitated location-routing problem . (Thesis). Université de Montréal. Retrieved from http://hdl.handle.net/1866/5518

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

Contardo, Claudio. “Models and algorithms for the capacitated location-routing problem .” 2011. Thesis, Université de Montréal. Accessed June 17, 2019. http://hdl.handle.net/1866/5518.

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

MLA Handbook (7th Edition):

Contardo, Claudio. “Models and algorithms for the capacitated location-routing problem .” 2011. Web. 17 Jun 2019.

Vancouver:

Contardo C. Models and algorithms for the capacitated location-routing problem . [Internet] [Thesis]. Université de Montréal; 2011. [cited 2019 Jun 17]. Available from: http://hdl.handle.net/1866/5518.

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

Council of Science Editors:

Contardo C. Models and algorithms for the capacitated location-routing problem . [Thesis]. Université de Montréal; 2011. Available from: http://hdl.handle.net/1866/5518

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

4. 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 June 17, 2019. 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. 17 Jun 2019.

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 2019 Jun 17]. 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/ ;

5. Potter, Douglas. An implementation of a constraint branching algorithm for optimally solving airline crew pairing problems.

Degree: 2008, Chalmers University of Technology

 Competition in the airline industry depends greatly on how efficiently crews are scheduled. Scheduling problems can be modeled as integer programs which can be solved… (more)

Subjects/Keywords: optimization; crew scheduling; mathematical model; branch-and-price

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Potter, D. (2008). An implementation of a constraint branching algorithm for optimally solving airline crew pairing problems. (Thesis). Chalmers University of Technology. Retrieved from http://studentarbeten.chalmers.se/publication/82068-an-implementation-of-a-constraint-branching-algorithm-for-optimally-solving-airline-crew-pairing-pro

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

Potter, Douglas. “An implementation of a constraint branching algorithm for optimally solving airline crew pairing problems.” 2008. Thesis, Chalmers University of Technology. Accessed June 17, 2019. http://studentarbeten.chalmers.se/publication/82068-an-implementation-of-a-constraint-branching-algorithm-for-optimally-solving-airline-crew-pairing-pro.

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

MLA Handbook (7th Edition):

Potter, Douglas. “An implementation of a constraint branching algorithm for optimally solving airline crew pairing problems.” 2008. Web. 17 Jun 2019.

Vancouver:

Potter D. An implementation of a constraint branching algorithm for optimally solving airline crew pairing problems. [Internet] [Thesis]. Chalmers University of Technology; 2008. [cited 2019 Jun 17]. Available from: http://studentarbeten.chalmers.se/publication/82068-an-implementation-of-a-constraint-branching-algorithm-for-optimally-solving-airline-crew-pairing-pro.

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

Council of Science Editors:

Potter D. An implementation of a constraint branching algorithm for optimally solving airline crew pairing problems. [Thesis]. Chalmers University of Technology; 2008. Available from: http://studentarbeten.chalmers.se/publication/82068-an-implementation-of-a-constraint-branching-algorithm-for-optimally-solving-airline-crew-pairing-pro

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


University of Edinburgh

6. Yu, Yu. Stochastic ship fleet routing with inventory limits.

Degree: 2010, University of Edinburgh

 This thesis describes a stochastic ship routing problem with inventory management. The problem involves finding a set of least costs routes for a fleet of… (more)

Subjects/Keywords: stochastic programming; ship routing; inventory; column generation; branch and price; decomposition

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Yu, Y. (2010). Stochastic ship fleet routing with inventory limits. (Doctoral Dissertation). University of Edinburgh. Retrieved from http://hdl.handle.net/1842/4640

Chicago Manual of Style (16th Edition):

Yu, Yu. “Stochastic ship fleet routing with inventory limits.” 2010. Doctoral Dissertation, University of Edinburgh. Accessed June 17, 2019. http://hdl.handle.net/1842/4640.

MLA Handbook (7th Edition):

Yu, Yu. “Stochastic ship fleet routing with inventory limits.” 2010. Web. 17 Jun 2019.

Vancouver:

Yu Y. Stochastic ship fleet routing with inventory limits. [Internet] [Doctoral dissertation]. University of Edinburgh; 2010. [cited 2019 Jun 17]. Available from: http://hdl.handle.net/1842/4640.

Council of Science Editors:

Yu Y. Stochastic ship fleet routing with inventory limits. [Doctoral Dissertation]. University of Edinburgh; 2010. Available from: http://hdl.handle.net/1842/4640


University of Cincinnati

7. WANG, XINFANG. A BRANCH-AND-PRICE APPROACH FOR SOLVING THE SHARE-OF-CHOICE PRODUCT LINE DESIGN PROBLEM.

Degree: PhD, Business Administration : Quantitative Analysis, 2007, University of Cincinnati

 Companies rely heavily on new products as a source of profit. New products are usually introduced in several configurations to comprise a product line. A… (more)

Subjects/Keywords: Business Administration, General; integer programming; branch-and-price; product design

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

WANG, X. (2007). A BRANCH-AND-PRICE APPROACH FOR SOLVING THE SHARE-OF-CHOICE PRODUCT LINE DESIGN PROBLEM. (Doctoral Dissertation). University of Cincinnati. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=ucin1185223055

Chicago Manual of Style (16th Edition):

WANG, XINFANG. “A BRANCH-AND-PRICE APPROACH FOR SOLVING THE SHARE-OF-CHOICE PRODUCT LINE DESIGN PROBLEM.” 2007. Doctoral Dissertation, University of Cincinnati. Accessed June 17, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1185223055.

MLA Handbook (7th Edition):

WANG, XINFANG. “A BRANCH-AND-PRICE APPROACH FOR SOLVING THE SHARE-OF-CHOICE PRODUCT LINE DESIGN PROBLEM.” 2007. Web. 17 Jun 2019.

Vancouver:

WANG X. A BRANCH-AND-PRICE APPROACH FOR SOLVING THE SHARE-OF-CHOICE PRODUCT LINE DESIGN PROBLEM. [Internet] [Doctoral dissertation]. University of Cincinnati; 2007. [cited 2019 Jun 17]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ucin1185223055.

Council of Science Editors:

WANG X. A BRANCH-AND-PRICE APPROACH FOR SOLVING THE SHARE-OF-CHOICE PRODUCT LINE DESIGN PROBLEM. [Doctoral Dissertation]. University of Cincinnati; 2007. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ucin1185223055

8. 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 June 17, 2019. 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. 17 Jun 2019.

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 2019 Jun 17]. 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

9. 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 June 17, 2019. http://hdl.handle.net/1959.13/1038800.

MLA Handbook (7th Edition):

Ruther, Sebastian. “Integrated aircraft routing, crew pairing, and tail assignment.” 2013. Web. 17 Jun 2019.

Vancouver:

Ruther S. Integrated aircraft routing, crew pairing, and tail assignment. [Internet] [Doctoral dissertation]. University of Newcastle; 2013. [cited 2019 Jun 17]. 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

10. 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 June 17, 2019. 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. 17 Jun 2019.

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 2019 Jun 17]. 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

11. 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 June 17, 2019. 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. 17 Jun 2019.

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 2019 Jun 17]. 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/ ;

12. 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 June 17, 2019. 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. 17 Jun 2019.

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 2019 Jun 17]. 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/ ;

13. 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 June 17, 2019. 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. 17 Jun 2019.

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 2019 Jun 17]. 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

14. 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 June 17, 2019. 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. 17 Jun 2019.

Vancouver:

Prishchepo EA. Branch-and-Price Algorithm for the Team Orienteering Problem with Time-Dependent Rewards. [Internet] [Thesis]. University of Vienna; 2017. [cited 2019 Jun 17]. 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

15. 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 June 17, 2019. 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. 17 Jun 2019.

Vancouver:

Moura LFdS. Branch & price for the virtual network embedding problem. [Internet] [Thesis]. Universidade do Rio Grande do Sul; 2015. [cited 2019 Jun 17]. 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

16. 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 June 17, 2019. 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. 17 Jun 2019.

Vancouver:

Hillebrand A. Separating a polygonal environment into a multi-layered environment. [Internet] [Masters thesis]. Universiteit Utrecht; 2012. [cited 2019 Jun 17]. 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

17. 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 June 17, 2019. 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. 17 Jun 2019.

Vancouver:

Friske MW. A branch-and-price algorith, for a compressor scheduling problem. [Internet] [Thesis]. Universidade do Rio Grande do Sul; 2016. [cited 2019 Jun 17]. 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


Université Catholique de Louvain

18. Massen, Florence. Optimization approaches for vehicle routing problems with Black Box Feasibility.

Degree: 2013, Université Catholique de Louvain

The Vehicle Routing Problem (VRP) is concerned with determining how a set of vehicles can be used to visit a set of customers such as… (more)

Subjects/Keywords: Black Box Feasibility; Vehicle Routing; Column Generation; Branch and Price; Ant Colony Optimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Massen, F. (2013). Optimization approaches for vehicle routing problems with Black Box Feasibility. (Thesis). Université Catholique de Louvain. Retrieved from http://hdl.handle.net/2078.1/133880

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

Massen, Florence. “Optimization approaches for vehicle routing problems with Black Box Feasibility.” 2013. Thesis, Université Catholique de Louvain. Accessed June 17, 2019. http://hdl.handle.net/2078.1/133880.

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

MLA Handbook (7th Edition):

Massen, Florence. “Optimization approaches for vehicle routing problems with Black Box Feasibility.” 2013. Web. 17 Jun 2019.

Vancouver:

Massen F. Optimization approaches for vehicle routing problems with Black Box Feasibility. [Internet] [Thesis]. Université Catholique de Louvain; 2013. [cited 2019 Jun 17]. Available from: http://hdl.handle.net/2078.1/133880.

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

Council of Science Editors:

Massen F. Optimization approaches for vehicle routing problems with Black Box Feasibility. [Thesis]. Université Catholique de Louvain; 2013. Available from: http://hdl.handle.net/2078.1/133880

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


University of Texas – Austin

19. Koc, Ali. Prioritization via stochastic optimization.

Degree: Mechanical Engineering, 2010, University of Texas – Austin

 We take a novel perspective on real-life decision making problems involving binary activity-selection decisions that compete for scarce resources. The current literature in operations research… (more)

Subjects/Keywords: Prioritization; Stochastic programming; Branch-and-price; Parallel programming; Operations research; Nuclear power industry; Parallelization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Koc, A. (2010). Prioritization via stochastic optimization. (Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/ETD-UT-2010-05-1258

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

Koc, Ali. “Prioritization via stochastic optimization.” 2010. Thesis, University of Texas – Austin. Accessed June 17, 2019. http://hdl.handle.net/2152/ETD-UT-2010-05-1258.

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

MLA Handbook (7th Edition):

Koc, Ali. “Prioritization via stochastic optimization.” 2010. Web. 17 Jun 2019.

Vancouver:

Koc A. Prioritization via stochastic optimization. [Internet] [Thesis]. University of Texas – Austin; 2010. [cited 2019 Jun 17]. Available from: http://hdl.handle.net/2152/ETD-UT-2010-05-1258.

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

Council of Science Editors:

Koc A. Prioritization via stochastic optimization. [Thesis]. University of Texas – Austin; 2010. Available from: http://hdl.handle.net/2152/ETD-UT-2010-05-1258

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


University of Waterloo

20. 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 June 17, 2019. 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. 17 Jun 2019.

Vancouver:

Yildiz BC. Models and Solution Methods for the Pallet Loading Problem. [Internet] [Thesis]. University of Waterloo; 2018. [cited 2019 Jun 17]. 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

21. 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 June 17, 2019. 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. 17 Jun 2019.

Vancouver:

Ugur Y. Data Driven Efficiency for E-Warehousing: Descriptive and Prescriptive Analytics. [Internet] [Thesis]. University of Waterloo; 2018. [cited 2019 Jun 17]. 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

22. 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

É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. 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. Accessed June 17, 2019. 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. 17 Jun 2019.

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; 2017. [cited 2019 Jun 17]. 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; 2017. Available from: http://www.theses.fr/2017PSLED020

23. 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 June 17, 2019. 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. 17 Jun 2019.

Vancouver:

Rahmani N. Planning and routing via decomposition approaches : Planification et Routage via les Approches de Décomposition. [Internet] [Doctoral dissertation]. Bordeaux; 2014. [cited 2019 Jun 17]. 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

24. 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 June 17, 2019. 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. 17 Jun 2019.

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 2019 Jun 17]. 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.


Texas A&M University

25. Cimren, Elif I. Strategic Surveillance System Design for Ports and Waterways.

Degree: 2010, Texas A&M University

 The purpose of this dissertation is to synthesize a methodology to prescribe a strategic design of a surveillance system to provide the required level of… (more)

Subjects/Keywords: branch and price; integer programming; homeland security; port and waterway surveillance; integer programming; knapsack problem; lifting

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cimren, E. I. (2010). Strategic Surveillance System Design for Ports and Waterways. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2009-05-360

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

Cimren, Elif I. “Strategic Surveillance System Design for Ports and Waterways.” 2010. Thesis, Texas A&M University. Accessed June 17, 2019. http://hdl.handle.net/1969.1/ETD-TAMU-2009-05-360.

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

MLA Handbook (7th Edition):

Cimren, Elif I. “Strategic Surveillance System Design for Ports and Waterways.” 2010. Web. 17 Jun 2019.

Vancouver:

Cimren EI. Strategic Surveillance System Design for Ports and Waterways. [Internet] [Thesis]. Texas A&M University; 2010. [cited 2019 Jun 17]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2009-05-360.

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

Council of Science Editors:

Cimren EI. Strategic Surveillance System Design for Ports and Waterways. [Thesis]. Texas A&M University; 2010. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2009-05-360

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

26. 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 June 17, 2019. 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. 17 Jun 2019.

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 2019 Jun 17]. 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

27. 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 June 17, 2019. 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. 17 Jun 2019.

Vancouver:

Tönissen DD. The Size Robust Multiple Knapsack Problem. [Internet] [Masters thesis]. Universiteit Utrecht; 2013. [cited 2019 Jun 17]. 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


University of Toronto

28. 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 June 17, 2019. 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. 17 Jun 2019.

Vancouver:

Tam JW. Vehicle Routing Approaches for Solving an Order Cutoff Assignment Problem. [Internet] [Masters thesis]. University of Toronto; 2011. [cited 2019 Jun 17]. 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

29. 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 June 17, 2019. 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. 17 Jun 2019.

Vancouver:

Tresoldi E. LOCATION AND ROUTING PROBLEMS: A UNIFIED APPROACH. [Internet] [Thesis]. Università degli Studi di Milano; 2012. [cited 2019 Jun 17]. 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


Florida International University

30. Mestry, Siddharth D. Branch and Price Solution Approach for Order Acceptance and Capacity Planning in Make-to-Order Operations.

Degree: PhD, Please see currently inactive department below., 2010, Florida International University

  The increasing emphasis on mass customization, shortened product lifecycles, synchronized supply chains, when coupled with advances in information system, is driving most firms towards… (more)

Subjects/Keywords: Order Acceptance; Branch-and-Price; Capacity Planning; Make-to-Order Operations; Large-Scale Optimization; Operations Research; Decomposition Techniques

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mestry, S. D. (2010). Branch and Price Solution Approach for Order Acceptance and Capacity Planning in Make-to-Order Operations. (Doctoral Dissertation). Florida International University. Retrieved from http://digitalcommons.fiu.edu/etd/145 ; 10.25148/etd.FI10041619 ; FI10041619

Chicago Manual of Style (16th Edition):

Mestry, Siddharth D. “Branch and Price Solution Approach for Order Acceptance and Capacity Planning in Make-to-Order Operations.” 2010. Doctoral Dissertation, Florida International University. Accessed June 17, 2019. http://digitalcommons.fiu.edu/etd/145 ; 10.25148/etd.FI10041619 ; FI10041619.

MLA Handbook (7th Edition):

Mestry, Siddharth D. “Branch and Price Solution Approach for Order Acceptance and Capacity Planning in Make-to-Order Operations.” 2010. Web. 17 Jun 2019.

Vancouver:

Mestry SD. Branch and Price Solution Approach for Order Acceptance and Capacity Planning in Make-to-Order Operations. [Internet] [Doctoral dissertation]. Florida International University; 2010. [cited 2019 Jun 17]. Available from: http://digitalcommons.fiu.edu/etd/145 ; 10.25148/etd.FI10041619 ; FI10041619.

Council of Science Editors:

Mestry SD. Branch and Price Solution Approach for Order Acceptance and Capacity Planning in Make-to-Order Operations. [Doctoral Dissertation]. Florida International University; 2010. Available from: http://digitalcommons.fiu.edu/etd/145 ; 10.25148/etd.FI10041619 ; FI10041619

[1] [2]

.