( en | de | ru )

 

Disambiguation of "Gualandi, Stefano"

Author of the publication

copydeleteadd this publication to your clipboard
A lagrangian propagator for artificial neural networks in constraint programming.

, and . Constraints An Int. J., 21 (4): 435-462 (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Stefano Meini

Stefano Cracolici

Stefano Cardanobile

Stefano Terzo

Giovanni Stefano

 

Other publications of authors with the same name

On the Separation of Topology-Free Rank Inequalities for the Max Stable Set Problem., and . SEA, volume 75 of LIPIcs, page 29:1-29:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Constraint Programming-based Column Generation., and . Ann. Oper. Res., 204 (1): 11-32 (2013)Routing, scheduling and channel assignment in Wireless Mesh Networks: Optimization models and algorithms., , , , and . Ad Hoc Networks, 8 (6): 545-563 (2010)On the Computation of Kantorovich-Wasserstein Distances Between Two-Dimensional Histograms by Uncapacitated Minimum Cost Flows., , and . SIAM J. Optim., 30 (3): 2441-2469 (2020)Lower bounding procedure for the asymmetric quadratic traveling salesman problem., , , and . Eur. J. Oper. Res., 253 (3): 584-592 (2016)A simple branching scheme for vertex coloring problems., and . Discret. Appl. Math., 160 (1-2): 192-196 (2012)On the Design of the Fiber To The Home Networks., , and . CTW, page 65-68. (2010)A Branch-and-price Approach to the k-Clustering Minimum Biclique Completion Problem., , and . CTW, page 69-72. (2010)k-Clustering Minimum Biclique Completion via a Hybrid CP and SDP Approach.. CPAIOR, volume 5547 of Lecture Notes in Computer Science, page 87-101. Springer, (2009)Improving Cutting Plane Generation with 0-1 Inequalities by Bi-criteria Separation., , and . SEA, volume 6049 of Lecture Notes in Computer Science, page 266-275. Springer, (2010)