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