Local convex hulls for a special class of integer multicommodity flow problems

DOI10.1007/s10589-016-9831-3zbMath1352.90102OpenAlexW2261564661WikidataQ57948630 ScholiaQ57948630MaRDI QIDQ301702

Raymond S. K. Kwan, Zhiyuan Lin

Publication date: 1 July 2016

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-016-9831-3

zbMATH Keywords

convex hull computationinteger multicommodity network flowrolling stock scheduling

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Avoiding unnecessary demerging and remerging of multi‐commodity integer flows

Uses Software

• Qhull

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Models and algorithms for combinatorial optimization problems arising in railway applications
• On integer polytopes with few nonzero vertices
• Circulation of railway rolling stock: a branch-and-price approach
• A Lagrangian heuristic for a train-unit assignment problem
• A rolling stock circulation model for combining and splitting of passenger trains
• The multidimensional content of the frustum of the simplex
• Solving a real-world train-unit assignment problem
• A Branch-First, Cut-Second Approach for Locomotive Assignment
• Models and Algorithms for the Train Unit Assignment Problem
• Simultaneous Assignment of Locomotives and Cars to Passenger Trains
• The quickhull algorithm for convex hulls
• The maximum numbers of faces of a convex polytope

This page was built for publication: Local convex hulls for a special class of integer multicommodity flow problems