Solvable cases of a new combinatorial problem of optimization

DOI10.1007/BF02733482MaRDI QIDQ1974351zbMATH OpenOpenAlexFDO

Authors V. Ya. Burdyuk, Vadim A. Semenov

Publication date 26 September 2000

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

Full work available at URL https://doi.org/10.1007/bf02733482

zbMATH Keywords

combinatorial optimizationHungarian method

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• A method for modeling the structure of initial data and subclasses of solvable combinatorial optimization problems
• Efficiently solvable special cases of hard combinatorial optimization problems
• Subclasses of solvable problems from classes of combinatorial optimization problems
• Exact Algorithms for Generalized Combinatorial Optimization Problems
• scientific article; zbMATH DE number 3902037

Cited in

(4)

• On simple combinatorial optimization problems. A collection of contributions in honour of Jack van Lint
• A method for modeling the structure of initial data and subclasses of solvable combinatorial optimization problems
• A combinatorial solution for bridge and torch problem
• Subclasses of solvable problems from classes of combinatorial optimization problems

This page was built for publication: Solvable cases of a new combinatorial problem of optimization

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