Evaluation of solution of discrete optimization problem with incomplete input

DOI10.1007/S11590-020-01606-YMaRDI QIDQ828663zbMATH OpenOpenAlexFDO

Authors Maksim Barketau

Publication date 5 May 2021

Published in Optimization Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11590-020-01606-y

zbMATH Keywords

unit spheremeasurable setassignement problemasymmetric travelling salesman problemincomplete input

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Recommendations

• Analysis of discrete optimization algorithms using incomplete information
• The solution of the continuous optimal decomposition problem with incomplete initial data
• scientific article; zbMATH DE number 4072726
• Optimization on the combinatorial set of permutations in inexact input data conditions
• A useful transform of standard input data for a classical NP-complete problem

Cited in

(1)

• Analysis of discrete optimization algorithms using incomplete information

This page was built for publication: Evaluation of solution of discrete optimization problem with incomplete input

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