Advanced search options

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

You searched for `subject:(valid inequalities)`

.
Showing records 1 – 18 of
18 total matches.

▼ Search Limiters

Texas A&M University

1.
Luo, Haochen.
*Valid**Inequalities* and Facets for Multi-Module (Survivable) Capacitated Network Design Problem.

Degree: PhD, Industrial Engineering, 2019, Texas A&M University

URL: http://hdl.handle.net/1969.1/188770

► In this dissertation, we develop new methodologies and algorithms to solve the multi-module (survivable) network design problem. Many real-world decision-making problems can be modeled as…
(more)

Subjects/Keywords: mixed-integer programming; network design; cutset inequalities; valid inequalities; n-step MIR

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Luo, H. (2019). Valid Inequalities and Facets for Multi-Module (Survivable) Capacitated Network Design Problem. (Doctoral Dissertation). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/188770

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

Luo, Haochen. “Valid Inequalities and Facets for Multi-Module (Survivable) Capacitated Network Design Problem.” 2019. Doctoral Dissertation, Texas A&M University. Accessed November 24, 2020. http://hdl.handle.net/1969.1/188770.

MLA Handbook (7^{th} Edition):

Luo, Haochen. “Valid Inequalities and Facets for Multi-Module (Survivable) Capacitated Network Design Problem.” 2019. Web. 24 Nov 2020.

Vancouver:

Luo H. Valid Inequalities and Facets for Multi-Module (Survivable) Capacitated Network Design Problem. [Internet] [Doctoral dissertation]. Texas A&M University; 2019. [cited 2020 Nov 24]. Available from: http://hdl.handle.net/1969.1/188770.

Council of Science Editors:

Luo H. Valid Inequalities and Facets for Multi-Module (Survivable) Capacitated Network Design Problem. [Doctoral Dissertation]. Texas A&M University; 2019. Available from: http://hdl.handle.net/1969.1/188770

Carnegie Mellon University

2.
Yildiz, Sercan.
*Valid**Inequalities* for Mixed-Integer Linear and Mixed-Integer Conic Programs.

Degree: 2016, Carnegie Mellon University

URL: http://repository.cmu.edu/dissertations/777

► Mixed-integer programming provides a natural framework for modeling optimization problems which require discrete decisions. *Valid* *inequalities*, used as cutting-planes and cuttingsurfaces in integer programming solvers,…
(more)

Subjects/Keywords: Integer programming; valid inequalities; cutting-planes; separation; convexification

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Yildiz, S. (2016). Valid Inequalities for Mixed-Integer Linear and Mixed-Integer Conic Programs. (Thesis). Carnegie Mellon University. Retrieved from http://repository.cmu.edu/dissertations/777

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

Yildiz, Sercan. “Valid Inequalities for Mixed-Integer Linear and Mixed-Integer Conic Programs.” 2016. Thesis, Carnegie Mellon University. Accessed November 24, 2020. http://repository.cmu.edu/dissertations/777.

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Yildiz, Sercan. “Valid Inequalities for Mixed-Integer Linear and Mixed-Integer Conic Programs.” 2016. Web. 24 Nov 2020.

Vancouver:

Yildiz S. Valid Inequalities for Mixed-Integer Linear and Mixed-Integer Conic Programs. [Internet] [Thesis]. Carnegie Mellon University; 2016. [cited 2020 Nov 24]. Available from: http://repository.cmu.edu/dissertations/777.

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

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Yildiz S. Valid Inequalities for Mixed-Integer Linear and Mixed-Integer Conic Programs. [Thesis]. Carnegie Mellon University; 2016. Available from: http://repository.cmu.edu/dissertations/777

Not specified: Masters Thesis or Doctoral Dissertation

3. Fernandes, Susana. Optimised search heuristics: combining metaheuristics and exact methods to solve scheduling problems.

Degree: 2008, RCAAP

URL: http://www.rcaap.pt/detail.jsp?id=oai:sapientia.ualg.pt:10400.1/1154

►

Tese dout., Matemática, Investigação Operacional, Universidade do Algarve, 2009

Scheduling problems have many real life applications, from automotive industry to air traffic control. These problems… (more)

Subjects/Keywords: Metaheuristics; Exact Algorithms; GRASP; Tabu Search; Branch-and-Bound; Valid Inequalities; Scheduling Problems

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Fernandes, S. (2008). Optimised search heuristics: combining metaheuristics and exact methods to solve scheduling problems. (Thesis). RCAAP. Retrieved from http://www.rcaap.pt/detail.jsp?id=oai:sapientia.ualg.pt:10400.1/1154

Not specified: Masters Thesis or Doctoral Dissertation

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

Fernandes, Susana. “Optimised search heuristics: combining metaheuristics and exact methods to solve scheduling problems.” 2008. Thesis, RCAAP. Accessed November 24, 2020. http://www.rcaap.pt/detail.jsp?id=oai:sapientia.ualg.pt:10400.1/1154.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Fernandes, Susana. “Optimised search heuristics: combining metaheuristics and exact methods to solve scheduling problems.” 2008. Web. 24 Nov 2020.

Vancouver:

Fernandes S. Optimised search heuristics: combining metaheuristics and exact methods to solve scheduling problems. [Internet] [Thesis]. RCAAP; 2008. [cited 2020 Nov 24]. Available from: http://www.rcaap.pt/detail.jsp?id=oai:sapientia.ualg.pt:10400.1/1154.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Fernandes S. Optimised search heuristics: combining metaheuristics and exact methods to solve scheduling problems. [Thesis]. RCAAP; 2008. Available from: http://www.rcaap.pt/detail.jsp?id=oai:sapientia.ualg.pt:10400.1/1154

Not specified: Masters Thesis or Doctoral Dissertation

Université Catholique de Louvain

4. Filipecki, Bartosz. Strengthened formulations for MIP problems in networks.

Degree: 2018, Université Catholique de Louvain

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

►

Many real-world problems can be formulated in the framework of mixedinteger programming. This includes many problems in routing, scheduling and other fields, which affect our… (more)

Subjects/Keywords: Mixed-Integer Programming; Extended Formulations; Valid Inequalities; Optimal Power Flow; Steiner Tree Problem; Convex Rexoloring

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Filipecki, B. (2018). Strengthened formulations for MIP problems in networks. (Thesis). Université Catholique de Louvain. Retrieved from http://hdl.handle.net/2078.1/195710

Not specified: Masters Thesis or Doctoral Dissertation

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

Filipecki, Bartosz. “Strengthened formulations for MIP problems in networks.” 2018. Thesis, Université Catholique de Louvain. Accessed November 24, 2020. http://hdl.handle.net/2078.1/195710.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Filipecki, Bartosz. “Strengthened formulations for MIP problems in networks.” 2018. Web. 24 Nov 2020.

Vancouver:

Filipecki B. Strengthened formulations for MIP problems in networks. [Internet] [Thesis]. Université Catholique de Louvain; 2018. [cited 2020 Nov 24]. Available from: http://hdl.handle.net/2078.1/195710.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Filipecki B. Strengthened formulations for MIP problems in networks. [Thesis]. Université Catholique de Louvain; 2018. Available from: http://hdl.handle.net/2078.1/195710

Not specified: Masters Thesis or Doctoral Dissertation

Rice University

5. Becker, Timothy. Bilevel Clique Interdiction and Related Problems.

Degree: PhD, Engineering, 2017, Rice University

URL: http://hdl.handle.net/1911/96109

► I introduce a formulation of the bilevel clique interdiction problem. Interdiction, a military term, describes the removal of enemy resources. The single level clique interdiction…
(more)

Subjects/Keywords: Graph Theory; Integer Programming; Bilevel Programming; Interdiction; Column Generation; Facets; Valid Inequalities

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Becker, T. (2017). Bilevel Clique Interdiction and Related Problems. (Doctoral Dissertation). Rice University. Retrieved from http://hdl.handle.net/1911/96109

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

Becker, Timothy. “Bilevel Clique Interdiction and Related Problems.” 2017. Doctoral Dissertation, Rice University. Accessed November 24, 2020. http://hdl.handle.net/1911/96109.

MLA Handbook (7^{th} Edition):

Becker, Timothy. “Bilevel Clique Interdiction and Related Problems.” 2017. Web. 24 Nov 2020.

Vancouver:

Becker T. Bilevel Clique Interdiction and Related Problems. [Internet] [Doctoral dissertation]. Rice University; 2017. [cited 2020 Nov 24]. Available from: http://hdl.handle.net/1911/96109.

Council of Science Editors:

Becker T. Bilevel Clique Interdiction and Related Problems. [Doctoral Dissertation]. Rice University; 2017. Available from: http://hdl.handle.net/1911/96109

Arizona State University

6. Lobo, Loy Joseph. An Improved Mathematical Formulation For the Carbon Capture and Storage (CCS) Problem.

Degree: Industrial Engineering, 2017, Arizona State University

URL: http://repository.asu.edu/items/45475

► Carbon Capture and Storage (CCS) is a climate stabilization strategy that prevents CO2 emissions from entering the atmosphere. Despite its benefits, impactful CCS projects require…
(more)

Subjects/Keywords: Operations research; Capacitated Fixed charge network flow problems; Carbon capture and storage; SimCCS; Strengthening the linear relaxation; Valid inequalities

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Lobo, L. J. (2017). An Improved Mathematical Formulation For the Carbon Capture and Storage (CCS) Problem. (Masters Thesis). Arizona State University. Retrieved from http://repository.asu.edu/items/45475

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

Lobo, Loy Joseph. “An Improved Mathematical Formulation For the Carbon Capture and Storage (CCS) Problem.” 2017. Masters Thesis, Arizona State University. Accessed November 24, 2020. http://repository.asu.edu/items/45475.

MLA Handbook (7^{th} Edition):

Lobo, Loy Joseph. “An Improved Mathematical Formulation For the Carbon Capture and Storage (CCS) Problem.” 2017. Web. 24 Nov 2020.

Vancouver:

Lobo LJ. An Improved Mathematical Formulation For the Carbon Capture and Storage (CCS) Problem. [Internet] [Masters thesis]. Arizona State University; 2017. [cited 2020 Nov 24]. Available from: http://repository.asu.edu/items/45475.

Council of Science Editors:

Lobo LJ. An Improved Mathematical Formulation For the Carbon Capture and Storage (CCS) Problem. [Masters Thesis]. Arizona State University; 2017. Available from: http://repository.asu.edu/items/45475

North Carolina State University

7.
Kianfar, Kiavash.
Generalized Mixed Integer Rounding *Valid* *Inequalities* for Mixed Integer Programming Problems.

Degree: PhD, Industrial Engineering, 2007, North Carolina State University

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

► Many decision-making problems in practice can be formulated as Mixed Integer Programming (MIP) problems, which are NP-hard in their general form. Over the past few…
(more)

Subjects/Keywords: group problem; cutting planes; valid inequalities; mixed integer rounding; mixed integer programming

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kianfar, K. (2007). Generalized Mixed Integer Rounding Valid Inequalities for Mixed Integer Programming Problems. (Doctoral Dissertation). North Carolina State University. Retrieved from http://www.lib.ncsu.edu/resolver/1840.16/5413

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

Kianfar, Kiavash. “Generalized Mixed Integer Rounding Valid Inequalities for Mixed Integer Programming Problems.” 2007. Doctoral Dissertation, North Carolina State University. Accessed November 24, 2020. http://www.lib.ncsu.edu/resolver/1840.16/5413.

MLA Handbook (7^{th} Edition):

Kianfar, Kiavash. “Generalized Mixed Integer Rounding Valid Inequalities for Mixed Integer Programming Problems.” 2007. Web. 24 Nov 2020.

Vancouver:

Kianfar K. Generalized Mixed Integer Rounding Valid Inequalities for Mixed Integer Programming Problems. [Internet] [Doctoral dissertation]. North Carolina State University; 2007. [cited 2020 Nov 24]. Available from: http://www.lib.ncsu.edu/resolver/1840.16/5413.

Council of Science Editors:

Kianfar K. Generalized Mixed Integer Rounding Valid Inequalities for Mixed Integer Programming Problems. [Doctoral Dissertation]. North Carolina State University; 2007. Available from: http://www.lib.ncsu.edu/resolver/1840.16/5413

Université Catholique de Louvain

8. Quesada Perez, José Miguel. Express shipment service network design : multiple hubs, complex routes and demand uncertainty.

Degree: 2020, Université Catholique de Louvain

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

► The express integrators offer the fastest and most reliable door-to-door packages delivery service in the transportation industry. Their premium service offers overnight deliveries in large…
(more)

Subjects/Keywords: Demand uncertainty; Service level; Composite variables; Multiple hubs; Service network design; Express integrator; Air network; Valid inequalities; Flexible hub assignment; Complex routes; Mixed integer programming

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Quesada Perez, J. M. (2020). Express shipment service network design : multiple hubs, complex routes and demand uncertainty. (Thesis). Université Catholique de Louvain. Retrieved from http://hdl.handle.net/2078.1/230449

Not specified: Masters Thesis or Doctoral Dissertation

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

Quesada Perez, José Miguel. “Express shipment service network design : multiple hubs, complex routes and demand uncertainty.” 2020. Thesis, Université Catholique de Louvain. Accessed November 24, 2020. http://hdl.handle.net/2078.1/230449.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Quesada Perez, José Miguel. “Express shipment service network design : multiple hubs, complex routes and demand uncertainty.” 2020. Web. 24 Nov 2020.

Vancouver:

Quesada Perez JM. Express shipment service network design : multiple hubs, complex routes and demand uncertainty. [Internet] [Thesis]. Université Catholique de Louvain; 2020. [cited 2020 Nov 24]. Available from: http://hdl.handle.net/2078.1/230449.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Quesada Perez JM. Express shipment service network design : multiple hubs, complex routes and demand uncertainty. [Thesis]. Université Catholique de Louvain; 2020. Available from: http://hdl.handle.net/2078.1/230449

Not specified: Masters Thesis or Doctoral Dissertation

University of California – Berkeley

9.
Tezel, Birce.
Submodular *Inequalities* for the Path Structures of the Capacitated Fixed-Charge Network Flow Problems.

Degree: Industrial Engineering & Operations Research, 2017, University of California – Berkeley

URL: http://www.escholarship.org/uc/item/5t17357f

► Capacitated fixed-charge network flow problems (CFCNF) are used to model a variety of problems in telecommunication, facility location, production planning and supply chain management. We…
(more)

Subjects/Keywords: Operations research; Applied mathematics; Industrial engineering; fixed-charge network flow; lot-sizing problem; mixed-integer optimization; polyhedral analysis; submodular functions; valid inequalities

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Tezel, B. (2017). Submodular Inequalities for the Path Structures of the Capacitated Fixed-Charge Network Flow Problems. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/5t17357f

Not specified: Masters Thesis or Doctoral Dissertation

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

Tezel, Birce. “Submodular Inequalities for the Path Structures of the Capacitated Fixed-Charge Network Flow Problems.” 2017. Thesis, University of California – Berkeley. Accessed November 24, 2020. http://www.escholarship.org/uc/item/5t17357f.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Tezel, Birce. “Submodular Inequalities for the Path Structures of the Capacitated Fixed-Charge Network Flow Problems.” 2017. Web. 24 Nov 2020.

Vancouver:

Tezel B. Submodular Inequalities for the Path Structures of the Capacitated Fixed-Charge Network Flow Problems. [Internet] [Thesis]. University of California – Berkeley; 2017. [cited 2020 Nov 24]. Available from: http://www.escholarship.org/uc/item/5t17357f.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Tezel B. Submodular Inequalities for the Path Structures of the Capacitated Fixed-Charge Network Flow Problems. [Thesis]. University of California – Berkeley; 2017. Available from: http://www.escholarship.org/uc/item/5t17357f

Not specified: Masters Thesis or Doctoral Dissertation

Texas A&M University

10. Arambula Mercado, Ivette. A new polyhedral approach to combinatorial designs.

Degree: PhD, Industrial Engineering, 2004, Texas A&M University

URL: http://hdl.handle.net/1969.1/358

► We consider combinatorial t-design problems as discrete optimization problems. Our motivation is that only a few studies have been done on the use of exact…
(more)

Subjects/Keywords: t-designs; integer programming; combinatorial optimization; polyhedral methods; valid inequalities; cutting planes; branch-and-cut; Steiner systems

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Arambula Mercado, I. (2004). A new polyhedral approach to combinatorial designs. (Doctoral Dissertation). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/358

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

Arambula Mercado, Ivette. “A new polyhedral approach to combinatorial designs.” 2004. Doctoral Dissertation, Texas A&M University. Accessed November 24, 2020. http://hdl.handle.net/1969.1/358.

MLA Handbook (7^{th} Edition):

Arambula Mercado, Ivette. “A new polyhedral approach to combinatorial designs.” 2004. Web. 24 Nov 2020.

Vancouver:

Arambula Mercado I. A new polyhedral approach to combinatorial designs. [Internet] [Doctoral dissertation]. Texas A&M University; 2004. [cited 2020 Nov 24]. Available from: http://hdl.handle.net/1969.1/358.

Council of Science Editors:

Arambula Mercado I. A new polyhedral approach to combinatorial designs. [Doctoral Dissertation]. Texas A&M University; 2004. Available from: http://hdl.handle.net/1969.1/358

Pontifical Catholic University of Rio de Janeiro

11. FELIPE SILVA PLACIDO DOS SANTOS. [en] ACCELERATING BENDERS STOCHASTIC DECOMPOSITION FOR THE OPTIMIZATION OF PARTIAL BACKORDER CONTROL FOR PERIODIC REVIEW (R, S) INVENTORY SYSTEM WITH UNCERTAIN DEMAND.

Degree: 2017, Pontifical Catholic University of Rio de Janeiro

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

►

[pt] Este trabalho apresenta uma proposta de aceleração da decomposição de Benders aplicada a uma versão mais geral e compacta (menos restrições e variáveis) do… (more)

Subjects/Keywords: [pt] TECNICAS DE ACELERACAO; [en] ACCELERATION TECHNIQUES; [pt] CONTROLE DE ESTOQUE; [en] STOCK CONTROL; [pt] DEMANDA INCERTA; [en] UNCERTAIN DEMAND; [pt] BACKORDER PARCIAL; [en] PARTIAL BACKORDER; [pt] METODO L-SHAPED; [en] L-SHAPED METHOD; [pt] DESIGUALDADES VALIDAS; [en] VALID INEQUALITIES

Record Details Similar Records

❌

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

APA (6^{th} Edition):

SANTOS, F. S. P. D. (2017). [en] ACCELERATING BENDERS STOCHASTIC DECOMPOSITION FOR THE OPTIMIZATION OF PARTIAL BACKORDER CONTROL FOR PERIODIC REVIEW (R, S) INVENTORY SYSTEM WITH UNCERTAIN DEMAND. (Thesis). Pontifical Catholic University of Rio de Janeiro. Retrieved from http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=31326

Not specified: Masters Thesis or Doctoral Dissertation

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

SANTOS, FELIPE SILVA PLACIDO DOS. “[en] ACCELERATING BENDERS STOCHASTIC DECOMPOSITION FOR THE OPTIMIZATION OF PARTIAL BACKORDER CONTROL FOR PERIODIC REVIEW (R, S) INVENTORY SYSTEM WITH UNCERTAIN DEMAND.” 2017. Thesis, Pontifical Catholic University of Rio de Janeiro. Accessed November 24, 2020. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=31326.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

SANTOS, FELIPE SILVA PLACIDO DOS. “[en] ACCELERATING BENDERS STOCHASTIC DECOMPOSITION FOR THE OPTIMIZATION OF PARTIAL BACKORDER CONTROL FOR PERIODIC REVIEW (R, S) INVENTORY SYSTEM WITH UNCERTAIN DEMAND.” 2017. Web. 24 Nov 2020.

Vancouver:

SANTOS FSPD. [en] ACCELERATING BENDERS STOCHASTIC DECOMPOSITION FOR THE OPTIMIZATION OF PARTIAL BACKORDER CONTROL FOR PERIODIC REVIEW (R, S) INVENTORY SYSTEM WITH UNCERTAIN DEMAND. [Internet] [Thesis]. Pontifical Catholic University of Rio de Janeiro; 2017. [cited 2020 Nov 24]. Available from: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=31326.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

SANTOS FSPD. [en] ACCELERATING BENDERS STOCHASTIC DECOMPOSITION FOR THE OPTIMIZATION OF PARTIAL BACKORDER CONTROL FOR PERIODIC REVIEW (R, S) INVENTORY SYSTEM WITH UNCERTAIN DEMAND. [Thesis]. Pontifical Catholic University of Rio de Janeiro; 2017. Available from: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=31326

Not specified: Masters Thesis or Doctoral Dissertation

12. Μητρόπουλος, Παναγιώτης. Πολυκριτηριακή ανάλυση στη λήψη αποφάσεων για τη χωροθέτηση εγκαταστάσεων και την κατανομή πόρων.

Degree: 2007, University of Patras

URL: http://nemertes.lis.upatras.gr/jspui/handle/10889/659

►

Στην εργασία αυτή αντιμετωπίζεται το πρόβλημα της χωροθέτησης εγκαταστάσεων και της κατανομής της ζήτησης σε περιφερειακό επίπεδο μέσω της παρουσίασης σχετικών μαθηματικών υποδειγμάτων μικτού ακέραιου… (more)

Subjects/Keywords: Χωροθέτηση-κατανομή; Ισχυρές ανισότητες; Ευρεστικές μέθοδοι; Διαχείριση απορριμμάτων; 628.445 64; Location–allocation; Valid inequalities; Heuristics; Solid waste management

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Μητρόπουλος, . (2007). Πολυκριτηριακή ανάλυση στη λήψη αποφάσεων για τη χωροθέτηση εγκαταστάσεων και την κατανομή πόρων. (Doctoral Dissertation). University of Patras. Retrieved from http://nemertes.lis.upatras.gr/jspui/handle/10889/659

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

Μητρόπουλος, Παναγιώτης. “Πολυκριτηριακή ανάλυση στη λήψη αποφάσεων για τη χωροθέτηση εγκαταστάσεων και την κατανομή πόρων.” 2007. Doctoral Dissertation, University of Patras. Accessed November 24, 2020. http://nemertes.lis.upatras.gr/jspui/handle/10889/659.

MLA Handbook (7^{th} Edition):

Μητρόπουλος, Παναγιώτης. “Πολυκριτηριακή ανάλυση στη λήψη αποφάσεων για τη χωροθέτηση εγκαταστάσεων και την κατανομή πόρων.” 2007. Web. 24 Nov 2020.

Vancouver:

Μητρόπουλος . Πολυκριτηριακή ανάλυση στη λήψη αποφάσεων για τη χωροθέτηση εγκαταστάσεων και την κατανομή πόρων. [Internet] [Doctoral dissertation]. University of Patras; 2007. [cited 2020 Nov 24]. Available from: http://nemertes.lis.upatras.gr/jspui/handle/10889/659.

Council of Science Editors:

Μητρόπουλος . Πολυκριτηριακή ανάλυση στη λήψη αποφάσεων για τη χωροθέτηση εγκαταστάσεων και την κατανομή πόρων. [Doctoral Dissertation]. University of Patras; 2007. Available from: http://nemertes.lis.upatras.gr/jspui/handle/10889/659

Pontifical Catholic University of Rio de Janeiro

13. GUSTAVO SOUTO DOS SANTOS DIZ. [en] MARITIME INVENTORY ROUTING: A PRACTICAL ASSESSMENT AND ROBUST OPTIMIZATION APPROACH.

Degree: 2019, Pontifical Catholic University of Rio de Janeiro

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

►

[pt] O problema de roteamento de navios com gestão de estoques (conhecido pelo termo em inglês Maritime inventory routing ou MIR) representa um problema prático… (more)

Subjects/Keywords: [pt] OTIMIZACAO ROBUSTA; [en] ROBUST OPTIMIZATION; [pt] PROGRAMACAO LINEAR INTEIRA MISTA; [en] MIXED INTEGER LINEAR PROGRAMMING; [pt] MARITIME INVENTORY ROUTING; [en] MARITIME INVENTORY ROUTING; [pt] INEQUACOES VALIDAS; [en] VALID INEQUALITIES; [pt] RELAX-AND-FIX; [en] RELAX-AND-FIX; [pt] FIX-AND-OPTIMIZE; [en] FIX-AND-OPTIMIZE

Record Details Similar Records

❌

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

APA (6^{th} Edition):

DIZ, G. S. D. S. (2019). [en] MARITIME INVENTORY ROUTING: A PRACTICAL ASSESSMENT AND ROBUST OPTIMIZATION APPROACH. (Thesis). Pontifical Catholic University of Rio de Janeiro. Retrieved from http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=36714

Not specified: Masters Thesis or Doctoral Dissertation

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

DIZ, GUSTAVO SOUTO DOS SANTOS. “[en] MARITIME INVENTORY ROUTING: A PRACTICAL ASSESSMENT AND ROBUST OPTIMIZATION APPROACH.” 2019. Thesis, Pontifical Catholic University of Rio de Janeiro. Accessed November 24, 2020. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=36714.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

DIZ, GUSTAVO SOUTO DOS SANTOS. “[en] MARITIME INVENTORY ROUTING: A PRACTICAL ASSESSMENT AND ROBUST OPTIMIZATION APPROACH.” 2019. Web. 24 Nov 2020.

Vancouver:

DIZ GSDS. [en] MARITIME INVENTORY ROUTING: A PRACTICAL ASSESSMENT AND ROBUST OPTIMIZATION APPROACH. [Internet] [Thesis]. Pontifical Catholic University of Rio de Janeiro; 2019. [cited 2020 Nov 24]. Available from: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=36714.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

DIZ GSDS. [en] MARITIME INVENTORY ROUTING: A PRACTICAL ASSESSMENT AND ROBUST OPTIMIZATION APPROACH. [Thesis]. Pontifical Catholic University of Rio de Janeiro; 2019. Available from: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=36714

Not specified: Masters Thesis or Doctoral Dissertation

14. Angilella, Vincent. Design optimal des réseaux Fiber To The Home : Optimal design of Fiber To The Home networks.

Degree: Docteur es, Recherche opérationnelle, 2018, Evry, Institut national des télécommunications

URL: http://www.theses.fr/2018TELE0004

►

Pour les opérateurs, les réseaux FTTH représentent à la fois la solution de référence pour répondre à la demande croissante de trafic fixe, et un… (more)

Subjects/Keywords: Réseaux optiques; Planification des réseaux; Théorie de la complexité; Programmation en nombres entiers; Inégalités valides; Programmation dynamique; Programmation linéaire mixte; Optical networks; Network design; Complexity theory; Integer programming; Valid inequalities; Dynamic programming; Mixed integer programming

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Angilella, V. (2018). Design optimal des réseaux Fiber To The Home : Optimal design of Fiber To The Home networks. (Doctoral Dissertation). Evry, Institut national des télécommunications. Retrieved from http://www.theses.fr/2018TELE0004

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

Angilella, Vincent. “Design optimal des réseaux Fiber To The Home : Optimal design of Fiber To The Home networks.” 2018. Doctoral Dissertation, Evry, Institut national des télécommunications. Accessed November 24, 2020. http://www.theses.fr/2018TELE0004.

MLA Handbook (7^{th} Edition):

Angilella, Vincent. “Design optimal des réseaux Fiber To The Home : Optimal design of Fiber To The Home networks.” 2018. Web. 24 Nov 2020.

Vancouver:

Angilella V. Design optimal des réseaux Fiber To The Home : Optimal design of Fiber To The Home networks. [Internet] [Doctoral dissertation]. Evry, Institut national des télécommunications; 2018. [cited 2020 Nov 24]. Available from: http://www.theses.fr/2018TELE0004.

Council of Science Editors:

Angilella V. Design optimal des réseaux Fiber To The Home : Optimal design of Fiber To The Home networks. [Doctoral Dissertation]. Evry, Institut national des télécommunications; 2018. Available from: http://www.theses.fr/2018TELE0004

Georgia Tech

15. Garcia, Renan. Resource constrained shortest paths and extensions.

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

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

► In this thesis, we use integer programming techniques to solve the resource constrained shortest path problem (RCSPP) which seeks a minimum cost path between two…
(more)

Subjects/Keywords: Dial-a-flight problem; Valid inequalities; Branch and cut; Integer programming; Constrained shortest paths; Integer programming; Combinatorial optimization; Algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Garcia, R. (2009). Resource constrained shortest paths and extensions. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/28268

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

Garcia, Renan. “Resource constrained shortest paths and extensions.” 2009. Doctoral Dissertation, Georgia Tech. Accessed November 24, 2020. http://hdl.handle.net/1853/28268.

MLA Handbook (7^{th} Edition):

Garcia, Renan. “Resource constrained shortest paths and extensions.” 2009. Web. 24 Nov 2020.

Vancouver:

Garcia R. Resource constrained shortest paths and extensions. [Internet] [Doctoral dissertation]. Georgia Tech; 2009. [cited 2020 Nov 24]. Available from: http://hdl.handle.net/1853/28268.

Council of Science Editors:

Garcia R. Resource constrained shortest paths and extensions. [Doctoral Dissertation]. Georgia Tech; 2009. Available from: http://hdl.handle.net/1853/28268

16.
Cimren, Emrah.
*Valid**Inequalities* for The 0-1 Mixed Knapsack Polytope with
Upper Bounds.

Degree: PhD, Industrial and Systems Engineering, 2010, The Ohio State University

URL: http://rave.ohiolink.edu/etdc/view?acc_num=osu1273804915

► The polyhedral structure of the convex hull of the 0-1 mixed knapsack polytope defined by a knapsack inequality with continuous and binary variables with…
(more)

Subjects/Keywords: Industrial Engineering; valid inequalities; polyhedral theory; mixed integer programming; knapsack polytope; sequence independent lifting

…98
3.2
3.3
3.4
4.
*Valid* *Inequalities* . . . . . . . . . . . . . . . . . . .
3.1.1 Basic… …Klabjan
3.1.5 Alternative *Valid* *Inequalities* . . . . . . . .
Separation… …*inequalities* for P . The first set of *valid* *inequalities* is developed by adding a new
subset of… …*valid* *inequalities* is generated by sequence independent lifting of
the flow cover *inequalities*… …that the
study of the polyhedral structure of P allows us to derive *valid* *inequalities* for…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Cimren, E. (2010). Valid Inequalities for The 0-1 Mixed Knapsack Polytope with Upper Bounds. (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1273804915

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

Cimren, Emrah. “Valid Inequalities for The 0-1 Mixed Knapsack Polytope with Upper Bounds.” 2010. Doctoral Dissertation, The Ohio State University. Accessed November 24, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=osu1273804915.

MLA Handbook (7^{th} Edition):

Cimren, Emrah. “Valid Inequalities for The 0-1 Mixed Knapsack Polytope with Upper Bounds.” 2010. Web. 24 Nov 2020.

Vancouver:

Cimren E. Valid Inequalities for The 0-1 Mixed Knapsack Polytope with Upper Bounds. [Internet] [Doctoral dissertation]. The Ohio State University; 2010. [cited 2020 Nov 24]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1273804915.

Council of Science Editors:

Cimren E. Valid Inequalities for The 0-1 Mixed Knapsack Polytope with Upper Bounds. [Doctoral Dissertation]. The Ohio State University; 2010. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1273804915

17. Mkadem, Mohamed Amine. Flow-shop with time delays, linear modeling and exact solution approaches : Flow-shop avec temps de transport, modélisation linéaire et approches de résolution exacte.

Degree: Docteur es, Technologies de l'Information et des Systèmes : Unité de recherche Heudyasic (UMR-7253), 2017, Compiègne

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

►

Dans le cadre de cette thèse, nous traitons le problème de flow-shop à deux machines avec temps de transport où l’objectif consiste à minimiser le… (more)

Subjects/Keywords: Problème de flow-shop; Temps de transport; Bornes inférieures; Règles de dominance; Programmation linéaire en nombres entiers; Inégalités valides; Branch-and-bound; Branch-and-cut; Algorithmes par séparation et évaluation; Operations research; Flow-shop; Time delays; Integer programming; Lower bounds; Dominance rules; Heuristics; Valid inequalities; Branch-and-bound; Branch-and-cut; Algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Mkadem, M. A. (2017). Flow-shop with time delays, linear modeling and exact solution approaches : Flow-shop avec temps de transport, modélisation linéaire et approches de résolution exacte. (Doctoral Dissertation). Compiègne. Retrieved from http://www.theses.fr/2017COMP2390

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

Mkadem, Mohamed Amine. “Flow-shop with time delays, linear modeling and exact solution approaches : Flow-shop avec temps de transport, modélisation linéaire et approches de résolution exacte.” 2017. Doctoral Dissertation, Compiègne. Accessed November 24, 2020. http://www.theses.fr/2017COMP2390.

MLA Handbook (7^{th} Edition):

Mkadem, Mohamed Amine. “Flow-shop with time delays, linear modeling and exact solution approaches : Flow-shop avec temps de transport, modélisation linéaire et approches de résolution exacte.” 2017. Web. 24 Nov 2020.

Vancouver:

Mkadem MA. Flow-shop with time delays, linear modeling and exact solution approaches : Flow-shop avec temps de transport, modélisation linéaire et approches de résolution exacte. [Internet] [Doctoral dissertation]. Compiègne; 2017. [cited 2020 Nov 24]. Available from: http://www.theses.fr/2017COMP2390.

Council of Science Editors:

Mkadem MA. Flow-shop with time delays, linear modeling and exact solution approaches : Flow-shop avec temps de transport, modélisation linéaire et approches de résolution exacte. [Doctoral Dissertation]. Compiègne; 2017. Available from: http://www.theses.fr/2017COMP2390

Virginia Tech

18. Staats, Raymond William. An Airspace Planning and Collaborative Decision Making Model Under Safety, Workload, and Equity Considerations.

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

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

► We develop a detailed, large-scale, airspace planning and collaborative decision-making model (APCDM), that is part of an $11.5B, 10-year, Federal Aviation Administration (FAA)-sponsored effort to…
(more)

Subjects/Keywords: Valid Inequalities; Air Traffic Control; Multi-attribute Utility Theory; Collaborative Decision Making; Decision Equity; Mixed-Integer Programming; Airline Scheduling Problem; Aircraft Collision Risk

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Staats, R. W. (2003). An Airspace Planning and Collaborative Decision Making Model Under Safety, Workload, and Equity Considerations. (Doctoral Dissertation). Virginia Tech. Retrieved from http://hdl.handle.net/10919/26844

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

Staats, Raymond William. “An Airspace Planning and Collaborative Decision Making Model Under Safety, Workload, and Equity Considerations.” 2003. Doctoral Dissertation, Virginia Tech. Accessed November 24, 2020. http://hdl.handle.net/10919/26844.

MLA Handbook (7^{th} Edition):

Staats, Raymond William. “An Airspace Planning and Collaborative Decision Making Model Under Safety, Workload, and Equity Considerations.” 2003. Web. 24 Nov 2020.

Vancouver:

Staats RW. An Airspace Planning and Collaborative Decision Making Model Under Safety, Workload, and Equity Considerations. [Internet] [Doctoral dissertation]. Virginia Tech; 2003. [cited 2020 Nov 24]. Available from: http://hdl.handle.net/10919/26844.

Council of Science Editors:

Staats RW. An Airspace Planning and Collaborative Decision Making Model Under Safety, Workload, and Equity Considerations. [Doctoral Dissertation]. Virginia Tech; 2003. Available from: http://hdl.handle.net/10919/26844