The following pages link to (Q3292914):
Displaying 50 items.
- Half-trek criterion for generic identifiability of linear structural equation models (Q116505) (← links)
- On reformulations for the one-warehouse multi-retailer problem (Q271926) (← links)
- Maximum likelihood analysis of the Ford-Fulkerson method on special graphs (Q289909) (← links)
- Approximation algorithms for solving the constrained arc routing problem in mixed graphs (Q297063) (← links)
- Complexity results for the linear time-cost tradeoff problem with multiple milestones and completely ordered jobs (Q299837) (← links)
- Two-phase branch-and-cut for the mixed capacitated general routing problem (Q319006) (← links)
- Reliability-based economic model predictive control for generalised flow-based networks including actuators' health-aware capabilities (Q328906) (← links)
- A simple algorithm to evaluate supply-chain reliability for brittle commodity logistics under production and delivery constraints (Q331828) (← links)
- Double resource optimization for a robust computer network subject to a transmission budget (Q331840) (← links)
- Reliability evaluation according to a routing scheme for multi-state computer networks under assured accuracy rate (Q331848) (← links)
- The value of information in stochastic maximum flow problems (Q336360) (← links)
- Branch and bound for the cutwidth minimization problem (Q339558) (← links)
- Solution approaches for the cutting stock problem with setup cost (Q339571) (← links)
- Mining preserving structures in a graph sequence (Q344786) (← links)
- A model-based approach and analysis for multi-period networks (Q353173) (← links)
- Flow location (FlowLoc) problems: dynamic network flows and location models for evacuation planning (Q367642) (← links)
- Multicriterial multi-index resource scheduling problems (Q367976) (← links)
- Braess's paradox for flows over time (Q372993) (← links)
- \textsc{FlipCut} supertrees: towards matrix representation accuracy in polynomial time (Q378228) (← links)
- A product form solution to a system with multi-type jobs and multi-type servers (Q383231) (← links)
- Asymmetric resource networks. III: A study of limit states (Q384694) (← links)
- Extensions to 2-factors in bipartite graphs (Q396808) (← links)
- Weighted maximum-clique transversal sets of graphs (Q410660) (← links)
- On flows in simple bidirected and skew-symmetric networks (Q415697) (← links)
- Domain decomposition methods with graph cuts algorithms for total variation minimization (Q421368) (← links)
- On solving continuous-time dynamic network flows (Q453631) (← links)
- Control of limit states in absorbing resource networks (Q463333) (← links)
- Weighted graphs with fixed vertex degrees and network flows (Q465307) (← links)
- On the complexity of time-dependent shortest paths (Q476455) (← links)
- Stochastic computer network under accuracy rate constraint from QoS viewpoint (Q497123) (← links)
- Processing time-dependent shortest path queries without pre-computed speed information on road networks (Q497898) (← links)
- About the minimum mean cycle-canceling algorithm (Q499347) (← links)
- Constrained \((0,1)\)-matrix completion with a staircase of fixed zeros (Q501232) (← links)
- The problem of maximum flow with minimum attainable cost in a network (Q505156) (← links)
- Backup reliability assessment within tolerable packet error rate for a multi-state unreliable vertex computer network (Q506140) (← links)
- Linguistic performance evaluation for an ERP system with link failures (Q506309) (← links)
- Design of an efficient load balancing algorithm using the symmetric balanced incomplete block design (Q506713) (← links)
- Lattice flows in networks (Q522926) (← links)
- What the transportation problem did for me (Q537598) (← links)
- Minimizing the density of terminal assignments in layout design (Q581242) (← links)
- A min-max relation for stable sets in graphs with no odd-\(K_ 4\) (Q582302) (← links)
- A measure-theoretical max-flow-min-cut problem (Q583082) (← links)
- On the planar integer two-flow problem (Q585080) (← links)
- Bidirectional resource networks: A new flow model (Q600769) (← links)
- Optimal placement of UV-based communications relay nodes (Q604957) (← links)
- Approximation algorithms for multiprocessor scheduling under uncertainty (Q613111) (← links)
- The inverse maximum dynamic flow problem (Q625882) (← links)
- Approximation algorithms for \(k\)-hurdle problems (Q627530) (← links)
- Maximum flow in directed planar graphs with vertex capacities (Q634675) (← links)
- Continuous and discrete flows over time (Q634790) (← links)
