A multicommodity network-flow problem with side constraints on paths solved by column generation

DOI10.1287/IJOC.15.1.42.15151zbMATH Open1238.90024OpenAlexW2131559541MaRDI QIDQ2884548FDOQ2884548

Authors: Kaj Holmberg, Di Yuan 

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

Recommendations

• scientific article; zbMATH DE number 1487908
• scientific article; zbMATH DE number 1086903
• Integer multicommodity flow problems
• An extended model and a column generation algorithm for the planar multicommodity flow problem
• Multicommodity network flow with jump constraints

zbMATH Keywords

integer programmingcolumn generationside constraintsflow algorithmsmulticommodity networks-graphs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Cited In (23)

• Single-Sink Multicommodity Flow with Side Constraints
• Constraint generation for network reliability problems
• Traffic equilibrium with a continuously distributed bound on travel weights: the rise of range anxiety and mental account
• Solving the constrained shortest path problem using random search strategy
• Exact and approximate approaches for the Pareto front generation of the single path multicommodity flow problem
• A column-generation approach for joint mobilization and evacuation planning
• Title not available (Why is that?)
• Metaheuristics for solving the biobjective single‐path multicommodity communication flow problem
• A column generation heuristic for a dynamic generalized assignment problem
• Multi-period traffic routing in satellite networks
• On the parametrized complexity of read-once refutations in UTVPI+ constraint systems
• Implementation of a three-stage approach for the dynamic resource-constrained shortest-path sub-problem in branch-and-price
• The transit time constrained fixed charge multi-commodity network design problem
• A multi-start variable neighborhood search for solving the single path multicommodity flow problem
• Heuristic approaches for the multiperiod location-transportation problem with reuse of vehicles in emergency logistics
• An introduction to dynamic generative networks: minimum cost flow
• An extended model and a column generation algorithm for the planar multicommodity flow problem
• Modeling and solving the rooted distance-constrained minimum spanning tree problem
• A three-stage approach for the resource-constrained shortest path as a sub-problem in column generation
• Circulation of railway rolling stock: a branch-and-price approach
• A survey of resource constrained shortest path problems: exact solution approaches
• Algorithms for an integer multicommodity network flow problem with node reliability considerations
• Three-stage approaches for optimizing some variations of the resource constrained shortest-path sub-problem in a column generation context

Uses Software

• PPRN

This page was built for publication: A multicommodity network-flow problem with side constraints on paths solved by column generation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2884548)