scientific article

Publication date: 1962

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

mathematical programming applications of probability theory

Programming involving graphs or networks (90C35) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Deterministic network models in operations research (90B10) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Directed graphs (digraphs), tournaments (05C20) Flows in graphs (05C21)

Related Items (only showing first 100 items - show all)

Minimax problem of suppressing a communication network ⋮ On reformulations for the one-warehouse multi-retailer problem ⋮ Maximum likelihood analysis of the Ford-Fulkerson method on special graphs ⋮ The discrete time/cost trade-off problem: Extensions and heuristic procedures ⋮ Approximation algorithms for solving the constrained arc routing problem in mixed graphs ⋮ Complexity results for the linear time-cost tradeoff problem with multiple milestones and completely ordered jobs ⋮ Quick max-flow algorithm ⋮ Stochastic and dynamic shipper carrier network design problem ⋮ Network topology and locational market power ⋮ Two-phase branch-and-cut for the mixed capacitated general routing problem ⋮ Approximation algorithms for treewidth ⋮ Reliability-based economic model predictive control for generalised flow-based networks including actuators' health-aware capabilities ⋮ A simple algorithm to evaluate supply-chain reliability for brittle commodity logistics under production and delivery constraints ⋮ Double resource optimization for a robust computer network subject to a transmission budget ⋮ Reliability evaluation according to a routing scheme for multi-state computer networks under assured accuracy rate ⋮ The value of information in stochastic maximum flow problems ⋮ Branch and bound for the cutwidth minimization problem ⋮ Solution approaches for the cutting stock problem with setup cost ⋮ Joint routing and rate allocation for multiple video streams in ad-hoc wireless networks ⋮ Mining preserving structures in a graph sequence ⋮ A model-based approach and analysis for multi-period networks ⋮ Flow location (FlowLoc) problems: dynamic network flows and location models for evacuation planning ⋮ Multicriterial multi-index resource scheduling problems ⋮ Bidirectional resource networks: A new flow model ⋮ Braess's paradox for flows over time ⋮ Optimal placement of UV-based communications relay nodes ⋮ \textsc{FlipCut} supertrees: towards matrix representation accuracy in polynomial time ⋮ A product form solution to a system with multi-type jobs and multi-type servers ⋮ Alternating paths along axis-parallel segments ⋮ Asymmetric resource networks. III: A study of limit states ⋮ Approximation algorithms for multiprocessor scheduling under uncertainty ⋮ Static and dynamic source locations in undirected networks ⋮ Extensions to 2-factors in bipartite graphs ⋮ Global binary optimization on graphs for classification of high-dimensional data ⋮ Pattern matching with wildcards and length constraints using maximum network flow ⋮ Algorithms for \(\mathcal{GA}\mathrm{-}\mathcal H\) reduced graphs ⋮ Uncertain minimum cost flow problem ⋮ Weighted maximum-clique transversal sets of graphs ⋮ The inverse maximum dynamic flow problem ⋮ On flows in simple bidirected and skew-symmetric networks ⋮ Approximation algorithms for \(k\)-hurdle problems ⋮ On the complexity of bribery and manipulation in tournaments with uncertain information ⋮ Domain decomposition methods with graph cuts algorithms for total variation minimization ⋮ The maximum flow problem of uncertain network ⋮ Maximum flow in directed planar graphs with vertex capacities ⋮ Continuous and discrete flows over time ⋮ Matrix scaling, entropy minimization, and conjugate duality. II: The dual problem ⋮ Random walks in random Dirichlet environment are transient in dimension \(d \geq 3\) ⋮ Phased graphs and graph energies ⋮ A survey of dynamic network flows ⋮ On solving continuous-time dynamic network flows ⋮ Nash equilibria and the price of anarchy for flows over time ⋮ Non-coexistence of infinite clusters in two-dimensional dependent site percolation ⋮ Control of limit states in absorbing resource networks ⋮ Weighted graphs with fixed vertex degrees and network flows ⋮ Updating network flows given multiple, heterogeneous arc attribute changes ⋮ Maximum \(k\)-splittable \(s, t\)-flows ⋮ Maximal flow in branching trees and binary search trees ⋮ On the complexity of time-dependent shortest paths ⋮ A knowledge-based analysis of global function computation ⋮ A note on edge-based graph partitioning and its linear algebraic structure ⋮ Stochastic computer network under accuracy rate constraint from QoS viewpoint ⋮ Processing time-dependent shortest path queries without pre-computed speed information on road networks ⋮ About the minimum mean cycle-canceling algorithm ⋮ Constrained \((0,1)\)-matrix completion with a staircase of fixed zeros ⋮ The problem of maximum flow with minimum attainable cost in a network ⋮ Backup reliability assessment within tolerable packet error rate for a multi-state unreliable vertex computer network ⋮ Linguistic performance evaluation for an ERP system with link failures ⋮ Design of an efficient load balancing algorithm using the symmetric balanced incomplete block design ⋮ A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs ⋮ An improved branch and bound algorithm for minimum concave cost network flow problems ⋮ Lattice flows in networks ⋮ Polynomial dual network simplex algorithms ⋮ 3-approximation algorithm for a two depot, heterogeneous traveling salesman problem ⋮ Minimum flow problem on network flows with time-varying bounds ⋮ What the transportation problem did for me ⋮ Ideal clutters ⋮ Structural and algorithmic properties for parametric minimum cuts ⋮ Minimizing the density of terminal assignments in layout design ⋮ A min-max relation for stable sets in graphs with no odd-\(K_ 4\) ⋮ A measure-theoretical max-flow-min-cut problem ⋮ On the most imbalanced orientation of a graph ⋮ On the planar integer two-flow problem ⋮ Half-trek criterion for generic identifiability of linear structural equation models ⋮ Exact solution approaches for the multi-period degree constrained minimum spanning tree problem ⋮ Maximizing network throughput under stochastic user equilibrium with elastic demand ⋮ Multicommodity flows in tree-like networks ⋮ Optimal routing of data flows in wireless sensor networks ⋮ The universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths ⋮ Bidimensional allocation of seats via zero-one matrices with given line sums ⋮ A primal simplex algorithm that solves the maximum flow problem in at most nm pivots and \(O(n^ 2m)\) time ⋮ \(k\)-independent percolation on trees ⋮ Asymmetrical resource networks. I. Stabilization processes for low resources ⋮ Finding feasible vectors of Edmonds-Giles polyhedra ⋮ A maximum flow problem with intermediate node requirements ⋮ Failure of averaging on multiply-connected domains ⋮ An infeasible (exterior point) simplex algorithm for assignment problems ⋮ Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results ⋮ Locating stops along bus or railway lines -- a bicriteria problem ⋮ Complete bound consistency for the global cardinality constraint

This page was built for publication: