Advanced search options

Sorted by: relevance · author · university · date | New search

You searched for `subject:(Cutting Plane)`

.
Showing records 1 – 30 of
37 total matches.

Search Limiters

Dates

- 2016 – 2020 (10)
- 2011 – 2015 (13)
- 2006 – 2010 (13)

▼ Search Limiters

University of Utah

1. Pokkunuri, Rama Krishna Sandeep. Exploiting example structure in multiple instance learning.

Degree: MS, Computer Science, 2011, University of Utah

URL: http://content.lib.utah.edu/cdm/singleitem/collection/etd3/id/402/rec/975

► Multiple Instance Learning (MIL) is a type of supervised learning with missing data. Here, each example (a.k.a. bag) has one or more instances. In the…
(more)

Subjects/Keywords: Cutting plane optimization; Machine learning; Multiple instance learning; Structured prediction

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Pokkunuri, R. K. S. (2011). Exploiting example structure in multiple instance learning. (Masters Thesis). University of Utah. Retrieved from http://content.lib.utah.edu/cdm/singleitem/collection/etd3/id/402/rec/975

Chicago Manual of Style (16^{th} Edition):

Pokkunuri, Rama Krishna Sandeep. “Exploiting example structure in multiple instance learning.” 2011. Masters Thesis, University of Utah. Accessed November 30, 2020. http://content.lib.utah.edu/cdm/singleitem/collection/etd3/id/402/rec/975.

MLA Handbook (7^{th} Edition):

Pokkunuri, Rama Krishna Sandeep. “Exploiting example structure in multiple instance learning.” 2011. Web. 30 Nov 2020.

Vancouver:

Pokkunuri RKS. Exploiting example structure in multiple instance learning. [Internet] [Masters thesis]. University of Utah; 2011. [cited 2020 Nov 30]. Available from: http://content.lib.utah.edu/cdm/singleitem/collection/etd3/id/402/rec/975.

Council of Science Editors:

Pokkunuri RKS. Exploiting example structure in multiple instance learning. [Masters Thesis]. University of Utah; 2011. Available from: http://content.lib.utah.edu/cdm/singleitem/collection/etd3/id/402/rec/975

North Carolina State University

2.
Sullivan, Eric Joseph.
Solving the Max-Cut Problem using Semidefinite Optimization in a *Cutting* *Plane* Algorithm.

Degree: MS, Operations Research, 2008, North Carolina State University

URL: http://www.lib.ncsu.edu/resolver/1840.16/2598

► A central graph theory problem that occurs in experimental physics, circuit layout, and computational linear algebra is the max-cut problem. The max-cut problem is to…
(more)

Subjects/Keywords: Cutting Plane; Semidefinite; Max-cut

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Sullivan, E. J. (2008). Solving the Max-Cut Problem using Semidefinite Optimization in a Cutting Plane Algorithm. (Thesis). North Carolina State University. Retrieved from http://www.lib.ncsu.edu/resolver/1840.16/2598

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Sullivan, Eric Joseph. “Solving the Max-Cut Problem using Semidefinite Optimization in a Cutting Plane Algorithm.” 2008. Thesis, North Carolina State University. Accessed November 30, 2020. http://www.lib.ncsu.edu/resolver/1840.16/2598.

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Sullivan, Eric Joseph. “Solving the Max-Cut Problem using Semidefinite Optimization in a Cutting Plane Algorithm.” 2008. Web. 30 Nov 2020.

Vancouver:

Sullivan EJ. Solving the Max-Cut Problem using Semidefinite Optimization in a Cutting Plane Algorithm. [Internet] [Thesis]. North Carolina State University; 2008. [cited 2020 Nov 30]. Available from: http://www.lib.ncsu.edu/resolver/1840.16/2598.

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Sullivan EJ. Solving the Max-Cut Problem using Semidefinite Optimization in a Cutting Plane Algorithm. [Thesis]. North Carolina State University; 2008. Available from: http://www.lib.ncsu.edu/resolver/1840.16/2598

Not specified: Masters Thesis or Doctoral Dissertation

University of Tennessee – Knoxville

3. Zhang, Kaike. Efficient Algorithms for Solving Facility Problems with Disruptions.

Degree: 2017, University of Tennessee – Knoxville

URL: https://trace.tennessee.edu/utk_graddiss/4804

► This study investigates facility location problems in the presence of facility disruptions. Two types of problems are investigated. Firstly, we study a facility location problem…
(more)

Subjects/Keywords: reliable facility location; facility disruptions; fortification; cutting plane algorithm; robust optimization

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Zhang, K. (2017). Efficient Algorithms for Solving Facility Problems with Disruptions. (Doctoral Dissertation). University of Tennessee – Knoxville. Retrieved from https://trace.tennessee.edu/utk_graddiss/4804

Chicago Manual of Style (16^{th} Edition):

Zhang, Kaike. “Efficient Algorithms for Solving Facility Problems with Disruptions.” 2017. Doctoral Dissertation, University of Tennessee – Knoxville. Accessed November 30, 2020. https://trace.tennessee.edu/utk_graddiss/4804.

MLA Handbook (7^{th} Edition):

Zhang, Kaike. “Efficient Algorithms for Solving Facility Problems with Disruptions.” 2017. Web. 30 Nov 2020.

Vancouver:

Zhang K. Efficient Algorithms for Solving Facility Problems with Disruptions. [Internet] [Doctoral dissertation]. University of Tennessee – Knoxville; 2017. [cited 2020 Nov 30]. Available from: https://trace.tennessee.edu/utk_graddiss/4804.

Council of Science Editors:

Zhang K. Efficient Algorithms for Solving Facility Problems with Disruptions. [Doctoral Dissertation]. University of Tennessee – Knoxville; 2017. Available from: https://trace.tennessee.edu/utk_graddiss/4804

4. Da Costa Fontes, Fábio Francisco. Optimization Models and Algorithms for the Design of Global Transportation Networks : Modèles et algorithmes pour la conception de réseaux de transport mondiaux.

Degree: Docteur es, Génie Informatique et Automatique, 2017, Université d'Artois

URL: http://www.theses.fr/2017ARTO0206

►

Le développement de structures de réseau efficaces pour le transport de marchandises est fondamental sur le marché mondial actuel. Les demandes doivent être traitées rapidement,… (more)

Subjects/Keywords: Hub-and-spoke; Sub-hub; Programmation linéaire en nombres entiers binaires; Cutting plane; VNDS; Matheuristic; Hub-and-spoke; Sub-hub; Binary integer linear programming; Cutting plane; VNDS; Matheuristic; 388; 621.39

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Da Costa Fontes, F. F. (2017). Optimization Models and Algorithms for the Design of Global Transportation Networks : Modèles et algorithmes pour la conception de réseaux de transport mondiaux. (Doctoral Dissertation). Université d'Artois. Retrieved from http://www.theses.fr/2017ARTO0206

Chicago Manual of Style (16^{th} Edition):

Da Costa Fontes, Fábio Francisco. “Optimization Models and Algorithms for the Design of Global Transportation Networks : Modèles et algorithmes pour la conception de réseaux de transport mondiaux.” 2017. Doctoral Dissertation, Université d'Artois. Accessed November 30, 2020. http://www.theses.fr/2017ARTO0206.

MLA Handbook (7^{th} Edition):

Da Costa Fontes, Fábio Francisco. “Optimization Models and Algorithms for the Design of Global Transportation Networks : Modèles et algorithmes pour la conception de réseaux de transport mondiaux.” 2017. Web. 30 Nov 2020.

Vancouver:

Da Costa Fontes FF. Optimization Models and Algorithms for the Design of Global Transportation Networks : Modèles et algorithmes pour la conception de réseaux de transport mondiaux. [Internet] [Doctoral dissertation]. Université d'Artois; 2017. [cited 2020 Nov 30]. Available from: http://www.theses.fr/2017ARTO0206.

Council of Science Editors:

Da Costa Fontes FF. Optimization Models and Algorithms for the Design of Global Transportation Networks : Modèles et algorithmes pour la conception de réseaux de transport mondiaux. [Doctoral Dissertation]. Université d'Artois; 2017. Available from: http://www.theses.fr/2017ARTO0206

University of Arizona

5. Chen, Binyuan. FINITE DISJUNCTIVE PROGRAMMING METHODS FOR GENERAL MIXED INTEGER LINEAR PROGRAMS .

Degree: 2011, University of Arizona

URL: http://hdl.handle.net/10150/145120

► In this dissertation, a finitely convergent disjunctive programming procedure, the Convex Hull Tree (CHT) algorithm, is proposed to obtain the convex hull of a general…
(more)

Subjects/Keywords: cutting plane; finite convergence; convex hull; disjunctive programming; mixed-integer linear program

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Chen, B. (2011). FINITE DISJUNCTIVE PROGRAMMING METHODS FOR GENERAL MIXED INTEGER LINEAR PROGRAMS . (Doctoral Dissertation). University of Arizona. Retrieved from http://hdl.handle.net/10150/145120

Chicago Manual of Style (16^{th} Edition):

Chen, Binyuan. “FINITE DISJUNCTIVE PROGRAMMING METHODS FOR GENERAL MIXED INTEGER LINEAR PROGRAMS .” 2011. Doctoral Dissertation, University of Arizona. Accessed November 30, 2020. http://hdl.handle.net/10150/145120.

MLA Handbook (7^{th} Edition):

Chen, Binyuan. “FINITE DISJUNCTIVE PROGRAMMING METHODS FOR GENERAL MIXED INTEGER LINEAR PROGRAMS .” 2011. Web. 30 Nov 2020.

Vancouver:

Chen B. FINITE DISJUNCTIVE PROGRAMMING METHODS FOR GENERAL MIXED INTEGER LINEAR PROGRAMS . [Internet] [Doctoral dissertation]. University of Arizona; 2011. [cited 2020 Nov 30]. Available from: http://hdl.handle.net/10150/145120.

Council of Science Editors:

Chen B. FINITE DISJUNCTIVE PROGRAMMING METHODS FOR GENERAL MIXED INTEGER LINEAR PROGRAMS . [Doctoral Dissertation]. University of Arizona; 2011. Available from: http://hdl.handle.net/10150/145120

Clemson University

6. Wang, Wenshan. Network Target Coordination for Design Optimization of Decomposed Systems.

Degree: PhD, Mechanical Engineering, 2012, Clemson University

URL: https://tigerprints.clemson.edu/all_dissertations/1071

► A complex engineered system is often decomposed into a number of different subsystems that interact on one another and together produce results not obtainable by…
(more)

Subjects/Keywords: Alternating Direction Method of Multipliers; Analytical Target Cascading; Consensus Optimization; Cutting Plane Methods; Multidisciplinary Design Optimization; Network Target Cascading; Mechanical Engineering

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Wang, W. (2012). Network Target Coordination for Design Optimization of Decomposed Systems. (Doctoral Dissertation). Clemson University. Retrieved from https://tigerprints.clemson.edu/all_dissertations/1071

Chicago Manual of Style (16^{th} Edition):

Wang, Wenshan. “Network Target Coordination for Design Optimization of Decomposed Systems.” 2012. Doctoral Dissertation, Clemson University. Accessed November 30, 2020. https://tigerprints.clemson.edu/all_dissertations/1071.

MLA Handbook (7^{th} Edition):

Wang, Wenshan. “Network Target Coordination for Design Optimization of Decomposed Systems.” 2012. Web. 30 Nov 2020.

Vancouver:

Wang W. Network Target Coordination for Design Optimization of Decomposed Systems. [Internet] [Doctoral dissertation]. Clemson University; 2012. [cited 2020 Nov 30]. Available from: https://tigerprints.clemson.edu/all_dissertations/1071.

Council of Science Editors:

Wang W. Network Target Coordination for Design Optimization of Decomposed Systems. [Doctoral Dissertation]. Clemson University; 2012. Available from: https://tigerprints.clemson.edu/all_dissertations/1071

7.
Wang, Qianyi.
Theory and computation of sparse *cutting* planes.

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

URL: http://hdl.handle.net/1853/56307

► *Cutting* *plane* plays an important role in the theory and computation of integer programming. Nowadays, most state-of-the-art integer programming solvers tend to bias their *cutting*…
(more)

Subjects/Keywords: Integer programming; Cutting plane; Sparse; Algorithm; Theory

…all mixed stable sets for 5-cycle . . . . . . . . . . . .
64
ix
SUMMARY
A *cutting* *plane*… …integer programming solvers tend to bias their *cutting*
*plane* selection towards sparse cuts. In… …linear programming (MILP) solvers are based on branch&-bound and *cutting*-*plane* (… …an important criterion
for *cutting*-*plane* selection and use [21, 2, 34]… …*cutting*-*plane* techniques that are based on generation of cuts from
single rows (which…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Wang, Q. (2016). Theory and computation of sparse cutting planes. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/56307

Chicago Manual of Style (16^{th} Edition):

Wang, Qianyi. “Theory and computation of sparse cutting planes.” 2016. Doctoral Dissertation, Georgia Tech. Accessed November 30, 2020. http://hdl.handle.net/1853/56307.

MLA Handbook (7^{th} Edition):

Wang, Qianyi. “Theory and computation of sparse cutting planes.” 2016. Web. 30 Nov 2020.

Vancouver:

Wang Q. Theory and computation of sparse cutting planes. [Internet] [Doctoral dissertation]. Georgia Tech; 2016. [cited 2020 Nov 30]. Available from: http://hdl.handle.net/1853/56307.

Council of Science Editors:

Wang Q. Theory and computation of sparse cutting planes. [Doctoral Dissertation]. Georgia Tech; 2016. Available from: http://hdl.handle.net/1853/56307

8. Shuo, Xu. Effects of Inventory Policies on Supply Chain Design.

Degree: 2015, University of Waterloo

URL: http://hdl.handle.net/10012/9386

► This thesis is motivated by an industrial problem faced by Bombardier Inc. in designing a two-echelon supply chain. The upper echelon is a plant that…
(more)

Subjects/Keywords: Supply Chain; Inventory-Location; Cutting Plane

…solution, a
*cutting*-*plane* algorithm is proposed. The algorithm separates the original problem… …algorithm
to solve the inventory stocking problem. Chapter 5 develops an exact *cutting*-*plane*… …performance of the *cutting* *plane* algorithm and discusses the effects of base
stock and batch… …replenishment time and response time
constraint. We also proposed an *cutting*-*plane* algorithm to find… …replenishment policy at both plant and service centers. He developed a *cutting*-*plane*
algorithm to…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Shuo, X. (2015). Effects of Inventory Policies on Supply Chain Design. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/9386

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Shuo, Xu. “Effects of Inventory Policies on Supply Chain Design.” 2015. Thesis, University of Waterloo. Accessed November 30, 2020. http://hdl.handle.net/10012/9386.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Shuo, Xu. “Effects of Inventory Policies on Supply Chain Design.” 2015. Web. 30 Nov 2020.

Vancouver:

Shuo X. Effects of Inventory Policies on Supply Chain Design. [Internet] [Thesis]. University of Waterloo; 2015. [cited 2020 Nov 30]. Available from: http://hdl.handle.net/10012/9386.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Shuo X. Effects of Inventory Policies on Supply Chain Design. [Thesis]. University of Waterloo; 2015. Available from: http://hdl.handle.net/10012/9386

Not specified: Masters Thesis or Doctoral Dissertation

University of Waterloo

9.
Yen, Ginger.
* Cutting*-

Degree: 2008, University of Waterloo

URL: http://hdl.handle.net/10012/4104

► The single-row facility layout problem (SRFLP) is concerned with finding the optimal linear placement of n departments with different lengths in a straight line. It…
(more)

Subjects/Keywords: Single-Row Facility Layout Problem; Cutting Plane; Semidefinite Programming

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Yen, G. (2008). Cutting-Plane Separation Strategies for Semidefinite Programming Models to Solve Single-Row Facility Layout Problems. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/4104

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Yen, Ginger. “Cutting-Plane Separation Strategies for Semidefinite Programming Models to Solve Single-Row Facility Layout Problems.” 2008. Thesis, University of Waterloo. Accessed November 30, 2020. http://hdl.handle.net/10012/4104.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Yen, Ginger. “Cutting-Plane Separation Strategies for Semidefinite Programming Models to Solve Single-Row Facility Layout Problems.” 2008. Web. 30 Nov 2020.

Vancouver:

Yen G. Cutting-Plane Separation Strategies for Semidefinite Programming Models to Solve Single-Row Facility Layout Problems. [Internet] [Thesis]. University of Waterloo; 2008. [cited 2020 Nov 30]. Available from: http://hdl.handle.net/10012/4104.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Yen G. Cutting-Plane Separation Strategies for Semidefinite Programming Models to Solve Single-Row Facility Layout Problems. [Thesis]. University of Waterloo; 2008. Available from: http://hdl.handle.net/10012/4104

Not specified: Masters Thesis or Doctoral Dissertation

University of Manchester

10. Kim, Yuri. The effect of particle size on the local strain distribution in advanced aluminium alloys.

Degree: 2017, University of Manchester

URL: http://www.manchester.ac.uk/escholar/uk-ac-man-scw:308148

► The High Resolution Digital Image Correlation (HRDIC) technique was used to analyse the deformation pattern in the AA7021 alloy. Two different microstructures were induced by…
(more)

Subjects/Keywords: High Resolution Digital Image Correlation (HRDIC); Aluminium alloys (AA7021); Gold remodelling; Ageing; Precipitates; Bowing and cutting mechanism; Glide plane softening

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kim, Y. (2017). The effect of particle size on the local strain distribution in advanced aluminium alloys. (Doctoral Dissertation). University of Manchester. Retrieved from http://www.manchester.ac.uk/escholar/uk-ac-man-scw:308148

Chicago Manual of Style (16^{th} Edition):

Kim, Yuri. “The effect of particle size on the local strain distribution in advanced aluminium alloys.” 2017. Doctoral Dissertation, University of Manchester. Accessed November 30, 2020. http://www.manchester.ac.uk/escholar/uk-ac-man-scw:308148.

MLA Handbook (7^{th} Edition):

Kim, Yuri. “The effect of particle size on the local strain distribution in advanced aluminium alloys.” 2017. Web. 30 Nov 2020.

Vancouver:

Kim Y. The effect of particle size on the local strain distribution in advanced aluminium alloys. [Internet] [Doctoral dissertation]. University of Manchester; 2017. [cited 2020 Nov 30]. Available from: http://www.manchester.ac.uk/escholar/uk-ac-man-scw:308148.

Council of Science Editors:

Kim Y. The effect of particle size on the local strain distribution in advanced aluminium alloys. [Doctoral Dissertation]. University of Manchester; 2017. Available from: http://www.manchester.ac.uk/escholar/uk-ac-man-scw:308148

University of Michigan

11.
Atlason, Julius.
Simulation-based *cutting* *plane* methods for optimization of service systems.

Degree: PhD, Industrial engineering, 2004, University of Michigan

URL: http://hdl.handle.net/2027.42/124614

► Simulation is a powerful tool for analyzing a complex system. When decisions need to be made about the operating policies and settings of a system,…
(more)

Subjects/Keywords: Based; Call Centers; Cutting Plane; Methods; Optimization; Sample Average Approximation; Service; Simulation; Systems

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Atlason, J. (2004). Simulation-based cutting plane methods for optimization of service systems. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/124614

Chicago Manual of Style (16^{th} Edition):

Atlason, Julius. “Simulation-based cutting plane methods for optimization of service systems.” 2004. Doctoral Dissertation, University of Michigan. Accessed November 30, 2020. http://hdl.handle.net/2027.42/124614.

MLA Handbook (7^{th} Edition):

Atlason, Julius. “Simulation-based cutting plane methods for optimization of service systems.” 2004. Web. 30 Nov 2020.

Vancouver:

Atlason J. Simulation-based cutting plane methods for optimization of service systems. [Internet] [Doctoral dissertation]. University of Michigan; 2004. [cited 2020 Nov 30]. Available from: http://hdl.handle.net/2027.42/124614.

Council of Science Editors:

Atlason J. Simulation-based cutting plane methods for optimization of service systems. [Doctoral Dissertation]. University of Michigan; 2004. Available from: http://hdl.handle.net/2027.42/124614

University of Waterloo

12. Naoum-Sawaya, Joe. New Benders' Decomposition Approaches for W-CDMA Telecommunication Network Design.

Degree: 2007, University of Waterloo

URL: http://hdl.handle.net/10012/2769

► Network planning is an essential phase in successfully operating state-of-the-art telecommunication systems. It helps carriers increase revenues by deploying the right technologies in a cost…
(more)

Subjects/Keywords: Benders Decomposition; Mathematical Programming; Analytic Center Cutting Plane Method; Telecommunication Network Planning

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Naoum-Sawaya, J. (2007). New Benders' Decomposition Approaches for W-CDMA Telecommunication Network Design. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/2769

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Naoum-Sawaya, Joe. “New Benders' Decomposition Approaches for W-CDMA Telecommunication Network Design.” 2007. Thesis, University of Waterloo. Accessed November 30, 2020. http://hdl.handle.net/10012/2769.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Naoum-Sawaya, Joe. “New Benders' Decomposition Approaches for W-CDMA Telecommunication Network Design.” 2007. Web. 30 Nov 2020.

Vancouver:

Naoum-Sawaya J. New Benders' Decomposition Approaches for W-CDMA Telecommunication Network Design. [Internet] [Thesis]. University of Waterloo; 2007. [cited 2020 Nov 30]. Available from: http://hdl.handle.net/10012/2769.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Naoum-Sawaya J. New Benders' Decomposition Approaches for W-CDMA Telecommunication Network Design. [Thesis]. University of Waterloo; 2007. Available from: http://hdl.handle.net/10012/2769

Not specified: Masters Thesis or Doctoral Dissertation

13. El-Hajj, Racha. Vehicle routing problems with profits, exact and heuristic approaches : Problèmes de tournées de véhicules avec profits, méthodes exactes et approchées.

Degree: Docteur es, Technologies de l'Information et des Systèmes, 2015, Compiègne; Université libanaise

URL: http://www.theses.fr/2015COMP2192

►

Nous nous intéressons dans cette thèse à la résolution du problème de tournées sélectives (Team Orienteering Problem - TOP) et ses variantes. Ce problème est… (more)

Subjects/Keywords: Problèmes de tournées de véhicules avec profits; Plans sécants; Optimisation par essaim; Génération de colonnes; Vehicle routing problems with profits; Cutting plane; Particle swarm optimization; Column generation

Record Details Similar Records

❌

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

APA (6^{th} Edition):

El-Hajj, R. (2015). Vehicle routing problems with profits, exact and heuristic approaches : Problèmes de tournées de véhicules avec profits, méthodes exactes et approchées. (Doctoral Dissertation). Compiègne; Université libanaise. Retrieved from http://www.theses.fr/2015COMP2192

Chicago Manual of Style (16^{th} Edition):

El-Hajj, Racha. “Vehicle routing problems with profits, exact and heuristic approaches : Problèmes de tournées de véhicules avec profits, méthodes exactes et approchées.” 2015. Doctoral Dissertation, Compiègne; Université libanaise. Accessed November 30, 2020. http://www.theses.fr/2015COMP2192.

MLA Handbook (7^{th} Edition):

El-Hajj, Racha. “Vehicle routing problems with profits, exact and heuristic approaches : Problèmes de tournées de véhicules avec profits, méthodes exactes et approchées.” 2015. Web. 30 Nov 2020.

Vancouver:

El-Hajj R. Vehicle routing problems with profits, exact and heuristic approaches : Problèmes de tournées de véhicules avec profits, méthodes exactes et approchées. [Internet] [Doctoral dissertation]. Compiègne; Université libanaise; 2015. [cited 2020 Nov 30]. Available from: http://www.theses.fr/2015COMP2192.

Council of Science Editors:

El-Hajj R. Vehicle routing problems with profits, exact and heuristic approaches : Problèmes de tournées de véhicules avec profits, méthodes exactes et approchées. [Doctoral Dissertation]. Compiègne; Université libanaise; 2015. Available from: http://www.theses.fr/2015COMP2192

Université Catholique de Louvain

14. Aravena Solís, Ignacio Andrés. Analysis of renewable energy integration in transmission-constrained electricity markets using parallel computing.

Degree: 2018, Université Catholique de Louvain

URL: http://hdl.handle.net/2078.1/203018

►

Renewable energy integration has progressively challenged the operating assumptions of electricity markets, questioning at first the deterministic nature of day-ahead and other forward electricity markets.… (more)

Subjects/Keywords: Renewable energy integration; European electricity market; Zonal electricity market; Cutting-plane method; Asynchronous subgradient algorithm; Block-coordinate descent method; Stochastic unit commitment; Flow-based market coupling; ATC-based market coupling

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Aravena Solís, I. A. (2018). Analysis of renewable energy integration in transmission-constrained electricity markets using parallel computing. (Thesis). Université Catholique de Louvain. Retrieved from http://hdl.handle.net/2078.1/203018

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Aravena Solís, Ignacio Andrés. “Analysis of renewable energy integration in transmission-constrained electricity markets using parallel computing.” 2018. Thesis, Université Catholique de Louvain. Accessed November 30, 2020. http://hdl.handle.net/2078.1/203018.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Aravena Solís, Ignacio Andrés. “Analysis of renewable energy integration in transmission-constrained electricity markets using parallel computing.” 2018. Web. 30 Nov 2020.

Vancouver:

Aravena Solís IA. Analysis of renewable energy integration in transmission-constrained electricity markets using parallel computing. [Internet] [Thesis]. Université Catholique de Louvain; 2018. [cited 2020 Nov 30]. Available from: http://hdl.handle.net/2078.1/203018.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Aravena Solís IA. Analysis of renewable energy integration in transmission-constrained electricity markets using parallel computing. [Thesis]. Université Catholique de Louvain; 2018. Available from: http://hdl.handle.net/2078.1/203018

Not specified: Masters Thesis or Doctoral Dissertation

University of Edinburgh

15. Riedel, Sebastian. Efficient prediction of relational structure and its application to natural language processing.

Degree: PhD, 2009, University of Edinburgh

URL: http://hdl.handle.net/1842/4167

► Many tasks in Natural Language Processing (NLP) require us to predict a relational structure over entities. For example, in Semantic Role Labelling we try to…
(more)

Subjects/Keywords: 005.1; Natural Language Processing; NLP; Markov Logic; Cutting Plane Inference; MAP inference

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Riedel, S. (2009). Efficient prediction of relational structure and its application to natural language processing. (Doctoral Dissertation). University of Edinburgh. Retrieved from http://hdl.handle.net/1842/4167

Chicago Manual of Style (16^{th} Edition):

Riedel, Sebastian. “Efficient prediction of relational structure and its application to natural language processing.” 2009. Doctoral Dissertation, University of Edinburgh. Accessed November 30, 2020. http://hdl.handle.net/1842/4167.

MLA Handbook (7^{th} Edition):

Riedel, Sebastian. “Efficient prediction of relational structure and its application to natural language processing.” 2009. Web. 30 Nov 2020.

Vancouver:

Riedel S. Efficient prediction of relational structure and its application to natural language processing. [Internet] [Doctoral dissertation]. University of Edinburgh; 2009. [cited 2020 Nov 30]. Available from: http://hdl.handle.net/1842/4167.

Council of Science Editors:

Riedel S. Efficient prediction of relational structure and its application to natural language processing. [Doctoral Dissertation]. University of Edinburgh; 2009. Available from: http://hdl.handle.net/1842/4167

16. Cardozo Arteaga, Carmen. Optimisation of power system security with high share of variable renewables : Consideration of the primary reserve deployment dynamics on a Frequency Constrained Unit Commitment model : Optimisation de la sûreté d’un système électrique en présence des énergies renouvelables intermittentes : Intégration de contraintes de déploiement de la réserve primaire dans un outil journalier de placement de production.

Degree: Docteur es, Génie électrique, 2016, Université Paris-Saclay (ComUE)

URL: http://www.theses.fr/2016SACLC024

► Le placement de production (UC pour unit commitment) est une famille de problèmes d'optimisation qui déterminent l’état et la puissance de consigne des groupes de…
(more)

Subjects/Keywords: Régulation primaire de fréquence; Placement de production; PLNE; Décomposition de Benders; Méthodes de plans sécants; Primary frequency regulation; Unit commitment; MILP; Benders’ decomposition; Cutting plane methods

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Cardozo Arteaga, C. (2016). Optimisation of power system security with high share of variable renewables : Consideration of the primary reserve deployment dynamics on a Frequency Constrained Unit Commitment model : Optimisation de la sûreté d’un système électrique en présence des énergies renouvelables intermittentes : Intégration de contraintes de déploiement de la réserve primaire dans un outil journalier de placement de production. (Doctoral Dissertation). Université Paris-Saclay (ComUE). Retrieved from http://www.theses.fr/2016SACLC024

Chicago Manual of Style (16^{th} Edition):

Cardozo Arteaga, Carmen. “Optimisation of power system security with high share of variable renewables : Consideration of the primary reserve deployment dynamics on a Frequency Constrained Unit Commitment model : Optimisation de la sûreté d’un système électrique en présence des énergies renouvelables intermittentes : Intégration de contraintes de déploiement de la réserve primaire dans un outil journalier de placement de production.” 2016. Doctoral Dissertation, Université Paris-Saclay (ComUE). Accessed November 30, 2020. http://www.theses.fr/2016SACLC024.

MLA Handbook (7^{th} Edition):

Cardozo Arteaga, Carmen. “Optimisation of power system security with high share of variable renewables : Consideration of the primary reserve deployment dynamics on a Frequency Constrained Unit Commitment model : Optimisation de la sûreté d’un système électrique en présence des énergies renouvelables intermittentes : Intégration de contraintes de déploiement de la réserve primaire dans un outil journalier de placement de production.” 2016. Web. 30 Nov 2020.

Vancouver:

Cardozo Arteaga C. Optimisation of power system security with high share of variable renewables : Consideration of the primary reserve deployment dynamics on a Frequency Constrained Unit Commitment model : Optimisation de la sûreté d’un système électrique en présence des énergies renouvelables intermittentes : Intégration de contraintes de déploiement de la réserve primaire dans un outil journalier de placement de production. [Internet] [Doctoral dissertation]. Université Paris-Saclay (ComUE); 2016. [cited 2020 Nov 30]. Available from: http://www.theses.fr/2016SACLC024.

Council of Science Editors:

Cardozo Arteaga C. Optimisation of power system security with high share of variable renewables : Consideration of the primary reserve deployment dynamics on a Frequency Constrained Unit Commitment model : Optimisation de la sûreté d’un système électrique en présence des énergies renouvelables intermittentes : Intégration de contraintes de déploiement de la réserve primaire dans un outil journalier de placement de production. [Doctoral Dissertation]. Université Paris-Saclay (ComUE); 2016. Available from: http://www.theses.fr/2016SACLC024

Delft University of Technology

17. Kalicharan, Kishan (author). Intermodal Transport: Routing Vehicles and Scheduling Containers.

Degree: 2018, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:6a99a2a6-ae1d-4355-95db-363f8a399a12

►

In intermodal transport multiple types of vehicles are used to transport containers. If the routes of the vehicles are known, then the container allocation can… (more)

Subjects/Keywords: Branch and Bound; Cutting Plane; Multicommodity Flow; Intermodal Transport; Time-Space Graph; Network Design; Min Cost Flow; Column Generating; Local search algorithm; fix; fixed-charge; capacitated; Container; Barges; Reductions; ILP

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kalicharan, K. (. (2018). Intermodal Transport: Routing Vehicles and Scheduling Containers. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:6a99a2a6-ae1d-4355-95db-363f8a399a12

Chicago Manual of Style (16^{th} Edition):

Kalicharan, Kishan (author). “Intermodal Transport: Routing Vehicles and Scheduling Containers.” 2018. Masters Thesis, Delft University of Technology. Accessed November 30, 2020. http://resolver.tudelft.nl/uuid:6a99a2a6-ae1d-4355-95db-363f8a399a12.

MLA Handbook (7^{th} Edition):

Kalicharan, Kishan (author). “Intermodal Transport: Routing Vehicles and Scheduling Containers.” 2018. Web. 30 Nov 2020.

Vancouver:

Kalicharan K(. Intermodal Transport: Routing Vehicles and Scheduling Containers. [Internet] [Masters thesis]. Delft University of Technology; 2018. [cited 2020 Nov 30]. Available from: http://resolver.tudelft.nl/uuid:6a99a2a6-ae1d-4355-95db-363f8a399a12.

Council of Science Editors:

Kalicharan K(. Intermodal Transport: Routing Vehicles and Scheduling Containers. [Masters Thesis]. Delft University of Technology; 2018. Available from: http://resolver.tudelft.nl/uuid:6a99a2a6-ae1d-4355-95db-363f8a399a12

University of Florida

18. Davarnia, Danial. Convexification Techniques for Bilinear and Complementarity Constraints with Application to Network Interdiction.

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

URL: https://ufdc.ufl.edu/UFE0050279

Continuous and discrete bilinear and complementarity constraints are widely used to model engineering and management problems.
*Advisors/Committee Members: RICHARD,JEAN-PHILIPPE P (committee chair), GARCIA,ALFREDO (committee member), HAMILTON,JONATHAN H (committee member), TAWARMALANI,MOHIT (committee member).*

Subjects/Keywords: Aggregation; Algorithms; Conic sections; Linear programming; Mathematical inequalities; Mathematical programming; Mathematical variables; Operations research; Optimal solutions; Polytopes; bilinear – complementarity – convexification – cutting-plane – envelope – interdiction – kkt – lifting

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Davarnia, D. (2016). Convexification Techniques for Bilinear and Complementarity Constraints with Application to Network Interdiction. (Doctoral Dissertation). University of Florida. Retrieved from https://ufdc.ufl.edu/UFE0050279

Chicago Manual of Style (16^{th} Edition):

Davarnia, Danial. “Convexification Techniques for Bilinear and Complementarity Constraints with Application to Network Interdiction.” 2016. Doctoral Dissertation, University of Florida. Accessed November 30, 2020. https://ufdc.ufl.edu/UFE0050279.

MLA Handbook (7^{th} Edition):

Davarnia, Danial. “Convexification Techniques for Bilinear and Complementarity Constraints with Application to Network Interdiction.” 2016. Web. 30 Nov 2020.

Vancouver:

Davarnia D. Convexification Techniques for Bilinear and Complementarity Constraints with Application to Network Interdiction. [Internet] [Doctoral dissertation]. University of Florida; 2016. [cited 2020 Nov 30]. Available from: https://ufdc.ufl.edu/UFE0050279.

Council of Science Editors:

Davarnia D. Convexification Techniques for Bilinear and Complementarity Constraints with Application to Network Interdiction. [Doctoral Dissertation]. University of Florida; 2016. Available from: https://ufdc.ufl.edu/UFE0050279

19. Wang, Xiaojing. The Master Equality Polyhedron: Two-Slope Facets and Separation Algorithm.

Degree: 2015, University of Waterloo

URL: http://hdl.handle.net/10012/9511

► This thesis presents our findings about the Master Equality Polyhedron (MEP), an extension of Gomory's Master Group Polyhedron. We prove a theorem analogous to Gomory…
(more)

Subjects/Keywords: Master Polyhedron; two-slope; cutting plane; separation algorithm

…others, in 1958, Ralph Gomory gave a brief
description of a *cutting*-*plane* method for general… …*cutting* planes focuses on finding cuts that improve the efficiency of the
*cutting*-*plane* method… …TSP, and some improve general models,
potentially making them easier to solve. *Cutting*… …planes are a common tool applicable to
1
general IPs and MIPs. Ideal *cutting* planes describe… …*cutting* planes are hard to find. Our
research considers strong *cutting* planes related to a…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Wang, X. (2015). The Master Equality Polyhedron: Two-Slope Facets and Separation Algorithm. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/9511

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Wang, Xiaojing. “The Master Equality Polyhedron: Two-Slope Facets and Separation Algorithm.” 2015. Thesis, University of Waterloo. Accessed November 30, 2020. http://hdl.handle.net/10012/9511.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Wang, Xiaojing. “The Master Equality Polyhedron: Two-Slope Facets and Separation Algorithm.” 2015. Web. 30 Nov 2020.

Vancouver:

Wang X. The Master Equality Polyhedron: Two-Slope Facets and Separation Algorithm. [Internet] [Thesis]. University of Waterloo; 2015. [cited 2020 Nov 30]. Available from: http://hdl.handle.net/10012/9511.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Wang X. The Master Equality Polyhedron: Two-Slope Facets and Separation Algorithm. [Thesis]. University of Waterloo; 2015. Available from: http://hdl.handle.net/10012/9511

Not specified: Masters Thesis or Doctoral Dissertation

Kansas State University

20.
Harris, Andrew William.
Generating an
original *Cutting*-*plane* Algorithm in Three Sets.

Degree: MS, Department of Industrial & Manufacturing Systems Engineering, 2010, Kansas State University

URL: http://hdl.handle.net/2097/7013

► Integer programs (IP) are a commonly researched class of problems used by governments and businesses to improve decision making through optimal resource allocation and scheduling.…
(more)

Subjects/Keywords: cutting; plane; lifting; synchronized; simultaneous; Engineering, General (0537); Engineering, Industrial (0546); Mathematics (0405)

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Harris, A. W. (2010). Generating an original Cutting-plane Algorithm in Three Sets. (Masters Thesis). Kansas State University. Retrieved from http://hdl.handle.net/2097/7013

Chicago Manual of Style (16^{th} Edition):

Harris, Andrew William. “Generating an original Cutting-plane Algorithm in Three Sets.” 2010. Masters Thesis, Kansas State University. Accessed November 30, 2020. http://hdl.handle.net/2097/7013.

MLA Handbook (7^{th} Edition):

Harris, Andrew William. “Generating an original Cutting-plane Algorithm in Three Sets.” 2010. Web. 30 Nov 2020.

Vancouver:

Harris AW. Generating an original Cutting-plane Algorithm in Three Sets. [Internet] [Masters thesis]. Kansas State University; 2010. [cited 2020 Nov 30]. Available from: http://hdl.handle.net/2097/7013.

Council of Science Editors:

Harris AW. Generating an original Cutting-plane Algorithm in Three Sets. [Masters Thesis]. Kansas State University; 2010. Available from: http://hdl.handle.net/2097/7013

Virginia Tech

21. Smith, Jonathan Cole. Tight Discrete Formulations to Enhance Solvability with Applications to Production, Telecommunications, and Air Transportation Problems.

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

URL: http://hdl.handle.net/10919/26710

► In formulating discrete optimization problems, it is not only important to have a correct mathematical model, but to have a well structured model that can…
(more)

Subjects/Keywords: Mathematical Modeling; Reformulation-Linearization Technique; Cutting Plane Generation; Telecommunications; Integer Programming

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Smith, J. C. (2000). Tight Discrete Formulations to Enhance Solvability with Applications to Production, Telecommunications, and Air Transportation Problems. (Doctoral Dissertation). Virginia Tech. Retrieved from http://hdl.handle.net/10919/26710

Chicago Manual of Style (16^{th} Edition):

Smith, Jonathan Cole. “Tight Discrete Formulations to Enhance Solvability with Applications to Production, Telecommunications, and Air Transportation Problems.” 2000. Doctoral Dissertation, Virginia Tech. Accessed November 30, 2020. http://hdl.handle.net/10919/26710.

MLA Handbook (7^{th} Edition):

Smith, Jonathan Cole. “Tight Discrete Formulations to Enhance Solvability with Applications to Production, Telecommunications, and Air Transportation Problems.” 2000. Web. 30 Nov 2020.

Vancouver:

Smith JC. Tight Discrete Formulations to Enhance Solvability with Applications to Production, Telecommunications, and Air Transportation Problems. [Internet] [Doctoral dissertation]. Virginia Tech; 2000. [cited 2020 Nov 30]. Available from: http://hdl.handle.net/10919/26710.

Council of Science Editors:

Smith JC. Tight Discrete Formulations to Enhance Solvability with Applications to Production, Telecommunications, and Air Transportation Problems. [Doctoral Dissertation]. Virginia Tech; 2000. Available from: http://hdl.handle.net/10919/26710

University of Waterloo

22. Dang, Jiarui. Empirical Analysis of Algorithms for Block-Angular Linear Programs.

Degree: 2007, University of Waterloo

URL: http://hdl.handle.net/10012/3189

► This thesis aims to study the theoretical complexity and empirical performance of decomposition algorithms. We focus on linear programs with a block-angular structure. Decomposition algorithms…
(more)

Subjects/Keywords: empirical analysis; block-angular; Dantzig-Wolfe decomposition; analytic center cutting plane method; interior point method; simplex

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Dang, J. (2007). Empirical Analysis of Algorithms for Block-Angular Linear Programs. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/3189

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Dang, Jiarui. “Empirical Analysis of Algorithms for Block-Angular Linear Programs.” 2007. Thesis, University of Waterloo. Accessed November 30, 2020. http://hdl.handle.net/10012/3189.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Dang, Jiarui. “Empirical Analysis of Algorithms for Block-Angular Linear Programs.” 2007. Web. 30 Nov 2020.

Vancouver:

Dang J. Empirical Analysis of Algorithms for Block-Angular Linear Programs. [Internet] [Thesis]. University of Waterloo; 2007. [cited 2020 Nov 30]. Available from: http://hdl.handle.net/10012/3189.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Dang J. Empirical Analysis of Algorithms for Block-Angular Linear Programs. [Thesis]. University of Waterloo; 2007. Available from: http://hdl.handle.net/10012/3189

Not specified: Masters Thesis or Doctoral Dissertation

Pontifical Catholic University of Rio de Janeiro

23.
MARCELO PRAIS.
[en] A STUDY ON *CUTTING* *PLANE* AND FIXING VARIABLE TECHNIQUES
APPLIED TO THE RESOLUTION OF SET PARTITIONING PROBLEMS.

Degree: 2007, Pontifical Catholic University of Rio de Janeiro

URL: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=10249

►

[pt] Este trabalho consiste da aplicação de métodos de planos de corte (euclideano acelerado e cortes disjuntivos) na solução de problemas de programação inteira pura… (more)

Subjects/Keywords: [pt] PLANOS DE CORTE COM TECNICAS; [en] CUTTING PLANE TECHNIQUES; [pt] TECNICAS DE PENALIDADES; [en] PENALTY TECHNIQUES

Record Details Similar Records

❌

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

APA (6^{th} Edition):

PRAIS, M. (2007). [en] A STUDY ON CUTTING PLANE AND FIXING VARIABLE TECHNIQUES APPLIED TO THE RESOLUTION OF SET PARTITIONING PROBLEMS. (Thesis). Pontifical Catholic University of Rio de Janeiro. Retrieved from http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=10249

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

PRAIS, MARCELO. “[en] A STUDY ON CUTTING PLANE AND FIXING VARIABLE TECHNIQUES APPLIED TO THE RESOLUTION OF SET PARTITIONING PROBLEMS.” 2007. Thesis, Pontifical Catholic University of Rio de Janeiro. Accessed November 30, 2020. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=10249.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

PRAIS, MARCELO. “[en] A STUDY ON CUTTING PLANE AND FIXING VARIABLE TECHNIQUES APPLIED TO THE RESOLUTION OF SET PARTITIONING PROBLEMS.” 2007. Web. 30 Nov 2020.

Vancouver:

PRAIS M. [en] A STUDY ON CUTTING PLANE AND FIXING VARIABLE TECHNIQUES APPLIED TO THE RESOLUTION OF SET PARTITIONING PROBLEMS. [Internet] [Thesis]. Pontifical Catholic University of Rio de Janeiro; 2007. [cited 2020 Nov 30]. Available from: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=10249.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

PRAIS M. [en] A STUDY ON CUTTING PLANE AND FIXING VARIABLE TECHNIQUES APPLIED TO THE RESOLUTION OF SET PARTITIONING PROBLEMS. [Thesis]. Pontifical Catholic University of Rio de Janeiro; 2007. Available from: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=10249

Not specified: Masters Thesis or Doctoral Dissertation

Uppsala University

24. Hellman, Fredrik. Towards the Solution of Large-Scale and Stochastic Traffic Network Design Problems.

Degree: Information Technology, 2010, Uppsala University

URL: http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-130013

► This thesis investigates the second-best toll pricing and capacity expansion problems when stated as mathematical programs with equilibrium constraints (MPEC). Three main questions are rised: First,…
(more)

Subjects/Keywords: optimization; traffic network design; implicit programming; mathematical programs with equilibrium constraints; cutting plane method; bilevel programming; stochastics; MPEC; SMPEC

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Hellman, F. (2010). Towards the Solution of Large-Scale and Stochastic Traffic Network Design Problems. (Thesis). Uppsala University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-130013

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Hellman, Fredrik. “Towards the Solution of Large-Scale and Stochastic Traffic Network Design Problems.” 2010. Thesis, Uppsala University. Accessed November 30, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-130013.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Hellman, Fredrik. “Towards the Solution of Large-Scale and Stochastic Traffic Network Design Problems.” 2010. Web. 30 Nov 2020.

Vancouver:

Hellman F. Towards the Solution of Large-Scale and Stochastic Traffic Network Design Problems. [Internet] [Thesis]. Uppsala University; 2010. [cited 2020 Nov 30]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-130013.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Hellman F. Towards the Solution of Large-Scale and Stochastic Traffic Network Design Problems. [Thesis]. Uppsala University; 2010. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-130013

Not specified: Masters Thesis or Doctoral Dissertation

25. Hadji, Makhlouf. Synthèse de réseaux à composantes connexes unicycliques : On the design of networks with unicyclic connected components.

Degree: Docteur es, Informatique, 2009, Evry, Institut national des télécommunications

URL: http://www.theses.fr/2009TELE0012

►

Cette thèse s'inscrit dans le domaine de l'optimisation combinatoire. Elle utilise l'approche polyèdrale pour résoudre des problèmes combinatoires qui se posent dans le contexte des… (more)

Subjects/Keywords: Optimisation combinatoire; Algorithme à plans coupants; Graphe unicyclique; Combinatorial optimization; Cutting plane algorithm; Unicyclic graphs

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Hadji, M. (2009). Synthèse de réseaux à composantes connexes unicycliques : On the design of networks with unicyclic connected components. (Doctoral Dissertation). Evry, Institut national des télécommunications. Retrieved from http://www.theses.fr/2009TELE0012

Chicago Manual of Style (16^{th} Edition):

Hadji, Makhlouf. “Synthèse de réseaux à composantes connexes unicycliques : On the design of networks with unicyclic connected components.” 2009. Doctoral Dissertation, Evry, Institut national des télécommunications. Accessed November 30, 2020. http://www.theses.fr/2009TELE0012.

MLA Handbook (7^{th} Edition):

Hadji, Makhlouf. “Synthèse de réseaux à composantes connexes unicycliques : On the design of networks with unicyclic connected components.” 2009. Web. 30 Nov 2020.

Vancouver:

Hadji M. Synthèse de réseaux à composantes connexes unicycliques : On the design of networks with unicyclic connected components. [Internet] [Doctoral dissertation]. Evry, Institut national des télécommunications; 2009. [cited 2020 Nov 30]. Available from: http://www.theses.fr/2009TELE0012.

Council of Science Editors:

Hadji M. Synthèse de réseaux à composantes connexes unicycliques : On the design of networks with unicyclic connected components. [Doctoral Dissertation]. Evry, Institut national des télécommunications; 2009. Available from: http://www.theses.fr/2009TELE0012

University of Florida

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

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

URL: https://ufdc.ufl.edu/UFE0024769

► 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 Details Similar Records

❌

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

APA (6^{th} Edition):

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

Chicago Manual of Style (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

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

Vancouver:

Penuel J. Decomposition Algorithms for Two Stage Stochastic Integer Programming. [Internet] [Doctoral dissertation]. University of Florida; 2009. [cited 2020 Nov 30]. Available from: https://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: https://ufdc.ufl.edu/UFE0024769

University of Waterloo

27. Jayaswal, Sachin. Product Differentiation and Operations Strategy for Price and Time Sensitive Markets.

Degree: 2009, University of Waterloo

URL: http://hdl.handle.net/10012/4350

► In this dissertation, we study the interplay between a firm’s operations strategy, with regard to its capacity management, and its marketing decision of product differentiation.…
(more)

Subjects/Keywords: product differentiation; pricing; leadtime guarantee; capacity sharing; product substitution; competition; nash equilibrium; game theory; matrix geometric method; cutting plane method

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Jayaswal, S. (2009). Product Differentiation and Operations Strategy for Price and Time Sensitive Markets. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/4350

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Jayaswal, Sachin. “Product Differentiation and Operations Strategy for Price and Time Sensitive Markets.” 2009. Thesis, University of Waterloo. Accessed November 30, 2020. http://hdl.handle.net/10012/4350.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Jayaswal, Sachin. “Product Differentiation and Operations Strategy for Price and Time Sensitive Markets.” 2009. Web. 30 Nov 2020.

Vancouver:

Jayaswal S. Product Differentiation and Operations Strategy for Price and Time Sensitive Markets. [Internet] [Thesis]. University of Waterloo; 2009. [cited 2020 Nov 30]. Available from: http://hdl.handle.net/10012/4350.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Jayaswal S. Product Differentiation and Operations Strategy for Price and Time Sensitive Markets. [Thesis]. University of Waterloo; 2009. Available from: http://hdl.handle.net/10012/4350

Not specified: Masters Thesis or Doctoral Dissertation

28. Soberanis, Policarpio Antonio. Risk optimization with p-order conic constraints.

Degree: PhD, Industrial Engineering, 2009, University of Iowa

URL: https://ir.uiowa.edu/etd/437

► My dissertation considers solving of linear programming problems with p-order conic constraints that are related to a class of stochastic optimization models with risk…
(more)

Subjects/Keywords: cutting plane; decomposition algorithm; Higher Moment Risk Models; p-order conic constraint; Portfolio optimization; Stochastic optimization; Industrial Engineering

…of 3D general p-order cones 50
3 A *CUTTING* *PLANE* ALGORITHM FOR POLYHEDRAL
APPROXIMATIONS… …A *Cutting* *Plane* Formulation for Polyhedral Approximations of pOCP Problems… …A *Cutting* *Plane* Algorithm for Polyhedral Approximations
of p-Order Conic Programming… …the *cutting* *plane* (CPA) algorithm and the SOCP reformulation using the MOSEK… …solver. . . . . .
81
Average running times (in seconds) of the *cutting* *plane* (…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Soberanis, P. A. (2009). Risk optimization with p-order conic constraints. (Doctoral Dissertation). University of Iowa. Retrieved from https://ir.uiowa.edu/etd/437

Chicago Manual of Style (16^{th} Edition):

Soberanis, Policarpio Antonio. “Risk optimization with p-order conic constraints.” 2009. Doctoral Dissertation, University of Iowa. Accessed November 30, 2020. https://ir.uiowa.edu/etd/437.

MLA Handbook (7^{th} Edition):

Soberanis, Policarpio Antonio. “Risk optimization with p-order conic constraints.” 2009. Web. 30 Nov 2020.

Vancouver:

Soberanis PA. Risk optimization with p-order conic constraints. [Internet] [Doctoral dissertation]. University of Iowa; 2009. [cited 2020 Nov 30]. Available from: https://ir.uiowa.edu/etd/437.

Council of Science Editors:

Soberanis PA. Risk optimization with p-order conic constraints. [Doctoral Dissertation]. University of Iowa; 2009. Available from: https://ir.uiowa.edu/etd/437

29. Chandrasekaran, Karthekeyan. New approaches to integer programming.

Degree: PhD, Algorithms, Combinatorics, and Optimization, 2012, Georgia Tech

URL: http://hdl.handle.net/1853/44814

► Integer Programming (IP) is a powerful and widely-used formulation for combinatorial problems. The study of IP over the past several decades has led to fascinating…
(more)

Subjects/Keywords: Random graphs; Feedback vertex set; Cutting plane method; Integer program; Discrepancy; Random; Matching; Integer programming; Programming (Mathematics); Algorithms

…Edge-Walk . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
65
10
*Cutting* *plane*… …efficiency of
the *cutting* *plane* approach for perfect matching evident from implementations [38… …reduction [49, 50, 41]; the *cutting* *plane* method to
solve IPs led to the theory of valid… …inequalities and the emergence of *cutting* *plane* proofs
as a powerful proof technique in mathematical… …to solve IPs are the *cutting* *plane* method and the
branch-and-bound method. Despite the poor…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Chandrasekaran, K. (2012). New approaches to integer programming. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/44814

Chicago Manual of Style (16^{th} Edition):

Chandrasekaran, Karthekeyan. “New approaches to integer programming.” 2012. Doctoral Dissertation, Georgia Tech. Accessed November 30, 2020. http://hdl.handle.net/1853/44814.

MLA Handbook (7^{th} Edition):

Chandrasekaran, Karthekeyan. “New approaches to integer programming.” 2012. Web. 30 Nov 2020.

Vancouver:

Chandrasekaran K. New approaches to integer programming. [Internet] [Doctoral dissertation]. Georgia Tech; 2012. [cited 2020 Nov 30]. Available from: http://hdl.handle.net/1853/44814.

Council of Science Editors:

Chandrasekaran K. New approaches to integer programming. [Doctoral Dissertation]. Georgia Tech; 2012. Available from: http://hdl.handle.net/1853/44814

30. Waal, A.G. Processing of Erroneous and Unsafe Data.

Degree: 2003, Erasmus Research Institute of Management

URL: http://hdl.handle.net/1765/870

► textabstractStatistical offices have to overcome many problems before they can publish reliable data. Two of these problems are examined in this thesis. The first problem…
(more)

Subjects/Keywords: Branch-and-bound algorithm; cell suppression; cutting plane algorithm; error localisation; imputation; local suppression; mixed integer programming; optimisation; statistical data editing; statistical disclosure control; statistics; vertex generation

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Waal, A. G. (2003). Processing of Erroneous and Unsafe Data. (Doctoral Dissertation). Erasmus Research Institute of Management. Retrieved from http://hdl.handle.net/1765/870

Chicago Manual of Style (16^{th} Edition):

Waal, A G. “Processing of Erroneous and Unsafe Data.” 2003. Doctoral Dissertation, Erasmus Research Institute of Management. Accessed November 30, 2020. http://hdl.handle.net/1765/870.

MLA Handbook (7^{th} Edition):

Waal, A G. “Processing of Erroneous and Unsafe Data.” 2003. Web. 30 Nov 2020.

Vancouver:

Waal AG. Processing of Erroneous and Unsafe Data. [Internet] [Doctoral dissertation]. Erasmus Research Institute of Management; 2003. [cited 2020 Nov 30]. Available from: http://hdl.handle.net/1765/870.

Council of Science Editors:

Waal AG. Processing of Erroneous and Unsafe Data. [Doctoral Dissertation]. Erasmus Research Institute of Management; 2003. Available from: http://hdl.handle.net/1765/870