The following pages link to (Q5514188):
Displaying 50 items.
- Dynamic graph models and their properties (Q276764) (← links)
- A simple linear algorithm for the edge-disjoint \((s, t)\)-paths problem in undirected planar graphs (Q287243) (← links)
- Maximum weight independent sets and cliques in intersection graphs of filaments (Q294733) (← links)
- Strongly polynomial primal monotonic build-up simplex algorithm for maximal flow problems (Q317432) (← links)
- A continuous time-cost tradeoff problem with multiple milestones and completely ordered jobs (Q319449) (← links)
- Decomposition's Dantzig-Wolfe applied to fuzzy multicommodity flow problems (Q339711) (← links)
- New reformulations of distributionally robust shortest path problem (Q342487) (← links)
- Cycle-based reducibility of multi-index transport-type systems of linear inequalities (Q357096) (← links)
- Scheduling arc maintenance jobs in a network to maximize total flow over time (Q406493) (← links)
- A generalization of Hungarian method and Hall's theorem with applications in wireless sensor networks (Q412342) (← links)
- Aggregation of monotone reciprocal relations with application to group decision making (Q429412) (← links)
- Multi-objective optimization for stochastic computer networks using NSGA-II and TOPSIS (Q439580) (← links)
- Bounded fractionality of the multiflow feasibility problem for demand graph \(K_3 + K_3\) and related maximization problems (Q444377) (← links)
- Design of fault-tolerant on-board networks with variable switch sizes (Q476844) (← links)
- Finding a subdivision of a digraph (Q476873) (← links)
- Maximum probability shortest path problem (Q491594) (← links)
- Survey of polynomial transformations between NP-complete problems (Q555184) (← links)
- Multistate components assignment problem with optimal network reliability subject to assignment budget (Q555430) (← links)
- On the expected value of stochastic linear programs and (dynamic) network flow problems (Q579134) (← links)
- Two easy duality theorems for product partial orders (Q580378) (← links)
- On certain convex matrix sets (Q581622) (← links)
- Traffic assignment in communication satellites (Q594769) (← links)
- Integer matrices with constraints on leading partial row and column sums (Q602764) (← links)
- On a class of mixed-integer sets with a single integer variable (Q614040) (← links)
- Shortest path and maximum flow problems in networks with additive losses and gains (Q620954) (← links)
- Novel matrix forms of rough set flow graphs with applications to data integration (Q630674) (← links)
- Using minimal cuts to optimize network reliability for a stochastic computer network subject to assignment budget (Q632651) (← links)
- Minimal-cost network flow problems with variable lower bounds on arc flows (Q632657) (← links)
- Finding the shortest paths by node combination (Q632873) (← links)
- An introduction to dynamic generative networks: minimum cost flow (Q651703) (← links)
- Speeding up the Floyd-Warshall algorithm for the cycled shortest path problem (Q656681) (← links)
- Sensor location and classification for disturbance rejection by measurement feedback (Q665180) (← links)
- The smallest networks on which the Ford-Fulkerson maximum flow procedure may fail to terminate (Q672389) (← links)
- A genuinely polynomial primal simplex algorithm for the assignment problem (Q686416) (← links)
- Submodular functions in graph theory (Q686469) (← links)
- On simple combinatorial optimization problems. A collection of contributions in honour of Jack van Lint (Q687374) (← links)
- Two strongly polynomial cut cancelling algorithms for minimum cost network flow (Q689972) (← links)
- Reliability evaluation of multi-state systems under cost consideration (Q693557) (← links)
- A warm-start dual simplex solution algorithm for the minimum flow networks with postoptimality analyses (Q699349) (← links)
- Spectral methods for graph clustering - a survey (Q713095) (← links)
- Multicommodity flows in certain planar directed networks (Q753654) (← links)
- Railway scheduling by network optimization (Q753674) (← links)
- On module assignment in two-processor distributed systems (Q754638) (← links)
- The mixed postman problem (Q754753) (← links)
- Metrics on spaces of finite trees (Q758937) (← links)
- An introduction to timetabling (Q759645) (← links)
- A polynomial algorithm for minimum quadratic cost flow problems (Q761341) (← links)
- Models of central capacity and concurrency (Q762011) (← links)
- Transmission facility planning in telecommunications networks: A heuristic approach (Q788618) (← links)
- A network flow procedure for project crashing with penalty nodes (Q790038) (← links)
