Branching and bounds tighteningtechniques for non-convex MINLP
From MaRDI portal
Publication:3396388
DOI10.1080/10556780903087124zbMath1179.90237OpenAlexW2001741445MaRDI QIDQ3396388
Margot, François, Leo Liberti, Pietro Belotti, Jon Lee, Andreas Wächter
Publication date: 18 September 2009
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556780903087124
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)
Related Items
A hybrid LP/NLP paradigm for global optimization relaxations, Trajectory planning for autonomous underwater vehicles in the presence of obstacles and a nonlinear flow field using mixed integer nonlinear programming, Global optimization with spline constraints: a new branch-and-bound method based on B-splines, Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects, A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in \(n\)-space, Mathematical programming techniques in water network optimization, Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, A model for clustering data from heterogeneous dissimilarities, A global MINLP approach to symbolic regression, Algorithmic and modeling insights via volumetric comparison of polyhedral relaxations, Maximizing the number of conflict-free aircraft using mixed-integer nonlinear programming, Relaxations and heuristics for the multiple non-linear separable knapsack problem, RLT-POS: reformulation-linearization technique-based optimization software for solving polynomial programming problems, On the product knapsack problem, A non-parametric approach to demand forecasting in revenue management, Divisive heuristic for modularity density maximization, On linear programming relaxations for solving polynomial programming problems, Convergence analysis of Taylor models and McCormick-Taylor models, GLOMIQO: global mixed-integer quadratic optimizer, Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness, Convergence-order analysis of branch-and-bound algorithms for constrained problems, Arbitrarily tight \(\alpha \mathrm{BB}\) underestimators of general non-linear functions over sub-optimal domains, A computational study of global optimization solvers on two trust region subproblems, A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables, Guided dive for the spatial branch-and-bound, A recipe for finding good solutions to MINLPs, Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations, Some results on the strength of relaxations of multilinear functions, A storm of feasibility pumps for nonconvex MINLP, The design of a reliable and robust hierarchical health service network using an accelerated Benders decomposition algorithm, On interval-subgradient and no-good cuts, Virtuous smoothing for global optimization, A framework for globally optimizing mixed-integer signomial programs, Mathematical programming: Turing completeness and applications to software analysis, A generalization of the classical \(\alpha \)BB convex underestimation via diagonal and nondiagonal quadratic terms, Global optimization of mixed-integer nonlinear (polynomial) programming problems: The Bernstein polynomial approach, Algorithms for generalized potential games with mixed-integer variables, Inexact solution of NLP subproblems in MINLP, Domain reduction techniques for global NLP and MINLP optimization, Reduced RLT representations for nonconvex polynomial programming problems, A comparative study of SQP-type algorithms for nonlinear and nonconvex mixed-integer optimization, Combinatorial integral approximation, Explicit convex and concave envelopes through polyhedral subdivisions, An integer linear programming approach for bilinear integer programming, An efficient strategy for the activation of MIP relaxations in a multicore global MINLP solver, Fitting piecewise linear continuous functions, On global optimization with indefinite quadratics, On convex relaxations of quadrilinear terms, Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations, Ball-and-finger system: modeling and optimal trajectories, Energy-optimal multi-goal motion planning for planar robot manipulators, Convergence rate of McCormick relaxations, An improved Bernstein global optimization algorithm for MINLP problems with application in process industry, Reformulations in mathematical programming: automatic symmetry detection and exploitation, Stabilizer-based symmetry breaking constraints for mathematical programs, Extended formulations for convex envelopes, A reliable affine relaxation method for global optimization, Reverse propagation of McCormick relaxations, Bounds tightening based on optimality conditions for nonconvex box-constrained optimization, Safe autonomy under perception uncertainty using chance-constrained temporal logic, A computational study of primal heuristics inside an MI(NL)P solver, Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions, Computing equilibria of Cournot oligopoly models with mixed-integer quantities, New error measures and methods for realizing protein graphs from distance data, Mixed-integer linear programming heuristics for the prepack optimization problem, Time-optimal velocity planning by a bound-tightening technique, Mixed-integer nonlinear programming for aircraft conflict avoidance by sequentially applying velocity and heading angle changes, Three enhancements for optimization-based bound tightening, Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization, On branching-point selection for trilinear monomials in spatial branch-and-bound: the hull relaxation, Global optimization of nonconvex problems with convex-transformable intermediates, Decomposition-based inner- and outer-refinement algorithms for global optimization, Rounding-based heuristics for nonconvex MINLPS, Globally solving nonconvex quadratic programming problems via completely positive programming, A dynamic convexized method for nonconvex mixed integer nonlinear programming, Tighter McCormick relaxations through subgradient propagation, Experimental validation of volume-based comparison for double-McCormick relaxations, Outer approximation for integer nonlinear programs via decision diagrams, Convergent upper bounds in global minimization with nonlinear equality constraints, Feasibility pump for aircraft deconfliction with speed regulation, Preprocessing and cutting planes with conflict graphs, MINLP formulations for continuous piecewise linear function fitting, Orbital shrinking: theory and applications, Monotonic reformulation and bound tightening for global optimization of ideal multi-component distillation columns, Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation, On tackling reverse convex constraints for non-overlapping of unequal circles, Convex hull representations for bounded products of variables, Parallel global search algorithm with local tuning for solving mixed-integer global optimization problems, RENS. The optimal rounding, Branch-and-price for a class of nonconvex mixed-integer nonlinear programs, Polynomial programming prevents aircraft (and other) conflicts, Output feedback design for discrete-time constrained systems subject to persistent disturbances via bilinear programming, Mixed integer nonlinear programming tools: a practical overview, A choice-based optimization approach for contracting in supply chains, Delaunay-based derivative-free optimization via global surrogates. III: nonconvex constraints, Tight bounds on the maximal perimeter and the maximal width of convex small polygons, AC optimal power flow: a conic programming relaxation and an iterative MILP scheme for global optimization, Non-convex nested Benders decomposition, Empirical performance bounds for quantum approximate optimization, Hidden invariant convexity for global and conic-intersection optimality guarantees in discrete-time optimal control, A reformulation technique to solve polynomial optimization problems with separable objective functions of bounded integer variables, A stochastic biomass blending problem in decentralized supply chains, Cycle-based formulations in distance geometry, (Global) optimization: historical notes and recent developments, Mixed-integer nonlinear and continuous optimization formulations for aircraft conflict avoidance via heading and speed deviations, A branch and bound algorithm for robust binary optimization with budget uncertainty, Learning lyapunov functions for hybrid systems, Deterministic global optimization of binary hybrid distillation/melt-crystallization processes based on relaxed MINLP formulations, COMPARISON BETWEEN FIVE MINLP SOLVERS AND NEW RESULTS RELATED TO TRIGONOMETRIC FUNCTIONS, Linear transformation based solution methods for non-convex mixed integer quadratic programs, Three ideas for a feasibility pump for nonconvex MINLP, Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT, EAGO.jl: easy advanced global optimization in Julia, Side-constrained minimum sum-of-squares clustering: mathematical programming and random projections, Global exact optimization for covering a rectangle with 6 circles, Disjunctive Cuts for Nonconvex MINLP, Symmetry in Mathematical Programming, An Algorithmic Framework for MINLP with Separable Non-Convexity, On handling indicator constraints in mixed integer programming, Obtaining Tighter Relaxations of Mathematical Programs with Complementarity Constraints, Experiments with hybrid Bernstein global optimization algorithm for the OPF problem in power systems, Strong valid inequalities for orthogonal disjunctions and bilinear covering sets, Numerical certification of Pareto optimality for biobjective nonlinear problems, Improving the Betweenness Centrality of a Node by Adding Links, Computing in Operations Research Using Julia, A general framework for convexity analysis in deterministic global optimization, Large-scale standard pooling problems with constrained pools and fixed demands, Bound reduction using pairs of linear inequalities, Deterministic global optimization in ab-initio quantum chemistry, Mixed integer nonlinear programming tools: an updated practical overview, Discrete dynamical system approaches for Boolean polynomial optimization, Exact and approximation algorithms for a soft rectangle packing problem, On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study, A Lagrangian propagator for artificial neural networks in constraint programming, Constrained global optimization for wine blending, The equilateral small octagon of maximal width, Tractable Relaxations of Composite Functions, Mixed-Integer Convex Nonlinear Optimization with Gradient-Boosted Trees Embedded, The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming, A Decomposition-Based Heuristic for Collaborative Scheduling in a Network of Open-Pit Mines, Validation of nominations in gas network optimization: models, methods, and solutions, Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2, A mixed integer linear programming support vector machine for cost-effective group feature selection: branch-cut-and-price approach, SUSPECT: MINLP special structure detector for Pyomo, A mathematical programming formulation for the Hartree-Fock problem on open-shell systems, Optimality-based domain reduction for inequality-constrained NLP and MINLP problems, Error bounds for monomial convexification in polynomial optimization, \texttt{EXPEDIS}: an exact penalty method over discrete sets, SDP-based branch-and-bound for non-convex quadratic integer optimization, A partial outer convexification approach to control transmission lines, Graph-based algorithms for the efficient solution of optimization problems involving monotone functions, Variable Bound Tightening and Valid Constraints for Multiperiod Blending, Distance geometry and data science, Facets of a mixed-integer bilinear covering set with bounds on variables, On the impact of running intersection inequalities for globally solving polynomial optimization problems, Using Two-Dimensional Projections for Stronger Separation and Propagation of Bilinear Terms, Computational advances in polynomial optimization: RAPOSa, a freely available global solver, On the relation between the extended supporting hyperplane algorithm and Kelley's cutting plane algorithm, Valid constraints for the Point Packing in a Square problem, On the Weber facility location problem with limited distances and side constraints, A locally optimal hierarchical divisive heuristic for bipartite modularity maximization, Undercover: a primal MINLP heuristic exploring a largest sub-MIP, Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques, Multi-Tree Decomposition Methods for Large-Scale Mixed Integer Nonlinear Optimization, Further optimizations of CSIDH: a systematic approach to efficient strategies, permutations, and bound vectors, More Virtuous Smoothing, Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations, Detecting and solving aircraft conflicts using bilevel programming, Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON, SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework, A new framework to relax composite functions in nonlinear programs, Relax-tighten-round algorithm for optimal placement and control of valves and chlorine boosters in water networks, Global solution of non-convex quadratically constrained quadratic programs, Global optimization, ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations, Models and solution techniques for production planning problems with increasing byproducts, Aircraft deconfliction with speed regulation: new models from mixed-integer optimization, A note on convex reformulation schemes for mixed integer quadratic programs, The travelling salesman problem with neighbourhoods: MINLP solution, Unnamed Item, Unnamed Item, Convex quadratic relaxations of nonconvex quadratically constrained quadratic programs, An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs, QPLIB: a library of quadratic programming instances, A branch-and-cut algorithm for mixed-integer bilinear programming, Preemptive Uniprocessor Scheduling of Mixed-Criticality Sporadic Task Systems, Global optimization of mathematical programs with complementarity constraints and application to clean energy deployment, Mathematical programming formulations for the alternating current optimal power flow problem, Mathematical programming formulations for the alternating current optimal power flow problem, Firefly penalty-based algorithm for bound constrained mixed-integer nonlinear programming, Static Analysis by Abstract Interpretation: A Mathematical Programming Approach, Molecular distance geometry methods: from continuous to discrete, Relaxing Nonconvex Quadratic Functions by Multiple Adaptive Diagonal Perturbations, An overview of exact algorithms for the Euclidean Steiner tree problem inn-space, Computing All Solutions of Nash Equilibrium Problems with Discrete Strategy Sets, Solving Chance-Constrained Optimization Problems with Stochastic Quadratic Inequalities, Conflict Analysis for MINLP, On the Composition of Convex Envelopes for Quadrilinear Terms, New SOCP relaxation and branching rule for bipartite bilinear programs, Global optimality bounds for the placement of control valves in water supply networks, MPEC Methods for Bilevel Optimization Problems, Kuznetsov independence for interval-valued expectations and sets of probability distributions: properties and algorithms, Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints, Optimization and sustainable development, Nonlinear chance-constrained problems with applications to hydro scheduling, Mixed-integer linear methods for layout-optimization of screening systems in recovered paper production
Uses Software
