A Lagrangian propagator for artificial neural networks in constraint programming

DOI10.1007/s10601-015-9234-6zbMath1368.90148OpenAlexW2276412021MaRDI QIDQ2398510

Stefano Gualandi, Michele Lombardi

Publication date: 16 August 2017

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10601-015-9234-6

zbMATH Keywords

Lagrangian relaxationneural networksconstraint programming

Mathematics Subject Classification ID

Nonlinear programming (90C30) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (2)

Constraint programming and operations research ⋮ Strong mixed-integer programming formulations for trained neural networks

Uses Software

• Paramils

Cites Work

• Lagrangian bounds from decision diagrams
• New filtering for \textsc{AtMostNValue} and its weighted variant: a Lagrangian approach
• Constraint programming based Lagrangian relaxation for the automatic recording problem
• Branching and bounds tighteningtechniques for non-convex MINLP
• Introduction to Derivative-Free Optimization
• ParamILS: An Automatic Algorithm Configuration Framework
• A Lagrangian Relaxation for Golomb Rulers
• A Survey on Direct Search Methods for Blackbox Optimization and Their Applications
• Convergence Analysis of Deflected Conditional Approximate Subgradient Methods
• Embedding Decision Trees and Random Forests in Constraint Programming
• Understanding the Potential of Propagators
• Principles and Practice of Constraint Programming – CP 2004
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Lagrangian propagator for artificial neural networks in constraint programming