Avoiding unnecessary demerging and remerging of multi‐commodity integer flows

DOI10.1002/net.21969OpenAlexW3043924320MaRDI QIDQ6092659

Zhiyuan Lin, Raymond S. K. Kwan

Publication date: 23 November 2023

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.21969

zbMATH Keywords

train unit schedulingfixed-charge multi-commodity flowheuristic branchingflows on bipartite graphsunnecessary flow demerging/remerging

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Local convex hulls for a special class of integer multicommodity flow problems
• Two classical transportation problems revisited: pure constant fixed charges and the paradox
• A fast algorithm for constructing Monge sequences in transportation problems with forbidden arcs
• Monge sequences, antimatroids, and the transportation problem with forbidden arcs
• A study of the fixed charge transportation problem
• Redundant coupling/decoupling in train unit scheduling optimization
• Minimum concave-cost network flow problems: Applications, complexity, and algorithms
• Solving a real-world train-unit assignment problem
• A Suggested Computation for Maximal Multi-Commodity Network Flows
• Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem
• Analysis of a flow problem with fixed charges
• A Simplex-Based Tabu Search Method for Capacitated Network Design
• On the use of guided design search for discovering significant decision variables in the fixed‐charge capacitated multicommodity network design problem
• Bundle-based relaxation methods for multicommodity capacitated fixed charge network design

This page was built for publication: Avoiding unnecessary demerging and remerging of multi‐commodity integer flows