Tightening the Linear Relaxation of a Mixed Integer Nonlinear Program Using Constraint Programming

DOI10.1007/978-3-642-01929-6_16zbMath1241.90054OpenAlexW1495472527MaRDI QIDQ3630163

Ignacio E. Grossmann, Pierre Pestiaux, Sylvain Mouret

Publication date: 3 June 2009

Published in: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-01929-6_16

Mathematics Subject Classification ID

Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Deterministic scheduling theory in operations research (90B35)

Related Items (2)

An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs ⋮ Petri net-based approach to short-term scheduling of crude oil operations with less tank requirement

Uses Software

• Unnamed Item

This page was built for publication: Tightening the Linear Relaxation of a Mixed Integer Nonlinear Program Using Constraint Programming