Cut-off in linear partially combinatorial problems of Euclidean combinatorial optimization

MaRDI QIDQ2740122zbMATH OpenFDO

Authors O. O. Emets, E. M. Emets'

Publication date 16 September 2001

Published in Dopovidi Natsional'noï Akademiï Nauk Ukraïny. Matematyka, Pryrodoznavstvo, Tekhnichni Nauky (Search for Journal in Brave)

zbMATH Keywords

Euclidean combinatorial optimizationlinear objective function

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27)

Cited in

(4)

• Theory and methods of Euclidian combinatorial optimization: current status and prospects
• The method of cutting the vertices of permutation polyhedron graph to solve linear conditional optimization problems on permutations
• Computing tight bounds via piecewise linear functions through the example of circle cutting problems
• The polyhedral-surface cutting plane method of optimization over a vertex-located set

This page was built for publication: Cut-off in linear partially combinatorial problems of Euclidean combinatorial optimization

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