Solving Linear Conditional Completely Combinatorial Optimization Problems on Permutations by the Branch and Bound Method

2013 ◽  
Vol 49 (2) ◽  
pp. 264-278 ◽  
Author(s):  
O. O. Iemets ◽  
Ye. M. Yemets ◽  
T. A. Parfionova ◽  
T. V. Chilikina
Keyword(s):  
Combinatorial Optimization ◽  
Branch And Bound ◽  
Optimization Problems ◽  
Branch And Bound Method ◽  
Combinatorial Optimization Problems

Boosting branch-and-bound MaxSAT solvers with clause learning

2021 ◽  
pp. 1-21
Author(s):  
Chu-Min Li ◽  
Zhenxing Xu ◽  
Jordi Coll ◽  
Felip Manyà ◽  
Djamal Habet ◽  
...  
Keyword(s):  
Experimental Investigation ◽  
Combinatorial Optimization ◽  
Problem Solving ◽  
Branch And Bound ◽  
Real World ◽  
Optimization Problems ◽  
Satisfiability Problem ◽  
Maximum Satisfiability ◽  
Combinatorial Optimization Problems ◽  
Clause Learning

The Maximum Satisfiability Problem, or MaxSAT, offers a suitable problem solving formalism for combinatorial optimization problems. Nevertheless, MaxSAT solvers implementing the Branch-and-Bound (BnB) scheme have not succeeded in solving challenging real-world optimization problems. It is widely believed that BnB MaxSAT solvers are only superior on random and some specific crafted instances. At the same time, SAT-based MaxSAT solvers perform particularly well on real-world instances. To overcome this shortcoming of BnB MaxSAT solvers, this paper proposes a new BnB MaxSAT solver called MaxCDCL. The main feature of MaxCDCL is the combination of clause learning of soft conflicts and an efficient bounding procedure. Moreover, the paper reports on an experimental investigation showing that MaxCDCL is competitive when compared with the best performing solvers of the 2020 MaxSAT Evaluation. MaxCDCL performs very well on real-world instances, and solves a number of instances that other solvers cannot solve. Furthermore, MaxCDCL, when combined with the best performing MaxSAT solvers, solves the highest number of instances of a collection from all the MaxSAT evaluations held so far.

Chapter 23. MaxSAT, Hard and Soft Constraints

2021 ◽  
Author(s):  
Chu Min Li ◽  
Felip Manyà
Keyword(s):  
Combinatorial Optimization ◽  
Lower Bounds ◽  
Branch And Bound ◽  
Data Structures ◽  
Optimization Problems ◽  
Soft Constraints ◽  
Inference Rules ◽  
Combinatorial Optimization Problems ◽  
Definition Of ◽  
Hard And Soft Constraints

MaxSAT solving is becoming a competitive generic approach for solving combinatorial optimization problems, partly due to the development of new solving techniques that have been recently incorporated into modern MaxSAT solvers, and to the challenge problems posed at the MaxSAT Evaluations. In this chapter we present the most relevant results on both approximate and exact MaxSAT solving, and survey in more detail the techniques that have proven to be useful in branch and bound MaxSAT and Weighted MaxSAT solvers. Among such techniques, we pay special attention to the definition of good quality lower bounds, powerful inference rules, clever variable selection heuristics and suitable data structures. Moreover, we discuss the advantages of dealing with hard and soft constraints in the Partial MaxSAT formalims, and present a summary of the MaxSAT Evaluations that have been organized so far as affiliated events of the International Conference on Theory and Applications of Satisfiability Testing.

scholarly journals Branch and Bound Algorithm for the Traveling Salesman Problem is not a Direct Type Algorithm

2020 ◽  
Vol 27 (1) ◽  
pp. 72-85
Author(s):  
Aleksandr N. Maksimenko
Keyword(s):  
Combinatorial Optimization ◽  
Traveling Salesman Problem ◽  
Branch And Bound ◽  
Optimization Problems ◽  
Clique Number ◽  
Traveling Salesman ◽  
Branch And Bound Algorithm ◽  
Combinatorial Optimization Problems ◽  
Type Algorithm ◽  
The Traveling Salesman Problem

In this paper, we consider the notion of a direct type algorithm introduced by V. A. Bondarenko in 1983. A direct type algorithm is a linear decision tree with some special properties. the concept of a direct type algorithm is determined using the graph of solutions of a combinatorial optimization problem. ‘e vertices of this graph are all feasible solutions of a problem. Two solutions are called adjacent if there are input data for which these and only these solutions are optimal. A key feature of direct type algorithms is that their complexity is bounded from below by the clique number of the solutions graph. In 2015-2018, there were five papers published, the main results of which are estimates of the clique numbers of polyhedron graphs associated with various combinatorial optimization problems. the main motivation in these works is the thesis that the class of direct type algorithms is wide and includes many classical combinatorial algorithms, including the branch and bound algorithm for the traveling salesman problem, proposed by J. D. C. Little, K. G. Murty, D. W. Sweeney, C. Karel in 1963. We show that this algorithm is not a direct type algorithm. Earlier, in 2014, the author of this paper showed that the Hungarian algorithm for the assignment problem is not a direct type algorithm. ‘us, the class of direct type algorithms is not so wide as previously assumed.

Sign in / Sign up

Export Citation Format

Share Document