Continuous extensions on Euclidean combinatorial configurations
From MaRDI portal
Publication:5093671
zbMATH Open1492.90153MaRDI QIDQ5093671FDOQ5093671
Authors: Oksana Pichugina, Sergiy Yakovlev 
Publication date: 29 July 2022
Full work available at URL: http://www.math.md/publications/basm/issues/y2022-n1/13579/
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
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Cites Work
- Title not available (Why is that?)
- Principles of combinatorics
- Two pairs of families of polyhedral norms versus \(\ell _p\)-norms: proximity and applications in optimization
- Title not available (Why is that?)
- CVaR norm and applications in optimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0--1 quadratic problems leading to quasi-Newton methods
- Lagrangian bounds in multiextremal polynomial and discrete optimization problems
- Continuous approaches for solving discrete optimization problems
- Combinatorial configurations in balance layout optimization problems
- Vector optimization problems with linear criteria over a fuzzy combinatorial set of alternatives
- Optimization of linear functions at the vertices of a permutation polyhedron with additional linear constraints
- ORBITOPES
- Construction of convex continuations for functions defined on a hypersphere
- Localization of solutions of some problems of nonlinear integer optimization
- The theory of convex continuations of functions at the vertices of convex polygons
- Title not available (Why is that?)
- Continuous representations and functional extensions in combinatorial optimization
- On a set of problems on covering of a bounded set
- Continuous Approaches to the Unconstrained Binary Quadratic Problems
- Bounds on the minimum of convex functions on Euclidean combinatorial sets
- The method of artificial space dilation in problems of optimal packing of geometric objects
- Set coverings and tolerance relations
- Mathematical Models of Placement Optimisation: Two- and Three-Dimensional Problems and Applications
- Homology representations arising from the half cube. II
- Configuration space of geometric objects
- Convex extensions in combinatorial optimization and their applications
- Properties of combinatorial optimization problems over polyhedral-spherical sets
- Optimization of 3D objects layout into a multiply connected domain with account for shortest distances
- Edmonds, matching and the birth of polyhedral combinatorics
- A graph-theoretic approach to multiobjective permutation-based optimization
- Theory and methods of Euclidian combinatorial optimization: current status and prospects
- Formalizing spatial configuration optimization problems with the use of a special function class
- The Fundamental Theorem on Symmetric Polynomials: History's First Whiff of Galois Theory
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)
