A Multicommodity Network-Flow Problem with Side Constraints on Paths Solved by Column Generation

From MaRDI portal
Publication:2884548

DOI10.1287/ijoc.15.1.42.15151zbMath1238.90024OpenAlexW2131559541MaRDI QIDQ2884548

Di Yuan, Kaj Holmberg

Publication date: 30 May 2012

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.15.1.42.15151




Related Items (19)

Exact and approximate approaches for the Pareto front generation of the single path multicommodity flow problemThree-stage approaches for optimizing some variations of the resource constrained shortest-path sub-problem in a column generation contextCirculation of railway rolling stock: a branch-and-price approachModeling and solving the rooted distance-constrained minimum spanning tree problemImplementation of a three-stage approach for the dynamic resource-constrained shortest-path sub-problem in branch-and-priceHeuristic approaches for the multiperiod location-transportation problem with reuse of vehicles in emergency logisticsThe transit time constrained fixed charge multi-commodity network design problemMulti-period traffic routing in satellite networksA column-generation approach for joint mobilization and evacuation planningMetaheuristics for solving the biobjective single‐path multicommodity communication flow problemA multi-start variable neighborhood search for solving the single path multicommodity flow problemAn introduction to dynamic generative networks: minimum cost flowTraffic equilibrium with a continuously distributed bound on travel weights: the rise of range anxiety and mental accountAlgorithms for an integer multicommodity network flow problem with node reliability considerationsA three-stage approach for the resource-constrained shortest path as a sub-problem in column generationSolving the constrained shortest path problem using random search strategyA column generation heuristic for a dynamic generalized assignment problemA survey of resource constrained shortest path problems: Exact solution approachesOn the parametrized complexity of Read-once refutations in UTVPI+ constraint systems


Uses Software



This page was built for publication: A Multicommodity Network-Flow Problem with Side Constraints on Paths Solved by Column Generation