Continuous extensions on Euclidean combinatorial configurations
From MaRDI portal
Recommendations
- Continuous representations and functional extensions in combinatorial optimization
- Theory and methods of Euclidian combinatorial optimization: current status and prospects
- Configuration space of geometric objects
- Projective configurations: their invariants and homology
- Convex extensions in combinatorial optimization and their applications
Cites work
- A graph-theoretic approach to multiobjective permutation-based optimization
- Bounds on the minimum of convex functions on Euclidean combinatorial sets
- Combinatorial configurations in balance layout optimization problems
- Configuration space of geometric objects
- Construction of convex continuations for functions defined on a hypersphere
- Continuous approaches for solving discrete optimization problems
- Continuous Approaches to the Unconstrained Binary Quadratic Problems
- Continuous representations and functional extensions in combinatorial optimization
- Convex extensions in combinatorial optimization and their applications
- CVaR norm and applications in optimization
- Edmonds, matching and the birth of polyhedral combinatorics
- Formalizing spatial configuration optimization problems with the use of a special function class
- Homology representations arising from the half cube. II
- scientific article; zbMATH DE number 3842033 (Why is no real title available?)
- scientific article; zbMATH DE number 3828715 (Why is no real title available?)
- scientific article; zbMATH DE number 3486652 (Why is no real title available?)
- scientific article; zbMATH DE number 3618052 (Why is no real title available?)
- scientific article; zbMATH DE number 1201576 (Why is no real title available?)
- Lagrangian bounds in multiextremal polynomial and discrete optimization problems
- Localization of solutions of some problems of nonlinear integer optimization
- Mathematical Models of Placement Optimisation: Two- and Three-Dimensional Problems and Applications
- On a set of problems on covering of a bounded set
- On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0--1 quadratic problems leading to quasi-Newton methods
- Optimization of 3D objects layout into a multiply connected domain with account for shortest distances
- Optimization of linear functions at the vertices of a permutation polyhedron with additional linear constraints
- ORBITOPES
- Principles of combinatorics
- Properties of combinatorial optimization problems over polyhedral-spherical sets
- Set coverings and tolerance relations
- The Fundamental Theorem on Symmetric Polynomials: History's First Whiff of Galois Theory
- The method of artificial space dilation in problems of optimal packing of geometric objects
- The theory of convex continuations of functions at the vertices of convex polygons
- Theory and methods of Euclidian combinatorial optimization: current status and prospects
- Two pairs of families of polyhedral norms versus \(\ell _p\)-norms: proximity and applications in optimization
- Vector optimization problems with linear criteria over a fuzzy combinatorial set of alternatives
Cited in
(3)
This page was built for publication: Continuous extensions on Euclidean combinatorial configurations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5093671)
