Pages that link to "Item:Q4161054"
From MaRDI portal
The following pages link to Multicommodity network flows—A survey (Q4161054):
Displaying 50 items.
- A bi-objective column generation algorithm for the multi-commodity minimum cost flow problem (Q319360) (← links)
- Express analysis and aggregated representation of the set of reachable flows for a multicommodity network system (Q786093) (← links)
- A two-commodity multistate flow network with capacity weight varying with edges, nodes and types of commodity (Q864752) (← links)
- System capacity for a two-commodity multistate flow network with unreliable nodes and capacity weight (Q878580) (← links)
- Analysis of a system of nonlocal conservation laws for multi-commodity flow on networks (Q887714) (← links)
- A multi-start variable neighborhood search for solving the single path multicommodity flow problem (Q902982) (← links)
- A survey of dynamic network flows (Q917417) (← links)
- New methods for multi-commodity flows (Q920829) (← links)
- Two-commodity reliability evaluation of a stochastic-flow network with varying capacity weight in terms of minimal paths (Q958439) (← links)
- Combinatorial approaches to multiflow problems (Q1080357) (← links)
- The minimal average cost flow problem (Q1130071) (← links)
- Optimal planning of network structures within an exchange area (Q1150523) (← links)
- The forwarding index of communication networks with given connectivity (Q1199420) (← links)
- An implementation of a parallel primal-dual interior point method for block- structured linear programs (Q1203072) (← links)
- A variable-penalty alternating directions method for convex optimization (Q1290650) (← links)
- A model management solution system for multicommodity network flows (Q1319534) (← links)
- Multicommodity network flows: The impact of formulation on decomposition (Q1321667) (← links)
- Dynamic factorization in large-scale optimization (Q1330893) (← links)
- Operations research games: A survey. (With comments and rejoinder) (Q1348703) (← links)
- Multicommodity network flow with jump constraints (Q1356790) (← links)
- A smooth penalty function algorithm for network-structured problems (Q1388940) (← links)
- Exact and approximate approaches for the Pareto front generation of the single path multicommodity flow problem (Q1615965) (← links)
- Performance evaluation for a transportation system in stochastic case (Q1761107) (← links)
- A heuristic solution procedure for multicommodity integer flows (Q1905088) (← links)
- Range-constrained traffic assignment with multi-modal recharge for electric vehicles (Q2005853) (← links)
- Quantum bridge analytics II: QUBO-plus, network optimization and combinatorial chaining for asset exchange (Q2026705) (← links)
- Multi-warehouse package consolidation for split orders in online retailing (Q2029283) (← links)
- Analysis of critical damage in the communication network. IV: Multicriteria estimations of cluster vulnerability (Q2134320) (← links)
- Dynamic multicommodity contraflow problem with asymmetric transit times (Q2138334) (← links)
- Quantum bridge analytics. II: QUBO-plus, network optimization and combinatorial chaining for asset exchange (Q2159525) (← links)
- Analysis of cluster damages in network systems (Q2206489) (← links)
- Algorithms for an integer multicommodity network flow problem with node reliability considerations (Q2247900) (← links)
- Approximate decomposition methods for the analysis of multicommodity flow routing in generalized queuing networks (Q2255986) (← links)
- An approach to the analysis of possible structural damages in multicommodity network systems (Q2284269) (← links)
- Generate upper boundary vectors meeting the demand and budget for a \(p\)-commodity network with unreliable nodes (Q2370349) (← links)
- Descent direction algorithm with multicommodity flow problem for signal optimization and traffic assignment jointly (Q2371467) (← links)
- A remark on a standard and linear vector network equilibrium problem with capacity constraints (Q2383101) (← links)
- On a multicommodity stochastic-flow network with unreliable nodes subject to budget constraint (Q2432906) (← links)
- An algorithm to generate all upper boundary points for \((\mathbf d,B) \) in terms of minimal cuts (Q2458722) (← links)
- Algorithms for Finding Optimal Flows in Dynamic Networks (Q2974407) (← links)
- Measure the quality level for a supplier-demand system by a multicommodity stochastic-flow network (Q3437468) (← links)
- Bi-objective min-flow problem with capacity and flow constraints (Q3487125) (← links)
- A two level optimization approach for long-term planning in a large air transportation network (Q3612698) (← links)
- Large-scale linear programming: Geometry, working bases and factorizations (Q3664825) (← links)
- Network design and dynamic routing under queueing demand (Q3696826) (← links)
- A fertilizer transportation problem (Q3748065) (← links)
- Optimal control of store-and-forward networks (Q3944435) (← links)
- Models for the design and analysis of a large package sort facility (Q4537617) (← links)
- PARALLELIZATION STRATEGIES OF A ROW-ACTION METHOD FOR MULTICOMMODITY NETWORK FLOW PROBLEMS (Q4820107) (← links)
- Basis characterisation for linear multicommodity network programs (Q4836775) (← links)
