Avoiding unnecessary demerging and remerging of multi‐commodity integer flows
From MaRDI portal
Cites work
- A fast algorithm for constructing Monge sequences in transportation problems with forbidden arcs
- A Simplex-Based Tabu Search Method for Capacitated Network Design
- A study of the fixed charge transportation problem
- A suggested computation for maximal multi-commodity network flows
- Analysis of a flow problem with fixed charges
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
- Combining exact and heuristic approaches for the capacitated fixed-charge network flow problem
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- Local convex hulls for a special class of integer multicommodity flow problems
- Minimum concave-cost network flow problems: Applications, complexity, and algorithms
- Monge sequences, antimatroids, and the transportation problem with forbidden arcs
- Network flows. Theory, algorithms, and applications.
- On the use of guided design search for discovering significant decision variables in the fixed‐charge capacitated multicommodity network design problem
- Redundant coupling/decoupling in train unit scheduling optimization
- Solving a real-world train-unit assignment problem
- Two classical transportation problems revisited: pure constant fixed charges and the paradox
This page was built for publication: Avoiding unnecessary demerging and remerging of multi‐commodity integer flows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6092659)