Pseudo-Boolean conditional optimization models for a class of multiple traveling salesmen problems

DOI10.1134/S0005117921100040zbMath1483.90135OpenAlexW3216617311MaRDI QIDQ2069675

M. G. Kozlova, V. A. Lukianenko, M. S. Germanchuk

Publication date: 21 January 2022

Published in: Automation and Remote Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0005117921100040

zbMATH Keywords

metaheuristicsmultiagent salesman problempseudo-Boolean conditional optimization model with disjunctive constraints

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Boolean programming (90C09)

Cites Work

• Pseudo-Boolean optimization
• The traveling salesman problem. Approximate algorithms
• The traveling salesman problem. I: Theoretical issues
• The traveling salesman problem. II: Exact methods
• The search of a maximum upper zero of a monotone function on ranked sets
• Disjunctive and conjunctive normal forms of pseudo-Boolean functions
• Pseudo-Boolean optimization with a disjunctive constraint
• Pseudo-Boolean methods for bivalent programming. Lecture at the first European meeting of the Institute of Management Sciences and of the Econometric Society, Warsaw, September 2--7, 1966
• A Synthesis of Pseudo-Boolean Empirical Models by Precedential Information
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item