A branch and bound algorithm for numerical Max-CSP

DOI10.1007/s10601-009-9084-1zbMath1209.68095OpenAlexW2604592360MaRDI QIDQ968350

Marc Christie, Alexandre Goldsztejn, Jean-Marie Normand, Frédéric Benhamou

Publication date: 5 May 2010

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10601-009-9084-1

zbMATH Keywords

constraint programmingnumerical constraintsnumerical Max-CSP

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Logic programming (68N17)

Related Items (1)

Genetic based discrete particle swarm optimization for elderly day care center timetabling

Uses Software

• KNITRO
• MINOS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Estimation theory for nonlinear models and set membership uncertainty
• Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
• Consistency in networks of relations
• Global optimization by continuous grasp
• Interval Methods for Systems of Equations
• Applying interval arithmetic to real, integer, and boolean constraints
• Guaranteed robust nonlinear minimax estimation
• Principles and Practice of Constraint Programming – CP 2003

This page was built for publication: A branch and bound algorithm for numerical Max-CSP