ARTÍCULO
TITULO

The Minimization Problem for Boolean Formulas

Hemaspaandra    
E. Wechsung    
G.    

Resumen

No disponible

 Artículos similares

       
 
Przemyslaw Sebastjan and Waclaw Kus    
In this paper, the authors focus on presenting the methodology for tuning optimization algorithm parameters, with a special focus on evolutionary algorithm applications. The problem considered concerns the phenomenon of nonlinear buckling of the automoti... ver más
Revista: Applied Sciences

 
David Rajaratnam, Torsten Schaub, Philipp Wanko, Kai Chen, Sirui Liu and Tran Cao Son    
A warehouse delivery problem consists of a set of robots that undertake delivery jobs within a warehouse. Items are moved around the warehouse in response to events. A solution to a warehouse delivery problem is a collision-free schedule of robot movemen... ver más
Revista: Algorithms

 
Nikoletta Gkonou, Emmanouil Nisyrios and Konstantinos Gkiotsalitis    
This study develops optimal maintenance schedules for train lines, a critical endeavor ensuring the safety, efficiency, and reliability of railway networks. The study addresses the combined scheduling problem of maintenance works and crews on the railway... ver más
Revista: Applied Sciences

 
Vladimir Krutikov, Elena Tovbis, Anatoly Bykov, Predrag Stanimirovic, Ekaterina Chernova and Lev Kazakovtsev    
We investigate a solution of a convex programming problem with a strongly convex objective function based on the dual approach. A dual optimization problem has constraints on the positivity of variables. We study the methods and properties of transformat... ver más
Revista: Algorithms

 
Walter Gil-González, Oscar Danilo Montoya and César Leonardo Trujillo-Rodríguez    
This research addresses the efficient integration and sizing of flexible alternating current transmission systems (FACTS) in electrical distribution networks via a convex optimization approach. The exact mixed-integer nonlinear programming (MINLP) model ... ver más
Revista: Algorithms