A linear input dependence model for interdependent networks

Συγγραφείς: Hemanshu Kaul, Adam Rumpf

Πηγή: European Journal of Operational Research. 302:781-797

Θεματικοί όροι: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), 05 social sciences, 0211 other engineering and technologies, 90C05 (Primary), 90-08 (Secondary), interdependent networks, 02 engineering and technology, Programming involving graphs or networks, randomized rounding, Optimization and Control (math.OC), networks, input dependence, 0502 economics and business, Deterministic network models in operations research, FOS: Mathematics, network simplex algorithm, Mathematics - Optimization and Control, Computer Science - Discrete Mathematics

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: http://arxiv.org/pdf/2102.05248
http://arxiv.org/abs/2102.05248
https://arxiv.org/abs/2102.05248

Simulation and Evaluation of Network Simplex Algorithm and its Extensions for Vehicle Scheduling Problems in Ports

Συγγραφείς: Hassan Rashidi

Πηγή: International Journal of Maritime Technology, Vol 11, Iss Winter and Spring 2019, Pp 1-12 (2019)

Θεματικοί όροι: container terminals, Naval architecture. Shipbuilding. Marine engineering, 0211 other engineering and technologies, optimization methods, VM1-989, 02 engineering and technology, network simplex algorithm, dynamic scheduling, dynamic network simplex algorithm

Σύνδεσμος πρόσβασης: http://ijmt.ir/files/site1/user_files_13d531/hrashi-A-10-961-1-ab230df.pdf
https://doaj.org/article/7ded448353c945b0a6e502816b49b01f

Ship type decision considering empty container repositioning and foldable containers

Συγγραφείς: Wang, K, Wang, S, Zhen, L, Qu, X

Συνεισφορές: Department of Logistics and Maritime Studies

Θεματικοί όροι: Empty container repositioning, Foldable containers, Network simplex algorithm, Ship fleet deployment

Relation: http://hdl.handle.net/10397/98329; 97; 121; 108; 6820724

Διαθεσιμότητα: http://hdl.handle.net/10397/98329
https://doi.org/10.1016/j.tre.2017.10.003

Multi-granularity hybrid parallel network simplex algorithm for minimum-cost flow problems

Συγγραφείς: Jiang, Jincheng^Aff1, Chen, Jinsong^Aff1, Wang, Chisheng^{Aff2, IDs11227020032279_cor3}

Πηγή: The Journal of Supercomputing: An International Journal of High-Performance Computer Design, Analysis, and Use. 76(12):9800-9826

Optimizing the Static and Dynamic Scheduling problem of Automated Guided Vehicles in Container Terminals

Συγγραφείς: Hassan Rashidi

Πηγή: Control and Optimization in Applied Mathematics, Vol 2, Iss 2, Pp 77-101 (2017)

Θεματικοί όροι: network simplex algorithm, dynamic network simplex algorithm, optimization methods, dynamic scheduling, container terminals, Mathematics, QA1-939

Περιγραφή αρχείου: electronic resource

Relation: https://mathco.journals.pnu.ac.ir/article_5730_fbbd6925e9091cab1b93c28d72353257.pdf; https://doaj.org/toc/2383-3130; https://doaj.org/toc/2538-5615

Σύνδεσμος πρόσβασης: https://doaj.org/article/fe3e7a6b0a064f3383a1cf58a1b76f7a

Programs with Network Structure

Συγγραφείς: Friesz, Terry L.^Aff4, Bernstein, David^Aff5

Συνεισφορές: Friesz, Terry L., Series editor^{Aff1, Aff2}, Bernstein, David^Aff3

Πηγή: Foundations of Network Optimization and Games. 3:121-167

Minimum cost flow problem Minimum Cost Flow Problem

Συγγραφείς: Ahuja, Ravindra K.^Aff1_373, Magnanti, Thomas L.^Aff2_373, Orlin, James B.^Aff3_373

Συνεισφορές: Floudas, Christodoulos A., editor^Aff1, Pardalos, Panos M., editor^Aff2

Πηγή: Encyclopedia of Optimization. :2095-2108

Algorithms for the Simple Equal Flow Problem

Συγγραφείς: Ahuja, Ravindra K., Orlin, James B., Sechi, Giovanni M., Zuddas, Paola

Πηγή: Management Science, 1999 Oct 01. 45(10), 1440-1455.

Σύνδεσμος πρόσβασης: https://www.jstor.org/stable/2634849

Reformulation of the linear program for completely ergodic MDPs with average cost criteria

Συγγραφείς: Vahid Hashemi

Πηγή: Optimization Letters

Θεματικοί όροι: 0301 basic medicine, pre-Leontief, Markov and semi-Markov decision processes, flow networks, 0211 other engineering and technologies, strong polynomial time, undiscounted, 02 engineering and technology, 16. Peace & justice, 7. Clean energy, Markov decision processes, 03 medical and health sciences, Linear programming, network simplex algorithm

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://hdl.handle.net/11858/00-001M-0000-002E-0178-D

Clustering for faster network simplex pivots

Συγγραφείς: Eppstein, David

Πηγή: Networks. 35:173-180

Θεματικοί όροι: Extremal problems in graph theory, dual network simplex algorithm, primal network simplex algorithm, Programming involving graphs or networks, minimum-cost flow, optimal pivot selection

Περιγραφή αρχείου: application/xml; application/pdf

Σύνδεσμος πρόσβασης: https://escholarship.org/content/qt4x82k6zw/qt4x82k6zw.pdf?t=qeyo9f
https://zbmath.org/1471729
https://doi.org/10.1002/(sici)1097-0037(200005)35:3<173::aid-net1>3.0.co;2-w
http://dl.acm.org/citation.cfm?id=314464.314490
https://escholarship.org/uc/item/4x82k6zw

A complete and an incomplete algorithm for automated guided vehicle scheduling in container terminals

Συγγραφείς: Hassan Rashidi, Edward P. K. Tsang

Πηγή: Computers & Mathematics with Applications. 61:630-641

Θεματικοί όροι: Scheduling problems, Optimization, Search methods, Container terminals, Deterministic scheduling theory in operations research, QA75 Electronic computers. Computer science, 0211 other engineering and technologies, 02 engineering and technology, Computational Mathematics, Computational Theory and Mathematics, Network Simplex Algorithm, scheduling problems, Modelling and Simulation, container terminals, \texttt{DSGAV}, Case-oriented studies in operations research, search methods, network simplex algorithm, optimization

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://zbmath.org/5929989
https://doi.org/10.1016/j.camwa.2010.12.009

The Network Simplex Algorithm

Συγγραφείς: Jungnickel, Dieter^Aff1

Συνεισφορές: Jungnickel, Dieter^AffID1

Πηγή: Graphs, Networks and Algorithms. 5:359-378

Finding non-dominated solutions in bi-objective integer network flow problems

Συγγραφείς: Augusto Eusébio, José Rui Figueira

Συνεισφορές: Repositório IC-Online

Πηγή: Computers & Operations Research. 36:2554-2564

Θεματικοί όροι: Efficient solutions, 0209 industrial biotechnology, Network simplex algorithm, bi-objective integer network flows, 0211 other engineering and technologies, 02 engineering and technology, efficient solutions, Non-dominated solutions, non-dominated solutions, Deterministic network models in operations research, network simplex algorithm, Bi-objective integer network flows, Recherche opérationnelle, Multi-objective and goal programming

Περιγραφή αρχείου: application/xml; application/pdf

Σύνδεσμος πρόσβασης: http://hdl.handle.net/http://hdl.handle.net/10400.8/12774

A dynamic version for the Network Simplex Algorithm

Συγγραφείς: Rashidi, Hassan ^⁎

Πηγή: In Applied Soft Computing Journal November 2014 24:414-422

Uncertain minimum cost flow problem

Συγγραφείς: Sibo Ding

Πηγή: Soft Computing. 18:2201-2207

Θεματικοί όροι: Transportation, logistics and supply chain management, uncertain programming, 0211 other engineering and technologies, 0202 electrical engineering, electronic engineering, information engineering, minimum cost flow problem, 02 engineering and technology, network simplex algorithm, 6. Clean water, uncertainty theory

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://zbmath.org/6514854
https://doi.org/10.1007/s00500-013-1194-4

ネットワークシンプレックス法における巡回を防ぐ方法

Συγγραφείς: Yoneda, Sayaka, Watanabe, Sennosuke, Watanabe, Yoshihide

Πηγή: 同志社大学理工学研究報告. 54(1):95-100

Θεματικοί όροι: 木構造, cycling, ネットワークシンプレックス法, 巡回, minimum cost flow problem, network simplex algorithm, tree structure, 最小費用流問題

Minimum cost flow problem Minimum Cost Flow Problem

Συγγραφείς: Ahuja, Ravindra K.^{Aff1_0-306-48332-7_283}, Magnanti, Thomas L.^{Aff2_0-306-48332-7_283}, Orlin, James B.^{Aff3_0-306-48332-7_283}

Συνεισφορές: Floudas, Christodoulos A., editor^{Aff1_0-306-48332-7}, Pardalos, Panos M., editor^{Aff2_0-306-48332-7}

Πηγή: Encyclopedia of Optimization. :1382-1392

最短路問題を用いたネットワークシンプレックス法のMATLABへの実装: 最短経路問題を用いたネットワークシンプレックス法のMATLABへの実装

Συγγραφείς: Aoyama, Naomichi, Watanabe, Yoshihide, Itoh, Toshiaki

Πηγή: 同志社大学理工学研究報告. 52(2):99-106

Θεματικοί όροι: ネットワーク・シンプレックス法, 最少費用流問題, network, 最短経路問題, network simplex algorithm, ネットワーク, 有向グラフ, digraph, shortest path problem, minimum cost flow

A network simplex based algorithm for the minimum cost proportional flow problem with disconnected subnetworks

Συγγραφείς: Ufuk Bahçeci, Orhan Feyzioglu

Πηγή: Optimization Letters. 6:1173-1184

Θεματικοί όροι: disconnected subnetworks, minimum cost network flow, 0209 industrial biotechnology, proportional flow, 0211 other engineering and technologies, 02 engineering and technology, Programming involving graphs or networks, network simplex algorithm

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://zbmath.org/6102950
https://doi.org/10.1007/s11590-011-0356-5
https://avesis.gsu.edu.tr/publication/details/97a301f5-f80a-454e-80a3-7794545ce5d1/oai

Algorithms for the Simple Equal Flow Problem

Συγγραφείς: SECHI, GIOVANNI MARIA, AHUJA R. K, ORLIN J. B, ZUDDAS, PAOLA

Πηγή: Management Science. 45:1440-1455

Θεματικοί όροι: minimum cost flow problem, network simplex algorithm, scaling algorithm, parametric programming, network flows

Σύνδεσμος πρόσβασης: https://dspace.mit.edu/bitstream/1721.1/2660/1/SWP-3960-37617969.pdf
https://hdl.handle.net/11584/95567
https://hdl.handle.net/11584/14362