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:(Linear programming relaxation). Showing records 1 – 18 of 18 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


University of Florida

1. Nguyen, Trang Thi Le. Convexification Techniques for Complementarity and Multilinear Constraints.

Degree: PhD, Industrial and Systems Engineering, 2013, University of Florida

 In this Dissertation, we develop tighter convex relaxations for polyhedral sets with complementarity constraints and multilinear constraints using tools inspired from integer programming. Firstly, we… (more)

Subjects/Keywords: Algorithms; Integers; Linear inequalities; Linear programming; Mathematical inequalities; Optimal solutions; Polyhedrons; Polynomials; Relaxation techniques; Tableaux; complementarity  – convexification  – multilinear

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Nguyen, T. T. L. (2013). Convexification Techniques for Complementarity and Multilinear Constraints. (Doctoral Dissertation). University of Florida. Retrieved from http://ufdc.ufl.edu/UFE0045295

Chicago Manual of Style (16th Edition):

Nguyen, Trang Thi Le. “Convexification Techniques for Complementarity and Multilinear Constraints.” 2013. Doctoral Dissertation, University of Florida. Accessed January 20, 2020. http://ufdc.ufl.edu/UFE0045295.

MLA Handbook (7th Edition):

Nguyen, Trang Thi Le. “Convexification Techniques for Complementarity and Multilinear Constraints.” 2013. Web. 20 Jan 2020.

Vancouver:

Nguyen TTL. Convexification Techniques for Complementarity and Multilinear Constraints. [Internet] [Doctoral dissertation]. University of Florida; 2013. [cited 2020 Jan 20]. Available from: http://ufdc.ufl.edu/UFE0045295.

Council of Science Editors:

Nguyen TTL. Convexification Techniques for Complementarity and Multilinear Constraints. [Doctoral Dissertation]. University of Florida; 2013. Available from: http://ufdc.ufl.edu/UFE0045295


University of Illinois – Urbana-Champaign

2. Madan, Vivek. On approximability and LP formulations for multicut and feedback set problems.

Degree: PhD, Computer Science, 2018, University of Illinois – Urbana-Champaign

 Graph cut algorithms are an important tool for solving optimization problems in a variety of areas in computer science. Of particular importance is the min… (more)

Subjects/Keywords: Approximation; Multicut; Feedback set; Linear programming relaxation; Hardness of approximation; Linear cut; Multiway cut; Subset feedback set; Flow-cut gap

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Madan, V. (2018). On approximability and LP formulations for multicut and feedback set problems. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/102390

Chicago Manual of Style (16th Edition):

Madan, Vivek. “On approximability and LP formulations for multicut and feedback set problems.” 2018. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed January 20, 2020. http://hdl.handle.net/2142/102390.

MLA Handbook (7th Edition):

Madan, Vivek. “On approximability and LP formulations for multicut and feedback set problems.” 2018. Web. 20 Jan 2020.

Vancouver:

Madan V. On approximability and LP formulations for multicut and feedback set problems. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2018. [cited 2020 Jan 20]. Available from: http://hdl.handle.net/2142/102390.

Council of Science Editors:

Madan V. On approximability and LP formulations for multicut and feedback set problems. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2018. Available from: http://hdl.handle.net/2142/102390


University of Florida

3. Penuel, John. Decomposition Algorithms for Two Stage Stochastic Integer Programming.

Degree: PhD, Industrial and Systems Engineering, 2009, University of Florida

 Stochastic programming seeks to optimize decision making in uncertain conditions. This type of work is typically amenable to decomposition into first- and second-stage decisions. First-stage… (more)

Subjects/Keywords: Algorithms; Cleaning; Distance functions; Heating; Heuristics; Integers; Linear programming; Optimal solutions; Relaxation time; Vertices; algorithms, cutting, integer, plane, programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Penuel, J. (2009). Decomposition Algorithms for Two Stage Stochastic Integer Programming. (Doctoral Dissertation). University of Florida. Retrieved from http://ufdc.ufl.edu/UFE0024769

Chicago Manual of Style (16th Edition):

Penuel, John. “Decomposition Algorithms for Two Stage Stochastic Integer Programming.” 2009. Doctoral Dissertation, University of Florida. Accessed January 20, 2020. http://ufdc.ufl.edu/UFE0024769.

MLA Handbook (7th Edition):

Penuel, John. “Decomposition Algorithms for Two Stage Stochastic Integer Programming.” 2009. Web. 20 Jan 2020.

Vancouver:

Penuel J. Decomposition Algorithms for Two Stage Stochastic Integer Programming. [Internet] [Doctoral dissertation]. University of Florida; 2009. [cited 2020 Jan 20]. Available from: http://ufdc.ufl.edu/UFE0024769.

Council of Science Editors:

Penuel J. Decomposition Algorithms for Two Stage Stochastic Integer Programming. [Doctoral Dissertation]. University of Florida; 2009. Available from: http://ufdc.ufl.edu/UFE0024769


Université de Sherbrooke

4. Joannopoulos, Emilie. Contributions à la résolution globale de problèmes bilinéaires appliqués à l'industrie porcine .

Degree: 2018, Université de Sherbrooke

 Cette thèse porte sur l'élaboration et l'étude de modèles représentant l'alimentation de porcs en croissance. Elle présente deux objectifs principaux. Un objectif pratique et un… (more)

Subjects/Keywords: Modèles mathématiques; Programmation non linéaire; Optimisation globale; Problème bilinéaire; Relaxation convexe; Problème de diète; Modelling; Non linear programming; Global optimization; Bilinear problem; Convex relaxation; Diet problem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Joannopoulos, E. (2018). Contributions à la résolution globale de problèmes bilinéaires appliqués à l'industrie porcine . (Doctoral Dissertation). Université de Sherbrooke. Retrieved from http://hdl.handle.net/11143/12375

Chicago Manual of Style (16th Edition):

Joannopoulos, Emilie. “Contributions à la résolution globale de problèmes bilinéaires appliqués à l'industrie porcine .” 2018. Doctoral Dissertation, Université de Sherbrooke. Accessed January 20, 2020. http://hdl.handle.net/11143/12375.

MLA Handbook (7th Edition):

Joannopoulos, Emilie. “Contributions à la résolution globale de problèmes bilinéaires appliqués à l'industrie porcine .” 2018. Web. 20 Jan 2020.

Vancouver:

Joannopoulos E. Contributions à la résolution globale de problèmes bilinéaires appliqués à l'industrie porcine . [Internet] [Doctoral dissertation]. Université de Sherbrooke; 2018. [cited 2020 Jan 20]. Available from: http://hdl.handle.net/11143/12375.

Council of Science Editors:

Joannopoulos E. Contributions à la résolution globale de problèmes bilinéaires appliqués à l'industrie porcine . [Doctoral Dissertation]. Université de Sherbrooke; 2018. Available from: http://hdl.handle.net/11143/12375

5. Moura, Victor Cavinato. Programação de frota de embarcações de lançamento de dutos.

Degree: Mestrado, Engenharia Naval e Oceânica, 2012, University of São Paulo

A presente pesquisa considera o problema de programação de uma frota de embarcações de lançamentos de dutos, conhecidas como Pipe Layer Support Vessel (PLSVs), as… (more)

Subjects/Keywords: Apoio marítimo offshore; Heurísticas; Heuristics; Lagrangean relaxation; Mixed Integer Linear Programming; Offshore support vessels; Programação de veículos; Programação Linear Inteira Mista; Relaxação Lagrangiana; Vehicle scheduling

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Moura, V. C. (2012). Programação de frota de embarcações de lançamento de dutos. (Masters Thesis). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/3/3135/tde-13062013-170706/ ;

Chicago Manual of Style (16th Edition):

Moura, Victor Cavinato. “Programação de frota de embarcações de lançamento de dutos.” 2012. Masters Thesis, University of São Paulo. Accessed January 20, 2020. http://www.teses.usp.br/teses/disponiveis/3/3135/tde-13062013-170706/ ;.

MLA Handbook (7th Edition):

Moura, Victor Cavinato. “Programação de frota de embarcações de lançamento de dutos.” 2012. Web. 20 Jan 2020.

Vancouver:

Moura VC. Programação de frota de embarcações de lançamento de dutos. [Internet] [Masters thesis]. University of São Paulo; 2012. [cited 2020 Jan 20]. Available from: http://www.teses.usp.br/teses/disponiveis/3/3135/tde-13062013-170706/ ;.

Council of Science Editors:

Moura VC. Programação de frota de embarcações de lançamento de dutos. [Masters Thesis]. University of São Paulo; 2012. Available from: http://www.teses.usp.br/teses/disponiveis/3/3135/tde-13062013-170706/ ;


University of Florida

6. Yalamanchili, Vijay Krishna. Topology Optimization of Structures Using Global Stress Measure.

Degree: MS, Mechanical Engineering - Mechanical and Aerospace Engineering, 2012, University of Florida

 Topology optimization is a mathematical approach to determine the optimal distribution of material within a given design space. Minimization of compliance for a given mass… (more)

Subjects/Keywords: Data smoothing; Design optimization; Linear programming; Objective functions; Plane stress; Shape optimization; Stress distribution; Stress functions; Stress relaxation; Topology; constraints  – global  – optimization  – stress  – topology

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Yalamanchili, V. K. (2012). Topology Optimization of Structures Using Global Stress Measure. (Masters Thesis). University of Florida. Retrieved from http://ufdc.ufl.edu/UFE0044267

Chicago Manual of Style (16th Edition):

Yalamanchili, Vijay Krishna. “Topology Optimization of Structures Using Global Stress Measure.” 2012. Masters Thesis, University of Florida. Accessed January 20, 2020. http://ufdc.ufl.edu/UFE0044267.

MLA Handbook (7th Edition):

Yalamanchili, Vijay Krishna. “Topology Optimization of Structures Using Global Stress Measure.” 2012. Web. 20 Jan 2020.

Vancouver:

Yalamanchili VK. Topology Optimization of Structures Using Global Stress Measure. [Internet] [Masters thesis]. University of Florida; 2012. [cited 2020 Jan 20]. Available from: http://ufdc.ufl.edu/UFE0044267.

Council of Science Editors:

Yalamanchili VK. Topology Optimization of Structures Using Global Stress Measure. [Masters Thesis]. University of Florida; 2012. Available from: http://ufdc.ufl.edu/UFE0044267


Massey University

7. Wildbore, Bronwyn Louise. Theoretical and computational analysis of the two-stage capacitated plant location problem.

Degree: PhD, Decision Science, 2008, Massey University

 Mathematical models for plant location problems form an important class of integer and mixed-integer linear programs. The Two-Stage Capacitated Plant Location Problem (TSCPLP), the subject(more)

Subjects/Keywords: Decision-making; Mathematical models; Lagrangian relaxation bounds; Linear programming; Theoretical analysis; Computational analysis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wildbore, B. L. (2008). Theoretical and computational analysis of the two-stage capacitated plant location problem. (Doctoral Dissertation). Massey University. Retrieved from http://hdl.handle.net/10179/660

Chicago Manual of Style (16th Edition):

Wildbore, Bronwyn Louise. “Theoretical and computational analysis of the two-stage capacitated plant location problem.” 2008. Doctoral Dissertation, Massey University. Accessed January 20, 2020. http://hdl.handle.net/10179/660.

MLA Handbook (7th Edition):

Wildbore, Bronwyn Louise. “Theoretical and computational analysis of the two-stage capacitated plant location problem.” 2008. Web. 20 Jan 2020.

Vancouver:

Wildbore BL. Theoretical and computational analysis of the two-stage capacitated plant location problem. [Internet] [Doctoral dissertation]. Massey University; 2008. [cited 2020 Jan 20]. Available from: http://hdl.handle.net/10179/660.

Council of Science Editors:

Wildbore BL. Theoretical and computational analysis of the two-stage capacitated plant location problem. [Doctoral Dissertation]. Massey University; 2008. Available from: http://hdl.handle.net/10179/660


Vrije Universiteit Amsterdam

8. El-Kebir, M. Networks, modules and breeding schedules: Applications of Combinatorial Optimization to Computational Biology .

Degree: 2015, Vrije Universiteit Amsterdam

Subjects/Keywords: combinatorial optimization; computation biology; network alignment; Lagrangian relaxation; mixed-integer linear programming; visualization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

El-Kebir, M. (2015). Networks, modules and breeding schedules: Applications of Combinatorial Optimization to Computational Biology . (Doctoral Dissertation). Vrije Universiteit Amsterdam. Retrieved from http://hdl.handle.net/1871/53449

Chicago Manual of Style (16th Edition):

El-Kebir, M. “Networks, modules and breeding schedules: Applications of Combinatorial Optimization to Computational Biology .” 2015. Doctoral Dissertation, Vrije Universiteit Amsterdam. Accessed January 20, 2020. http://hdl.handle.net/1871/53449.

MLA Handbook (7th Edition):

El-Kebir, M. “Networks, modules and breeding schedules: Applications of Combinatorial Optimization to Computational Biology .” 2015. Web. 20 Jan 2020.

Vancouver:

El-Kebir M. Networks, modules and breeding schedules: Applications of Combinatorial Optimization to Computational Biology . [Internet] [Doctoral dissertation]. Vrije Universiteit Amsterdam; 2015. [cited 2020 Jan 20]. Available from: http://hdl.handle.net/1871/53449.

Council of Science Editors:

El-Kebir M. Networks, modules and breeding schedules: Applications of Combinatorial Optimization to Computational Biology . [Doctoral Dissertation]. Vrije Universiteit Amsterdam; 2015. Available from: http://hdl.handle.net/1871/53449


University of Akron

9. Sands, William Alvah. Phylogenetic Inference Using a Discrete-Integer Linear Programming Model.

Degree: MS, Applied Mathematics, 2017, University of Akron

 Combinatorial methods have proved to be useful in generating relaxations of polytopes in various areas of mathematical programming. In this work, we propose a discrete-integer… (more)

Subjects/Keywords: Applied Mathematics; Biology; Phylogenetics; Trees; Distance Methods; Balanced Minimal Evolution; Polytopes; Relaxation; Linear Programming; Discrete Constraints; Branch and Bound; Heuristic; Large Neighborhood Search

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sands, W. A. (2017). Phylogenetic Inference Using a Discrete-Integer Linear Programming Model. (Masters Thesis). University of Akron. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=akron1492783280743802

Chicago Manual of Style (16th Edition):

Sands, William Alvah. “Phylogenetic Inference Using a Discrete-Integer Linear Programming Model.” 2017. Masters Thesis, University of Akron. Accessed January 20, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=akron1492783280743802.

MLA Handbook (7th Edition):

Sands, William Alvah. “Phylogenetic Inference Using a Discrete-Integer Linear Programming Model.” 2017. Web. 20 Jan 2020.

Vancouver:

Sands WA. Phylogenetic Inference Using a Discrete-Integer Linear Programming Model. [Internet] [Masters thesis]. University of Akron; 2017. [cited 2020 Jan 20]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=akron1492783280743802.

Council of Science Editors:

Sands WA. Phylogenetic Inference Using a Discrete-Integer Linear Programming Model. [Masters Thesis]. University of Akron; 2017. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=akron1492783280743802


University of Florida

10. Kumar, Gollakota Surya, 1939-. Iterative methods for solving large-scale linear programs.

Degree: 1979, University of Florida

Subjects/Keywords: Algorithms; Linear inequalities; Linear programming; Mathematical procedures; Mathematical programming; Mathematical relaxation method; Mathematics; Perceptron convergence procedure; Polyhedrons; Simplex method; Linear programming; Management thesis Ph. D

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kumar, Gollakota Surya, 1. (1979). Iterative methods for solving large-scale linear programs. (Thesis). University of Florida. Retrieved from http://ufdc.ufl.edu/UF00097456

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

Kumar, Gollakota Surya, 1939-. “Iterative methods for solving large-scale linear programs.” 1979. Thesis, University of Florida. Accessed January 20, 2020. http://ufdc.ufl.edu/UF00097456.

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

MLA Handbook (7th Edition):

Kumar, Gollakota Surya, 1939-. “Iterative methods for solving large-scale linear programs.” 1979. Web. 20 Jan 2020.

Vancouver:

Kumar, Gollakota Surya 1. Iterative methods for solving large-scale linear programs. [Internet] [Thesis]. University of Florida; 1979. [cited 2020 Jan 20]. Available from: http://ufdc.ufl.edu/UF00097456.

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

Council of Science Editors:

Kumar, Gollakota Surya 1. Iterative methods for solving large-scale linear programs. [Thesis]. University of Florida; 1979. Available from: http://ufdc.ufl.edu/UF00097456

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


Delft University of Technology

11. Ploussard, Q. Efficient reduction techniques for a large-scale Transmission Expansion Planning problem.

Degree: 2019, Delft University of Technology

 The aim of Transmission Expansion Planning (TEP) studies is to decide which, where, and when new grid elements should be built in order to minimize… (more)

Subjects/Keywords: energy; electrictity; transmission expansion planning; linear programming; integer linear programming; relaxation methods; clustering; dimension reduction; network theory (graphs); partitioning algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ploussard, Q. (2019). Efficient reduction techniques for a large-scale Transmission Expansion Planning problem. (Doctoral Dissertation). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:a98046eb-d641-446d-90af-f40dbacb63cc ; urn:NBN:nl:ui:24-uuid:a98046eb-d641-446d-90af-f40dbacb63cc ; a98046eb-d641-446d-90af-f40dbacb63cc ; 10.4233/uuid:a98046eb-d641-446d-90af-f40dbacb63cc ; urn:isbn:978-84-09-05576-0 ; urn:NBN:nl:ui:24-uuid:a98046eb-d641-446d-90af-f40dbacb63cc ; http://resolver.tudelft.nl/uuid:a98046eb-d641-446d-90af-f40dbacb63cc

Chicago Manual of Style (16th Edition):

Ploussard, Q. “Efficient reduction techniques for a large-scale Transmission Expansion Planning problem.” 2019. Doctoral Dissertation, Delft University of Technology. Accessed January 20, 2020. http://resolver.tudelft.nl/uuid:a98046eb-d641-446d-90af-f40dbacb63cc ; urn:NBN:nl:ui:24-uuid:a98046eb-d641-446d-90af-f40dbacb63cc ; a98046eb-d641-446d-90af-f40dbacb63cc ; 10.4233/uuid:a98046eb-d641-446d-90af-f40dbacb63cc ; urn:isbn:978-84-09-05576-0 ; urn:NBN:nl:ui:24-uuid:a98046eb-d641-446d-90af-f40dbacb63cc ; http://resolver.tudelft.nl/uuid:a98046eb-d641-446d-90af-f40dbacb63cc.

MLA Handbook (7th Edition):

Ploussard, Q. “Efficient reduction techniques for a large-scale Transmission Expansion Planning problem.” 2019. Web. 20 Jan 2020.

Vancouver:

Ploussard Q. Efficient reduction techniques for a large-scale Transmission Expansion Planning problem. [Internet] [Doctoral dissertation]. Delft University of Technology; 2019. [cited 2020 Jan 20]. Available from: http://resolver.tudelft.nl/uuid:a98046eb-d641-446d-90af-f40dbacb63cc ; urn:NBN:nl:ui:24-uuid:a98046eb-d641-446d-90af-f40dbacb63cc ; a98046eb-d641-446d-90af-f40dbacb63cc ; 10.4233/uuid:a98046eb-d641-446d-90af-f40dbacb63cc ; urn:isbn:978-84-09-05576-0 ; urn:NBN:nl:ui:24-uuid:a98046eb-d641-446d-90af-f40dbacb63cc ; http://resolver.tudelft.nl/uuid:a98046eb-d641-446d-90af-f40dbacb63cc.

Council of Science Editors:

Ploussard Q. Efficient reduction techniques for a large-scale Transmission Expansion Planning problem. [Doctoral Dissertation]. Delft University of Technology; 2019. Available from: http://resolver.tudelft.nl/uuid:a98046eb-d641-446d-90af-f40dbacb63cc ; urn:NBN:nl:ui:24-uuid:a98046eb-d641-446d-90af-f40dbacb63cc ; a98046eb-d641-446d-90af-f40dbacb63cc ; 10.4233/uuid:a98046eb-d641-446d-90af-f40dbacb63cc ; urn:isbn:978-84-09-05576-0 ; urn:NBN:nl:ui:24-uuid:a98046eb-d641-446d-90af-f40dbacb63cc ; http://resolver.tudelft.nl/uuid:a98046eb-d641-446d-90af-f40dbacb63cc

12. Benhizia, Faten. OPTIMISATION DU PLAN DE TRANSPORT PAR PLANIFICATION INTEGREE DES RESSOURCES : INTEGRATED PLANNING OF RAILWAY TRANSPORTATION RESOURCES.

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

La production des circulations ferroviaires a la sncf repose actuellement sur un processus essentiellement sequentiel dans lequel la conception des grilles horaires de circulation (reservation… (more)

Subjects/Keywords: RECHERCHE OPERATIONNELLE; PLANIFICATION INTEGREE DES RESSOURCES FERROVIAIRES; RELAXATION LAGRANGIENNE; PRODUCTION DE CIRCULATIONS FERROVIAIRES; PROGRAMMATION LINEAIRE EN VARIABLES MIXTES; OPTIMISATION; TRANSPORT FERROVIAIRE; Integrated planning of railway transportation resources; Mixed integer linear programming formulation; Planning of railway production; Lagrangian relaxation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Benhizia, F. (2012). OPTIMISATION DU PLAN DE TRANSPORT PAR PLANIFICATION INTEGREE DES RESSOURCES : INTEGRATED PLANNING OF RAILWAY TRANSPORTATION RESOURCES. (Doctoral Dissertation). Saint-Etienne, EMSE. Retrieved from http://www.theses.fr/2012EMSE0668

Chicago Manual of Style (16th Edition):

Benhizia, Faten. “OPTIMISATION DU PLAN DE TRANSPORT PAR PLANIFICATION INTEGREE DES RESSOURCES : INTEGRATED PLANNING OF RAILWAY TRANSPORTATION RESOURCES.” 2012. Doctoral Dissertation, Saint-Etienne, EMSE. Accessed January 20, 2020. http://www.theses.fr/2012EMSE0668.

MLA Handbook (7th Edition):

Benhizia, Faten. “OPTIMISATION DU PLAN DE TRANSPORT PAR PLANIFICATION INTEGREE DES RESSOURCES : INTEGRATED PLANNING OF RAILWAY TRANSPORTATION RESOURCES.” 2012. Web. 20 Jan 2020.

Vancouver:

Benhizia F. OPTIMISATION DU PLAN DE TRANSPORT PAR PLANIFICATION INTEGREE DES RESSOURCES : INTEGRATED PLANNING OF RAILWAY TRANSPORTATION RESOURCES. [Internet] [Doctoral dissertation]. Saint-Etienne, EMSE; 2012. [cited 2020 Jan 20]. Available from: http://www.theses.fr/2012EMSE0668.

Council of Science Editors:

Benhizia F. OPTIMISATION DU PLAN DE TRANSPORT PAR PLANIFICATION INTEGREE DES RESSOURCES : INTEGRATED PLANNING OF RAILWAY TRANSPORTATION RESOURCES. [Doctoral Dissertation]. Saint-Etienne, EMSE; 2012. Available from: http://www.theses.fr/2012EMSE0668


Colorado School of Mines

13. Steeger, Gregory M. Strategic bidding for price-maker hydroelectric producers.

Degree: PhD, Economics and Business, 2007, Colorado School of Mines

 Hydropower is arguably the most important and widely used renewable energy source in the world. Deregulation has led to the use of auction-based markets while… (more)

Subjects/Keywords: Mixed-integer linear programming; Benders decomposition; Bidding problem; Hydroelectric; Lagrangian relaxation; Stochastic dual dynamic programming; Water-power  – Economic aspects; Linear programming; Deregulation; Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Steeger, G. M. (2007). Strategic bidding for price-maker hydroelectric producers. (Doctoral Dissertation). Colorado School of Mines. Retrieved from http://hdl.handle.net/11124/486

Chicago Manual of Style (16th Edition):

Steeger, Gregory M. “Strategic bidding for price-maker hydroelectric producers.” 2007. Doctoral Dissertation, Colorado School of Mines. Accessed January 20, 2020. http://hdl.handle.net/11124/486.

MLA Handbook (7th Edition):

Steeger, Gregory M. “Strategic bidding for price-maker hydroelectric producers.” 2007. Web. 20 Jan 2020.

Vancouver:

Steeger GM. Strategic bidding for price-maker hydroelectric producers. [Internet] [Doctoral dissertation]. Colorado School of Mines; 2007. [cited 2020 Jan 20]. Available from: http://hdl.handle.net/11124/486.

Council of Science Editors:

Steeger GM. Strategic bidding for price-maker hydroelectric producers. [Doctoral Dissertation]. Colorado School of Mines; 2007. Available from: http://hdl.handle.net/11124/486

14. Carlos Renato Seabra Almeida Junior. Relaxação lagrangeana com divisão em clusters aplicada ao problema da diversidade máxima.

Degree: 2009, Instituto Nacional de Pesquisas Espaciais

O Problema da Diversidade Máxima é um problema de natureza combinatória com o objetivo de selecionar os m itens mais distintos de um conjunto N… (more)

Subjects/Keywords: problema da diversidade máxima; geração de colunas; relaxação lagrangeana; método dos subgradientes; particionamento de grafo; otimização combinatória; programação linear; maximun diversity problem; column generation; lagrangean relaxation; sub gradients method; graph partitioning; combinatorial optimizatiom; linear programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Junior, C. R. S. A. (2009). Relaxação lagrangeana com divisão em clusters aplicada ao problema da diversidade máxima. (Thesis). Instituto Nacional de Pesquisas Espaciais. Retrieved from http://urlib.net/sid.inpe.br/[email protected]/2009/04.24.16.45

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

Junior, Carlos Renato Seabra Almeida. “Relaxação lagrangeana com divisão em clusters aplicada ao problema da diversidade máxima.” 2009. Thesis, Instituto Nacional de Pesquisas Espaciais. Accessed January 20, 2020. http://urlib.net/sid.inpe.br/[email protected]/2009/04.24.16.45.

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

MLA Handbook (7th Edition):

Junior, Carlos Renato Seabra Almeida. “Relaxação lagrangeana com divisão em clusters aplicada ao problema da diversidade máxima.” 2009. Web. 20 Jan 2020.

Vancouver:

Junior CRSA. Relaxação lagrangeana com divisão em clusters aplicada ao problema da diversidade máxima. [Internet] [Thesis]. Instituto Nacional de Pesquisas Espaciais; 2009. [cited 2020 Jan 20]. Available from: http://urlib.net/sid.inpe.br/[email protected]/2009/04.24.16.45.

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

Council of Science Editors:

Junior CRSA. Relaxação lagrangeana com divisão em clusters aplicada ao problema da diversidade máxima. [Thesis]. Instituto Nacional de Pesquisas Espaciais; 2009. Available from: http://urlib.net/sid.inpe.br/[email protected]/2009/04.24.16.45

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

15. Penaranda, Adriana Gomes. Modelos e heurísticas para o problema de controle de densidade em redes de sensores sem fio planas.

Degree: 2013, Universidade Federal do Amazonas

As Redes de Sensores Sem Fios (RSSFs) são redes compostas por um grande número de nós de sensores. Estas redes necessitam de controle de densidade… (more)

Subjects/Keywords: Redes de sensores sem fios; Problema de controle de densidade; Relaxação lagrangeana; Programação linear inteira; Wireless sensor networks; Density control problem; Lagrangean relaxation; Integer linear programming; CIÊNCIAS EXATAS E DA TERRA: CIÊNCIA DA COMPUTAÇÃO

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Penaranda, A. G. (2013). Modelos e heurísticas para o problema de controle de densidade em redes de sensores sem fio planas. (Masters Thesis). Universidade Federal do Amazonas. Retrieved from http://tede.ufam.edu.br/handle/tede/2905

Chicago Manual of Style (16th Edition):

Penaranda, Adriana Gomes. “Modelos e heurísticas para o problema de controle de densidade em redes de sensores sem fio planas.” 2013. Masters Thesis, Universidade Federal do Amazonas. Accessed January 20, 2020. http://tede.ufam.edu.br/handle/tede/2905.

MLA Handbook (7th Edition):

Penaranda, Adriana Gomes. “Modelos e heurísticas para o problema de controle de densidade em redes de sensores sem fio planas.” 2013. Web. 20 Jan 2020.

Vancouver:

Penaranda AG. Modelos e heurísticas para o problema de controle de densidade em redes de sensores sem fio planas. [Internet] [Masters thesis]. Universidade Federal do Amazonas; 2013. [cited 2020 Jan 20]. Available from: http://tede.ufam.edu.br/handle/tede/2905.

Council of Science Editors:

Penaranda AG. Modelos e heurísticas para o problema de controle de densidade em redes de sensores sem fio planas. [Masters Thesis]. Universidade Federal do Amazonas; 2013. Available from: http://tede.ufam.edu.br/handle/tede/2905

16. Potthoff, Daniel. Railway Crew Rescheduling: Novel approaches and extensions.

Degree: 2010, Erasmus Research Institute of Management

 textabstractPassenger railway operators meticulously plan how to use the rolling stock and the crew in order to operate the published timetable. However, unexpected events such… (more)

Subjects/Keywords: column generation; crew; disruption management; integer programming; lagrangian relaxation; linear programming; railway; rescheduling; robustness; uncertainty

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Potthoff, D. (2010). Railway Crew Rescheduling: Novel approaches and extensions. (Doctoral Dissertation). Erasmus Research Institute of Management. Retrieved from http://hdl.handle.net/1765/21084

Chicago Manual of Style (16th Edition):

Potthoff, Daniel. “Railway Crew Rescheduling: Novel approaches and extensions.” 2010. Doctoral Dissertation, Erasmus Research Institute of Management. Accessed January 20, 2020. http://hdl.handle.net/1765/21084.

MLA Handbook (7th Edition):

Potthoff, Daniel. “Railway Crew Rescheduling: Novel approaches and extensions.” 2010. Web. 20 Jan 2020.

Vancouver:

Potthoff D. Railway Crew Rescheduling: Novel approaches and extensions. [Internet] [Doctoral dissertation]. Erasmus Research Institute of Management; 2010. [cited 2020 Jan 20]. Available from: http://hdl.handle.net/1765/21084.

Council of Science Editors:

Potthoff D. Railway Crew Rescheduling: Novel approaches and extensions. [Doctoral Dissertation]. Erasmus Research Institute of Management; 2010. Available from: http://hdl.handle.net/1765/21084

17. ΜΕΓΑΛΟΚΟΝΟΜΟΣ, ΓΕΩΡΓΙΟΣ. ΤΟ ΑΝΑΣΤΡΟΦΟ ΠΡΟΒΛΗΜΑ ΔΙΑΚΕΝΤΡΩΝ ΜΕ ΠΕΡΙΟΡΙΣΜΟΥΣ ΧΩΡΗΤΙΚΟΤΗΤΑΣ: ΕΦΑΡΜΟΓΗ ΣΤΗ ΧΩΡΟΘΕΤΗΣΗ ΤΩΝ ΚΕΝΤΡΩΝ ΥΓΕΙΑΣ.

Degree: 1997, Πανεπιστήμιο Πατρών; University of Patras

Η ΔΙΑΤΡΙΒΗ ΑΥΤΗ ΑΣΧΟΛΕΙΤΑΙ ΜΕ ΤΟ ΑΝΑΣΤΡΟΦΟ ΠΡΟΒΛΗΜΑ ΤΩΝ ΔΙΑΚΕΝΤΡΩΝ ΜΕ ΠΕΡΙΟΡΙΣΜΟΥΣ ΧΩΡΗΤΙΚΟΤΗΤΑΣ ΚΑΙ ΔΙΝΕΤΑΙ ΕΜΦΑΣΗ ΣΕ ΜΕΘΟΔΟΥΣ ΒΕΛΤΙΣΤΗΣ ΕΠΙΛΥΣΗΣ ΤΟΥ ΠΡΟΒΛΗΜΑΤΟΣ. ΤΟ ΠΡΟΒΛΗΜΑ ΔΙΑΤΥΠΩΝΕΤΑΙ… (more)

Subjects/Keywords: 0 - 1 Integer programming; 0 - 1 Ακέραιος προγραμματισμός; COMBINATORIAL OPTIMIZATION; LAGRANGEAN RELAXATION; LINEAR PROGRAMMING RELAXATION; LOCATION - CENTER; SUBGRADIENT OPTIMIZATION; ΓΡΑΜΜΙΚΗ ΧΑΛΑΡΩΣΗ; ΠΡΟΒΛΗΜΑΤΑ ΔΙΑΚΕΝΤΡΩΝ; ΣΥΝΔΙΑΣΤΙΚΗ ΒΕΛΤΙΣΤΟΠΟΙΗΣΗ; ΧΑΛΑΡΩΣΗ ΚΑΤΑ LANGRAMGE; Χωροθέτηση

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

ΜΕΓΑΛΟΚΟΝΟΜΟΣ, . (1997). ΤΟ ΑΝΑΣΤΡΟΦΟ ΠΡΟΒΛΗΜΑ ΔΙΑΚΕΝΤΡΩΝ ΜΕ ΠΕΡΙΟΡΙΣΜΟΥΣ ΧΩΡΗΤΙΚΟΤΗΤΑΣ: ΕΦΑΡΜΟΓΗ ΣΤΗ ΧΩΡΟΘΕΤΗΣΗ ΤΩΝ ΚΕΝΤΡΩΝ ΥΓΕΙΑΣ. (Thesis). Πανεπιστήμιο Πατρών; University of Patras. Retrieved from http://hdl.handle.net/10442/hedi/8565

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

ΜΕΓΑΛΟΚΟΝΟΜΟΣ, ΓΕΩΡΓΙΟΣ. “ΤΟ ΑΝΑΣΤΡΟΦΟ ΠΡΟΒΛΗΜΑ ΔΙΑΚΕΝΤΡΩΝ ΜΕ ΠΕΡΙΟΡΙΣΜΟΥΣ ΧΩΡΗΤΙΚΟΤΗΤΑΣ: ΕΦΑΡΜΟΓΗ ΣΤΗ ΧΩΡΟΘΕΤΗΣΗ ΤΩΝ ΚΕΝΤΡΩΝ ΥΓΕΙΑΣ.” 1997. Thesis, Πανεπιστήμιο Πατρών; University of Patras. Accessed January 20, 2020. http://hdl.handle.net/10442/hedi/8565.

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

MLA Handbook (7th Edition):

ΜΕΓΑΛΟΚΟΝΟΜΟΣ, ΓΕΩΡΓΙΟΣ. “ΤΟ ΑΝΑΣΤΡΟΦΟ ΠΡΟΒΛΗΜΑ ΔΙΑΚΕΝΤΡΩΝ ΜΕ ΠΕΡΙΟΡΙΣΜΟΥΣ ΧΩΡΗΤΙΚΟΤΗΤΑΣ: ΕΦΑΡΜΟΓΗ ΣΤΗ ΧΩΡΟΘΕΤΗΣΗ ΤΩΝ ΚΕΝΤΡΩΝ ΥΓΕΙΑΣ.” 1997. Web. 20 Jan 2020.

Vancouver:

ΜΕΓΑΛΟΚΟΝΟΜΟΣ . ΤΟ ΑΝΑΣΤΡΟΦΟ ΠΡΟΒΛΗΜΑ ΔΙΑΚΕΝΤΡΩΝ ΜΕ ΠΕΡΙΟΡΙΣΜΟΥΣ ΧΩΡΗΤΙΚΟΤΗΤΑΣ: ΕΦΑΡΜΟΓΗ ΣΤΗ ΧΩΡΟΘΕΤΗΣΗ ΤΩΝ ΚΕΝΤΡΩΝ ΥΓΕΙΑΣ. [Internet] [Thesis]. Πανεπιστήμιο Πατρών; University of Patras; 1997. [cited 2020 Jan 20]. Available from: http://hdl.handle.net/10442/hedi/8565.

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

Council of Science Editors:

ΜΕΓΑΛΟΚΟΝΟΜΟΣ . ΤΟ ΑΝΑΣΤΡΟΦΟ ΠΡΟΒΛΗΜΑ ΔΙΑΚΕΝΤΡΩΝ ΜΕ ΠΕΡΙΟΡΙΣΜΟΥΣ ΧΩΡΗΤΙΚΟΤΗΤΑΣ: ΕΦΑΡΜΟΓΗ ΣΤΗ ΧΩΡΟΘΕΤΗΣΗ ΤΩΝ ΚΕΝΤΡΩΝ ΥΓΕΙΑΣ. [Thesis]. Πανεπιστήμιο Πατρών; University of Patras; 1997. Available from: http://hdl.handle.net/10442/hedi/8565

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


Université de Montréal

18. 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 January 20, 2020. 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 Jan 2020.

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 2020 Jan 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

.