Convex extensions in combinatorial optimization and their applications
From MaRDI portal
Recommendations
- The theory of convex extensions in combinatorial optimization problems
- Properties of combinatorial optimization problems over polyhedral-spherical sets
- The optimization of linear and convex functions on an Euclidean combinatorial set of polypermutations
- Extremal properties of nondifferentiable convex functions on euclidean sets of combinations with repetitions
- Continuous representations and functional extensions in combinatorial optimization
Cited in
(13)- Convex and convex-like optimization over a range inclusion problem and first applications
- Configuration space of geometric objects
- Properties of combinatorial optimization problems over polyhedral-spherical sets
- A method to solve conditional optimization problems with quadratic objective functions on the set of permutations
- Theory and methods of Euclidian combinatorial optimization: current status and prospects
- Formalizing spatial configuration optimization problems with the use of a special function class
- scientific article; zbMATH DE number 5888310 (Why is no real title available?)
- Convex compactifications and special extensions of optimization problems
- The theory of convex extensions in combinatorial optimization problems
- Extremal properties of nondifferentiable convex functions on euclidean sets of combinations with repetitions
- Continuous representations and functional extensions in combinatorial optimization
- Continuous extensions on Euclidean combinatorial configurations
- The polyhedral-surface cutting plane method of optimization over a vertex-located set
This page was built for publication: Convex extensions in combinatorial optimization and their applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1797565)
