Log in

Relevant bibliographies by topics / Integer programming and network flows

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers

Academic literature on the topic 'Integer programming and network flows'

Author: Grafiati

Published: 4 June 2021

Last updated: 1 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Integer programming and network flows.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Integer programming and network flows"

1

Mora, Camilo Andres, Oscar Danilo Montoya, and Edwin Rivas Trujillo. "Mixed-Integer Programming Model for Transmission Network Expansion Planning with Battery Energy Storage Systems (BESS)." Energies 13, no. 17 (2020): 4386. http://dx.doi.org/10.3390/en13174386.

Full text

Abstract:

This article assesses the costs and benefits of incorporating battery energy storage systems (BESS) in transmission network expansion planning (TEP) over multiple time periods. We propose a mixed-integer programming model (MIP) for joint planning of the installation of battery energy storage systems (BESS) and construction of new transmission lines in multiple periods of time. The mathematical formulation of the presented model is based on the strategies of the agents of a transmission network to maximize their benefit, and on the operational restrictions of the power flows in transmission net

APA, Harvard, Vancouver, ISO, and other styles

2

Kamal, Md Abdus Samad, Jun-ichi Imura, Tomohisa Hayakawa, Akira Ohata, and Kazuyuki Aihara. "Network-Wide Optimization of Traffic Signals Using Mixed Integer Programming." Journal of Robotics and Mechatronics 26, no. 5 (2014): 607–15. http://dx.doi.org/10.20965/jrm.2014.p0607.

Full text

Abstract:

<div class=""abs_img""><img src=""[disp_template_path]/JRM/abst-image/00260005/09.jpg"" width=""300"" />Network with four intersections</div> In this paper a network-wide traffic signal control scheme in a model predictive control framework using mixed integer programming is presented. A concise model of traffic is proposed to describe a signalized road network considering conservation of traffic. In the model, the traffic of two sections that belong to a traffic signal group of a junction are represented by a single continuous variable. Therefore, the number of variables req

APA, Harvard, Vancouver, ISO, and other styles

3

Van den Briel, M. H. L., T. Vossen, and S. Kambhampati. "Loosely Coupled Formulations for Automated Planning: An Integer Programming Perspective." Journal of Artificial Intelligence Research 31 (February 5, 2008): 217–57. http://dx.doi.org/10.1613/jair.2443.

Full text

Abstract:

We represent planning as a set of loosely coupled network flow problems, where each network corresponds to one of the state variables in the planning domain. The network nodes correspond to the state variable values and the network arcs correspond to the value transitions. The planning problem is to find a path (a sequence of actions) in each network such that, when merged, they constitute a feasible plan. In this paper we present a number of integer programming formulations that model these loosely coupled networks with varying degrees of flexibility. Since merging may introduce exponentially

APA, Harvard, Vancouver, ISO, and other styles

4

MOROWATI-SHALILVAND, Shahram, and Javad MEHRI-TEKMEH. "Finding Most Vital Links over Time in a Flow Network." An International Journal of Optimization and Control: Theories & Applications (IJOCTA) 2, no. 2 (2012): 173–86. http://dx.doi.org/10.11121/ijocta.01.2012.0098.

Full text

Abstract:

This paper deals with finding most vital links of a network which carries flows over time (also called ”dynamic flows”). Given a network and a time horizon T, Single Most Vital Link Over Time (SMVLOT) problem looks for a link whose removal results in greatest decrease in the value of maximum flow over time (dynamic maximum flow) up to time horizon T between two terminal nodes. SMVLOT problem is formulated as a mixed binary linear programming problem. This formulation is extended to a general case called k-Most Vital Links Over Time (KMVLOT) problem, in which we look for finding those k links w

APA, Harvard, Vancouver, ISO, and other styles

5

Ling, Yong Fa, Qing Liao, Yong Tao Dong, and Yan Li. "A New Genetic Algorithm for Balancing Network Load." Advanced Materials Research 588-589 (November 2012): 1188–93. http://dx.doi.org/10.4028/www.scientific.net/amr.588-589.1188.

Full text

Abstract:

This article firstly presents an optimization mathematic model of load distribution based on integer programming, and proposes an optimization method based on genetic algorithm, used for solving problems of balanced network flows with high complexity computation multi-constraint. The simulation results have verified that the algorithm is efficient and evidently improve the status that traditional SPF route algorithm tends to unbalanced network load distribution.

APA, Harvard, Vancouver, ISO, and other styles

6

Mujali Al-Rawahna, Ammar Salamh, and Anas Yahya Bader Al Hadid. "A Propose Model Optimal Supply Chain Distribution Network for Farmer Industrial." IJIIS: International Journal of Informatics and Information Systems 3, no. 2 (2020): 43–53. http://dx.doi.org/10.47738/ijiis.v3i2.62.

Full text

Abstract:

A supply chain should be operated in the most efficient way in a highly competitive environment, with the goals of cost minimization, shipment delays, inventories and expenditures, and distribution maximization, gain, return on investment, level of customer support, and efficiency. The development of supply-chain distribution networks is therefore an extremely complex task, due to the large physical production and distribution network flows, the uncertainties associated with external interface customers and suppliers as well as the non-linear dynamics linked to internal information flows. This

APA, Harvard, Vancouver, ISO, and other styles

7

Zhao, Yang, Lei Wang, Xue Chen, and Futao Yang. "Bulk Restoration for SDN-Based Transport Network." Scientific Programming 2016 (2016): 1–8. http://dx.doi.org/10.1155/2016/1938312.

Full text

Abstract:

We propose a bulk restoration scheme for software defined networking- (SDN-) based transport network. To enhance the network survivability and improve the throughput, we allow disrupted flows to be recovered synchronously in dynamic order. In addition backup paths are scheduled globally by applying the principles of load balance. We model the bulk restoration problem using a mixed integer linear programming (MILP) formulation. Then, a heuristic algorithm is devised. The proposed algorithm is verified by simulation and the results are analyzed comparing with sequential restoration schemes.

APA, Harvard, Vancouver, ISO, and other styles

8

Guerrero Campanur, Aaron, Elias Olivares-Benitez, Pablo A. Miranda, Rodolfo Eleazar Perez-Loaiza, and Jose Humberto Ablanedo-Rosas. "Design of a Logistics Nonlinear System for a Complex, Multiechelon, Supply Chain Network with Uncertain Demands." Complexity 2018 (November 12, 2018): 1–16. http://dx.doi.org/10.1155/2018/4139601.

Full text

Abstract:

Industrial systems, such as logistics and supply chain networks, are complex systems because they comprise a big number of interconnected actors and significant nonlinear and stochastic features. This paper analyzes a distribution network design problem for a four-echelon supply chain. The problem is represented as an inventory-location model with uncertain demand and a continuous review inventory policy. The decision variables include location at the intermediate levels and product flows between echelons. The related safety and cyclic inventory levels can be computed from these decision varia

APA, Harvard, Vancouver, ISO, and other styles

9

Xu, Lei, and Tsan Sheng Adam Ng. "A Robust Mixed-Integer Linear Programming Model for Mitigating Rail Transit Disruptions Under Uncertainty." Transportation Science 54, no. 5 (2020): 1388–407. http://dx.doi.org/10.1287/trsc.2020.0998.

Full text

Abstract:

In this paper, we propose a two-stage robust optimization framework to evaluate widely controllable commuter flow strategies that can help mitigate uncertain disruption impacts on rail transit commuter flows. In the operation-as-usual stage, preemptive control strategies including timetable adjustment, commuter path choice diversion, and commuter trip starting time diversion are planned within budget and other requirement constraints. In the disruption stage, optimal contingency routing is derived to minimize disruption impacts. To this end, a linear programming model that simulates the commut

APA, Harvard, Vancouver, ISO, and other styles

10

Wang, Lingling, Xu Wang, Chuanwen Jiang, Shuo Yin, and Meng Yang. "Dynamic Coordinated Active–Reactive Power Optimization for Active Distribution Network with Energy Storage Systems." Applied Sciences 9, no. 6 (2019): 1129. http://dx.doi.org/10.3390/app9061129.

Full text

Abstract:

This paper proposes a coordinated active–reactive power optimization model for an active distribution network with energy storage systems, where the active and reactive resources are handled simultaneously. The model aims to minimize the power losses, the operation cost, and the voltage deviation of the distribution network. In particular, the reactive power capabilities of distributed generators and energy storage systems are fully utilized to minimize power losses and improve voltage profiles. The uncertainties pertaining to the forecasted values of renewable energy sources are modelled by s

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Integer programming and network flows"

1

Parmar, Amandeep. "Integer programming approaches to networks with equal-split restrictions." Diss., Available online, Georgia Institute of Technology, 2007, 2007. http://etd.gatech.edu/theses/available/etd-05032007-170932/.

Full text

Abstract:

Thesis (Ph. D.)--Industrial and Systems Engineering, Georgia Institute of Technology, 2008.<br>Nemhauser,George, Committee Member ; Gu, Zonghao, Committee Member ; Ergun, Ozlem, Committee Member ; Sokol, Joel, Committee Co-Chair ; Ahmed, Shabbir, Committee Chair.

APA, Harvard, Vancouver, ISO, and other styles

2

Bouras, Ikram. "Fixed charge network design problem with user-optimal flows." Thesis, Montpellier, 2019. http://www.theses.fr/2019MONTS136.

Full text

Abstract:

Cette thèse s'adresse à la classe des problèmes de conception de réseaux bi-niveaux. Nous nous sommes intéressés à l'étude des applications des différents domaines et au développement d'algorithmes exacts pour la résolution des problème de réseaux bi-niveau correspondants. En particulier, nous avons étudié le problème de conception de réseau bi-niveau dans lequel le ``leader" sélectionne une partie du réseau à activer, puis, dans le deuxième niveau, la solution doit être optimale pour un problème de flot dans le sous-réseau sélectionné. Dans cette thèse, trois applications de ce problème sont

APA, Harvard, Vancouver, ISO, and other styles

3

Baitshenyetsi, Tumo. "Applying tree knapsack approaches to general network design : a case study / T. Baitshenyetsi." Thesis, North-West University, 2010. http://hdl.handle.net/10394/4434.

Full text

Abstract:

There are many practical decision problems that fall into the category of network flow problems: numerous examples of applications can be found in areas such as telecommunications, logistics, distributions, engineering, computer science and so on. One of the most popular and valuable tools to solve network flow problems of a topological nature is the use of linear programming models. An important extension of these models is that of integer programming models that deal with problems where some, or all, of the variables are required to assume integer variables. A significant application in this

APA, Harvard, Vancouver, ISO, and other styles

4

He, Qie. "Topics in discrete optimization: models, complexity and algorithms." Diss., Georgia Institute of Technology, 2013. http://hdl.handle.net/1853/50237.

Full text

Abstract:

In this dissertation we examine several discrete optimization problems through the perspectives of modeling, complexity and algorithms. We first provide a probabilistic comparison of split and type 1 triangle cuts for mixed-integer programs with two rows and two integer variables in terms of cut coefficients and volume cutoff. Under a specific probabilistic model of the problem parameters, we show that for the above measure, the probability that a split cut is better than a type 1 triangle cut is higher than the probability that a type 1 triangle cut is better than a split cut. The analysis al

APA, Harvard, Vancouver, ISO, and other styles

5

Ferreira, Irma. "Sequence variation of the amelogenin gene on the Y-chromosome / by Irma Ferreira." North-West University, 2010. http://hdl.handle.net/10394/4412.

Full text

Abstract:

The accurate determination of gender of biological samples has valuable applications in medical and forensic investigations. Gender determination based on length variations in the X-Y homologous amelogenin gene, is part of most commercial multiplex DNA profiling kits. The first report of a failure of the amelogenin sex test was in 1998 when two normal males were typed as female. Subsequently, several amelogenin Y (AMELY) negative males have been reported. This study represents the first report of this phenomenon in the black South African population. This study determined the size of t

APA, Harvard, Vancouver, ISO, and other styles

6

Singh, Manish Kumar. "Optimization, Learning, and Control for Energy Networks." Diss., Virginia Tech, 2021. http://hdl.handle.net/10919/104064.

Full text

Abstract:

Massive infrastructure networks such as electric power, natural gas, or water systems play a pivotal role in everyday human lives. Development and operation of these networks is extremely capital-intensive. Moreover, security and reliability of these networks is critical. This work identifies and addresses a diverse class of computationally challenging and time-critical problems pertaining to these networks. This dissertation extends the state of the art on three fronts. First, general proofs of uniqueness for network flow problems are presented, thus addressing open problems. Efficient netwo

APA, Harvard, Vancouver, ISO, and other styles

7

Teixeira, Rafael Buback. "Modelo integrado para seleção de cargas e reposicionamento de contêineres vazios no transporte marítimo." Universidade de São Paulo, 2011. http://www.teses.usp.br/teses/disponiveis/3/3148/tde-02052011-205155/.

Full text

Abstract:

A popularização dos contêineres no transporte de cargas gerais por volta dos anos 60 provocou significativa mudança no tráfego de mercadorias ao redor do mundo. A utilização deste equipamento simplifica e agiliza o processo de transporte e manuseio de cargas, uma vez que permite a movimentação entre diferentes modais com rapidez e segurança nas operações de carga e descarga. Neste contexto, esta pesquisa trata do problema que integra decisões de escolha de cargas a serem transportadas pelo modal marítimo com decisões de reposicionamento de contêineres vazios de modo a maximizar a receita total

APA, Harvard, Vancouver, ISO, and other styles

8

Morris, Steven Michael. "Truck Dispatching and Fixed Driver Rest Locations." Diss., Georgia Institute of Technology, 2007. http://hdl.handle.net/1853/19745.

Full text

Abstract:

This thesis sets out to analyze how restricting rest (sleep) locations for long-haul truckers may impact operational productivity, given hours-of-service regulations. Productivity in this thesis is measured by the minimum number of unique drivers required to feasibly execute a set of load requests over a known planning horizon. When drivers may stop for rest at any location, they may maximize utilization under regulated driving hours. When drivers may only rest at certain discrete locations, their productivity may be diminished since they may no longer be able to fully utilize available servic

APA, Harvard, Vancouver, ISO, and other styles

9

Guazzelli, Cauê Sauter. "Modelos e métodos para estudos de configuração de redes logísticas." Universidade de São Paulo, 2018. http://www.teses.usp.br/teses/disponiveis/3/3138/tde-13072018-112347/.

Full text

Abstract:

Este trabalho trata do problema de configuração de redes logísticas, em que são consideradas como principais decisões a quantidade e a localização de instalações logísticas e a definição da alocação de clientes às instalações. Mais especificamente, o trabalho considera um processo típico de configuração de redes logísticas que se vale de modelos discretos de otimização e a tomada de decisão com base nos resultados. O objetivo da tese é propor modelos e métodos capazes de dar suporte às etapas fundamentais deste tipo de estudo. Inicialmente são propostos métodos para a seleção de locais candida

APA, Harvard, Vancouver, ISO, and other styles

10

Van, der Merwe Corna. "An optimisation approach to improve the throughput in wireless mesh networks through network coding / van der Merwe C." Thesis, North-West University, 2011. http://hdl.handle.net/10394/7302.

Full text

Abstract:

In this study, the effect of implementing Network Coding on the aggregated throughput in Wireless Mesh Networks, was examined. Wireless Mesh Networks (WMNs) are multiple hop wireless networks, where routing through any node is possible. The implication of this characteristic, is that messages flow across the points where it would have been terminated in conventional wireless networks. User nodes in conventional wireless networks only transmit and receive messages from an Access Point (AP), and discard any messages not intended for them. The result is an increase in the volume of network traffi

APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Integer programming and network flows"

1

Eiselt, H. A., and C. L. Sandblom. Integer Programming and Network Models. Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/978-3-662-04197-0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Eiselt, Horst A. Integer programming and network models. Springer, 2000.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

3

Woodruff, David L., ed. Network Interdiction and Stochastic Integer Programming. Kluwer Academic Publishers, 2003. http://dx.doi.org/10.1007/b101869.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Bazaraa, M. S. Linear programming and network flows. 4th ed. John Wiley & Sons, 2010.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

5

Bazaraa, M. S. Linear programming and network flows. 3rd ed. John Wiley, 2004.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

6

J, Jarvis John, and Sherali Hanif D. 1952-, eds. Linear programming and network flows. 4th ed. John Wiley & Sons, 2010.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

7

Bazaraa, Mokhtar S. Linear programming and network flows. 2nd ed. Wiley, 1990.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

8

Linear programming and network flows. 3rd ed. John Wiley, 2005.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

9

J, Jarvis John, and Sherali Hanif D. 1952-, eds. Linear programming and network flows. 2nd ed. Wiley, 1990.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

10

Bazaraa, Mokhtar S., John J. Jarvis, and Hanif D. Sherali. Linear Programming and Network Flows. John Wiley & Sons, Inc., 2009. http://dx.doi.org/10.1002/9780471703778.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Integer programming and network flows"

1

Walukiewicz, Stanisław. "Unimodularity and Network Flows. Cutting-Plane Methods." In Integer Programming. Springer Netherlands, 1991. http://dx.doi.org/10.1007/978-94-015-7945-2_3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Eiselt, H. A., and C. L. Sandblom. "Multicommodity Network Flows." In Integer Programming and Network Models. Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/978-3-662-04197-0_19.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Eiselt, H. A., and C. L. Sandblom. "Network Flow Algorithms." In Integer Programming and Network Models. Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/978-3-662-04197-0_18.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Eiselt, H. A., and C. L. Sandblom. "Applications of Network Flow Models." In Integer Programming and Network Models. Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/978-3-662-04197-0_17.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Ahuja, Ravindra K., Dorit S. Hochbaum, and James B. Orlin. "Solving the Convex Cost Integer Dual Network Flow Problem." In Integer Programming and Combinatorial Optimization. Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/3-540-48777-8_3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

de Lima, Vinícius L., Manuel Iori, and Flávio K. Miyazawa. "New Exact Techniques Applied to a Class of Network Flow Formulations." In Integer Programming and Combinatorial Optimization. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-73879-2_13.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Tseng, Paul, and Dimitri P. Bertsekas. "An ε-Relaxation method for generalized separable convex cost network flow problems." In Integer Programming and Combinatorial Optimization. Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-61310-2_7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Fekete, Sándor P., Samir Khuller, Monika Klemmstein, Balaji Raghavachari, and Neal Young. "A network-flow technique for finding low-weight bounded-degree spanning trees." In Integer Programming and Combinatorial Optimization. Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-61310-2_9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Wagler, Annegret K. "Combinatorial Optimization: The Interplay of Graph Theory, Linear and Integer Programming Illustrated on Network Flow." In Large-Scale Networks in Engineering and Life Sciences. Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-08437-4_4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Hassin, Refael, and Asaf Levin. "Synthesis of 2-Commodity Flow Networks." In Integer Programming and Combinatorial Optimization. Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-45535-3_18.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Integer programming and network flows"

1

Almohamad, Abdullateef, Mazen O. Hasna, Tamer Khattab, and Mohamed Haouari. "On Network Flow Maximization via Multihop Backhauling and UAVs: An Integer Programming Approach." In 2019 IEEE 89th Vehicular Technology Conference (VTC2019-Spring). IEEE, 2019. http://dx.doi.org/10.1109/vtcspring.2019.8746478.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Ferreira, R. S., C. L. T. Borges, and M. V. F. Pereira. "Distribution network reconfiguration under modeling of AC optimal power flow equations: A mixed-integer programming approach." In 2013 IEEE PES Conference on Innovative Smart Grid Technologies (ISGT Latin America). IEEE, 2013. http://dx.doi.org/10.1109/isgt-la.2013.6554487.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Ma, Hang, Glenn Wagner, Ariel Felner, Jiaoyang Li, T. K. Satish Kumar, and Sven Koenig. "Multi-Agent Path Finding with Deadlines." In Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/58.

Full text

Abstract:

We formalize Multi-Agent Path Finding with Deadlines (MAPF-DL). The objective is to maximize the number of agents that can reach their given goal vertices from their given start vertices within the deadline, without colliding with each other. We first show that MAPF-DL is NP-hard to solve optimally. We then present two classes of optimal algorithms, one based on a reduction of MAPF-DL to a flow problem and a subsequent compact integer linear programming formulation of the resulting reduced abstracted multi-commodity flow network and the other one based on novel combinatorial search algorithms.

APA, Harvard, Vancouver, ISO, and other styles

4

Koster, Arie M. C. A., Manuel Kutschka, and Christian Raack. "Towards robust network design using integer linear programming techniques." In 2010 6th EURO-NGI Conference on Next Generation Internet Networks (NGI). IEEE, 2010. http://dx.doi.org/10.1109/ngi.2010.5534462.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Ibaraki, Toshihide, Toshihide Nomura, and Masahiro Sasaki. "Integer Programming Approaches to the Problem of Network Upgrading." In 2008 International Symposium on Applications and the Internet. IEEE, 2008. http://dx.doi.org/10.1109/saint.2008.16.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Zia, Leila, Yixin Diao, Chris Ward, and Kamal Bhattacharya. "Using mixed integer programming to schedule it change requests." In NOMS 2008 - 2008 IEEE Network Operations and Management Symposium. IEEE, 2008. http://dx.doi.org/10.1109/noms.2008.4575241.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Tami, Y., K. Sebaa, M. Lahdeb, and H. Nouri. "Mixed-Integer Quadratic Constrained Programming versus Quadratic Programming Methods for Distribution Network Reconfiguration." In 2019 International Conference on Advanced Electrical Engineering (ICAEE). IEEE, 2019. http://dx.doi.org/10.1109/icaee47123.2019.9015181.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Xue-Ming Yuan and Soumen Saha. "A mixed integer programming model for production inventory network design." In 2008 6th IEEE International Conference on Industrial Informatics (INDIN). IEEE, 2008. http://dx.doi.org/10.1109/indin.2008.4618218.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Gersht, Alexander, and Robert Weihmayer. "A mixed integer/linear programming approach to communication network design." In 1986 25th IEEE Conference on Decision and Control. IEEE, 1986. http://dx.doi.org/10.1109/cdc.1986.267435.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Alfarhan, Faris, and Ahmed Alsohaily. "Self-organizing wireless network parameter optimization through mixed integer programming." In ICC 2017 - 2017 IEEE International Conference on Communications. IEEE, 2017. http://dx.doi.org/10.1109/icc.2017.7996475.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!