Constrained global optimization for wine blending
DOI10.1007/S10601-015-9235-5zbMATH Open1368.90133OpenAlexW2297406489MaRDI QIDQ2398517FDOQ2398517
Authors: Philippe Vismara, Remi Coletta, Gilles Trombettoni
Publication date: 16 August 2017
Published in: Constraints (Search for Journal in Brave)
Full work available at URL: https://hal-lirmm.ccsd.cnrs.fr/lirmm-01275597/file/wineblending_constraints_2016.pdf
Recommendations
global optimizationmixed integer nonlinear programmingassemblageinterval constraint programmingmixed numerical CSPwinewine blending
Applications of mathematical programming (90C90) Nonconvex programming, global optimization (90C26) Mixed integer programming (90C11)
Cites Work
- PROFIL/BIAS - A fast interval library
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Branching and bounds tighteningtechniques for non-convex MINLP
- Affine arithmetic: concepts and applications
- Constructive Interval Disjunction
- Upper bounding in inner regions for global optimization under inequality constraints
- Contractor programming
- FILIB++, a fast interval library supporting containment computations
- Title not available (Why is that?)
- Computing leximin-optimal solutions in constraint networks
Cited In (3)
Uses Software
This page was built for publication: Constrained global optimization for wine blending
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2398517)