Abstract
Determination of the simplex form of the general polyhedron of arrangements, which is necessary to use according to the Karmarkar algorithm on solving the auxiliary problems of linear programming in the methods of combinatorial cutting in the Euclidian combinatorial optimization is under consideration.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
