Advanced search options

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

You searched for `subject:(Integer Programming)`

.
Showing records 1 – 30 of
1095 total matches.

◁ [1] [2] [3] [4] [5] … [37] ▶

Search Limiters

Dates

- 2017 – 2021 (320)
- 2012 – 2016 (472)
- 2007 – 2011 (219)
- 2002 – 2006 (84)
- 1997 – 2001 (26)
- 1992 – 1996 (12)
- 1972 – 1976 (15)

Universities

- Georgia Tech (82)
- University of São Paulo (39)
- Virginia Tech (37)
- Delft University of Technology (34)
- Texas A&M University (34)
- University of Waterloo (27)
- Pontifical Catholic University of Rio de Janeiro (24)
- University of Texas – Austin (22)
- National University of Singapore (19)
- Universidade Estadual de Campinas (18)
- Kansas State University (17)
- University of Michigan (17)
- University of Tennessee – Knoxville (16)
- Colorado School of Mines (15)
- KTH (15)

Department

- Industrial and Systems Engineering (93)
- Industrial Engineering (44)
- Informatique (21)
- Civil Engineering (16)
- Electrical Engineering (15)
- Mechanical Engineering (13)
- Electrical and Computer Engineering (12)
- Mathematics (11)
- Computer Science (10)
- Industrial engineering (10)

Degrees

- PhD (298)
- MS (106)
- Docteur es (72)
- Mestrado (29)
- Master (10)

▼ Search Limiters

Penn State University

1.
Thein, Michael William.
An In Depth Analysis of Sudoku with Focus in *Integer* and Constraint * Programming*.

Degree: 2014, Penn State University

URL: https://submit-etda.libraries.psu.edu/catalog/21272

► We analyze sudoku in detail. We study sudoku as it pertains to computational complexity, graph coloring, and various *programming* methods that can be used to…
(more)

Subjects/Keywords: Sudoku; Integer Programming; Constraint Programming

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Thein, M. W. (2014). An In Depth Analysis of Sudoku with Focus in Integer and Constraint Programming. (Thesis). Penn State University. Retrieved from https://submit-etda.libraries.psu.edu/catalog/21272

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

Thein, Michael William. “An In Depth Analysis of Sudoku with Focus in Integer and Constraint Programming.” 2014. Thesis, Penn State University. Accessed March 04, 2021. https://submit-etda.libraries.psu.edu/catalog/21272.

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Thein, Michael William. “An In Depth Analysis of Sudoku with Focus in Integer and Constraint Programming.” 2014. Web. 04 Mar 2021.

Vancouver:

Thein MW. An In Depth Analysis of Sudoku with Focus in Integer and Constraint Programming. [Internet] [Thesis]. Penn State University; 2014. [cited 2021 Mar 04]. Available from: https://submit-etda.libraries.psu.edu/catalog/21272.

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

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Thein MW. An In Depth Analysis of Sudoku with Focus in Integer and Constraint Programming. [Thesis]. Penn State University; 2014. Available from: https://submit-etda.libraries.psu.edu/catalog/21272

Not specified: Masters Thesis or Doctoral Dissertation

Dalhousie University

2.
Zhou, Jun.
ANALYSIS OF A MINE-MILL PRODUCTION SYSTEM USING SIMULATION
AND *INTEGER* * PROGRAMMING*.

Degree: Master of Applied Science, Department of Industrial Engineering, 2010, Dalhousie University

URL: http://hdl.handle.net/10222/13162

► Mine-mill production faces several operational difficulties, such as fluctuations in ore delivery from mines, random failure of machines, usage of stockpiles and storage bins, and…
(more)

Subjects/Keywords: Simulation; Integer Programming; Mill Planning

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Zhou, J. (2010). ANALYSIS OF A MINE-MILL PRODUCTION SYSTEM USING SIMULATION AND INTEGER PROGRAMMING. (Masters Thesis). Dalhousie University. Retrieved from http://hdl.handle.net/10222/13162

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

Zhou, Jun. “ANALYSIS OF A MINE-MILL PRODUCTION SYSTEM USING SIMULATION AND INTEGER PROGRAMMING.” 2010. Masters Thesis, Dalhousie University. Accessed March 04, 2021. http://hdl.handle.net/10222/13162.

MLA Handbook (7^{th} Edition):

Zhou, Jun. “ANALYSIS OF A MINE-MILL PRODUCTION SYSTEM USING SIMULATION AND INTEGER PROGRAMMING.” 2010. Web. 04 Mar 2021.

Vancouver:

Zhou J. ANALYSIS OF A MINE-MILL PRODUCTION SYSTEM USING SIMULATION AND INTEGER PROGRAMMING. [Internet] [Masters thesis]. Dalhousie University; 2010. [cited 2021 Mar 04]. Available from: http://hdl.handle.net/10222/13162.

Council of Science Editors:

Zhou J. ANALYSIS OF A MINE-MILL PRODUCTION SYSTEM USING SIMULATION AND INTEGER PROGRAMMING. [Masters Thesis]. Dalhousie University; 2010. Available from: http://hdl.handle.net/10222/13162

Penn State University

3. Trail, Casey D. Multiobjective Fixed Product Flexible Shop Scheduling with Transportation Considerations.

Degree: 2012, Penn State University

URL: https://submit-etda.libraries.psu.edu/catalog/16271

► This dissertation introduces the problem of multiobjective fixed product flexible shop scheduling with transportation considerations (MFFST). The MFFST problem consists of locations, tasks that need…
(more)

Subjects/Keywords: Multiobjective optimization; scheduling; integer programming

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Trail, C. D. (2012). Multiobjective Fixed Product Flexible Shop Scheduling with Transportation Considerations. (Thesis). Penn State University. Retrieved from https://submit-etda.libraries.psu.edu/catalog/16271

Not specified: Masters Thesis or Doctoral Dissertation

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

Trail, Casey D. “Multiobjective Fixed Product Flexible Shop Scheduling with Transportation Considerations.” 2012. Thesis, Penn State University. Accessed March 04, 2021. https://submit-etda.libraries.psu.edu/catalog/16271.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Trail, Casey D. “Multiobjective Fixed Product Flexible Shop Scheduling with Transportation Considerations.” 2012. Web. 04 Mar 2021.

Vancouver:

Trail CD. Multiobjective Fixed Product Flexible Shop Scheduling with Transportation Considerations. [Internet] [Thesis]. Penn State University; 2012. [cited 2021 Mar 04]. Available from: https://submit-etda.libraries.psu.edu/catalog/16271.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Trail CD. Multiobjective Fixed Product Flexible Shop Scheduling with Transportation Considerations. [Thesis]. Penn State University; 2012. Available from: https://submit-etda.libraries.psu.edu/catalog/16271

Not specified: Masters Thesis or Doctoral Dissertation

Oregon State University

4. Battilega, John Anthony. Computational improvements to Benders decomposition for generalized fixed charge problems.

Degree: PhD, Mathematics, 1973, Oregon State University

URL: http://hdl.handle.net/1957/17018

► A computationally efficient algorithm has been developed for determining exact or approximate solutions for large scale generalized fixed charge problems. This algorithm is based on…
(more)

Subjects/Keywords: Integer programming

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Battilega, J. A. (1973). Computational improvements to Benders decomposition for generalized fixed charge problems. (Doctoral Dissertation). Oregon State University. Retrieved from http://hdl.handle.net/1957/17018

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

Battilega, John Anthony. “Computational improvements to Benders decomposition for generalized fixed charge problems.” 1973. Doctoral Dissertation, Oregon State University. Accessed March 04, 2021. http://hdl.handle.net/1957/17018.

MLA Handbook (7^{th} Edition):

Battilega, John Anthony. “Computational improvements to Benders decomposition for generalized fixed charge problems.” 1973. Web. 04 Mar 2021.

Vancouver:

Battilega JA. Computational improvements to Benders decomposition for generalized fixed charge problems. [Internet] [Doctoral dissertation]. Oregon State University; 1973. [cited 2021 Mar 04]. Available from: http://hdl.handle.net/1957/17018.

Council of Science Editors:

Battilega JA. Computational improvements to Benders decomposition for generalized fixed charge problems. [Doctoral Dissertation]. Oregon State University; 1973. Available from: http://hdl.handle.net/1957/17018

Colorado State University

5. Suksavate, Warong. Develop a multi-periods fuel treatments allocation model to fragment landscape high hazard fuel patches.

Degree: MS(M.S.), Forest and Rangeland Stewardship, 2013, Colorado State University

URL: http://hdl.handle.net/10217/80318

► Increased forest fuel loading and continuity have led to more large fires that can potentially cause the loss of property, life and forest resources in…
(more)

Subjects/Keywords: fuel treatment; mixed integer programming

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Suksavate, W. (2013). Develop a multi-periods fuel treatments allocation model to fragment landscape high hazard fuel patches. (Masters Thesis). Colorado State University. Retrieved from http://hdl.handle.net/10217/80318

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

Suksavate, Warong. “Develop a multi-periods fuel treatments allocation model to fragment landscape high hazard fuel patches.” 2013. Masters Thesis, Colorado State University. Accessed March 04, 2021. http://hdl.handle.net/10217/80318.

MLA Handbook (7^{th} Edition):

Suksavate, Warong. “Develop a multi-periods fuel treatments allocation model to fragment landscape high hazard fuel patches.” 2013. Web. 04 Mar 2021.

Vancouver:

Suksavate W. Develop a multi-periods fuel treatments allocation model to fragment landscape high hazard fuel patches. [Internet] [Masters thesis]. Colorado State University; 2013. [cited 2021 Mar 04]. Available from: http://hdl.handle.net/10217/80318.

Council of Science Editors:

Suksavate W. Develop a multi-periods fuel treatments allocation model to fragment landscape high hazard fuel patches. [Masters Thesis]. Colorado State University; 2013. Available from: http://hdl.handle.net/10217/80318

Colorado State University

6. Heine, Matthew Alan. Constrained optimization model for partitioning students into cooperative learning groups, A.

Degree: MS(M.S.), Mathematics, 2016, Colorado State University

URL: http://hdl.handle.net/10217/173460

► The problem of the constrained partitioning of a set using quantitative relationships amongst the elements is considered. An approach based on constrained *integer* *programming* is…
(more)

Subjects/Keywords: integer programming; cooperative learning; partitioning

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Heine, M. A. (2016). Constrained optimization model for partitioning students into cooperative learning groups, A. (Masters Thesis). Colorado State University. Retrieved from http://hdl.handle.net/10217/173460

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

Heine, Matthew Alan. “Constrained optimization model for partitioning students into cooperative learning groups, A.” 2016. Masters Thesis, Colorado State University. Accessed March 04, 2021. http://hdl.handle.net/10217/173460.

MLA Handbook (7^{th} Edition):

Heine, Matthew Alan. “Constrained optimization model for partitioning students into cooperative learning groups, A.” 2016. Web. 04 Mar 2021.

Vancouver:

Heine MA. Constrained optimization model for partitioning students into cooperative learning groups, A. [Internet] [Masters thesis]. Colorado State University; 2016. [cited 2021 Mar 04]. Available from: http://hdl.handle.net/10217/173460.

Council of Science Editors:

Heine MA. Constrained optimization model for partitioning students into cooperative learning groups, A. [Masters Thesis]. Colorado State University; 2016. Available from: http://hdl.handle.net/10217/173460

Georgia Tech

7. Tompkins, Curtis Johnston. Group theoretic structures in the fixed charge transportation problem.

Degree: PhD, Industrial engineering, 1971, Georgia Tech

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

Subjects/Keywords: Integer programming

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Tompkins, C. J. (1971). Group theoretic structures in the fixed charge transportation problem. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/25022

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

Tompkins, Curtis Johnston. “Group theoretic structures in the fixed charge transportation problem.” 1971. Doctoral Dissertation, Georgia Tech. Accessed March 04, 2021. http://hdl.handle.net/1853/25022.

MLA Handbook (7^{th} Edition):

Tompkins, Curtis Johnston. “Group theoretic structures in the fixed charge transportation problem.” 1971. Web. 04 Mar 2021.

Vancouver:

Tompkins CJ. Group theoretic structures in the fixed charge transportation problem. [Internet] [Doctoral dissertation]. Georgia Tech; 1971. [cited 2021 Mar 04]. Available from: http://hdl.handle.net/1853/25022.

Council of Science Editors:

Tompkins CJ. Group theoretic structures in the fixed charge transportation problem. [Doctoral Dissertation]. Georgia Tech; 1971. Available from: http://hdl.handle.net/1853/25022

Georgia Tech

8. Carroll, Charles Lemuel. Variable selection rules for implicit enumeration.

Degree: MS, Industrial engineering, 1977, Georgia Tech

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

Subjects/Keywords: Integer programming

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Carroll, C. L. (1977). Variable selection rules for implicit enumeration. (Masters Thesis). Georgia Tech. Retrieved from http://hdl.handle.net/1853/25508

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

Carroll, Charles Lemuel. “Variable selection rules for implicit enumeration.” 1977. Masters Thesis, Georgia Tech. Accessed March 04, 2021. http://hdl.handle.net/1853/25508.

MLA Handbook (7^{th} Edition):

Carroll, Charles Lemuel. “Variable selection rules for implicit enumeration.” 1977. Web. 04 Mar 2021.

Vancouver:

Carroll CL. Variable selection rules for implicit enumeration. [Internet] [Masters thesis]. Georgia Tech; 1977. [cited 2021 Mar 04]. Available from: http://hdl.handle.net/1853/25508.

Council of Science Editors:

Carroll CL. Variable selection rules for implicit enumeration. [Masters Thesis]. Georgia Tech; 1977. Available from: http://hdl.handle.net/1853/25508

Georgia Tech

9.
Gu, Zonghao.
Lifted cover inequalities for 0-1 and mixed 0-1 *integer* programs.

Degree: PhD, Industrial engineering, 1995, Georgia Tech

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

Subjects/Keywords: Integer programming

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Gu, Z. (1995). Lifted cover inequalities for 0-1 and mixed 0-1 integer programs. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/32781

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

Gu, Zonghao. “Lifted cover inequalities for 0-1 and mixed 0-1 integer programs.” 1995. Doctoral Dissertation, Georgia Tech. Accessed March 04, 2021. http://hdl.handle.net/1853/32781.

MLA Handbook (7^{th} Edition):

Gu, Zonghao. “Lifted cover inequalities for 0-1 and mixed 0-1 integer programs.” 1995. Web. 04 Mar 2021.

Vancouver:

Gu Z. Lifted cover inequalities for 0-1 and mixed 0-1 integer programs. [Internet] [Doctoral dissertation]. Georgia Tech; 1995. [cited 2021 Mar 04]. Available from: http://hdl.handle.net/1853/32781.

Council of Science Editors:

Gu Z. Lifted cover inequalities for 0-1 and mixed 0-1 integer programs. [Doctoral Dissertation]. Georgia Tech; 1995. Available from: http://hdl.handle.net/1853/32781

10.
-2486-1396.
Mixed-*integer* *programming* in power systems : the interdiction and unit commitment problems.

Degree: PhD, Electrical and Computer Engineering, 2019, University of Texas – Austin

URL: http://dx.doi.org/10.26153/tsw/5794

► Mixed *integer* *programming* (MIP) maximizes (or minimizes) a linear objective *subject* to a set of constraints. In particular, one of the constraints for a MIP…
(more)

Subjects/Keywords: Power system; Mixed-integer programming

Record Details Similar Records

❌

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

APA (6^{th} Edition):

-2486-1396. (2019). Mixed-integer programming in power systems : the interdiction and unit commitment problems. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://dx.doi.org/10.26153/tsw/5794

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

Author name may be incomplete

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

-2486-1396. “Mixed-integer programming in power systems : the interdiction and unit commitment problems.” 2019. Doctoral Dissertation, University of Texas – Austin. Accessed March 04, 2021. http://dx.doi.org/10.26153/tsw/5794.

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

Author name may be incomplete

MLA Handbook (7^{th} Edition):

-2486-1396. “Mixed-integer programming in power systems : the interdiction and unit commitment problems.” 2019. Web. 04 Mar 2021.

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

Author name may be incomplete

Vancouver:

-2486-1396. Mixed-integer programming in power systems : the interdiction and unit commitment problems. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2019. [cited 2021 Mar 04]. Available from: http://dx.doi.org/10.26153/tsw/5794.

Author name may be incomplete

Council of Science Editors:

-2486-1396. Mixed-integer programming in power systems : the interdiction and unit commitment problems. [Doctoral Dissertation]. University of Texas – Austin; 2019. Available from: http://dx.doi.org/10.26153/tsw/5794

Author name may be incomplete

11.
Hutchinson, David M.
Development of a Nonlinear Binary *Programming* Model for Intersection Improvement Prioritization.

Degree: 2017, University of Nevada – Reno

URL: http://hdl.handle.net/11714/2028

► A model is presented that utilizes nonlinear binary mathematical *programming* and the predictive crash methodology found in the AASHTO Highway Safety Manual to prioritize the…
(more)

Subjects/Keywords: integer programming; Traffic Safety

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Hutchinson, D. M. (2017). Development of a Nonlinear Binary Programming Model for Intersection Improvement Prioritization. (Thesis). University of Nevada – Reno. Retrieved from http://hdl.handle.net/11714/2028

Not specified: Masters Thesis or Doctoral Dissertation

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

Hutchinson, David M. “Development of a Nonlinear Binary Programming Model for Intersection Improvement Prioritization.” 2017. Thesis, University of Nevada – Reno. Accessed March 04, 2021. http://hdl.handle.net/11714/2028.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Hutchinson, David M. “Development of a Nonlinear Binary Programming Model for Intersection Improvement Prioritization.” 2017. Web. 04 Mar 2021.

Vancouver:

Hutchinson DM. Development of a Nonlinear Binary Programming Model for Intersection Improvement Prioritization. [Internet] [Thesis]. University of Nevada – Reno; 2017. [cited 2021 Mar 04]. Available from: http://hdl.handle.net/11714/2028.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Hutchinson DM. Development of a Nonlinear Binary Programming Model for Intersection Improvement Prioritization. [Thesis]. University of Nevada – Reno; 2017. Available from: http://hdl.handle.net/11714/2028

Not specified: Masters Thesis or Doctoral Dissertation

Georgia Tech

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

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

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

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

❌

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

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

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

MLA Handbook (7^{th} Edition):

Angulo Olivares, Gustavo, I. “Integer programming approaches for semicontinuous and stochastic optimization.” 2014. Web. 04 Mar 2021.

Vancouver:

Angulo Olivares, Gustavo I. Integer programming approaches for semicontinuous and stochastic optimization. [Internet] [Doctoral dissertation]. Georgia Tech; 2014. [cited 2021 Mar 04]. 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

University of Toronto

13.
Michael, Mark.
Generalized Combinatorial Auction for Mixed *Integer* Linear * Programming*.

Degree: 2014, University of Toronto

URL: http://hdl.handle.net/1807/68562

►

Mixed *integer* linear *programming* is an invaluable tool for solving some of the toughest problems in operations research. Since the *integer* nature of these problems…
(more)

Subjects/Keywords: column generation; combinatorial auctions; combinatorial optimization; integer programming; linear programming; mixed integer programming; 0796

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Michael, M. (2014). Generalized Combinatorial Auction for Mixed Integer Linear Programming. (Masters Thesis). University of Toronto. Retrieved from http://hdl.handle.net/1807/68562

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

Michael, Mark. “Generalized Combinatorial Auction for Mixed Integer Linear Programming.” 2014. Masters Thesis, University of Toronto. Accessed March 04, 2021. http://hdl.handle.net/1807/68562.

MLA Handbook (7^{th} Edition):

Michael, Mark. “Generalized Combinatorial Auction for Mixed Integer Linear Programming.” 2014. Web. 04 Mar 2021.

Vancouver:

Michael M. Generalized Combinatorial Auction for Mixed Integer Linear Programming. [Internet] [Masters thesis]. University of Toronto; 2014. [cited 2021 Mar 04]. Available from: http://hdl.handle.net/1807/68562.

Council of Science Editors:

Michael M. Generalized Combinatorial Auction for Mixed Integer Linear Programming. [Masters Thesis]. University of Toronto; 2014. Available from: http://hdl.handle.net/1807/68562

Anna University

14.
Arunkumar N.
Optimization technique for multi objective supplier
selection with quantity discounts using *integer* linear *programming*
and meta heuristics;.

Degree: multi objective supplier selection with quantity discounts using integer linear programming and meta heuristics, 2014, Anna University

URL: http://shodhganga.inflibnet.ac.in/handle/10603/27971

►

In todays competitive operating environment it is impossible to newlinesuccessfully produce low cost high quality products without satisfactory newlinevendors Supplier selection is one of the… (more)

Subjects/Keywords: integer linear programming; mechanical engineering; meta heuristics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

N, A. (2014). Optimization technique for multi objective supplier selection with quantity discounts using integer linear programming and meta heuristics;. (Thesis). Anna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/27971

Not specified: Masters Thesis or Doctoral Dissertation

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

N, Arunkumar. “Optimization technique for multi objective supplier selection with quantity discounts using integer linear programming and meta heuristics;.” 2014. Thesis, Anna University. Accessed March 04, 2021. http://shodhganga.inflibnet.ac.in/handle/10603/27971.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

N, Arunkumar. “Optimization technique for multi objective supplier selection with quantity discounts using integer linear programming and meta heuristics;.” 2014. Web. 04 Mar 2021.

Vancouver:

N A. Optimization technique for multi objective supplier selection with quantity discounts using integer linear programming and meta heuristics;. [Internet] [Thesis]. Anna University; 2014. [cited 2021 Mar 04]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/27971.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

N A. Optimization technique for multi objective supplier selection with quantity discounts using integer linear programming and meta heuristics;. [Thesis]. Anna University; 2014. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/27971

Not specified: Masters Thesis or Doctoral Dissertation

Rochester Institute of Technology

15. Agarwal, Akshit. Balancing Medical Resident Education and Workload while Ensuring Quality Patient Care.

Degree: MS, Industrial and Systems Engineering, 2016, Rochester Institute of Technology

URL: https://scholarworks.rit.edu/theses/8987

► Medical residency is a requirement for medical professionals to practice medicine. Residency programs in internal medicine lasts 3 years and require residents to undergo…
(more)

Subjects/Keywords: Mathematical optimization; Mixed integer programming; Resident scheduling

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Agarwal, A. (2016). Balancing Medical Resident Education and Workload while Ensuring Quality Patient Care. (Masters Thesis). Rochester Institute of Technology. Retrieved from https://scholarworks.rit.edu/theses/8987

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

Agarwal, Akshit. “Balancing Medical Resident Education and Workload while Ensuring Quality Patient Care.” 2016. Masters Thesis, Rochester Institute of Technology. Accessed March 04, 2021. https://scholarworks.rit.edu/theses/8987.

MLA Handbook (7^{th} Edition):

Agarwal, Akshit. “Balancing Medical Resident Education and Workload while Ensuring Quality Patient Care.” 2016. Web. 04 Mar 2021.

Vancouver:

Agarwal A. Balancing Medical Resident Education and Workload while Ensuring Quality Patient Care. [Internet] [Masters thesis]. Rochester Institute of Technology; 2016. [cited 2021 Mar 04]. Available from: https://scholarworks.rit.edu/theses/8987.

Council of Science Editors:

Agarwal A. Balancing Medical Resident Education and Workload while Ensuring Quality Patient Care. [Masters Thesis]. Rochester Institute of Technology; 2016. Available from: https://scholarworks.rit.edu/theses/8987

Mississippi State University

16. Pirim, Harun. A MINIMUM SPANNING TREE BASED CLUSTERING ALGORITHM FOR HIGH THROUGHPUT BIOLOGICAL DATA.

Degree: PhD, Industrial and Systems Engineering, 2011, Mississippi State University

URL: http://sun.library.msstate.edu/ETD-db/theses/available/etd-03022011-155156/ ;

► A new minimum spanning tree (MST) based heuristic for clustering biological data is proposed. The heuristic uses MSTs to generate initial solutions and applies…
(more)

Subjects/Keywords: optimization; heuristics; networks; integer programming; clustering

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Pirim, H. (2011). A MINIMUM SPANNING TREE BASED CLUSTERING ALGORITHM FOR HIGH THROUGHPUT BIOLOGICAL DATA. (Doctoral Dissertation). Mississippi State University. Retrieved from http://sun.library.msstate.edu/ETD-db/theses/available/etd-03022011-155156/ ;

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

Pirim, Harun. “A MINIMUM SPANNING TREE BASED CLUSTERING ALGORITHM FOR HIGH THROUGHPUT BIOLOGICAL DATA.” 2011. Doctoral Dissertation, Mississippi State University. Accessed March 04, 2021. http://sun.library.msstate.edu/ETD-db/theses/available/etd-03022011-155156/ ;.

MLA Handbook (7^{th} Edition):

Pirim, Harun. “A MINIMUM SPANNING TREE BASED CLUSTERING ALGORITHM FOR HIGH THROUGHPUT BIOLOGICAL DATA.” 2011. Web. 04 Mar 2021.

Vancouver:

Pirim H. A MINIMUM SPANNING TREE BASED CLUSTERING ALGORITHM FOR HIGH THROUGHPUT BIOLOGICAL DATA. [Internet] [Doctoral dissertation]. Mississippi State University; 2011. [cited 2021 Mar 04]. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-03022011-155156/ ;.

Council of Science Editors:

Pirim H. A MINIMUM SPANNING TREE BASED CLUSTERING ALGORITHM FOR HIGH THROUGHPUT BIOLOGICAL DATA. [Doctoral Dissertation]. Mississippi State University; 2011. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-03022011-155156/ ;

University of Waterloo

17. Yang, Shenghao. Split Cuts From Sparse Disjunctions.

Degree: 2019, University of Waterloo

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

► Cutting planes are one of the major techniques used in solving Mixed-*Integer* Linear *Programming* (MIP) models. Various types of cuts have long been exploited by…
(more)

Subjects/Keywords: mixed-integer programming; split cuts; sparsity; decomposition

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Yang, S. (2019). Split Cuts From Sparse Disjunctions. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/14363

Not specified: Masters Thesis or Doctoral Dissertation

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

Yang, Shenghao. “Split Cuts From Sparse Disjunctions.” 2019. Thesis, University of Waterloo. Accessed March 04, 2021. http://hdl.handle.net/10012/14363.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Yang, Shenghao. “Split Cuts From Sparse Disjunctions.” 2019. Web. 04 Mar 2021.

Vancouver:

Yang S. Split Cuts From Sparse Disjunctions. [Internet] [Thesis]. University of Waterloo; 2019. [cited 2021 Mar 04]. Available from: http://hdl.handle.net/10012/14363.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Yang S. Split Cuts From Sparse Disjunctions. [Thesis]. University of Waterloo; 2019. Available from: http://hdl.handle.net/10012/14363

Not specified: Masters Thesis or Doctoral Dissertation

University of Nairobi

18.
Mulongo, Abiud, W.
A Two Layer Mixed *Integer* *Programming* Model for Dynamic Composite Webservice Selection in Virtual Organizations Inspired by Layering as Optimization Decomposition
.

Degree: 2016, University of Nairobi

URL: http://hdl.handle.net/11295/98299

► The key motivation for virtual organizations (VOs) is the need for business agility against a highly volatile and globally competitive market. The agility includes the…
(more)

Subjects/Keywords: A Two Layer Mixed Integer Programming Model

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Mulongo, Abiud, W. (2016). A Two Layer Mixed Integer Programming Model for Dynamic Composite Webservice Selection in Virtual Organizations Inspired by Layering as Optimization Decomposition . (Thesis). University of Nairobi. Retrieved from http://hdl.handle.net/11295/98299

Not specified: Masters Thesis or Doctoral Dissertation

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

Mulongo, Abiud, W. “A Two Layer Mixed Integer Programming Model for Dynamic Composite Webservice Selection in Virtual Organizations Inspired by Layering as Optimization Decomposition .” 2016. Thesis, University of Nairobi. Accessed March 04, 2021. http://hdl.handle.net/11295/98299.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Mulongo, Abiud, W. “A Two Layer Mixed Integer Programming Model for Dynamic Composite Webservice Selection in Virtual Organizations Inspired by Layering as Optimization Decomposition .” 2016. Web. 04 Mar 2021.

Vancouver:

Mulongo, Abiud W. A Two Layer Mixed Integer Programming Model for Dynamic Composite Webservice Selection in Virtual Organizations Inspired by Layering as Optimization Decomposition . [Internet] [Thesis]. University of Nairobi; 2016. [cited 2021 Mar 04]. Available from: http://hdl.handle.net/11295/98299.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Mulongo, Abiud W. A Two Layer Mixed Integer Programming Model for Dynamic Composite Webservice Selection in Virtual Organizations Inspired by Layering as Optimization Decomposition . [Thesis]. University of Nairobi; 2016. Available from: http://hdl.handle.net/11295/98299

Not specified: Masters Thesis or Doctoral Dissertation

19. Van Dijk, S.M. (author). Decomposition methods and rolling horizon approach for the yard crane scheduling problem.

Degree: 2015, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:2f22057e-3676-4103-8f22-021a2a4e01ba

►

Yard crane scheduling is one of the operational optimization problems that arise in a port container terminal. Multiple cranes have to store containers in the… (more)

Subjects/Keywords: Yard Crane; Mixed Integer Linear Programming

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Van Dijk, S. M. (. (2015). Decomposition methods and rolling horizon approach for the yard crane scheduling problem. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:2f22057e-3676-4103-8f22-021a2a4e01ba

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

Van Dijk, S M (author). “Decomposition methods and rolling horizon approach for the yard crane scheduling problem.” 2015. Masters Thesis, Delft University of Technology. Accessed March 04, 2021. http://resolver.tudelft.nl/uuid:2f22057e-3676-4103-8f22-021a2a4e01ba.

MLA Handbook (7^{th} Edition):

Van Dijk, S M (author). “Decomposition methods and rolling horizon approach for the yard crane scheduling problem.” 2015. Web. 04 Mar 2021.

Vancouver:

Van Dijk SM(. Decomposition methods and rolling horizon approach for the yard crane scheduling problem. [Internet] [Masters thesis]. Delft University of Technology; 2015. [cited 2021 Mar 04]. Available from: http://resolver.tudelft.nl/uuid:2f22057e-3676-4103-8f22-021a2a4e01ba.

Council of Science Editors:

Van Dijk SM(. Decomposition methods and rolling horizon approach for the yard crane scheduling problem. [Masters Thesis]. Delft University of Technology; 2015. Available from: http://resolver.tudelft.nl/uuid:2f22057e-3676-4103-8f22-021a2a4e01ba

Delft University of Technology

20.
van der Linden, Koos (author).
Decision diagrams for decomposed mixed *integer* linear programs.

Degree: 2017, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:57e43a69-e380-4917-9598-097710379b9f

►

A recent development in the field of discrete optimization is the combined use of (binary) decision diagrams (DD) and branch and bound for optimization. This… (more)

Subjects/Keywords: Decision diagrams; Mixed integer programming; Benders decomposition

Record Details Similar Records

❌

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

APA (6^{th} Edition):

van der Linden, K. (. (2017). Decision diagrams for decomposed mixed integer linear programs. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:57e43a69-e380-4917-9598-097710379b9f

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

van der Linden, Koos (author). “Decision diagrams for decomposed mixed integer linear programs.” 2017. Masters Thesis, Delft University of Technology. Accessed March 04, 2021. http://resolver.tudelft.nl/uuid:57e43a69-e380-4917-9598-097710379b9f.

MLA Handbook (7^{th} Edition):

van der Linden, Koos (author). “Decision diagrams for decomposed mixed integer linear programs.” 2017. Web. 04 Mar 2021.

Vancouver:

van der Linden K(. Decision diagrams for decomposed mixed integer linear programs. [Internet] [Masters thesis]. Delft University of Technology; 2017. [cited 2021 Mar 04]. Available from: http://resolver.tudelft.nl/uuid:57e43a69-e380-4917-9598-097710379b9f.

Council of Science Editors:

van der Linden K(. Decision diagrams for decomposed mixed integer linear programs. [Masters Thesis]. Delft University of Technology; 2017. Available from: http://resolver.tudelft.nl/uuid:57e43a69-e380-4917-9598-097710379b9f

21.
Ramalingam, Vijay P.
Xqx Based Modeling For General *Integer* *Programming* Problems.

Degree: PhD, Management Information Systems, 2014, University of Mississippi

URL: https://egrove.olemiss.edu/etd/395

► We present a new way to model general *integer* *programming* (IP) problems with in- equality and equality constraints using XQX. We begin with the definition…
(more)

Subjects/Keywords: Inequality; Integer Programming; Xqx Model; Operational Research

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Ramalingam, V. P. (2014). Xqx Based Modeling For General Integer Programming Problems. (Doctoral Dissertation). University of Mississippi. Retrieved from https://egrove.olemiss.edu/etd/395

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

Ramalingam, Vijay P. “Xqx Based Modeling For General Integer Programming Problems.” 2014. Doctoral Dissertation, University of Mississippi. Accessed March 04, 2021. https://egrove.olemiss.edu/etd/395.

MLA Handbook (7^{th} Edition):

Ramalingam, Vijay P. “Xqx Based Modeling For General Integer Programming Problems.” 2014. Web. 04 Mar 2021.

Vancouver:

Ramalingam VP. Xqx Based Modeling For General Integer Programming Problems. [Internet] [Doctoral dissertation]. University of Mississippi; 2014. [cited 2021 Mar 04]. Available from: https://egrove.olemiss.edu/etd/395.

Council of Science Editors:

Ramalingam VP. Xqx Based Modeling For General Integer Programming Problems. [Doctoral Dissertation]. University of Mississippi; 2014. Available from: https://egrove.olemiss.edu/etd/395

Colorado School of Mines

22.
King, Barry W.
Using *integer* *programming* for strategic underground and open pit-to-underground scheduling.

Degree: PhD, Mechanical Engineering, 2016, Colorado School of Mines

URL: http://hdl.handle.net/11124/170081

► We introduce a new *integer* *programming* formulation to solve the underground project scheduling problem, which we define as determining the time period in which to…
(more)

Subjects/Keywords: integer programming; mine scheduling; underground mine scheduling

Record Details Similar Records

❌

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

APA (6^{th} Edition):

King, B. W. (2016). Using integer programming for strategic underground and open pit-to-underground scheduling. (Doctoral Dissertation). Colorado School of Mines. Retrieved from http://hdl.handle.net/11124/170081

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

King, Barry W. “Using integer programming for strategic underground and open pit-to-underground scheduling.” 2016. Doctoral Dissertation, Colorado School of Mines. Accessed March 04, 2021. http://hdl.handle.net/11124/170081.

MLA Handbook (7^{th} Edition):

King, Barry W. “Using integer programming for strategic underground and open pit-to-underground scheduling.” 2016. Web. 04 Mar 2021.

Vancouver:

King BW. Using integer programming for strategic underground and open pit-to-underground scheduling. [Internet] [Doctoral dissertation]. Colorado School of Mines; 2016. [cited 2021 Mar 04]. Available from: http://hdl.handle.net/11124/170081.

Council of Science Editors:

King BW. Using integer programming for strategic underground and open pit-to-underground scheduling. [Doctoral Dissertation]. Colorado School of Mines; 2016. Available from: http://hdl.handle.net/11124/170081

Delft University of Technology

23. Puppels, Thomas (author). An Investigation Into Predict-and-Optimize Machine Learning.

Degree: 2020, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:5f5e1719-a460-4481-b6f9-80a26e8668c3

►

Predict-and-Optimize (PnO) is a relatively new machine learning paradigm that has attracted recent interest: it concerns the prediction of parameters that determine the value of… (more)

Subjects/Keywords: Machine Learning; Integer Programming; Combinatorial Optimization

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Puppels, T. (. (2020). An Investigation Into Predict-and-Optimize Machine Learning. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:5f5e1719-a460-4481-b6f9-80a26e8668c3

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

Puppels, Thomas (author). “An Investigation Into Predict-and-Optimize Machine Learning.” 2020. Masters Thesis, Delft University of Technology. Accessed March 04, 2021. http://resolver.tudelft.nl/uuid:5f5e1719-a460-4481-b6f9-80a26e8668c3.

MLA Handbook (7^{th} Edition):

Puppels, Thomas (author). “An Investigation Into Predict-and-Optimize Machine Learning.” 2020. Web. 04 Mar 2021.

Vancouver:

Puppels T(. An Investigation Into Predict-and-Optimize Machine Learning. [Internet] [Masters thesis]. Delft University of Technology; 2020. [cited 2021 Mar 04]. Available from: http://resolver.tudelft.nl/uuid:5f5e1719-a460-4481-b6f9-80a26e8668c3.

Council of Science Editors:

Puppels T(. An Investigation Into Predict-and-Optimize Machine Learning. [Masters Thesis]. Delft University of Technology; 2020. Available from: http://resolver.tudelft.nl/uuid:5f5e1719-a460-4481-b6f9-80a26e8668c3

University of Toronto

24. Eagen, Brendan. Ambulatory Clinic Scheduling.

Degree: PhD, 2017, University of Toronto

URL: http://hdl.handle.net/1807/77450

► In this thesis we seek to fully explore the ambulatory clinic scheduling problem (CSP) and study the creation of ambulatory clinic schedules using mathematical models.…
(more)

Subjects/Keywords: clinic scheduling; healthcare; integer programming; 0546

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Eagen, B. (2017). Ambulatory Clinic Scheduling. (Doctoral Dissertation). University of Toronto. Retrieved from http://hdl.handle.net/1807/77450

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

Eagen, Brendan. “Ambulatory Clinic Scheduling.” 2017. Doctoral Dissertation, University of Toronto. Accessed March 04, 2021. http://hdl.handle.net/1807/77450.

MLA Handbook (7^{th} Edition):

Eagen, Brendan. “Ambulatory Clinic Scheduling.” 2017. Web. 04 Mar 2021.

Vancouver:

Eagen B. Ambulatory Clinic Scheduling. [Internet] [Doctoral dissertation]. University of Toronto; 2017. [cited 2021 Mar 04]. Available from: http://hdl.handle.net/1807/77450.

Council of Science Editors:

Eagen B. Ambulatory Clinic Scheduling. [Doctoral Dissertation]. University of Toronto; 2017. Available from: http://hdl.handle.net/1807/77450

Texas Tech University

25.
Ruparel, Bharat C.
The bounded enumeration algorithm for all-*integer* * programming*.

Degree: Business Administration, 1983, Texas Tech University

URL: http://hdl.handle.net/2346/18575

Subjects/Keywords: Algorithms; Integer programming

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Ruparel, B. C. (1983). The bounded enumeration algorithm for all-integer programming. (Thesis). Texas Tech University. Retrieved from http://hdl.handle.net/2346/18575

Not specified: Masters Thesis or Doctoral Dissertation

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

Ruparel, Bharat C. “The bounded enumeration algorithm for all-integer programming.” 1983. Thesis, Texas Tech University. Accessed March 04, 2021. http://hdl.handle.net/2346/18575.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Ruparel, Bharat C. “The bounded enumeration algorithm for all-integer programming.” 1983. Web. 04 Mar 2021.

Vancouver:

Ruparel BC. The bounded enumeration algorithm for all-integer programming. [Internet] [Thesis]. Texas Tech University; 1983. [cited 2021 Mar 04]. Available from: http://hdl.handle.net/2346/18575.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Ruparel BC. The bounded enumeration algorithm for all-integer programming. [Thesis]. Texas Tech University; 1983. Available from: http://hdl.handle.net/2346/18575

Not specified: Masters Thesis or Doctoral Dissertation

Texas Tech University

26.
Ghandforoush, Parviz.
A constructive primal-dual cutting-plane algorithm for all-*integer* * programming*.

Degree: 1980, Texas Tech University

URL: http://hdl.handle.net/2346/19327

Subjects/Keywords: Algorithms; Integer programming

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Ghandforoush, P. (1980). A constructive primal-dual cutting-plane algorithm for all-integer programming. (Thesis). Texas Tech University. Retrieved from http://hdl.handle.net/2346/19327

Not specified: Masters Thesis or Doctoral Dissertation

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

Ghandforoush, Parviz. “A constructive primal-dual cutting-plane algorithm for all-integer programming.” 1980. Thesis, Texas Tech University. Accessed March 04, 2021. http://hdl.handle.net/2346/19327.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Ghandforoush, Parviz. “A constructive primal-dual cutting-plane algorithm for all-integer programming.” 1980. Web. 04 Mar 2021.

Vancouver:

Ghandforoush P. A constructive primal-dual cutting-plane algorithm for all-integer programming. [Internet] [Thesis]. Texas Tech University; 1980. [cited 2021 Mar 04]. Available from: http://hdl.handle.net/2346/19327.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Ghandforoush P. A constructive primal-dual cutting-plane algorithm for all-integer programming. [Thesis]. Texas Tech University; 1980. Available from: http://hdl.handle.net/2346/19327

Not specified: Masters Thesis or Doctoral Dissertation

Georgia Tech

27. Cullen, Frank Haywood. An algorithm for the solution of the general set-covering problem by Euclidean means.

Degree: MS, Industrial engineering, 1975, Georgia Tech

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

Subjects/Keywords: Algorithms; Integer programming

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Cullen, F. H. (1975). An algorithm for the solution of the general set-covering problem by Euclidean means. (Masters Thesis). Georgia Tech. Retrieved from http://hdl.handle.net/1853/25515

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

Cullen, Frank Haywood. “An algorithm for the solution of the general set-covering problem by Euclidean means.” 1975. Masters Thesis, Georgia Tech. Accessed March 04, 2021. http://hdl.handle.net/1853/25515.

MLA Handbook (7^{th} Edition):

Cullen, Frank Haywood. “An algorithm for the solution of the general set-covering problem by Euclidean means.” 1975. Web. 04 Mar 2021.

Vancouver:

Cullen FH. An algorithm for the solution of the general set-covering problem by Euclidean means. [Internet] [Masters thesis]. Georgia Tech; 1975. [cited 2021 Mar 04]. Available from: http://hdl.handle.net/1853/25515.

Council of Science Editors:

Cullen FH. An algorithm for the solution of the general set-covering problem by Euclidean means. [Masters Thesis]. Georgia Tech; 1975. Available from: http://hdl.handle.net/1853/25515

University of Tennessee – Knoxville

28. Shukla, Mohit. Optimizing Cash Flows and Minimizing Simultaneous Turnovers in Operating Room Scheduling.

Degree: MS, Industrial Engineering, 2016, University of Tennessee – Knoxville

URL: https://trace.tennessee.edu/utk_gradthes/3811

► Currently, the scheduling of surgical suites follows either an open booking or block booking framework. Under block booking, medical departments (or surgeons) that provide…
(more)

Subjects/Keywords: OR; Block Scheduling; Integer Programming; Operational Research

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Shukla, M. (2016). Optimizing Cash Flows and Minimizing Simultaneous Turnovers in Operating Room Scheduling. (Thesis). University of Tennessee – Knoxville. Retrieved from https://trace.tennessee.edu/utk_gradthes/3811

Not specified: Masters Thesis or Doctoral Dissertation

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

Shukla, Mohit. “Optimizing Cash Flows and Minimizing Simultaneous Turnovers in Operating Room Scheduling.” 2016. Thesis, University of Tennessee – Knoxville. Accessed March 04, 2021. https://trace.tennessee.edu/utk_gradthes/3811.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Shukla, Mohit. “Optimizing Cash Flows and Minimizing Simultaneous Turnovers in Operating Room Scheduling.” 2016. Web. 04 Mar 2021.

Vancouver:

Shukla M. Optimizing Cash Flows and Minimizing Simultaneous Turnovers in Operating Room Scheduling. [Internet] [Thesis]. University of Tennessee – Knoxville; 2016. [cited 2021 Mar 04]. Available from: https://trace.tennessee.edu/utk_gradthes/3811.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Shukla M. Optimizing Cash Flows and Minimizing Simultaneous Turnovers in Operating Room Scheduling. [Thesis]. University of Tennessee – Knoxville; 2016. Available from: https://trace.tennessee.edu/utk_gradthes/3811

Not specified: Masters Thesis or Doctoral Dissertation

Universitat de Valencia

29. Martínez Sykora, Antonio. Nesting Problems : Exact and Heuristic Algorithms .

Degree: 2013, Universitat de Valencia

URL: http://hdl.handle.net/10550/29003

► Nesting problems are two-dimensional cutting and packing problems involving irregular shapes. This thesis is focused on real applications on Nesting problems such as the garment…
(more)

Subjects/Keywords: integer programming; nesting; cutting and packing

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Martínez Sykora, A. (2013). Nesting Problems : Exact and Heuristic Algorithms . (Doctoral Dissertation). Universitat de Valencia. Retrieved from http://hdl.handle.net/10550/29003

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

Martínez Sykora, Antonio. “Nesting Problems : Exact and Heuristic Algorithms .” 2013. Doctoral Dissertation, Universitat de Valencia. Accessed March 04, 2021. http://hdl.handle.net/10550/29003.

MLA Handbook (7^{th} Edition):

Martínez Sykora, Antonio. “Nesting Problems : Exact and Heuristic Algorithms .” 2013. Web. 04 Mar 2021.

Vancouver:

Martínez Sykora A. Nesting Problems : Exact and Heuristic Algorithms . [Internet] [Doctoral dissertation]. Universitat de Valencia; 2013. [cited 2021 Mar 04]. Available from: http://hdl.handle.net/10550/29003.

Council of Science Editors:

Martínez Sykora A. Nesting Problems : Exact and Heuristic Algorithms . [Doctoral Dissertation]. Universitat de Valencia; 2013. Available from: http://hdl.handle.net/10550/29003

Kansas State University

30. Verschelden, Lucas George. Integrated optimization and simulation models for the locomotive refueling system configuration problem.

Degree: MS, Department of Industrial and Manufacturing Systems Engineering, 2017, Kansas State University

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

► Locomotives in the U.S. use over 3 billion gallons of fuel each year and faster refueling can increase rail network capacity without the infrastructure cost…
(more)

Subjects/Keywords: Train; Integer programming; Simulation; Scheduling; Locomotive; Refueling

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Verschelden, L. G. (2017). Integrated optimization and simulation models for the locomotive refueling system configuration problem. (Masters Thesis). Kansas State University. Retrieved from http://hdl.handle.net/2097/38222

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

Verschelden, Lucas George. “Integrated optimization and simulation models for the locomotive refueling system configuration problem.” 2017. Masters Thesis, Kansas State University. Accessed March 04, 2021. http://hdl.handle.net/2097/38222.

MLA Handbook (7^{th} Edition):

Verschelden, Lucas George. “Integrated optimization and simulation models for the locomotive refueling system configuration problem.” 2017. Web. 04 Mar 2021.

Vancouver:

Verschelden LG. Integrated optimization and simulation models for the locomotive refueling system configuration problem. [Internet] [Masters thesis]. Kansas State University; 2017. [cited 2021 Mar 04]. Available from: http://hdl.handle.net/2097/38222.

Council of Science Editors:

Verschelden LG. Integrated optimization and simulation models for the locomotive refueling system configuration problem. [Masters Thesis]. Kansas State University; 2017. Available from: http://hdl.handle.net/2097/38222