Multicommodity network flows: a survey. I: Applications and formulations
From MaRDI portal
(Redirected from Publication:5020877)
Recommendations
Cites work
- A branch-and-bound method for multicommodity location with balancing requirements
- A cycle augmentation algorithm for minimum cost multicommodity flows on a ring
- A generalized upper bounding algorithm for multicommodity network flow problems
- A heuristic solution procedure for multicommodity integer flows
- A minimum-cost multicommodity network flow problem concerning imports and exports
- A Network-Based Primal-Dual Heuristic for the Solution of Multicommodity Network Flow Problems
- A New Multiplier Adjustment Procedure for the Distributed Computation of Routing Assignments in Virtual Circuit Data Networks
- A parallel branch-and-bound algorithm for multicommodity location with balancing requirements
- A primal partitioning approach for single and non-simultaneous multicommodity flow problems
- A Primal Partitioning Solution for the Arc-Chain Formulation of a Multicommodity Network Flow Problem
- A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
- A suggested computation for maximal multi-commodity network flows
- A survey of dynamic network flows
- A survey on multi-net global routing for integrated circuits
- A tabu search procedure for multicommodity location/allocation with balancing requirements
- An approximate max-flow min-cut relation for undirected multicommodity flow, with applications
- ATM network design: Traffic models and optimization-based heuristics
- Branch-and-bound parallelization strategies applied to a depot location and container fleet management problem
- Combinatorial approaches to multiflow problems
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Computational experience with a difficult mixed-integer multicommodity flow problem
- Computing Wardropian equilibria in a complementarity framework
- Dual-Ascent Procedures for Multicommodity Location-Allocation Problems with Balancing Requirements
- Exact solution of multicommodity network optimization problems with general step cost functions
- Facility location models for distribution planning
- Geometric algorithms and combinatorial optimization.
- scientific article; zbMATH DE number 3174052 (Why is no real title available?)
- scientific article; zbMATH DE number 2086912 (Why is no real title available?)
- scientific article; zbMATH DE number 1848286 (Why is no real title available?)
- scientific article; zbMATH DE number 1875431 (Why is no real title available?)
- scientific article; zbMATH DE number 3356467 (Why is no real title available?)
- Integer Programming and Combinatorial Optimization
- Integer programming in VLSI design
- Matroids and multicommodity flows
- Minimizing stall time in single and parallel disk systems
- Minimum cost capacity installation for multicommodity network flows
- Models for multimode multicommodity location problems with interdepot balancing requirements
- Multi-Commodity Network Flows
- Multicommodity Distribution System Design by Benders Decomposition
- Multicommodity flow models for spanning trees with hop constraints
- Multicommodity flows in graphs
- Multicommodity flows in planar graphs
- Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
- Multicommodity network flow with jump constraints
- Multicommodity network flows: A survey. II: Solution methods
- On max-flow min-cut and integral flow properties for multicommodity flows in directed networks
- On the Complexity of Timetable and Multicommodity Flow Problems
- On the Computational Complexity of Combinatorial Problems
- On Two Commodity Network Flows
- Partitioning procedures for solving mixed-variables programming problems
- Potential function methods for approximately solving linear programming problems: theory and practice.
- Price-based planning and scheduling of multiproduct orders in symbiotic manufacturing networks
- Primal partition programming for block diagonal matrices
- Service network design in freight transportation
- Solving the undirected multicommodity flow problem using a shortest path‐based pricing algorithm
- Strong inequalities for capacitated survivable network design problems.
- The Decomposition Algorithm for Linear Programs
- The fleet assignment problem: Solving a large scale integer program
- Two commodity network flows and linear programming
Cited in
(16)- Multicommodity network flows: The impact of formulation on decomposition
- Solving the integrated multi-period scheduling routing problem for cleaning debris in the aftermath of disasters
- Dynamic multicommodity contraflow problem with asymmetric transit times
- Problem of groupage cargo routing in the multicommodity transport network with given tariffs and delivery time constraints
- scientific article; zbMATH DE number 38293 (Why is no real title available?)
- scientific article; zbMATH DE number 1487908 (Why is no real title available?)
- A combined matheuristic for the piecewise linear multicommodity network flow problem
- Multicommodity flows
- Multicommodity network flows: A survey. II: Solution methods
- Monotonicity and conformality in multicommodity network‐flow problems
- A Methodology of the Mathematical Modeling for Perspective Development of Nodes and Transport Routes in the Multicommodity Hierarchical Network. I. Optimization Problems
- High-accuracy multicommodity flows via iterative refinement
- The parameterised complexity of integer multicommodity flow
- A methodology of the mathematical modeling for perspective development of nodes and transport routes in the multicommodity hierarchical network. II: Experimental research
- Sensitivity analysis in Dantzig–Wolfe decomposition
- Express analysis and aggregated representation of the set of reachable flows for a multicommodity network system
This page was built for publication: Multicommodity network flows: a survey. I: Applications and formulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5020877)
