Abstract: The aim of the paper presented herein is to propose a new mixed integer formulation and an efficient metaheuristic for the Biobjective Cumulative Capacitated Vehicle Routing Problem that ...
Abstract: Boolean satisfiability (SAT), the first proven nondeterministic polynominal-complete problem, is crucial in dataintensive applications. Different applications have a wide spectrum of SAT ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback