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

DOI10.1007/S10589-016-9831-3MaRDI QIDQ301702zbMATHOpenAlexWikidataFDO

Authors Zhiyuan Lin, Raymond S. K. Kwan

Publication date 1 July 2016

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

Copyright license Creative Commons Attribution 4.0 International

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)

Recommendations

• Linear programming approaches to the convex hull problem in \(\mathbb{R}^ m\)
• scientific article; zbMATH DE number 724218
• scientific article; zbMATH DE number 1182912
• scientific article; zbMATH DE number 761263
• The convex hull problem for the selection of load cases in reinforced concrete cross-section analysis

Cites work

• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• scientific article; zbMATH DE number 1312984 (Why is no real title available?)
• scientific article; zbMATH DE number 508830 (Why is no real title available?)
• scientific article; zbMATH DE number 705150 (Why is no real title available?)
• scientific article; zbMATH DE number 3229353 (Why is no real title available?)
• A Lagrangian heuristic for a train-unit assignment problem
• A branch-first, cut-second approach for locomotive assignment
• A rolling stock circulation model for combining and splitting of passenger trains
• Circulation of railway rolling stock: a branch-and-price approach
• Models and algorithms for combinatorial optimization problems arising in railway applications
• Models and algorithms for the train unit assignment problem
• Network flows. Theory, algorithms, and applications.
• On integer polytopes with few nonzero vertices
• Simultaneous Assignment of Locomotives and Cars to Passenger Trains
• Solving a real-world train-unit assignment problem
• The maximum numbers of faces of a convex polytope
• The multidimensional content of the frustum of the simplex
• The quickhull algorithm for convex hulls

Cited in

(1)

• Avoiding unnecessary demerging and remerging of multi‐commodity integer flows

Describes a project that uses

Uses Software

• Qhull

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

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