An arbitrary starting variable dimension algorithm for computing an integer point of a simplex

DOI10.1023/A:1008713230329zbMath0970.90054OpenAlexW1504687020MaRDI QIDQ1303784

Hans van Maaren, Chuangyin Dang

Publication date: 14 October 2001

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

Full work available at URL: https://doi.org/10.1023/a:1008713230329

zbMATH Keywords

triangulationinteger programminginteger labelingpolytopesimplexinteger pointsimplicial approach

Mathematics Subject Classification ID

Integer programming (90C10) Extreme-point and pivoting methods (90C49)

Related Items (2)

Computing an integer point of a class of convex sets. ⋮ Computing an integer point of a simplex with an arbitrary starting homotopy-like simplicial algorithm

This page was built for publication: An arbitrary starting variable dimension algorithm for computing an integer point of a simplex