Pages that link to "Item:Q1780949"

The following pages link to A polyhedral branch-and-cut approach to global optimization (Q1780949):

Displaying 50 items.

• Approximated perspective relaxations: a project and lift approach (Q263157) (← links)
• Minimizing the sum of many rational functions (Q266410) (← links)
• Global solutions to a class of CEC benchmark constrained optimization problems (Q279808) (← links)
• Normalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problems (Q280099) (← links)
• Global optimization with spline constraints: a new branch-and-bound method based on B-splines (Q300751) (← links)
• Dynamic coupling of photoacclimation and photoinhibition in a model of microalgae growth (Q304817) (← links)
• Mathematical programming techniques in water network optimization (Q319201) (← links)
• A MILP formulation for generalized geometric programming using piecewise-linear approximations (Q319582) (← links)
• National-strategic investment in European power transmission capacity (Q319955) (← links)
• Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
• A model for clustering data from heterogeneous dissimilarities (Q323236) (← links)
• Floating-point arithmetic on the test bench. How are verified numerical solutions calculated? (Q335016) (← links)
• RLT-POS: reformulation-linearization technique-based optimization software for solving polynomial programming problems (Q340017) (← links)
• Approximating the objective function's gradient using perceptrons for constrained minimization with application in drag reduction (Q342078) (← links)
• Soft time-windows for a bi-objective vendor selection problem under a multi-sourcing strategy: binary-continuous differential evolution (Q342547) (← links)
• GLOMIQO: global mixed-integer quadratic optimizer (Q367170) (← links)
• Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality (Q386447) (← links)
• A framework for globally optimizing mixed-integer signomial programs (Q398656) (← links)
• Reduced RLT representations for nonconvex polynomial programming problems (Q427362) (← links)
• Packing congruent hyperspheres into a hypersphere (Q427402) (← links)
• Oops! I cannot do it again: testing for recursive feasibility in MPC (Q445103) (← links)
• Branch-and-lift algorithm for deterministic global optimization in nonlinear optimal control (Q467420) (← links)
• Bound constrained interval global optimization in the COCONUT environment (Q475813) (← links)
• A modified DIRECT algorithm with bilevel partition (Q480826) (← links)
• Upper bounding in inner regions for global optimization under inequality constraints (Q486384) (← links)
• Extended formulations for convex envelopes (Q486393) (← links)
• Global optimization of generalized semi-infinite programs via restriction of the right hand side (Q486720) (← links)
• A cost minimization heuristic for the pooling problem (Q490199) (← links)
• Reverse propagation of McCormick relaxations (Q496587) (← links)
• Bounds tightening based on optimality conditions for nonconvex box-constrained optimization (Q506441) (← links)
• An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints (Q513160) (← links)
• Three enhancements for optimization-based bound tightening (Q522269) (← links)
• Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization (Q522270) (← links)
• Convergence analysis of multivariate McCormick relaxations (Q524904) (← links)
• Computational optimization of gas compressor stations: MINLP models versus continuous reformulations (Q530424) (← links)
• Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach (Q604257) (← links)
• Combined bound-grid-factor constraints for enhancing RLT relaxations for polynomial programs (Q652688) (← links)
• Convergence rate of McCormick relaxations (Q656830) (← links)
• Reformulations in mathematical programming: automatic symmetry detection and exploitation (Q662305) (← links)
• Network expansion to mitigate market power (Q681461) (← links)
• Argument division based branch-and-bound algorithm for unit-modulus constrained complex quadratic programming (Q683728) (← links)
• A polynomial optimization approach to constant rebalanced portfolio selection (Q694522) (← links)
• Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons (Q717135) (← links)
• \texttt{lsmear}: a variable selection strategy for interval branch and bound solvers (Q721162) (← links)
• Reformulations for utilizing separability when solving convex MINLP problems (Q721170) (← links)
• DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs (Q723488) (← links)
• All or nothing at all (Q727180) (← links)
• Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming (Q742114) (← links)
• Working fluid selection for organic rankine cycles via deterministic global optimization of design and operation (Q779765) (← links)
• Delaunay-based derivative-free optimization via global surrogates. III: nonconvex constraints (Q785630) (← links)