Advanced search options

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

Language: English ^{❌}

You searched for `subject:(Binary integer programming)`

.
Showing records 1 – 8 of
8 total matches.

▼ Search Limiters

Queens University

1. Li, Wenjie. Popularity-driven Caching Strategy for Dynamic Adaptive Streaming over Information-Centric Networks .

Degree: Computing, 2015, Queens University

URL: http://hdl.handle.net/1974/13414

► The growing demand for video streaming is straining the current Internet, and mandating a novel approach to future Internet paradigms. The advent of Information-Centric Networks…
(more)

Subjects/Keywords: in-network caching; Optimization; Content-centric network; Queueing analysis; Binary integer programming; Dynamic adaptive streaming

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Li, W. (2015). Popularity-driven Caching Strategy for Dynamic Adaptive Streaming over Information-Centric Networks . (Thesis). Queens University. Retrieved from http://hdl.handle.net/1974/13414

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

Li, Wenjie. “Popularity-driven Caching Strategy for Dynamic Adaptive Streaming over Information-Centric Networks .” 2015. Thesis, Queens University. Accessed June 25, 2019. http://hdl.handle.net/1974/13414.

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Li, Wenjie. “Popularity-driven Caching Strategy for Dynamic Adaptive Streaming over Information-Centric Networks .” 2015. Web. 25 Jun 2019.

Vancouver:

Li W. Popularity-driven Caching Strategy for Dynamic Adaptive Streaming over Information-Centric Networks . [Internet] [Thesis]. Queens University; 2015. [cited 2019 Jun 25]. Available from: http://hdl.handle.net/1974/13414.

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

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Li W. Popularity-driven Caching Strategy for Dynamic Adaptive Streaming over Information-Centric Networks . [Thesis]. Queens University; 2015. Available from: http://hdl.handle.net/1974/13414

Not specified: Masters Thesis or Doctoral Dissertation

2. Lopez, Oscar Fabian. A compressive sensing approach to solving nonograms.

Degree: Mathematics, 2013, University of Texas – Austin

URL: http://hdl.handle.net/2152/22669

► A nonogram is a logic puzzle where one shades certain cells of a 2D grid to reveal a hidden image. One uses the sequences of…
(more)

Subjects/Keywords: Nonogram; Compressive sensing; Binary integer programming

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Lopez, O. F. (2013). A compressive sensing approach to solving nonograms. (Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/22669

Not specified: Masters Thesis or Doctoral Dissertation

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

Lopez, Oscar Fabian. “A compressive sensing approach to solving nonograms.” 2013. Thesis, University of Texas – Austin. Accessed June 25, 2019. http://hdl.handle.net/2152/22669.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Lopez, Oscar Fabian. “A compressive sensing approach to solving nonograms.” 2013. Web. 25 Jun 2019.

Vancouver:

Lopez OF. A compressive sensing approach to solving nonograms. [Internet] [Thesis]. University of Texas – Austin; 2013. [cited 2019 Jun 25]. Available from: http://hdl.handle.net/2152/22669.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Lopez OF. A compressive sensing approach to solving nonograms. [Thesis]. University of Texas – Austin; 2013. Available from: http://hdl.handle.net/2152/22669

Not specified: Masters Thesis or Doctoral Dissertation

3. Κυριακίδης, Θωμάς. Algorithms for optimal project scheduling.

Degree: 2013, University of Western Macedonia; Πανεπιστήμιο Δυτικής Μακεδονίας

URL: http://hdl.handle.net/10442/hedi/28198

► Project scheduling plays a vital role in project management, and constitutes one of the most important directions in both research and practice in the Operational…
(more)

Subjects/Keywords: Χρονοπρογραμματισμός έργων; Μικτός ακέραιος προγραμματισμός; Δυαδικός ακέραιος προγραμματισμός; Χρονικές υστερήσεις; Πρόβλημα χρονοπρογραμματισμός με περιορισμένους πόρους; Διαχείριση έργων; Μαθηματικός προγραμματισμός; Project scheduling; Mixed integer programming; Binary integer programming; Time lags; Resource constrained project scheduling; Project management; Mathematical programming

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Κυριακίδης, . . (2013). Algorithms for optimal project scheduling. (Thesis). University of Western Macedonia; Πανεπιστήμιο Δυτικής Μακεδονίας. Retrieved from http://hdl.handle.net/10442/hedi/28198

Not specified: Masters Thesis or Doctoral Dissertation

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

Κυριακίδης, Θωμάς. “Algorithms for optimal project scheduling.” 2013. Thesis, University of Western Macedonia; Πανεπιστήμιο Δυτικής Μακεδονίας. Accessed June 25, 2019. http://hdl.handle.net/10442/hedi/28198.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Κυριακίδης, Θωμάς. “Algorithms for optimal project scheduling.” 2013. Web. 25 Jun 2019.

Vancouver:

Κυριακίδης . Algorithms for optimal project scheduling. [Internet] [Thesis]. University of Western Macedonia; Πανεπιστήμιο Δυτικής Μακεδονίας; 2013. [cited 2019 Jun 25]. Available from: http://hdl.handle.net/10442/hedi/28198.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Κυριακίδης . Algorithms for optimal project scheduling. [Thesis]. University of Western Macedonia; Πανεπιστήμιο Δυτικής Μακεδονίας; 2013. Available from: http://hdl.handle.net/10442/hedi/28198

Not specified: Masters Thesis or Doctoral Dissertation

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

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

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

►

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

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

Record Details Similar Records

❌

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

APA (6^{th} Edition):

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

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

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

MLA Handbook (7^{th} Edition):

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

Vancouver:

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

Council of Science Editors:

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

University of Cincinnati

5. KANNAN, SRIRAM. AN EXACT ALGORITHM FOR THE SHARE-OF-CHOICE PROBLEM.

Degree: PhD, Business Administration : Quantitative Analysis, 2006, University of Cincinnati

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

► Products and services can be thought of as bundles of attributes that are each made up of many levels. Consumers consider tradeoffs between various attributes…
(more)

Subjects/Keywords: Operations Research; Product Design; Conjoint Optimization; Binary Integer Programming; Constraint Aggregation; Share of Choice Problem

Record Details Similar Records

❌

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

APA (6^{th} Edition):

KANNAN, S. (2006). AN EXACT ALGORITHM FOR THE SHARE-OF-CHOICE PROBLEM. (Doctoral Dissertation). University of Cincinnati. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=ucin1146808499

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

KANNAN, SRIRAM. “AN EXACT ALGORITHM FOR THE SHARE-OF-CHOICE PROBLEM.” 2006. Doctoral Dissertation, University of Cincinnati. Accessed June 25, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1146808499.

MLA Handbook (7^{th} Edition):

KANNAN, SRIRAM. “AN EXACT ALGORITHM FOR THE SHARE-OF-CHOICE PROBLEM.” 2006. Web. 25 Jun 2019.

Vancouver:

KANNAN S. AN EXACT ALGORITHM FOR THE SHARE-OF-CHOICE PROBLEM. [Internet] [Doctoral dissertation]. University of Cincinnati; 2006. [cited 2019 Jun 25]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ucin1146808499.

Council of Science Editors:

KANNAN S. AN EXACT ALGORITHM FOR THE SHARE-OF-CHOICE PROBLEM. [Doctoral Dissertation]. University of Cincinnati; 2006. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ucin1146808499

University of Western Ontario

6. Miranskyy, Andriy. Models, Techniques, and Metrics for Managing Risk in Software Engineering.

Degree: 2011, University of Western Ontario

URL: https://ir.lib.uwo.ca/etd/188

► The field of Software Engineering (SE) is the study of systematic and quantifiable approaches to software development, operation, and maintenance. This thesis presents a set…
(more)

Subjects/Keywords: software engineering; risk; execution trace; entropy; defect rediscovery; extreme value theory; Kappa distribution; G/M/k queue; binary integer programming; customer profiling; escalated requirement; assumption; stochastic modeling; Boolean network; Other Applied Mathematics; Software Engineering

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Miranskyy, A. (2011). Models, Techniques, and Metrics for Managing Risk in Software Engineering. (Thesis). University of Western Ontario. Retrieved from https://ir.lib.uwo.ca/etd/188

Not specified: Masters Thesis or Doctoral Dissertation

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

Miranskyy, Andriy. “Models, Techniques, and Metrics for Managing Risk in Software Engineering.” 2011. Thesis, University of Western Ontario. Accessed June 25, 2019. https://ir.lib.uwo.ca/etd/188.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Miranskyy, Andriy. “Models, Techniques, and Metrics for Managing Risk in Software Engineering.” 2011. Web. 25 Jun 2019.

Vancouver:

Miranskyy A. Models, Techniques, and Metrics for Managing Risk in Software Engineering. [Internet] [Thesis]. University of Western Ontario; 2011. [cited 2019 Jun 25]. Available from: https://ir.lib.uwo.ca/etd/188.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Miranskyy A. Models, Techniques, and Metrics for Managing Risk in Software Engineering. [Thesis]. University of Western Ontario; 2011. Available from: https://ir.lib.uwo.ca/etd/188

Not specified: Masters Thesis or Doctoral Dissertation

University of Cincinnati

7. FENG, KELI. THREE ESSAYS ON PRODUCTION AND INVENTORY MANAGEMENT.

Degree: PhD, Business Administration : Quantitative Analysis, 2005, University of Cincinnati

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

► This dissertation consists of three essays that address issues in production and inventory management. The first essay focuses on inventory management. We study a…
(more)

Subjects/Keywords: Business Administration, Management; Multi-Echelon Inventory; Stochastic Demand; Heuristics; Periodic-Review; Cyclic Scheduling; Flow-Time Optimization; Binary Integer Programming; Material Requirements Planning; Demand Uncertainty; Simulation based optimization

Record Details Similar Records

❌

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

APA (6^{th} Edition):

FENG, K. (2005). THREE ESSAYS ON PRODUCTION AND INVENTORY MANAGEMENT. (Doctoral Dissertation). University of Cincinnati. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=ucin1122442476

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

FENG, KELI. “THREE ESSAYS ON PRODUCTION AND INVENTORY MANAGEMENT.” 2005. Doctoral Dissertation, University of Cincinnati. Accessed June 25, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1122442476.

MLA Handbook (7^{th} Edition):

FENG, KELI. “THREE ESSAYS ON PRODUCTION AND INVENTORY MANAGEMENT.” 2005. Web. 25 Jun 2019.

Vancouver:

FENG K. THREE ESSAYS ON PRODUCTION AND INVENTORY MANAGEMENT. [Internet] [Doctoral dissertation]. University of Cincinnati; 2005. [cited 2019 Jun 25]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ucin1122442476.

Council of Science Editors:

FENG K. THREE ESSAYS ON PRODUCTION AND INVENTORY MANAGEMENT. [Doctoral Dissertation]. University of Cincinnati; 2005. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ucin1122442476

8. Morrison, David. New methods for branch-and-bound algorithms.

Degree: PhD, 0112, 2014, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/50713

► Branch-and-bound (B&B) algorithms, and extensions such as branch-and-price (B&P) are powerful tools for optimization. These algorithms are used in a wide variety of settings, and…
(more)

Subjects/Keywords: branch-and-bound; branch-and-price; search strategies; zero-suppressed binary decision diagrams; wide branching; graph coloring; mixed integer programming

…of the
tree first. For example, given a *binary* mixed *integer* *programming* problem with a… …branching scheme for *integer* *programming* in Section 2.6.1 is another *binary*
branching scheme.
In… …*integer* *programming* problem
A
An arbitrary search strategy for a branch-and-bound algorithm
b… …Constraint bounds for an *integer* *programming* problem
β
A numerical constant
c
A vector of cost… …path) at z
λ
Lagrange multiplier vector in an *integer* *programming* problem
M
A bound…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Morrison, D. (2014). New methods for branch-and-bound algorithms. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/50713

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

Morrison, David. “New methods for branch-and-bound algorithms.” 2014. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed June 25, 2019. http://hdl.handle.net/2142/50713.

MLA Handbook (7^{th} Edition):

Morrison, David. “New methods for branch-and-bound algorithms.” 2014. Web. 25 Jun 2019.

Vancouver:

Morrison D. New methods for branch-and-bound algorithms. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2014. [cited 2019 Jun 25]. Available from: http://hdl.handle.net/2142/50713.

Council of Science Editors:

Morrison D. New methods for branch-and-bound algorithms. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2014. Available from: http://hdl.handle.net/2142/50713