Solving linear optimization problems on arrangements by the truncation method

DOI10.1023/B:CASA.0000020230.93910.1DzbMATH Open1066.90067OpenAlexW2090919518MaRDI QIDQ557443FDOQ557443

Authors: O. A. Yemets', T. N. Barbolina 

Publication date: 30 June 2005

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:casa.0000020230.93910.1d

Recommendations

• Linear programming solutions of the truncated moment problem
• On the Solution of Problems of Nonlinear Conditional Optimization on Arrangements by the Cut-Off Method
• scientific article; zbMATH DE number 2206808
• Solving a linear problem of Euclidean combinatorial optimization on arrangements with the constant sum of the elements
• Linear optimization and extensions. Problems and solutions
• Tractable parameterizations for the minimum linear arrangement problem
• Tractable parameterizations for the minimum linear arrangement problem
• scientific article; zbMATH DE number 16591
• scientific article; zbMATH DE number 2145258
• scientific article; zbMATH DE number 2047294

zbMATH Keywords

multisetcorrect truncationgeneral set of arrangementslinear optimization problem on arrangements

Mathematics Subject Classification ID

Linear programming (90C05) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Cited In (11)

• Title not available (Why is that?)
• Title not available (Why is that?)
• On the Solution of Problems of Nonlinear Conditional Optimization on Arrangements by the Cut-Off Method
• Direct cut-off method for combinatorial optimization problems with additional constraints
• Title not available (Why is that?)
• Solving a linear problem of Euclidean combinatorial optimization on arrangements with the constant sum of the elements
• A modification of the method of combinatorial truncation in optimization problems over vertex-located sets
• Analysis of mathematical models and methods of solving combinatorial optimization problems on game-type permutations
• Analysis of an algorithm for solution of conditional optimization problems with linear-fractional objective functions over permutations
• Truncation Technique for Characterizing Linear Polymatroids
• Solving optimization problems with linear-fractional objective functions and additional constraints on the arrangements

This page was built for publication: Solving linear optimization problems on arrangements by the truncation method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q557443)