Network flows. Theory, algorithms, and applications.
From MaRDI portal
(Redirected from Publication:3056948)
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)
Recommendations
Cited in
(only showing first 100 items - show all)- The complexity of computing a bisimilarity pseudometric on probabilistic automata
- Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design
- A novel approach to subgraph selection with multiple weights on arcs
- On a biobjective search problem in a line: formulations and algorithms
- Solving the weighted stable set problem in claw-free graphs via decomposition
- The urban air mobility problem
- A network flow approach in finding maximum likelihood estimate of high concentration regions
- On polynomial cases of the unichain classification problem for Markov decision processes
- A probabilistic approach to pickup and delivery problems with time window uncertainty
- A simplex algorithm for a class of Leontief flow problems
- Solving elementary shortest-path problems as mixed-integer programs
- On the power of randomization in network interdiction
- Minimum label \(s\)-\(t\) cut has large integrality gaps
- Simplicial with truncated Dantzig-Wolfe decomposition for nonlinear multicommodity network flow problems with side constraints
- An augmenting‐flow algorithm for a class of node‐capacitated maximum flow problems
- Personnel scheduling and supplies provisioning in emergency relief operations
- The generalized assignment problem with minimum quantities
- Minimizing the number of tardy jobs with precedence constraints and agreeable due dates
- On a technique for finding running tracks of specific length in a road network
- On the Complexity of Computing Maximum and Minimum Min‐Cost‐Flows
- Inverse anti-k-centrum problem on networks with variable edge lengths
- Robotic-cell scheduling: special polynomially solvable cases of the traveling salesman problem on permuted Monge matrices
- Locomotive assignment graph model for freight traffic on linear Section of railway. The problem of finding a maximal independent schedule coverage
- Learning tractable Bayesian networks in the space of elimination orders
- Parametric analysis of overall min-cuts and applications in undirected networks.
- Approximation algorithms for routing and call scheduling in all-optical chains and rings.
- The computation of Cournot-Nash equilibria for the time-definite freight delivery industry under an oligopolistic market
- On the complexity of the dual method for maximum balanced flows
- Lagrangian based heuristics for the multicommodity network flow problem with fixed costs on paths
- Complexity and algorithms for nonlinear optimization problems
- Selecting intervals to optimize the design of observational studies subject to fine balance constraints
- Multicommodity network flows: A survey. II: Solution methods
- Quadratic programming and combinatorial minimum weight product problems
- The Rank-One Quadratic Assignment Problem
- Spatio-temporal pricing for ridesharing platforms
- Optimizing the US Navy's combat logistics force
- Minimization of Energy Losses in Electric Power Distribution Systems by Intelligent Search Strategies
- Minimum flow problem on network flows with time-varying bounds
- Reliability evaluation of multi-state systems under cost consideration
- Approximating airports and railways
- Simple linear flow decomposition algorithms on trees, circles, and augmented trees
- Column Generation Algorithms for the Capacitated m-Ring-Star Problem
- Robust optimization with belief functions
- Equivalence of the primal and dual simplex algorithms for the maximum flow problem
- Strong NP-hardness of AC power flows feasibility
- Shortest paths with shortest detours. A biobjective routing problem
- Solidarity and efficiency in preference aggregation: a tale of two rules
- Prospective network flow models and algorithms for bin packing problems
- Structural and algorithmic properties for parametric minimum cuts
- The Byzantine generals problem in generic and wireless networks
- Mathematical political districting taking care of minority groups
- Extension of M-convexity and L-convexity to polyhedral convex functions
- Closed-form formulas for cluster sizing for two-level hierarchical networks with source routing
- A fluid model for one-sided bipartite matching queues with match-dependent rewards
- Check-in counter planning via a network flow approach
- Learning-augmented maximum flow
- A (B + 1)-approximation for network flow interdiction with unit costs
- Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm
- Small Littlewood-Richardson coefficients
- Average cost Brownian drift control with proportional changeover costs
- Improving the bridge structure by using linear failure rate distribution
- On the second point-to-point undirected shortest simple path problem
- Pricing with markups in industries with increasing marginal costs
- The subdivision-constrained routing requests problem
- Structural Change and Homeostasis in Organizations: A Decision-Theoretic Approach
- A robust lot sizing problem with ill-known demands
- Fast and Scalable Domino Portrait Generation
- Complexity of strict robust integer minimum cost flow problems: an overview and further results
- A flow formulation for horizontal coordinate assignment with prescribed width
- The 2-allocation \(p\)-hub median problem and a modified Benders decomposition method for solving hub location problems
- Approximating bounded-degree spanning trees and connected factors with leaves
- A biobjective Dijkstra algorithm
- Mathematical optimization in intensity modulated radiation therapy
- The -maximum flow model with uncertain capacities
- Probabilistic local search algorithms for concave cost transportation network problems
- Possible line sums for a qualitative matrix
- The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs
- Dynamic matching: reducing integral algorithms to approximately-maximal fractional algorithms
- A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem
- Parallel machine scheduling with machine availability and eligibility constraints
- Two new algorithms for UMTS access network topology design
- The \(k\)-cardinality assignment problem
- Degree-constrained graph orientation: maximum satisfaction and minimum violation
- Inverse feasibility problems of the inverse maximum flow problems
- Fast algorithms for the undirected negative cost cycle detection problem
- A reduction approach to the repeated assignment problem
- A direct barter model for course add/drop process
- Optimality conditions in preference-based spanning tree problems
- Planning wireless networks by shortest path
- Search for all \(d\)-mincuts of a limited-flow network
- Algorithms for the minmax regret path problem with interval data
- A strongly polynomial algorithm for the minimum maximum flow degree problem
- A greedy algorithm for finding maximum spanning trees in infinite graphs
- Lower bounding techniques for the degree-constrained network design problem
- Clearance time estimation for incorporating evacuation risk in routing strategies for evacuation operations
- Trip-based path algorithms using the transit network hierarchy
- Interdicting the activities of a linear program -- a parametric analysis
- Approximability of the firefighter problem. Computing cuts over time
- Sectorization and configuration transition in airspace design
- Reachability cuts for the vehicle routing problem with time windows
This page was built for publication: Network flows. Theory, algorithms, and applications.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3056948)
