Pages that link to "Item:Q3396388"
From MaRDI portal
The following pages link to Branching and bounds tighteningtechniques for non-convex MINLP (Q3396388):
Displaying 50 items.
- Global optimization with spline constraints: a new branch-and-bound method based on B-splines (Q300751) (← links)
- Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects (Q312490) (← links)
- A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in \(n\)-space (Q316167) (← links)
- Mathematical programming techniques in water network optimization (Q319201) (← 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)
- RLT-POS: reformulation-linearization technique-based optimization software for solving polynomial programming problems (Q340017) (← links)
- A non-parametric approach to demand forecasting in revenue management (Q342029) (← links)
- Divisive heuristic for modularity density maximization (Q342346) (← links)
- Convergence analysis of Taylor models and McCormick-Taylor models (Q367158) (← links)
- GLOMIQO: global mixed-integer quadratic optimizer (Q367170) (← links)
- A recipe for finding good solutions to MINLPs (Q384810) (← links)
- A framework for globally optimizing mixed-integer signomial programs (Q398656) (← links)
- Mathematical programming: Turing completeness and applications to software analysis (Q405669) (← links)
- Global optimization of mixed-integer nonlinear (polynomial) programming problems: The Bernstein polynomial approach (Q411431) (← links)
- Reduced RLT representations for nonconvex polynomial programming problems (Q427362) (← links)
- An integer linear programming approach for bilinear integer programming (Q435736) (← links)
- Fitting piecewise linear continuous functions (Q439615) (← links)
- Energy-optimal multi-goal motion planning for planar robot manipulators (Q467470) (← links)
- An improved Bernstein global optimization algorithm for MINLP problems with application in process industry (Q475423) (← links)
- Stabilizer-based symmetry breaking constraints for mathematical programs (Q486387) (← links)
- Extended formulations for convex envelopes (Q486393) (← links)
- A reliable affine relaxation method for global optimization (Q496103) (← links)
- Reverse propagation of McCormick relaxations (Q496587) (← links)
- Bounds tightening based on optimality conditions for nonconvex box-constrained optimization (Q506441) (← links)
- Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions (Q517317) (← links)
- New error measures and methods for realizing protein graphs from distance data (Q517453) (← links)
- Three enhancements for optimization-based bound tightening (Q522269) (← links)
- Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization (Q522270) (← links)
- A dynamic convexized method for nonconvex mixed integer nonlinear programming (Q547132) (← links)
- On interval-subgradient and no-good cuts (Q613320) (← links)
- Combinatorial integral approximation (Q634784) (← links)
- Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations (Q652290) (← links)
- Convergence rate of McCormick relaxations (Q656830) (← links)
- Reformulations in mathematical programming: automatic symmetry detection and exploitation (Q662305) (← links)
- Safe autonomy under perception uncertainty using chance-constrained temporal logic (Q682357) (← links)
- A computational study of primal heuristics inside an MI(NL)P solver (Q683729) (← links)
- Computing equilibria of Cournot oligopoly models with mixed-integer quantities (Q684137) (← links)
- Feasibility pump for aircraft deconfliction with speed regulation (Q721163) (← links)
- RENS. The optimal rounding (Q744216) (← links)
- Mixed integer nonlinear programming tools: a practical overview (Q766256) (← links)
- Delaunay-based derivative-free optimization via global surrogates. III: nonconvex constraints (Q785630) (← links)
- A hybrid LP/NLP paradigm for global optimization relaxations (Q1621693) (← links)
- Trajectory planning for autonomous underwater vehicles in the presence of obstacles and a nonlinear flow field using mixed integer nonlinear programming (Q1628043) (← links)
- A global MINLP approach to symbolic regression (Q1650769) (← links)
- Algorithmic and modeling insights via volumetric comparison of polyhedral relaxations (Q1650771) (← links)
- Maximizing the number of conflict-free aircraft using mixed-integer nonlinear programming (Q1652204) (← links)
- Relaxations and heuristics for the multiple non-linear separable knapsack problem (Q1652581) (← links)
- On the product knapsack problem (Q1653266) (← links)
- On linear programming relaxations for solving polynomial programming problems (Q1654348) (← links)
