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

DOI10.1007/S10589-016-9831-3zbMATH Open1352.90102OpenAlexW2261564661WikidataQ57948630 ScholiaQ57948630MaRDI QIDQ301702FDOQ301702

Authors: Zhiyuan Lin, Raymond S. K. Kwan 

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

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

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)

Cites Work

• Network flows. Theory, algorithms, and applications.
• Title not available (Why is that?)
• The quickhull algorithm for convex hulls
• Simultaneous Assignment of Locomotives and Cars to Passenger Trains
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The maximum numbers of faces of a convex polytope
• 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
• Title not available (Why is that?)

Cited In (1)

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

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)