Constraint Logic Programming for Non Convex NLP and MINLP Problems

Prakash Kotecha; Ravindra D. Gudi

doi:10.3182/20060402-4-br-2902.00821

ScienceGate Book Chapters

JOURNAL ARTICLE

Constraint Logic Programming for Non Convex NLP and MINLP Problems

Prakash Kotecha Ravindra D. Gudi

Year: 2006 Journal: IFAC Proceedings Volumes Vol: 39 (2)Pages: 821-826 Publisher: Elsevier BV

DOI: 10.3182/20060402-4-br-2902.00821

Get Full-Text PDF Get Analytical Report

Keywords:

Mathematics Mathematical optimization Regular polygon Variable (mathematics) Constraint (computer-aided design) Integer (computer science) Representation (politics) Function (biology) Domain (mathematical analysis) Algorithm Convex optimization Effective domain Integer programming Computer science Convex combination

Metrics

Cited By

0.00

FWCI (Field Weighted Citation Impact)

Refs

0.25

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Topics

Constraint Satisfaction and Optimization

Physical Sciences → Computer Science → Computer Networks and Communications

Optimization and Mathematical Programming

Physical Sciences → Engineering → Control and Systems Engineering

Formal Methods in Verification

Physical Sciences → Computer Science → Computational Theory and Mathematics

Constraint Logic Programming for Non Convex NLP and MINLP Problems

Metrics

Topics

Related Documents

Solving nesting problems with non‐convex polygons by constraint logic programming

Constraint satisfaction problems in logic programming

Constraint logic programming and scheduling problems

MINLP algorithms mixed with constraint programming

Solving logic problems with object-oriented constraint logic programming