Linear constrained combinatorial optimization on well-described sets

Abstract A Horizontal method (LCCO-HM) for linear constrained combinatorial optimization (LCCO) on well-described combinatorial sets (CWDs) is offered. LCCO-HM utilizes an essential feature of the sets to solve linear unconstraint programs in polynomial time. The method belongs to the Branch and Bou...

Full description

Saved in:
Bibliographic Details
Published inIOP conference series. Materials Science and Engineering Vol. 1099; no. 1; p. 12064
Main Authors Pichugina, Oksana, Koliechkina, Liudmyla
Format Journal Article
LanguageEnglish
Published Bristol IOP Publishing 01.03.2021
Subjects
Combinatorial analysis
Euclidean geometry
Euclidean space
Linear functions
Optimization
Permutations
Polynomials
Online AccessGet full text

Cover

More Information
Summary:Abstract A Horizontal method (LCCO-HM) for linear constrained combinatorial optimization (LCCO) on well-described combinatorial sets (CWDs) is offered. LCCO-HM utilizes an essential feature of the sets to solve linear unconstraint programs in polynomial time. The method belongs to the Branch and Bound group. It reduces a search domain to solutions of auxiliary unconstrained combinatorial problems and performs pruning branches based on properties of a linear function on CWDs. Applicability of LCCO-HM is justified for sets of multipermutations and partial multipermutations embedded in Euclidean space. LCCO-HM is illustrated by an example of solving a permutation-based linear optimization problem.
ISSN:1757-8981
1757-899X
DOI:10.1088/1757-899X/1099/1/012064