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 +publisher:"Georgia Tech" +contributor:("Nemhauser, George"). Showing records 1 – 30 of 34 total matches.

[1] [2]

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


Georgia Tech

1. Li, Yaxian. Lower bounds for integer programming problems.

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

 Solving real world problems with mixed integer programming (MIP) involves efforts in modeling and efficient algorithms. To solve a minimization MIP problem, a lower bound… (more)

Subjects/Keywords: Lower bounds; Integer programming problems; Multi-dimensional knapsack problem; Algorithms; Knapsack problem (Mathematics); Integer programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Li, Y. (2013). Lower bounds for integer programming problems. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/48959

Chicago Manual of Style (16th Edition):

Li, Yaxian. “Lower bounds for integer programming problems.” 2013. Doctoral Dissertation, Georgia Tech. Accessed November 20, 2019. http://hdl.handle.net/1853/48959.

MLA Handbook (7th Edition):

Li, Yaxian. “Lower bounds for integer programming problems.” 2013. Web. 20 Nov 2019.

Vancouver:

Li Y. Lower bounds for integer programming problems. [Internet] [Doctoral dissertation]. Georgia Tech; 2013. [cited 2019 Nov 20]. Available from: http://hdl.handle.net/1853/48959.

Council of Science Editors:

Li Y. Lower bounds for integer programming problems. [Doctoral Dissertation]. Georgia Tech; 2013. Available from: http://hdl.handle.net/1853/48959


Georgia Tech

2. Zhang, Chengliang. Robust optimization with applications in maritime inventory routing.

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

 In recent years, the importance of incorporating uncertainty into planning models for logistics and transportation systems has been widely recognized in the Operations Research and… (more)

Subjects/Keywords: Robust planning; Inventory routing; Maritime transportation; Mixed integer programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhang, C. (2015). Robust optimization with applications in maritime inventory routing. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/54863

Chicago Manual of Style (16th Edition):

Zhang, Chengliang. “Robust optimization with applications in maritime inventory routing.” 2015. Doctoral Dissertation, Georgia Tech. Accessed November 20, 2019. http://hdl.handle.net/1853/54863.

MLA Handbook (7th Edition):

Zhang, Chengliang. “Robust optimization with applications in maritime inventory routing.” 2015. Web. 20 Nov 2019.

Vancouver:

Zhang C. Robust optimization with applications in maritime inventory routing. [Internet] [Doctoral dissertation]. Georgia Tech; 2015. [cited 2019 Nov 20]. Available from: http://hdl.handle.net/1853/54863.

Council of Science Editors:

Zhang C. Robust optimization with applications in maritime inventory routing. [Doctoral Dissertation]. Georgia Tech; 2015. Available from: http://hdl.handle.net/1853/54863


Georgia Tech

3. Ozlu, Ahmet Oguzhan. Optimization approaches for designing baseball scout networks under uncertainty.

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

 Major League Baseball (MLB) is a 30-team North American professional baseball league and Minor League Baseball (MiLB) is the hierarchy of developmental professional baseball teams… (more)

Subjects/Keywords: OR in sports; Scheduling; Integer programming; Heuristics; Schedule recovery; Discrete event simulation; Simulation and optimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ozlu, A. O. (2016). Optimization approaches for designing baseball scout networks under uncertainty. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/54983

Chicago Manual of Style (16th Edition):

Ozlu, Ahmet Oguzhan. “Optimization approaches for designing baseball scout networks under uncertainty.” 2016. Doctoral Dissertation, Georgia Tech. Accessed November 20, 2019. http://hdl.handle.net/1853/54983.

MLA Handbook (7th Edition):

Ozlu, Ahmet Oguzhan. “Optimization approaches for designing baseball scout networks under uncertainty.” 2016. Web. 20 Nov 2019.

Vancouver:

Ozlu AO. Optimization approaches for designing baseball scout networks under uncertainty. [Internet] [Doctoral dissertation]. Georgia Tech; 2016. [cited 2019 Nov 20]. Available from: http://hdl.handle.net/1853/54983.

Council of Science Editors:

Ozlu AO. Optimization approaches for designing baseball scout networks under uncertainty. [Doctoral Dissertation]. Georgia Tech; 2016. Available from: http://hdl.handle.net/1853/54983


Georgia Tech

4. Qiu, Shengli. Airline crew pairing optimization problems and capacitated vehicle routing problems.

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

 Crew pairing and vehicle routing are combinatorial optimization problems that have been studied for many years by researchers worldwide. The aim of this research work… (more)

Subjects/Keywords: Crew pairing; Duty tree; Primal-dual subproblem simplex; Capacitated vehicle routing; Set partitioning; Combinatorial optimization; Scheduling; Airlines Planning; Flight crews

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Qiu, S. (2012). Airline crew pairing optimization problems and capacitated vehicle routing problems. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/51717

Chicago Manual of Style (16th Edition):

Qiu, Shengli. “Airline crew pairing optimization problems and capacitated vehicle routing problems.” 2012. Doctoral Dissertation, Georgia Tech. Accessed November 20, 2019. http://hdl.handle.net/1853/51717.

MLA Handbook (7th Edition):

Qiu, Shengli. “Airline crew pairing optimization problems and capacitated vehicle routing problems.” 2012. Web. 20 Nov 2019.

Vancouver:

Qiu S. Airline crew pairing optimization problems and capacitated vehicle routing problems. [Internet] [Doctoral dissertation]. Georgia Tech; 2012. [cited 2019 Nov 20]. Available from: http://hdl.handle.net/1853/51717.

Council of Science Editors:

Qiu S. Airline crew pairing optimization problems and capacitated vehicle routing problems. [Doctoral Dissertation]. Georgia Tech; 2012. Available from: http://hdl.handle.net/1853/51717


Georgia Tech

5. Angulo Olivares, Gustavo, I. Integer programming approaches for semicontinuous and stochastic optimization.

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

 This thesis concerns the application of mixed-integer programming techniques to solve special classes of network flow problems and stochastic integer programs. We draw tools from… (more)

Subjects/Keywords: Integer programming; Stochastic programming; Forbidden vertices; Mathematical optimization; Dynamic programming; Integer programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Angulo Olivares, Gustavo, I. (2014). Integer programming approaches for semicontinuous and stochastic optimization. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/51862

Chicago Manual of Style (16th Edition):

Angulo Olivares, Gustavo, I. “Integer programming approaches for semicontinuous and stochastic optimization.” 2014. Doctoral Dissertation, Georgia Tech. Accessed November 20, 2019. http://hdl.handle.net/1853/51862.

MLA Handbook (7th Edition):

Angulo Olivares, Gustavo, I. “Integer programming approaches for semicontinuous and stochastic optimization.” 2014. Web. 20 Nov 2019.

Vancouver:

Angulo Olivares, Gustavo I. Integer programming approaches for semicontinuous and stochastic optimization. [Internet] [Doctoral dissertation]. Georgia Tech; 2014. [cited 2019 Nov 20]. Available from: http://hdl.handle.net/1853/51862.

Council of Science Editors:

Angulo Olivares, Gustavo I. Integer programming approaches for semicontinuous and stochastic optimization. [Doctoral Dissertation]. Georgia Tech; 2014. Available from: http://hdl.handle.net/1853/51862


Georgia Tech

6. Lee, Junho. Track layout accommodating dynamic routing in automated material handling systems.

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

 Modern semiconductor fabrication facilities depend on automated material handling systems (AMHSs) to manage the processes and variations in time required to produce advanced semiconductor products.… (more)

Subjects/Keywords: Semiconductor manufacturing; Automated material handling systems; Network design problems; Dynamic routing; Alternative paths

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lee, J. (2016). Track layout accommodating dynamic routing in automated material handling systems. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/55562

Chicago Manual of Style (16th Edition):

Lee, Junho. “Track layout accommodating dynamic routing in automated material handling systems.” 2016. Doctoral Dissertation, Georgia Tech. Accessed November 20, 2019. http://hdl.handle.net/1853/55562.

MLA Handbook (7th Edition):

Lee, Junho. “Track layout accommodating dynamic routing in automated material handling systems.” 2016. Web. 20 Nov 2019.

Vancouver:

Lee J. Track layout accommodating dynamic routing in automated material handling systems. [Internet] [Doctoral dissertation]. Georgia Tech; 2016. [cited 2019 Nov 20]. Available from: http://hdl.handle.net/1853/55562.

Council of Science Editors:

Lee J. Track layout accommodating dynamic routing in automated material handling systems. [Doctoral Dissertation]. Georgia Tech; 2016. Available from: http://hdl.handle.net/1853/55562


Georgia Tech

7. Klapp Belmar, Mathias A. Dynamic optimization for same-day delivery operations.

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

 Same-day delivery (SDD) is a service where consumers place orders online on the same day that these are processed and delivered to the customer. Providing… (more)

Subjects/Keywords: Same-day delivery; Dynamic optimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Klapp Belmar, M. A. (2016). Dynamic optimization for same-day delivery operations. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/56151

Chicago Manual of Style (16th Edition):

Klapp Belmar, Mathias A. “Dynamic optimization for same-day delivery operations.” 2016. Doctoral Dissertation, Georgia Tech. Accessed November 20, 2019. http://hdl.handle.net/1853/56151.

MLA Handbook (7th Edition):

Klapp Belmar, Mathias A. “Dynamic optimization for same-day delivery operations.” 2016. Web. 20 Nov 2019.

Vancouver:

Klapp Belmar MA. Dynamic optimization for same-day delivery operations. [Internet] [Doctoral dissertation]. Georgia Tech; 2016. [cited 2019 Nov 20]. Available from: http://hdl.handle.net/1853/56151.

Council of Science Editors:

Klapp Belmar MA. Dynamic optimization for same-day delivery operations. [Doctoral Dissertation]. Georgia Tech; 2016. Available from: http://hdl.handle.net/1853/56151


Georgia Tech

8. Hewitt, Michael R. Integer programming based search.

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

 When integer programming (IP) models are used in operational situations there is a need to consider the tradeoff between the conflicting goals of solution quality… (more)

Subjects/Keywords: Freight transportation; Column generation; Integer programming; Heuristics; Integer programming; Relaxation methods (Mathematics); Freight and freightage

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hewitt, M. R. (2009). Integer programming based search. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/31641

Chicago Manual of Style (16th Edition):

Hewitt, Michael R. “Integer programming based search.” 2009. Doctoral Dissertation, Georgia Tech. Accessed November 20, 2019. http://hdl.handle.net/1853/31641.

MLA Handbook (7th Edition):

Hewitt, Michael R. “Integer programming based search.” 2009. Web. 20 Nov 2019.

Vancouver:

Hewitt MR. Integer programming based search. [Internet] [Doctoral dissertation]. Georgia Tech; 2009. [cited 2019 Nov 20]. Available from: http://hdl.handle.net/1853/31641.

Council of Science Editors:

Hewitt MR. Integer programming based search. [Doctoral Dissertation]. Georgia Tech; 2009. Available from: http://hdl.handle.net/1853/31641


Georgia Tech

9. Na, Byungsoo. Optimization of automated float glass lines.

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

 Motivated by operational issues in real-world glass manufacturing, this thesis addresses a problem of laying out and sequencing the orders so as to minimize wasted… (more)

Subjects/Keywords: Optimization; Cyclic schedule; Cutting; Scheduling; Float line; Glass; Heuristics; Heuristic algorithms; Programming (Mathematics); Production scheduling

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Na, B. (2010). Optimization of automated float glass lines. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/39637

Chicago Manual of Style (16th Edition):

Na, Byungsoo. “Optimization of automated float glass lines.” 2010. Doctoral Dissertation, Georgia Tech. Accessed November 20, 2019. http://hdl.handle.net/1853/39637.

MLA Handbook (7th Edition):

Na, Byungsoo. “Optimization of automated float glass lines.” 2010. Web. 20 Nov 2019.

Vancouver:

Na B. Optimization of automated float glass lines. [Internet] [Doctoral dissertation]. Georgia Tech; 2010. [cited 2019 Nov 20]. Available from: http://hdl.handle.net/1853/39637.

Council of Science Editors:

Na B. Optimization of automated float glass lines. [Doctoral Dissertation]. Georgia Tech; 2010. Available from: http://hdl.handle.net/1853/39637


Georgia Tech

10. Vielma Centeno, Juan Pablo. Mixed integer programming approaches for nonlinear and stochastic programming.

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

 In this thesis we study how to solve some nonconvex optimization problems by using methods that capitalize on the success of Linear Programming (LP) based… (more)

Subjects/Keywords: Mixed integer programming; Stochastic programming; Mathematical optimization; Nonconvex programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Vielma Centeno, J. P. (2009). Mixed integer programming approaches for nonlinear and stochastic programming. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/29624

Chicago Manual of Style (16th Edition):

Vielma Centeno, Juan Pablo. “Mixed integer programming approaches for nonlinear and stochastic programming.” 2009. Doctoral Dissertation, Georgia Tech. Accessed November 20, 2019. http://hdl.handle.net/1853/29624.

MLA Handbook (7th Edition):

Vielma Centeno, Juan Pablo. “Mixed integer programming approaches for nonlinear and stochastic programming.” 2009. Web. 20 Nov 2019.

Vancouver:

Vielma Centeno JP. Mixed integer programming approaches for nonlinear and stochastic programming. [Internet] [Doctoral dissertation]. Georgia Tech; 2009. [cited 2019 Nov 20]. Available from: http://hdl.handle.net/1853/29624.

Council of Science Editors:

Vielma Centeno JP. Mixed integer programming approaches for nonlinear and stochastic programming. [Doctoral Dissertation]. Georgia Tech; 2009. Available from: http://hdl.handle.net/1853/29624


Georgia Tech

11. Feizollahi, Mohammadjavad. Large-scale unit commitment: Decentralized mixed integer programming approaches.

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

 We investigate theory and application of decentralized optimization for mixed integer programming (MIP) problems. Our focus is on loosely coupled MIPs where different blocks of… (more)

Subjects/Keywords: Decentralized optimization; Augmented Lagrangian; Unit commitment; Mixed integer programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Feizollahi, M. (2015). Large-scale unit commitment: Decentralized mixed integer programming approaches. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/56169

Chicago Manual of Style (16th Edition):

Feizollahi, Mohammadjavad. “Large-scale unit commitment: Decentralized mixed integer programming approaches.” 2015. Doctoral Dissertation, Georgia Tech. Accessed November 20, 2019. http://hdl.handle.net/1853/56169.

MLA Handbook (7th Edition):

Feizollahi, Mohammadjavad. “Large-scale unit commitment: Decentralized mixed integer programming approaches.” 2015. Web. 20 Nov 2019.

Vancouver:

Feizollahi M. Large-scale unit commitment: Decentralized mixed integer programming approaches. [Internet] [Doctoral dissertation]. Georgia Tech; 2015. [cited 2019 Nov 20]. Available from: http://hdl.handle.net/1853/56169.

Council of Science Editors:

Feizollahi M. Large-scale unit commitment: Decentralized mixed integer programming approaches. [Doctoral Dissertation]. Georgia Tech; 2015. Available from: http://hdl.handle.net/1853/56169


Georgia Tech

12. Munguia Conejero, Lluis-Miquel M. High performance computing algorithms for discrete optimization.

Degree: PhD, Computational Science and Engineering, 2017, Georgia Tech

 This thesis concerns the application of High Performance Computing to Discrete Optimization, and the development of massively parallel algorithms designed to accelerate the solving process… (more)

Subjects/Keywords: Integer programming; Discrete optimization; Parallel computing; Primal heuristics; High performance computing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Munguia Conejero, L. M. (2017). High performance computing algorithms for discrete optimization. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/60689

Chicago Manual of Style (16th Edition):

Munguia Conejero, Lluis-Miquel M. “High performance computing algorithms for discrete optimization.” 2017. Doctoral Dissertation, Georgia Tech. Accessed November 20, 2019. http://hdl.handle.net/1853/60689.

MLA Handbook (7th Edition):

Munguia Conejero, Lluis-Miquel M. “High performance computing algorithms for discrete optimization.” 2017. Web. 20 Nov 2019.

Vancouver:

Munguia Conejero LM. High performance computing algorithms for discrete optimization. [Internet] [Doctoral dissertation]. Georgia Tech; 2017. [cited 2019 Nov 20]. Available from: http://hdl.handle.net/1853/60689.

Council of Science Editors:

Munguia Conejero LM. High performance computing algorithms for discrete optimization. [Doctoral Dissertation]. Georgia Tech; 2017. Available from: http://hdl.handle.net/1853/60689


Georgia Tech

13. Karabulut, Ezgi. Distributed integer programming.

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

 In this thesis, we study distributed integer programming problems that involve multiple players with integer programming problems linked together with a common resource constraint. Our… (more)

Subjects/Keywords: Decentralized optimization; Resource allocation; Concavity; Online optimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Karabulut, E. (2017). Distributed integer programming. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/59194

Chicago Manual of Style (16th Edition):

Karabulut, Ezgi. “Distributed integer programming.” 2017. Doctoral Dissertation, Georgia Tech. Accessed November 20, 2019. http://hdl.handle.net/1853/59194.

MLA Handbook (7th Edition):

Karabulut, Ezgi. “Distributed integer programming.” 2017. Web. 20 Nov 2019.

Vancouver:

Karabulut E. Distributed integer programming. [Internet] [Doctoral dissertation]. Georgia Tech; 2017. [cited 2019 Nov 20]. Available from: http://hdl.handle.net/1853/59194.

Council of Science Editors:

Karabulut E. Distributed integer programming. [Doctoral Dissertation]. Georgia Tech; 2017. Available from: http://hdl.handle.net/1853/59194

14. Wang, Qianyi. Theory and computation of sparse cutting planes.

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

 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

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th Edition):

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

MLA Handbook (7th Edition):

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

Vancouver:

Wang Q. Theory and computation of sparse cutting planes. [Internet] [Doctoral dissertation]. Georgia Tech; 2016. [cited 2019 Nov 20]. 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

15. Kilinc-Karzan, Fatma. Tractable relaxations and efficient algorithmic techniques for large-scale optimization.

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

 In this thesis, we develop tractable relaxations and efficient algorithms for large-scale optimization. Our developments are motivated by a recent paradigm, Compressed Sensing (CS), which… (more)

Subjects/Keywords: First order methods; Tractable relaxations; Convex programming; Signal processing; Mathematical optimization; Compressed sensing; Mathematical optimization; Algorithms; Signal processing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kilinc-Karzan, F. (2011). Tractable relaxations and efficient algorithmic techniques for large-scale optimization. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/41141

Chicago Manual of Style (16th Edition):

Kilinc-Karzan, Fatma. “Tractable relaxations and efficient algorithmic techniques for large-scale optimization.” 2011. Doctoral Dissertation, Georgia Tech. Accessed November 20, 2019. http://hdl.handle.net/1853/41141.

MLA Handbook (7th Edition):

Kilinc-Karzan, Fatma. “Tractable relaxations and efficient algorithmic techniques for large-scale optimization.” 2011. Web. 20 Nov 2019.

Vancouver:

Kilinc-Karzan F. Tractable relaxations and efficient algorithmic techniques for large-scale optimization. [Internet] [Doctoral dissertation]. Georgia Tech; 2011. [cited 2019 Nov 20]. Available from: http://hdl.handle.net/1853/41141.

Council of Science Editors:

Kilinc-Karzan F. Tractable relaxations and efficient algorithmic techniques for large-scale optimization. [Doctoral Dissertation]. Georgia Tech; 2011. Available from: http://hdl.handle.net/1853/41141

16. Papageorgiou, Dimitri Jason. Optimization in maritime inventory routing.

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

 The primary aim of this thesis is to develop effective solution techniques for large-scale maritime inventory routing problems that possess a core substructure common in… (more)

Subjects/Keywords: Mixed-integer programming; Inventory routing; Maritime logistics; Maritime transportation; Optimization; Approximate dynamic programming; Shipping; Scheduling; Mathematical optimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Papageorgiou, D. J. (2012). Optimization in maritime inventory routing. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/50117

Chicago Manual of Style (16th Edition):

Papageorgiou, Dimitri Jason. “Optimization in maritime inventory routing.” 2012. Doctoral Dissertation, Georgia Tech. Accessed November 20, 2019. http://hdl.handle.net/1853/50117.

MLA Handbook (7th Edition):

Papageorgiou, Dimitri Jason. “Optimization in maritime inventory routing.” 2012. Web. 20 Nov 2019.

Vancouver:

Papageorgiou DJ. Optimization in maritime inventory routing. [Internet] [Doctoral dissertation]. Georgia Tech; 2012. [cited 2019 Nov 20]. Available from: http://hdl.handle.net/1853/50117.

Council of Science Editors:

Papageorgiou DJ. Optimization in maritime inventory routing. [Doctoral Dissertation]. Georgia Tech; 2012. Available from: http://hdl.handle.net/1853/50117

17. Ding, Zhihao. Headway control schemes to resist bus bunching.

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

 Bus bunching occurs when two or more buses travel head to tail. It is an annoying problem in public transportation because it increases passengers' average… (more)

Subjects/Keywords: Bus bunching; Self-organizing system

…reflects the level of ridership. It ranges from 0 to 0.2 for Georgia Tech campus bus system… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ding, Z. (2016). Headway control schemes to resist bus bunching. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/54957

Chicago Manual of Style (16th Edition):

Ding, Zhihao. “Headway control schemes to resist bus bunching.” 2016. Doctoral Dissertation, Georgia Tech. Accessed November 20, 2019. http://hdl.handle.net/1853/54957.

MLA Handbook (7th Edition):

Ding, Zhihao. “Headway control schemes to resist bus bunching.” 2016. Web. 20 Nov 2019.

Vancouver:

Ding Z. Headway control schemes to resist bus bunching. [Internet] [Doctoral dissertation]. Georgia Tech; 2016. [cited 2019 Nov 20]. Available from: http://hdl.handle.net/1853/54957.

Council of Science Editors:

Ding Z. Headway control schemes to resist bus bunching. [Doctoral Dissertation]. Georgia Tech; 2016. Available from: http://hdl.handle.net/1853/54957

18. Mac Cawley, Alejandro F. The international wine supply chain: challenges from bottling to the glass.

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

 Wine companies face two important challenges in their supply chain: the international shipping temperatures and their effect on the perceived quality of the wine and… (more)

Subjects/Keywords: Wine supply chain; Logistics; Shipping temperatures; Wine quality; Wine temperature; Bottling line scheduling; Lot sizing; Optimization; Sequence dependent setup times

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mac Cawley, A. F. (2014). The international wine supply chain: challenges from bottling to the glass. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/52213

Chicago Manual of Style (16th Edition):

Mac Cawley, Alejandro F. “The international wine supply chain: challenges from bottling to the glass.” 2014. Doctoral Dissertation, Georgia Tech. Accessed November 20, 2019. http://hdl.handle.net/1853/52213.

MLA Handbook (7th Edition):

Mac Cawley, Alejandro F. “The international wine supply chain: challenges from bottling to the glass.” 2014. Web. 20 Nov 2019.

Vancouver:

Mac Cawley AF. The international wine supply chain: challenges from bottling to the glass. [Internet] [Doctoral dissertation]. Georgia Tech; 2014. [cited 2019 Nov 20]. Available from: http://hdl.handle.net/1853/52213.

Council of Science Editors:

Mac Cawley AF. The international wine supply chain: challenges from bottling to the glass. [Doctoral Dissertation]. Georgia Tech; 2014. Available from: http://hdl.handle.net/1853/52213

19. Bartlett, Kelly K. Congestion-aware dynamic routing in automated material handling systems.

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

 In semiconductor manufacturing, automated material handling systems (AMHSs) transport wafers through a complex re-entrant manufacturing process. In some systems, Overhead Hoist Transport (OHT) vehicles move… (more)

Subjects/Keywords: Dynamic routing; Material handling

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bartlett, K. K. (2014). Congestion-aware dynamic routing in automated material handling systems. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/53013

Chicago Manual of Style (16th Edition):

Bartlett, Kelly K. “Congestion-aware dynamic routing in automated material handling systems.” 2014. Doctoral Dissertation, Georgia Tech. Accessed November 20, 2019. http://hdl.handle.net/1853/53013.

MLA Handbook (7th Edition):

Bartlett, Kelly K. “Congestion-aware dynamic routing in automated material handling systems.” 2014. Web. 20 Nov 2019.

Vancouver:

Bartlett KK. Congestion-aware dynamic routing in automated material handling systems. [Internet] [Doctoral dissertation]. Georgia Tech; 2014. [cited 2019 Nov 20]. Available from: http://hdl.handle.net/1853/53013.

Council of Science Editors:

Bartlett KK. Congestion-aware dynamic routing in automated material handling systems. [Doctoral Dissertation]. Georgia Tech; 2014. Available from: http://hdl.handle.net/1853/53013

20. Chen, Kenneth. Topics in group methods for integer programming.

Degree: PhD, Mathematics, 2011, Georgia Tech

 In 2003, Gomory and Johnson gave two different three-slope T-space facet constructions, both of which shared a slope with the corresponding Gomory mixed-integer cut. We… (more)

Subjects/Keywords: Lattice-free sets; T-space facets; Mixed-integer programming; Integer programming

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7 Sample image

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chen, K. (2011). Topics in group methods for integer programming. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/41133

Chicago Manual of Style (16th Edition):

Chen, Kenneth. “Topics in group methods for integer programming.” 2011. Doctoral Dissertation, Georgia Tech. Accessed November 20, 2019. http://hdl.handle.net/1853/41133.

MLA Handbook (7th Edition):

Chen, Kenneth. “Topics in group methods for integer programming.” 2011. Web. 20 Nov 2019.

Vancouver:

Chen K. Topics in group methods for integer programming. [Internet] [Doctoral dissertation]. Georgia Tech; 2011. [cited 2019 Nov 20]. Available from: http://hdl.handle.net/1853/41133.

Council of Science Editors:

Chen K. Topics in group methods for integer programming. [Doctoral Dissertation]. Georgia Tech; 2011. Available from: http://hdl.handle.net/1853/41133

21. Petersen, Jon D. Large-scale mixed integer optimization approaches for scheduling airline operations under irregularity.

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

 Perhaps no single industry has benefited more from advancements in computation, analytics, and optimization than the airline industry. Operations Research (OR) is now ubiquitous in… (more)

Subjects/Keywords: Airline recovery; Operations research; Large-scale optimization; Mathematical optimization; Integer programming; Air traffic capacity; Scheduling

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Petersen, J. D. (2012). Large-scale mixed integer optimization approaches for scheduling airline operations under irregularity. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/43662

Chicago Manual of Style (16th Edition):

Petersen, Jon D. “Large-scale mixed integer optimization approaches for scheduling airline operations under irregularity.” 2012. Doctoral Dissertation, Georgia Tech. Accessed November 20, 2019. http://hdl.handle.net/1853/43662.

MLA Handbook (7th Edition):

Petersen, Jon D. “Large-scale mixed integer optimization approaches for scheduling airline operations under irregularity.” 2012. Web. 20 Nov 2019.

Vancouver:

Petersen JD. Large-scale mixed integer optimization approaches for scheduling airline operations under irregularity. [Internet] [Doctoral dissertation]. Georgia Tech; 2012. [cited 2019 Nov 20]. Available from: http://hdl.handle.net/1853/43662.

Council of Science Editors:

Petersen JD. Large-scale mixed integer optimization approaches for scheduling airline operations under irregularity. [Doctoral Dissertation]. Georgia Tech; 2012. Available from: http://hdl.handle.net/1853/43662

22. Gui, Luyi. Managing and optimizing decentralized networks with resource sharing.

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

 Resource sharing is a common collaborative strategy used in practice. It has the potential to create synergistic value and leads to higher system efficiency. However,… (more)

Subjects/Keywords: Legislation; Mechanism design; Resource sharing; Decentralized networks; Optimization; EPR; Game theory; Cooperative games (Mathematics); Self-interest; Mathematical optimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gui, L. (2013). Managing and optimizing decentralized networks with resource sharing. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/47707

Chicago Manual of Style (16th Edition):

Gui, Luyi. “Managing and optimizing decentralized networks with resource sharing.” 2013. Doctoral Dissertation, Georgia Tech. Accessed November 20, 2019. http://hdl.handle.net/1853/47707.

MLA Handbook (7th Edition):

Gui, Luyi. “Managing and optimizing decentralized networks with resource sharing.” 2013. Web. 20 Nov 2019.

Vancouver:

Gui L. Managing and optimizing decentralized networks with resource sharing. [Internet] [Doctoral dissertation]. Georgia Tech; 2013. [cited 2019 Nov 20]. Available from: http://hdl.handle.net/1853/47707.

Council of Science Editors:

Gui L. Managing and optimizing decentralized networks with resource sharing. [Doctoral Dissertation]. Georgia Tech; 2013. Available from: http://hdl.handle.net/1853/47707

23. He, Qie. Topics in discrete optimization: models, complexity and algorithms.

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

 In this dissertation we examine several discrete optimization problems through the perspectives of modeling, complexity and algorithms. We first provide a probabilistic comparison of split… (more)

Subjects/Keywords: Integer programming; Combinatorial optimization; Stochastic programming; Network flow; Production planning; Computational complexity; Mathematical optimization; Integer programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

He, Q. (2013). Topics in discrete optimization: models, complexity and algorithms. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/50237

Chicago Manual of Style (16th Edition):

He, Qie. “Topics in discrete optimization: models, complexity and algorithms.” 2013. Doctoral Dissertation, Georgia Tech. Accessed November 20, 2019. http://hdl.handle.net/1853/50237.

MLA Handbook (7th Edition):

He, Qie. “Topics in discrete optimization: models, complexity and algorithms.” 2013. Web. 20 Nov 2019.

Vancouver:

He Q. Topics in discrete optimization: models, complexity and algorithms. [Internet] [Doctoral dissertation]. Georgia Tech; 2013. [cited 2019 Nov 20]. Available from: http://hdl.handle.net/1853/50237.

Council of Science Editors:

He Q. Topics in discrete optimization: models, complexity and algorithms. [Doctoral Dissertation]. Georgia Tech; 2013. Available from: http://hdl.handle.net/1853/50237

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

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

 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

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th Edition):

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

MLA Handbook (7th Edition):

Chandrasekaran, Karthekeyan. “New approaches to integer programming.” 2012. Web. 20 Nov 2019.

Vancouver:

Chandrasekaran K. New approaches to integer programming. [Internet] [Doctoral dissertation]. Georgia Tech; 2012. [cited 2019 Nov 20]. 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

25. Gupte, Akshay. Mixed integer bilinear programming with applications to the pooling problem.

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

 Solution methodologies for mixed integer bilinear problems (MIBLP) are studied in this dissertation. This problem class is motivated using the pooling problem, a multicommodity network… (more)

Subjects/Keywords: Cutting planes; Pooling problem; Sequential knapsack; McCormick envelopes; Integer programming; Bilinear; Algorithms; Computer programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gupte, A. (2012). Mixed integer bilinear programming with applications to the pooling problem. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/45761

Chicago Manual of Style (16th Edition):

Gupte, Akshay. “Mixed integer bilinear programming with applications to the pooling problem.” 2012. Doctoral Dissertation, Georgia Tech. Accessed November 20, 2019. http://hdl.handle.net/1853/45761.

MLA Handbook (7th Edition):

Gupte, Akshay. “Mixed integer bilinear programming with applications to the pooling problem.” 2012. Web. 20 Nov 2019.

Vancouver:

Gupte A. Mixed integer bilinear programming with applications to the pooling problem. [Internet] [Doctoral dissertation]. Georgia Tech; 2012. [cited 2019 Nov 20]. Available from: http://hdl.handle.net/1853/45761.

Council of Science Editors:

Gupte A. Mixed integer bilinear programming with applications to the pooling problem. [Doctoral Dissertation]. Georgia Tech; 2012. Available from: http://hdl.handle.net/1853/45761

26. Tyber, Steven Jay. Cutting planes in mixed integer programming: theory and algorithms.

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

 Recent developments in mixed integer programming have highlighted the need for multi-row cuts. To this day, the performance of such cuts has typically fallen short… (more)

Subjects/Keywords: Integer programming; Superadditive lifting; Corner polyhedra; Finite group polyhedra; Fixed-charge flow; Knapsack; Integer programming; Operations research

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Tyber, S. J. (2013). Cutting planes in mixed integer programming: theory and algorithms. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/47560

Chicago Manual of Style (16th Edition):

Tyber, Steven Jay. “Cutting planes in mixed integer programming: theory and algorithms.” 2013. Doctoral Dissertation, Georgia Tech. Accessed November 20, 2019. http://hdl.handle.net/1853/47560.

MLA Handbook (7th Edition):

Tyber, Steven Jay. “Cutting planes in mixed integer programming: theory and algorithms.” 2013. Web. 20 Nov 2019.

Vancouver:

Tyber SJ. Cutting planes in mixed integer programming: theory and algorithms. [Internet] [Doctoral dissertation]. Georgia Tech; 2013. [cited 2019 Nov 20]. Available from: http://hdl.handle.net/1853/47560.

Council of Science Editors:

Tyber SJ. Cutting planes in mixed integer programming: theory and algorithms. [Doctoral Dissertation]. Georgia Tech; 2013. Available from: http://hdl.handle.net/1853/47560

27. Qiu, Feng. Probabilistic covering problems.

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

 This dissertation studies optimization problems that involve probabilistic covering constraints. A probabilistic constraint evaluates and requires that the probability that a set of constraints involving… (more)

Subjects/Keywords: Optimization; Stochastic programming; Chance-constrained program; Mixed-integer program; Probabilistic program; Covering problem; Mathematical optimization; Linear programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Qiu, F. (2013). Probabilistic covering problems. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/47567

Chicago Manual of Style (16th Edition):

Qiu, Feng. “Probabilistic covering problems.” 2013. Doctoral Dissertation, Georgia Tech. Accessed November 20, 2019. http://hdl.handle.net/1853/47567.

MLA Handbook (7th Edition):

Qiu, Feng. “Probabilistic covering problems.” 2013. Web. 20 Nov 2019.

Vancouver:

Qiu F. Probabilistic covering problems. [Internet] [Doctoral dissertation]. Georgia Tech; 2013. [cited 2019 Nov 20]. Available from: http://hdl.handle.net/1853/47567.

Council of Science Editors:

Qiu F. Probabilistic covering problems. [Doctoral Dissertation]. Georgia Tech; 2013. Available from: http://hdl.handle.net/1853/47567


Georgia Tech

28. Song, Jin-Hwa. Inventory Routing Investigations.

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

 The elimination of distribution inefficiencies, occurring due to the timing of customers' orders is an important reason for companies to introduce vendor managed inventory programs.… (more)

Subjects/Keywords: Logistics; Randomized greedy heuristic; Branch-and-cut; Vendor managed inventory resupply; Delivery cover cuts; Delivery pattern; Pattern selection LP; Base delivery pattern; Inventory routing problem; Performance measurment; IRP-CM; Continuous moves; Inventory control Computer simulation; Physical distribution of goods; Mathematical optimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Song, J. (2004). Inventory Routing Investigations. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/5028

Chicago Manual of Style (16th Edition):

Song, Jin-Hwa. “Inventory Routing Investigations.” 2004. Doctoral Dissertation, Georgia Tech. Accessed November 20, 2019. http://hdl.handle.net/1853/5028.

MLA Handbook (7th Edition):

Song, Jin-Hwa. “Inventory Routing Investigations.” 2004. Web. 20 Nov 2019.

Vancouver:

Song J. Inventory Routing Investigations. [Internet] [Doctoral dissertation]. Georgia Tech; 2004. [cited 2019 Nov 20]. Available from: http://hdl.handle.net/1853/5028.

Council of Science Editors:

Song J. Inventory Routing Investigations. [Doctoral Dissertation]. Georgia Tech; 2004. Available from: http://hdl.handle.net/1853/5028


Georgia Tech

29. Goycoolea, Marcos G. Cutting Planes for Large Mixed Integer Programming Models.

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

 In this thesis I focus on cutting planes for large Mixed Integer Programming (MIP) problems. More specifically, I focus on two independent cutting planes studies.… (more)

Subjects/Keywords: Traveling salesman problem; Cutting planes; Mixed integer rounding; Mixed integer programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Goycoolea, M. G. (2006). Cutting Planes for Large Mixed Integer Programming Models. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/13956

Chicago Manual of Style (16th Edition):

Goycoolea, Marcos G. “Cutting Planes for Large Mixed Integer Programming Models.” 2006. Doctoral Dissertation, Georgia Tech. Accessed November 20, 2019. http://hdl.handle.net/1853/13956.

MLA Handbook (7th Edition):

Goycoolea, Marcos G. “Cutting Planes for Large Mixed Integer Programming Models.” 2006. Web. 20 Nov 2019.

Vancouver:

Goycoolea MG. Cutting Planes for Large Mixed Integer Programming Models. [Internet] [Doctoral dissertation]. Georgia Tech; 2006. [cited 2019 Nov 20]. Available from: http://hdl.handle.net/1853/13956.

Council of Science Editors:

Goycoolea MG. Cutting Planes for Large Mixed Integer Programming Models. [Doctoral Dissertation]. Georgia Tech; 2006. Available from: http://hdl.handle.net/1853/13956


Georgia Tech

30. Brooks, J. Paul. Solving a mixed-integer programming formulation of a classification model with misclassification limits.

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

 Classification, the development of rules for the allocation of observations to one or more groups, is a fundamental problem in machine learning and has been… (more)

Subjects/Keywords: Machine learning; Mathematical programming; Classification; Integer programming; Discriminant analysis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Brooks, J. P. (2005). Solving a mixed-integer programming formulation of a classification model with misclassification limits. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/7473

Chicago Manual of Style (16th Edition):

Brooks, J Paul. “Solving a mixed-integer programming formulation of a classification model with misclassification limits.” 2005. Doctoral Dissertation, Georgia Tech. Accessed November 20, 2019. http://hdl.handle.net/1853/7473.

MLA Handbook (7th Edition):

Brooks, J Paul. “Solving a mixed-integer programming formulation of a classification model with misclassification limits.” 2005. Web. 20 Nov 2019.

Vancouver:

Brooks JP. Solving a mixed-integer programming formulation of a classification model with misclassification limits. [Internet] [Doctoral dissertation]. Georgia Tech; 2005. [cited 2019 Nov 20]. Available from: http://hdl.handle.net/1853/7473.

Council of Science Editors:

Brooks JP. Solving a mixed-integer programming formulation of a classification model with misclassification limits. [Doctoral Dissertation]. Georgia Tech; 2005. Available from: http://hdl.handle.net/1853/7473

[1] [2]

.