Pages that link to "Item:Q1924068"
From MaRDI portal
The following pages link to A branch-and-reduce approach to global optimization (Q1924068):
Displaying 50 items.
- Extended reverse-convex programming: an approximate enumeration approach to global optimization (Q288222) (← links)
- Theoretical and computational results about optimality-based domain reductions (Q288410) (← links)
- 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)
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
- RLT-POS: reformulation-linearization technique-based optimization software for solving polynomial programming problems (Q340017) (← links)
- GLOMIQO: global mixed-integer quadratic optimizer (Q367170) (← links)
- A Newton method for solving continuous multiple material minimum compliance problems (Q373922) (← links)
- Semidefinite relaxations for non-convex quadratic mixed-integer programming (Q378112) (← links)
- Reduced RLT representations for nonconvex polynomial programming problems (Q427362) (← links)
- Bounds tightening based on optimality conditions for nonconvex box-constrained optimization (Q506441) (← links)
- Three enhancements for optimization-based bound tightening (Q522269) (← links)
- Global solution of optimization problems with parameter-embedded linear dynamic systems. (Q703168) (← links)
- Branch and Win: OR tree search algorithms for solving combinatorial optimisation problems. (Q703298) (← links)
- \(0\text{-}1\) multilinear programming as a unifying theory for LAD pattern generation (Q730482) (← links)
- A branch and reduce approach for solving a class of low rank d.c. programs (Q732158) (← links)
- Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming (Q742114) (← links)
- Mixed integer nonlinear programming tools: a practical overview (Q766256) (← links)
- A global optimization method, QBB, for twice-differentiable nonconvex optimization problem (Q811896) (← links)
- Bilinear modeling solution approach for fixed charge network flow problems (Q839798) (← links)
- A FPTAS for a class of linear multiplicative problems (Q849090) (← links)
- Reverse logistics network design with stochastic lead times (Q850286) (← links)
- A new bound-and-reduce approach of nonconvex quadratic programming problems (Q902837) (← links)
- Optimization and analysis of the profitability of tariff structures with two-part tariffs (Q976514) (← links)
- A nonisolated optimal solution of general linear multiplicative programming problems (Q1010262) (← links)
- Column enumeration based decomposition techniques for a class of non-convex MINLP problems (Q1029695) (← links)
- Process planning in a fuzzy environment (Q1278081) (← links)
- Interactions between nonlinear programming and modeling systems (Q1365050) (← links)
- Multiplicative programming problems: Analysis and efficient point search heuristic (Q1367730) (← links)
- Outcome-space cutting-plane algorithm for linear multiplicative programming (Q1579657) (← links)
- A hybrid LP/NLP paradigm for global optimization relaxations (Q1621693) (← links)
- An adaptive neighborhood search metaheuristic for the integrated railway rapid transit network design and line planning problem (Q1652047) (← links)
- Global optimization of MIQCPs with dynamic piecewise relaxations (Q1668791) (← links)
- On solving generalized convex MINLP problems using supporting hyperplane techniques (Q1668811) (← links)
- Strong valid inequalities for Boolean logical pattern generation (Q1675646) (← links)
- Deterministic global optimization of process flowsheets in a reduced space using McCormick relaxations (Q1685576) (← links)
- Domain reduction techniques for global NLP and MINLP optimization (Q1699520) (← links)
- An efficient strategy for the activation of MIP relaxations in a multicore global MINLP solver (Q1704912) (← links)
- Time-optimal velocity planning by a bound-tightening technique (Q1753068) (← links)
- On branching-point selection for trilinear monomials in spatial branch-and-bound: the hull relaxation (Q1756762) (← links)
- Exploiting algebraic structure in global optimization and the Belgian chocolate problem (Q1756771) (← links)
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs (Q1780950) (← links)
- Mixed integer programming for a special logic constrained optimal control problem (Q1780957) (← links)
- A comparison of complete global optimization solvers (Q1780958) (← links)
- Design of planar articulated mechanisms using branch and bound (Q1780959) (← links)
- BARON: A general purpose global optimization software package (Q1924072) (← links)
- Decomposition strategy for the stochastic pooling problem (Q1928271) (← links)
- On convex relaxations of quadrilinear terms (Q1959235) (← links)
- Global optimization problems and domain reduction strategies (Q1960192) (← links)
- Global minimization using an augmented Lagrangian method with variable lower-level constraints (Q1960193) (← links)
