Relevant bibliographies by topics / Network Simplex

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Network Simplex'

Author: Grafiati
Published: 4 June 2021
Last updated: 3 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 'Network Simplex.'

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 "Network Simplex"

1

Mo, Jiangtao, Liqun Qi, and Zengxin Wei. "A network simplex algorithm for simple manufacturing network model." Journal of Industrial & Management Optimization 1, no. 2 (2005): 251–73. http://dx.doi.org/10.3934/jimo.2005.1.251.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Ahuja, Ravindra K., and James B. Orlin. "The Scaling Network Simplex Algorithm." Operations Research 40, no. 1-supplement-1 (February 1992): S5—S13. http://dx.doi.org/10.1287/opre.40.1.s5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Orlin, James B., Serge A. Plotkin, and Éva Tardos. "Polynomial dual network simplex algorithms." Mathematical Programming 60, no. 1-3 (June 1993): 255–76. http://dx.doi.org/10.1007/bf01580615.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Eppstein, David. "Clustering for faster network simplex pivots." Networks 35, no. 3 (May 2000): 173–80. http://dx.doi.org/10.1002/(sici)1097-0037(200005)35:3<173::aid-net1>3.0.co;2-w.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Anderson, E. J., and A. B. Philpott. "A continuous-time network simplex algorithm." Networks 19, no. 4 (July 1989): 395–425. http://dx.doi.org/10.1002/net.3230190403.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Peters, Jörg. "The network simplex method on a multiprocessor." Networks 20, no. 7 (December 1990): 845–59. http://dx.doi.org/10.1002/net.3230200704.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Aronson, Jay E., and B. David Chen. "A forward network simplex algorithm for solving multiperiod network flow problems." Naval Research Logistics Quarterly 33, no. 3 (August 1986): 445–67. http://dx.doi.org/10.1002/nav.3800330310.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Venkateshan, Prahalad, Kamlesh Mathur, and Ronald H. Ballou. "An efficient generalized network-simplex-based algorithm for manufacturing network flows." Journal of Combinatorial Optimization 15, no. 4 (June 8, 2007): 315–41. http://dx.doi.org/10.1007/s10878-007-9080-6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Sharkey, Thomas C., and H. Edwin Romeijn. "A simplex algorithm for minimum-cost network-flow problems in infinite networks." Networks 52, no. 1 (August 2008): 14–31. http://dx.doi.org/10.1002/net.20221.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Rashidi, Hassan. "A dynamic version for the Network Simplex Algorithm." Applied Soft Computing 24 (November 2014): 414–22. http://dx.doi.org/10.1016/j.asoc.2014.07.017.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Network Simplex"

1

CORDEIRO, JOAQUIM PEDRO DE V. "NETWORK SIMPLEX, ALGORITHM E IMPLEMENTATION." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2008. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=13219@1.

Full text
Abstract:
PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO
COORDENAÇÃO DE APERFEIÇOAMENTO DO PESSOAL DE ENSINO SUPERIOR
Este trabalho busca desenvolver o método Simplex para Redes na solução de problemas de Fluxo de Custo Mínimo. Este método consiste em uma adaptação do método Simplex primal em que são exploradas as características específicas da rede subjacente ao problema ao se buscar a solução ótima em um número finito de árvores geradoras. A árvore geradora ótima será obtida iterativamente através de sucessivas melhorias na estrutura de cada árvore formada. A maior eficiência do Simplex para Redes se dá tanto no menor número de iterações necessárias para se atingir o ótimo, quanto na maior velocidade destas iterações, trata-se, portanto, de um método bastante poderoso na resolução de problemas de Fluxo de Custo Mínimo. Serão, também, abordados aspectos práticos da implementação do algoritmo além da aplicação deste algoritmo implementado em VBA (Visual Basic for Applications) em um problema prático a título de exemplificação.
The current work intends to develop a Network Simplex Method for solving Minimum Cost Flow problems. Such method consists of a primal Simplex Method adaptation in which specific characteristics of the network underlying the problem are investigated by searching for the optimal solution within a finite number of spanning trees. The optimal spanning tree is iteratively obtained through successive structure improvements in each formed tree. The higher efficiency of Network Simplex lies both in fewer iterations necessary to achieve the optimum and in the higher speed of these iterations. Therefore, it is a powerful method for solving Minimum Cost Flow Problems. Practical aspects of implementing the algorithm will be discussed, as well as the algorithm´s implementation in VBA (Visual Basic for Applications) through a practical instance.
APA, Harvard, Vancouver, ISO, and other styles
2

Aggarwal, Charu C., Haim Kaplan, and Robert E. 1948 Tarjan. "A Faster Primal Network Simplex Algorithm." Massachusetts Institute of Technology, Operations Research Center, 1996. http://hdl.handle.net/1721.1/5266.

Full text
Abstract:
We present a faster implementation of the polynomial time primal simplex algorithm due to Orlin [23]. His algorithm requires O(nm min{log(nC), m log n}) pivots and O(n2 m ??n{log nC, m log n}) time. The bottleneck operations in his algorithm are performing the relabeling operations on nodes, selecting entering arcs for pivots, and performing the pivots. We show how to speed up these operations so as to yield an algorithm whose running time is O(nm. log n) per scaling phase. We show how to extend the dynamic-tree data-structure in order to implement these algorithms. The extension may possibly have other applications as well.
APA, Harvard, Vancouver, ISO, and other styles
3

Solveson, Keith D. "Design and implementation of a Primal Simplex Network Optimizer in C." Thesis, Monterey, California : Naval Postgraduate School, 1990. http://handle.dtic.mil/100.2/ADA241350.

Full text
Abstract:
Thesis (M.S. in Operations Research)--Naval Postgraduate School, September 1990.
Thesis Advisor(s): Bradley, Gordon H. Second Reader: Stemp, Roger. "September 1990." Description based on title screen as viewed on December 21, 2009. DTIC Descriptor(s): Computer Networks, Simplex Method, Computer Program Documentation, Optimization, Programming Languages, Theses, Time, FORTRAN, Tuning, Symbols, Parameters, Networks, Algorithms, Test And Evaluation, Data Bases. DTIC Identifier(s): Software Engineering. Author(s) subject terms: Network, C, Primal, Transportation, Transshipment, Simplex. Includes bibliographical references (p. 48-50). Also available in print.
APA, Harvard, Vancouver, ISO, and other styles
4

Collet, François. "Short scale study of 4-simplex assembly with curvature, in euclidean Loop Quantum Gravity." Thesis, Aix-Marseille, 2016. http://www.theses.fr/2016AIXM4076/document.

Full text
Abstract:
Une étude d'un assemblage symétrique de trois 4-simplex en géométrie classique, de Regge et quantique. Nous étudions les propriétés géométriques et surtout la présence de courbure. Nous montrons que les géométries classique et de Regge de l'assemblage ont une courbure qui évolue en fonction de ses paramètres de bordure. Pour la géométrie quantique, une version euclidienne du modèle EPRL est utilisé avec une valeur pratique du paramètre Barbero-Immirzi pour définir l'amplitude de transition de l'ensemble et de ses composants. Un code C ++ est conçu pour calculer les amplitudes et étudier numériquement la géométrie quantique. Nous montrons qu'une géométrie classique, avec une courbure, émerge déjà à bas spin. Nous reconnaissons également l'apparition de configurations dégénérées et de leurs effets sur la géométrie attendue
A study of symmetrical assembly of three euclidean 4-simplices in classical, Regge and quantum geometry. We study the geometric properties and especially the presence of curvature. We show that classical and Regge geometry of the assembly have curvature which evolves in function of its boundary parameters. For the quantum geometry, a euclidean version of EPRL model is used with a convenient value of the Barbero-Immirzi parameter to define the transition amplitude of the assembly and its components. A C++ code is design for compute the amplitudes and study numerically the quantum geometry. We show that a classical geometry, with curvature, emerges already at low spin. We also recognize the appearance of the degenerate configurations and their effects on the expected geometry
APA, Harvard, Vancouver, ISO, and other styles
5

Vanderlinde, Jeferson Back [UNESP]. "Planejamento da expansão de sistemas de transmissão usando técnicas especializadas de programação inteira mista." Universidade Estadual Paulista (UNESP), 2017. http://hdl.handle.net/11449/152089.

Full text
Abstract:
Submitted by JEFERSON BACK VANDERLINDE null (jefersonbv@yahoo.com.br) on 2017-11-01T16:38:25Z No. of bitstreams: 1 jeferson_tese_final_20171101.pdf: 4860852 bytes, checksum: 2f99c37969be3815f82b1b4455a40230 (MD5)
Approved for entry into archive by LUIZA DE MENEZES ROMANETTO (luizamenezes@reitoria.unesp.br) on 2017-11-13T15:38:34Z (GMT) No. of bitstreams: 1 vanderlinde_jb_dr_ilha.pdf: 4860852 bytes, checksum: 2f99c37969be3815f82b1b4455a40230 (MD5)
Made available in DSpace on 2017-11-13T15:38:34Z (GMT). No. of bitstreams: 1 vanderlinde_jb_dr_ilha.pdf: 4860852 bytes, checksum: 2f99c37969be3815f82b1b4455a40230 (MD5) Previous issue date: 2017-09-06
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Neste trabalho, consideram-se a análise teórica e a implementação computacional dos algoritmos Primal Simplex Canalizado (PSC) e Dual Simplex Canalizado (DSC) especializados. Esses algoritmos foram incorporados em um algoritmo Branch and Bound (B&B) de modo a resolver o problema de Planejamento da Expansão de Sistemas de Transmissão (PEST). Neste caso, o problema PEST foi modelado usando os chamados modelo de Transportes e modelo Linear Disjuntivo (LD), o que produz um problema de Programação Linear Inteiro Misto (PLIM). O algoritmo PSC é utilizado na resolução do problema de Programação Linear (PL) inicial após desconsiderar a restrição de integralidade do problema PLIM original. Juntamente com o algoritmo PSC, foi implementada uma estratégia para reduzir o número de variáveis artificiais adicionadas ao PL, consequentemente reduzindo o número de iterações do algoritmo PSC. O algoritmo DSC é utilizado na reotimização eficiente dos subproblemas gerados pelo algoritmo B&B, através do quadro ótimo do PL inicial, excluindo, assim, a necessidade da resolução completa de cada subproblema e, consequentemente, reduzindo o consumo de processamento e memória. Nesta pesquisa, é apresentada uma nova proposta de otimização, e, consequentemente, a implementação computacional usando a linguagem de programação FORTRAN que opera independentemente de qualquer solver.
In this research, the theoretical analysis and computational implementation of the specialized dual simplex algorithm (DSA) and primal simplex algorithm (PSA) for bounded variables is considered. These algorithms have been incorporated in a Branch and Bound (B&B) algorithm to solve the Transmission Network Expansion Planning (TNEP) problem. In this case, the TNEP problem is modeled using transportation model and linear disjunctive model (DM), which produces a mixed-integer linear programming (MILP) problem. After relaxing the integrality of investment variables of the original MILP problem, the PSA is used to solve the initial linear programming (LP) problem. Also, it has been implemented a strategy in PSA to reduce the number of artificial variables which are added into the LP problem, and consequently reduces the number of iterations of PSA. Through optimal solution of the initial LP, the DSA is used in efficient reoptimization of subproblems, resulting from the B&B algorithm, thus excludes the need for complete resolution of each subproblems, which results reducing the CPU time and memory consumption. This research presents the implementation of the proposed approach using the FORTRAN programming language which operates independently and does not use any commercial solver.
APA, Harvard, Vancouver, ISO, and other styles
6

Vanderlinde, Jeferson Back. "Planejamento da expansão de sistemas de transmissão usando técnicas especializadas de programação inteira mista /." Ilha Solteira, 2017. http://hdl.handle.net/11449/152089.

Full text
Abstract:
Orientador: Rubén Augusto Romero Lázaro
Resumo: Neste trabalho, consideram-se a análise teórica e a implementação computacional dos algoritmos Primal Simplex Canalizado (PSC) e Dual Simplex Canalizado (DSC) especializados. Esses algoritmos foram incorporados em um algoritmo Branch and Bound (B&B) de modo a resolver o problema de Planejamento da Expansão de Sistemas de Transmissão (PEST). Neste caso, o problema PEST foi modelado usando os chamados modelo de Transportes e modelo Linear Disjuntivo (LD), o que produz um problema de Programação Linear Inteiro Misto (PLIM). O algoritmo PSC é utilizado na resolução do problema de Programação Linear (PL) inicial após desconsiderar a restrição de integralidade do problema PLIM original. Juntamente com o algoritmo PSC, foi implementada uma estratégia para reduzir o número de variáveis artificiais adicionadas ao PL, consequentemente reduzindo o número de iterações do algoritmo PSC. O algoritmo DSC é utilizado na reotimização eficiente dos subproblemas gerados pelo algoritmo B&B, através do quadro ótimo do PL inicial, excluindo, assim, a necessidade da resolução completa de cada subproblema e, consequentemente, reduzindo o consumo de processamento e memória. Nesta pesquisa, é apresentada uma nova proposta de otimização, e, consequentemente, a implementação computacional usando a linguagem de programação FORTRAN que opera independentemente de qualquer solver.
Doutor
APA, Harvard, Vancouver, ISO, and other styles
7

Sundaresan, Latha. "Simple network management protocol /." Online version of thesis, 1995. http://hdl.handle.net/1850/12254.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Chonbodeechalermroong, Yongyut School of Electrical Engineering UNSW. "Simple star multihop optical network." Awarded by:University of New South Wales. School of Electrical Engineering, 2001. http://handle.unsw.edu.au/1959.4/20328.

Full text
Abstract:
A new multihop wavelength-division multiplexed (WDM) optical network designed for uniform traffic with two wavelengths per node that can give the maximum throughput and minimum delay is proposed. It is called a 'Simple Star' multihop optical network. This network has good characteristics in traffic balance and small average number of hops. Moreover, Simple Star can be used together with multiple star couplers to reduce the number of wavelength used. Furthermore, unlike most existing networks, this network does not impose an upper limit to the number of nodes. Another interesting pattern is Simple Star with Center Node (Simple Star CN) particularly for prime numbers of nodes. It can be shown that the average number of hops of Simple Star (normal plus CN) is in between those of Shufflenet and Kautz, but the throughput and delay are better. An associated network called Simple Star Shared Channel (Simple Star SC) for two transceivers per node is also presented and it can be used together with multiple star couplers to reduce the number of wavelengths. An example of a 16-node Simple Star SC shows that the number of wavelengths used can be 8 times less than that in the normal Simple Star network. The Shared Channel simulation model is based on the concept of CSMA/CD (Carrier Sense Multiple Access with Collision Detection).
APA, Harvard, Vancouver, ISO, and other styles
9

Folke, Fredrik. "Security for home, small & medium sized enterprises IPv6 networks : Security using simple network equipment." Thesis, KTH, Kommunikationssystem, CoS, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-98295.

Full text
Abstract:
This theses project investigates and presents different threats that a network can be exposed to and the common protection techniques that can be applied, with a focus on the network perimeter – specifically the router/firewall between the local area network and the Internet. All Internet connected devices and networks are exposed to and affected by security threats to some degree, hence security is important in almost every type of network. With the constant growth of the Internet the 32-bit addressing scheme ipv4 is proving to be inadequate, and therefore the transition to the 128-bit addressing scheme ipv6 is becoming critical. With ipv6 comes new security threats (while still old threats remain) that requires an understanding of perimeter security. In this thesis we secure a home router and describe these steps to enable home and small business owners to secure their IPv6 network at a relatively low cost.
Detta projekt kommer att undersöka och presentera olika hot som ett IPv6 nätverk kan utsättas för samt de vanligaste skydds mekanismer som används idag, med fokus på nätverkets skallskydd mellan det interna lokala nätet och det yttre publika Internet. I stort sätt all Internet ansluten utrustning och nätverk är exponerad och påverkad i någon grad av säkerhets brister, säkerhet är en viktig del i stort sätt alla nätverk oavsett syfte eller verksamhet. Genom ett ständigt växande Internet börjar de 32-bitar adresser tillhörande IPv4 nätet ta slut, vilket gör behovet av att immigrera till 128-bitar adresser på IPv6 nätet allt mer kritiskt. Med IPv6 kommer nya säkerhetshot, samt att även vissa äldre hot kvarstår, som kräver en förståelse av perimeter skydd. I denna rapport säkrar vi en hemma router och beskriver för varje steg tillvägagångssättet för att hem och små företagare ska få möjlighet att skydda sina IPv6 nätverk till en relativt låg kostnad.
APA, Harvard, Vancouver, ISO, and other styles
10

Holmgren, Johan. "Efficient Updating Shortest Path Calculations for Traffic Assignment." Thesis, Linköping University, Department of Mathematics, 2004. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-2573.

Full text
Abstract:

Traffic planning in a modern congested society is an important and time consuming procedure. Finding fast algorithms for solving traffic problems is therefore of great interest for traffic planners allover the world.

This thesis concerns solving the fixed demand traffic assignment problem (TAP) on a number of different transportation test networks. TAP is solved using the Frank-Wolfe algorithm and the shortest path problems that arise as subproblems to the Frank-Wolfe algorithm are solved using the network simplex algorithm. We evaluate how a number of existing pricing strategies to the network simplex algorithm performs with TAP. We also construct a new efficient pricing strategy, the Bucket Pricing Strategy, inspired by the heap implementation of Dijkstra's method for shortest path problems. This pricing strategy is, together with the actual use of the network simplex algorithm, the main result of the thesis and the pricing strategy is designed to take advantage of the special structure of TAP. In addition to performing tests on the conventional Frank-Wolfe algorithm, we also test how the different pricing strategies perform on Frank-Wolfe algorithms using conjugate and bi-conjugate search directions.

These test results show that the updating shortest path calculations obtained by using the network simplex outperforms the non-updating Frank-Wolfe algorithms. Comparisons with Bar-Gera's OBA show that our implementation, especially together with the bucket pricing strategy, also outperforms this algorithm for relative gaps down to 10E-6.

APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Network Simplex"

1

Orlin, James B. Polynomial dual network simplex algorithms. Cambridge, Mass: Alfred P. Sloan School of Management, Massachusetts Institute of Technology, 1991.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Orlin, James B. Polynomial dual network simplex algorithms. Stanford, Calif: Dept. of Computer Science, Stanford University, 1991.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Parker, Philip M., and James N. Parker. Cold sores: A medical dictionary, bibliography and annotated research guide to Internet references. San Diego, CA: ICON Health Publications, 2003.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Sinclair, Andrew C. Simple network manager. Manchester: University of Manchester, Department of Computer Science, 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Harnedy, Sean J. Total SNMP: Exploring the Simple Network Management Protocol. Horsham, PA: CBM Books, 1994.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Harnedy, Sean J. Total SNMP: Exploring the Simple Network Management Protocol. 2nd ed. Upper Saddle River, NJ: Prentice Hall PTR, 1998.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Parker, Philip M., and James N. Parker. Valtrex: A medical dictionary, bibliography, and annotated research guide to Internet references. San Diego, CA: ICON Health, 2004.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

SNMP at the edge: Building effective service management systems. New York: McGraw-Hill, 2002.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

SNMP: A guide to network management. New York: McGraw-Hill, 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Keith, McCloghrie, ed. How to manage your network using SNMP: The networking management practicum. Englewood Cliffs, N.J: PTR Prentice Hall, 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Network Simplex"

1

Gass, Saul I., and Carl M. Harris. "Network simplex algorithm." In Encyclopedia of Operations Research and Management Science, 565. New York, NY: Springer US, 2001. http://dx.doi.org/10.1007/1-4020-0611-x_666.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Jungnickel, Dieter. "The Network Simplex Algorithm." In Graphs, Networks and Algorithms, 359–78. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-32278-5_11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Hamacher, Horst W., and Kathrin Klamroth. "The Simplex Method." In Lineare und Netzwerk-Optimierung / Linear and Network-Optimization, 11–57. Wiesbaden: Vieweg+Teubner Verlag, 2000. http://dx.doi.org/10.1007/978-3-322-91579-5_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Beckenbach, Isabel. "A Hypergraph Network Simplex Algorithm." In Operations Research Proceedings, 309–15. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-89920-6_42.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Grigoriadis, M. D. "An efficient implementation of the network simplex method." In Mathematical Programming Studies, 83–111. Berlin, Heidelberg: Springer Berlin Heidelberg, 1986. http://dx.doi.org/10.1007/bfb0121089.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Florian, Michael, and Denis Lebeuf. "An Efficient Implementation of the Network Simplex Method." In Lecture Notes in Economics and Mathematical Systems, 265–91. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/978-3-642-59179-2_14.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Marvila, M. T., A. R. G. Azevedo, J. Alexandre, E. B. Zanelato, S. N. Monteiro, and N. A. Cerqueira. "Proposal of Dosing of Mortars Using Simplex Network." In The Minerals, Metals & Materials Series, 747–56. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-05749-7_75.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Borndörfer, Ralf, Heide Hoppmann, Marika Karbstein, and Fabian Löbel. "The Modulo Network Simplex with Integrated Passenger Routing." In Operations Research Proceedings 2016, 637–44. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-55702-1_84.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Hamacher, Horst W., and Kathrin Klamroth. "Duality and Further Variations of the Simplex Method." In Lineare und Netzwerk-Optimierung / Linear and Network-Optimization, 59–78. Wiesbaden: Vieweg+Teubner Verlag, 2000. http://dx.doi.org/10.1007/978-3-322-91579-5_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Doi, Akio, and Tomohiro Chiba. "An Automatic Image Registration Method Using Downhill Simplex Method and Its Applications." In Advances in Network-Based Information Systems, 635–43. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-65521-5_55.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Network Simplex"

1

Tang, Hai, and Zhihui Hu. "Network Simplex Algorithm for DAG Layering." In 2013 Fifth International Conference on Computational and Information Sciences (ICCIS). IEEE, 2013. http://dx.doi.org/10.1109/iccis.2013.401.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Baloukas, Thanasis, and Konstantinos Paparrizos. "A visualization software for the network simplex algorithm." In the 2006 ACM symposium. New York, New York, USA: ACM Press, 2006. http://dx.doi.org/10.1145/1148493.1148520.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Zhong, Zhicheng, Minghan Feng, and Duo Liu. "Parallelization of Revised Simplex Algorithm on GPUs." In 2015 International Conference on Network and Information Systems for Computers (ICNISC). IEEE, 2015. http://dx.doi.org/10.1109/icnisc.2015.108.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Bai, Yu, ZhiMing Xu, ZhiBin Nie, and ShuNing Wang. "Objective Variation Network Simplex Algorithm for Concave Continuous Piecewise Linear Network Flow Problems." In ICCAE 2018: 2018 10th International Conference on Computer and Automation Engineering. New York, NY, USA: ACM, 2018. http://dx.doi.org/10.1145/3192975.3192978.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Zhang, Xiaowei, and Sanyang Liu. "A hybrid strategy combining differential evolution with simplex gradient." In 2012 2nd International Conference on Computer Science and Network Technology (ICCSNT). IEEE, 2012. http://dx.doi.org/10.1109/iccsnt.2012.6526241.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Jun-Hyeok Son and Bo-Hyeok Scriber. "Problem solution of linear programming using dual simplex method neural network." In Proceedings of the Eighth International Conference on Electrical Machines and Systems. IEEE, 2005. http://dx.doi.org/10.1109/icems.2005.202921.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Ursani, Ziauddin, Ahsan A. Ursani, and David W. Corne. "Introducing Simplex Mass Balancing Method for Multi-Commodity Flow Network with a Separator." In Fourth International Conference on Advanced Information Technologies and Applications. Academy & Industry Research Collaboration Center (AIRCC), 2015. http://dx.doi.org/10.5121/csit.2015.51505.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Huang, Chunhui. "The Optimization of Empty Shipping Container Reposition Based on the Network Simplex Method." In 2011 International Conference on Management and Service Science (MASS 2011). IEEE, 2011. http://dx.doi.org/10.1109/icmss.2011.5998249.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Cong Hao, Song Chen, and T. Yoshimura. "Network simplex method based Multiple Voltage Scheduling in Power-efficient High-level synthesis." In 2013 18th Asia and South Pacific Design Automation Conference (ASP-DAC 2013). IEEE, 2013. http://dx.doi.org/10.1109/aspdac.2013.6509602.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Nie, Zhibin, and Shuning Wang. "A sequential simplex algorithm for the continuous convex piecewise linear network flow problem*." In 2019 IEEE 15th International Conference on Control and Automation (ICCA). IEEE, 2019. http://dx.doi.org/10.1109/icca.2019.8899971.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Network Simplex"

1

Orlin, James B., Serge A. Plotkin, and Eva Tardos. Polynomial Dual Network Simplex Algorithms. Fort Belvoir, VA: Defense Technical Information Center, August 1991. http://dx.doi.org/10.21236/ada254340.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Goldberg, Andrew V., Michael D. Grigoriadis, and Robert E. Tarjan. Efficiency of the Network Simplex Algorithm for the Maximum Flow Problem. Fort Belvoir, VA: Defense Technical Information Center, October 1988. http://dx.doi.org/10.21236/ada214691.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Tarjan, Robert E. Efficiency of the Primal Network Simplex Algorithm for the Minimum-Cost Circulation Problem. Fort Belvoir, VA: Defense Technical Information Center, August 1988. http://dx.doi.org/10.21236/ada215109.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Schoenwaelder, J., and T. Jeffree. Simple Network Management Protocol (SNMP) over IEEE 802 Networks. RFC Editor, November 2006. http://dx.doi.org/10.17487/rfc4789.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

MacFaden, M., D. Partain, J. Saperia, and W. Tackabury. Configuring Networks and Devices with Simple Network Management Protocol (SNMP). RFC Editor, April 2003. http://dx.doi.org/10.17487/rfc3512.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Case, J. D., M. Fedor, M. L. Schoffstall, and J. Davin. Simple Network Management Protocol. RFC Editor, August 1988. http://dx.doi.org/10.17487/rfc1067.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Mills, D. Simple Network Time Protocol (SNTP). RFC Editor, March 1995. http://dx.doi.org/10.17487/rfc1769.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Mills, D. Simple Network Time Protocol (SNTP). RFC Editor, August 1992. http://dx.doi.org/10.17487/rfc1361.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Case, J. D., M. Fedor, M. L. Schoffstall, and J. Davin. Simple Network Management Protocol (SNMP). RFC Editor, April 1989. http://dx.doi.org/10.17487/rfc1098.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Case, J. D., M. Fedor, M. L. Schoffstall, and J. Davin. Simple Network Management Protocol (SNMP). RFC Editor, May 1990. http://dx.doi.org/10.17487/rfc1157.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Network Simplex' for particular source types:
Journal articles Dissertations / Theses Books
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!

To the bibliography