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:(Lagrange Relaxation). Showing records 1 – 8 of 8 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


University of Ontario Institute of Technology

1. Chen, Jiangwei. Multi-antenna relay network beamforming design for multiuser peer-to-peer communications.

Degree: 2014, University of Ontario Institute of Technology

 In this work, we consider a multi-user peer-to-peer relay network with multiple multiantenna relays which employ amplify-and-forward relaying protocol. Assuming distributed relay beamforming strategy, we… (more)

Subjects/Keywords: Multi-user peer-to-peer relay network; Lagrange dual domain; Semi-definite relaxation; (SDR); Signal-to-noise ratio

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chen, J. (2014). Multi-antenna relay network beamforming design for multiuser peer-to-peer communications. (Thesis). University of Ontario Institute of Technology. Retrieved from http://hdl.handle.net/10155/446

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

Chicago Manual of Style (16th Edition):

Chen, Jiangwei. “Multi-antenna relay network beamforming design for multiuser peer-to-peer communications.” 2014. Thesis, University of Ontario Institute of Technology. Accessed June 20, 2019. http://hdl.handle.net/10155/446.

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

MLA Handbook (7th Edition):

Chen, Jiangwei. “Multi-antenna relay network beamforming design for multiuser peer-to-peer communications.” 2014. Web. 20 Jun 2019.

Vancouver:

Chen J. Multi-antenna relay network beamforming design for multiuser peer-to-peer communications. [Internet] [Thesis]. University of Ontario Institute of Technology; 2014. [cited 2019 Jun 20]. Available from: http://hdl.handle.net/10155/446.

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

Council of Science Editors:

Chen J. Multi-antenna relay network beamforming design for multiuser peer-to-peer communications. [Thesis]. University of Ontario Institute of Technology; 2014. Available from: http://hdl.handle.net/10155/446

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


Curtin University of Technology

2. Loh, Ruen Chze. Using edge-disjoint paths to improve the QoS in computer communications .

Degree: 2010, Curtin University of Technology

 Most of today’s computer communications use only a single (s,t) path to transmit a message from a source node s to a destination node t.… (more)

Subjects/Keywords: Lagrange Relaxation; computer communications; t) communications; edge-disjoint paths; Binary Integer Programming (BIP); Quality-of-Service (QoS); multi (s

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Loh, R. C. (2010). Using edge-disjoint paths to improve the QoS in computer communications . (Thesis). Curtin University of Technology. Retrieved from http://hdl.handle.net/20.500.11937/2222

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

Loh, Ruen Chze. “Using edge-disjoint paths to improve the QoS in computer communications .” 2010. Thesis, Curtin University of Technology. Accessed June 20, 2019. http://hdl.handle.net/20.500.11937/2222.

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

MLA Handbook (7th Edition):

Loh, Ruen Chze. “Using edge-disjoint paths to improve the QoS in computer communications .” 2010. Web. 20 Jun 2019.

Vancouver:

Loh RC. Using edge-disjoint paths to improve the QoS in computer communications . [Internet] [Thesis]. Curtin University of Technology; 2010. [cited 2019 Jun 20]. Available from: http://hdl.handle.net/20.500.11937/2222.

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

Council of Science Editors:

Loh RC. Using edge-disjoint paths to improve the QoS in computer communications . [Thesis]. Curtin University of Technology; 2010. Available from: http://hdl.handle.net/20.500.11937/2222

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


Universidade Federal do Maranhão

3. Aniceto de Deus Pereira Neto. PRÉ-DESPACHO DE POTÊNCIA ATIVA CONSIDERANDO AS ÓTICAS DOS AGENTES GERADORES E DO OPERADOR DO SISTEMA.

Degree: 2008, Universidade Federal do Maranhão

The restructuring and deregulation of electricity markets has caused signicant changes in electrical power systems in several countries. This process has result in a market-based… (more)

Subjects/Keywords: Ambiente Competitivo; ENGENHARIA ELETRICA; Unit Commitment; Power Systems; Evolution Strategies; Relaxação de Lagrange; Sistemas de Potência; Mercado de Energia Elétrica; Lagrange Relaxation; Security System Operation; Restrições de Sistema; Estratégias Evolutivas; Competitive Environment; Pré-Despacho de Potência; Electricity Market

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Neto, A. d. D. P. (2008). PRÉ-DESPACHO DE POTÊNCIA ATIVA CONSIDERANDO AS ÓTICAS DOS AGENTES GERADORES E DO OPERADOR DO SISTEMA. (Thesis). Universidade Federal do Maranhão. Retrieved from http://www.tedebc.ufma.br//tde_busca/arquivo.php?codArquivo=204

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

Neto, Aniceto de Deus Pereira. “PRÉ-DESPACHO DE POTÊNCIA ATIVA CONSIDERANDO AS ÓTICAS DOS AGENTES GERADORES E DO OPERADOR DO SISTEMA.” 2008. Thesis, Universidade Federal do Maranhão. Accessed June 20, 2019. http://www.tedebc.ufma.br//tde_busca/arquivo.php?codArquivo=204.

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

MLA Handbook (7th Edition):

Neto, Aniceto de Deus Pereira. “PRÉ-DESPACHO DE POTÊNCIA ATIVA CONSIDERANDO AS ÓTICAS DOS AGENTES GERADORES E DO OPERADOR DO SISTEMA.” 2008. Web. 20 Jun 2019.

Vancouver:

Neto AdDP. PRÉ-DESPACHO DE POTÊNCIA ATIVA CONSIDERANDO AS ÓTICAS DOS AGENTES GERADORES E DO OPERADOR DO SISTEMA. [Internet] [Thesis]. Universidade Federal do Maranhão; 2008. [cited 2019 Jun 20]. Available from: http://www.tedebc.ufma.br//tde_busca/arquivo.php?codArquivo=204.

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

Council of Science Editors:

Neto AdDP. PRÉ-DESPACHO DE POTÊNCIA ATIVA CONSIDERANDO AS ÓTICAS DOS AGENTES GERADORES E DO OPERADOR DO SISTEMA. [Thesis]. Universidade Federal do Maranhão; 2008. Available from: http://www.tedebc.ufma.br//tde_busca/arquivo.php?codArquivo=204

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

4. Neamatian Monemi, Rahimeh. Fixed cardinality linear ordering problem, polyhedral studies and solution methods : Problème d'ordre linéaire sous containte de cardinalité, étude polyédrale et méthodes de résolution.

Degree: Docteur es, Informatique, Recherche Opérationnelle, 2014, Université Blaise-Pascale, Clermont-Ferrand II

 Le problème d’ordre linéaire (LOP) a reçu beaucoup d’attention dans différents domaines d’application, allant de l’archéologie à l’ordonnancement en passant par l’économie et même de… (more)

Subjects/Keywords: Optimisation; Recherche opérationnelle; NP-difficile; Programmation mathématiques; Programmation nombres entiers; Méthodes de résolution exacte; Polyèdres; Dimension de polytope; Facette; Relaxation Lagrange; Décomposition Lagrange; Décomposition Benders; Méthode de relax-and-cut; Méthode de plans sécants; Méthode de Bundle; Borne duale; Optimization; Operations research; NP-hard; Mathematical programming; Integer programming; Exact solution method; Polyhedral; Polytope dimension; Facet defining inequalities; Lagrangian relaxation; Lagrangian decomposition; Benders decomposition; Relax-and-cut; Cutting plane algorithm; Bundle method; Dual bound

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Neamatian Monemi, R. (2014). Fixed cardinality linear ordering problem, polyhedral studies and solution methods : Problème d'ordre linéaire sous containte de cardinalité, étude polyédrale et méthodes de résolution. (Doctoral Dissertation). Université Blaise-Pascale, Clermont-Ferrand II. Retrieved from http://www.theses.fr/2014CLF22516

Chicago Manual of Style (16th Edition):

Neamatian Monemi, Rahimeh. “Fixed cardinality linear ordering problem, polyhedral studies and solution methods : Problème d'ordre linéaire sous containte de cardinalité, étude polyédrale et méthodes de résolution.” 2014. Doctoral Dissertation, Université Blaise-Pascale, Clermont-Ferrand II. Accessed June 20, 2019. http://www.theses.fr/2014CLF22516.

MLA Handbook (7th Edition):

Neamatian Monemi, Rahimeh. “Fixed cardinality linear ordering problem, polyhedral studies and solution methods : Problème d'ordre linéaire sous containte de cardinalité, étude polyédrale et méthodes de résolution.” 2014. Web. 20 Jun 2019.

Vancouver:

Neamatian Monemi R. Fixed cardinality linear ordering problem, polyhedral studies and solution methods : Problème d'ordre linéaire sous containte de cardinalité, étude polyédrale et méthodes de résolution. [Internet] [Doctoral dissertation]. Université Blaise-Pascale, Clermont-Ferrand II; 2014. [cited 2019 Jun 20]. Available from: http://www.theses.fr/2014CLF22516.

Council of Science Editors:

Neamatian Monemi R. Fixed cardinality linear ordering problem, polyhedral studies and solution methods : Problème d'ordre linéaire sous containte de cardinalité, étude polyédrale et méthodes de résolution. [Doctoral Dissertation]. Université Blaise-Pascale, Clermont-Ferrand II; 2014. Available from: http://www.theses.fr/2014CLF22516


Georgia Tech

5. Ormeci, Melda. Inventory Control In A Build-To-Order Environment.

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

 This dissertation consists of three independent sections: In the first part, focusing on the auto industry we look at the challenges and solution strategies of… (more)

Subjects/Keywords: Stochastic inventory control; International logistics; Brownian motion; Impulse control; Lagrangian relaxation; Business logistics; Lagrange equations; Automobile industry and trade Inventory control

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ormeci, M. (2006). Inventory Control In A Build-To-Order Environment. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/11532

Chicago Manual of Style (16th Edition):

Ormeci, Melda. “Inventory Control In A Build-To-Order Environment.” 2006. Doctoral Dissertation, Georgia Tech. Accessed June 20, 2019. http://hdl.handle.net/1853/11532.

MLA Handbook (7th Edition):

Ormeci, Melda. “Inventory Control In A Build-To-Order Environment.” 2006. Web. 20 Jun 2019.

Vancouver:

Ormeci M. Inventory Control In A Build-To-Order Environment. [Internet] [Doctoral dissertation]. Georgia Tech; 2006. [cited 2019 Jun 20]. Available from: http://hdl.handle.net/1853/11532.

Council of Science Editors:

Ormeci M. Inventory Control In A Build-To-Order Environment. [Doctoral Dissertation]. Georgia Tech; 2006. Available from: http://hdl.handle.net/1853/11532

6. Awi, Romeo Olivier. Minimization problems involving polyconvex integrands.

Degree: PhD, Mathematics, 2015, Georgia Tech

 This thesis is mainly concerned with problems in the areas of the Calculus of Variations and Partial Differential Equations (PDEs). The properties of the functional… (more)

Subjects/Keywords: Relaxation; Duality; Lack of compactness; Euler-lagrange equations and polar factorization

…importance in this study: 1. Relaxation 2. Duality 3. Euler-Lagrange Equation and Polar… …Lagrange Equations. In most cases, these Euler–Lagrange Equations are difficult to identify and… …These Euler– Lagrange equations could provide a way to link the minimization problem (1… …the Euler-Lagrange equation of the minimization problem is (10). Typically, one… …and the Euler-Lagrange equations associated to (11). 1.2 Main results. We focus… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Awi, R. O. (2015). Minimization problems involving polyconvex integrands. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/53901

Chicago Manual of Style (16th Edition):

Awi, Romeo Olivier. “Minimization problems involving polyconvex integrands.” 2015. Doctoral Dissertation, Georgia Tech. Accessed June 20, 2019. http://hdl.handle.net/1853/53901.

MLA Handbook (7th Edition):

Awi, Romeo Olivier. “Minimization problems involving polyconvex integrands.” 2015. Web. 20 Jun 2019.

Vancouver:

Awi RO. Minimization problems involving polyconvex integrands. [Internet] [Doctoral dissertation]. Georgia Tech; 2015. [cited 2019 Jun 20]. Available from: http://hdl.handle.net/1853/53901.

Council of Science Editors:

Awi RO. Minimization problems involving polyconvex integrands. [Doctoral Dissertation]. Georgia Tech; 2015. Available from: http://hdl.handle.net/1853/53901


Curtin University of Technology

7. Grigoleit, Mark Ted. Optimisation of large scale network problems .

Degree: 2008, Curtin University of Technology

 The Constrained Shortest Path Problem (CSPP) consists of finding the shortest path in a graph or network that satisfies one or more resource constraints. Without… (more)

Subjects/Keywords: large grid networks; random valued network; Lagrange relaxation; Constraint programming; Constrained Shortest Path Problem (CSPP); submarine transit path problem; single side constraint

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Grigoleit, M. T. (2008). Optimisation of large scale network problems . (Thesis). Curtin University of Technology. Retrieved from http://hdl.handle.net/20.500.11937/1405

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

Grigoleit, Mark Ted. “Optimisation of large scale network problems .” 2008. Thesis, Curtin University of Technology. Accessed June 20, 2019. http://hdl.handle.net/20.500.11937/1405.

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

MLA Handbook (7th Edition):

Grigoleit, Mark Ted. “Optimisation of large scale network problems .” 2008. Web. 20 Jun 2019.

Vancouver:

Grigoleit MT. Optimisation of large scale network problems . [Internet] [Thesis]. Curtin University of Technology; 2008. [cited 2019 Jun 20]. Available from: http://hdl.handle.net/20.500.11937/1405.

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

Council of Science Editors:

Grigoleit MT. Optimisation of large scale network problems . [Thesis]. Curtin University of Technology; 2008. Available from: http://hdl.handle.net/20.500.11937/1405

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


Université de Montréal

8. Moreau, Francis. Choix d'un associateur 2-D pour le balayage multiple et optimisation de l'estimation des pistes .

Degree: 2009, Université de Montréal

Subjects/Keywords: Fusion des données; Pistage; Association de données; Relaxation lagrangienne; Programmation linéaire; Association à S dimension; Algorithme d'enchère; JVC; Optimisation; Senseurs multiples; 5aData fusion; Tracking; Data association; Lagrange relaxation; Linear programming; S dimensional association; Auction algorithm; JVC; Optimization; Multi-sensor

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Moreau, F. (2009). Choix d'un associateur 2-D pour le balayage multiple et optimisation de l'estimation des pistes . (Thesis). Université de Montréal. Retrieved from http://hdl.handle.net/1866/7881

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

Moreau, Francis. “Choix d'un associateur 2-D pour le balayage multiple et optimisation de l'estimation des pistes .” 2009. Thesis, Université de Montréal. Accessed June 20, 2019. http://hdl.handle.net/1866/7881.

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

MLA Handbook (7th Edition):

Moreau, Francis. “Choix d'un associateur 2-D pour le balayage multiple et optimisation de l'estimation des pistes .” 2009. Web. 20 Jun 2019.

Vancouver:

Moreau F. Choix d'un associateur 2-D pour le balayage multiple et optimisation de l'estimation des pistes . [Internet] [Thesis]. Université de Montréal; 2009. [cited 2019 Jun 20]. Available from: http://hdl.handle.net/1866/7881.

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

Council of Science Editors:

Moreau F. Choix d'un associateur 2-D pour le balayage multiple et optimisation de l'estimation des pistes . [Thesis]. Université de Montréal; 2009. Available from: http://hdl.handle.net/1866/7881

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

.