A branch and bound algorithm for numerical Max-CSP

DOI10.1007/S10601-009-9084-1zbMATH Open1209.68095OpenAlexW2604592360MaRDI QIDQ968350FDOQ968350

Authors: J.-M. Normand, Alexandre Goldsztejn, Marc Christie, 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

Recommendations

• Partition-based lower bound for Max-CSP
• Numerical constraint satisfaction problems with non-isolated solutions
• A combinatorial algorithm for MAX CSP
• scientific article; zbMATH DE number 2043437
• The approximability of MAX CSP with fixed-value constraints

zbMATH Keywords

constraint programmingnumerical constraintsnumerical Max-CSP

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Consistency in networks of relations
• Interval Methods for Systems of Equations
• Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
• Applying interval arithmetic to real, integer, and boolean constraints
• Estimation theory for nonlinear models and set membership uncertainty
• Global optimization by continuous grasp
• Solving Max-SAT as weighted CSP
• Title not available (Why is that?)
• Guaranteed robust nonlinear minimax estimation

Cited In (5)

• Title not available (Why is that?)
• Note on an improved branch-and-bound algorithm to solve \(n/m/P/F_{\text{max}}\) problems
• A branch-and-bound algorithm for solving max-\(k\)-cut problem
• Genetic based discrete particle swarm optimization for elderly day care center timetabling
• Recent Advances in Constraints

Uses Software

• KNITRO
• MINOS

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q968350)