Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1857671
- A Global-Optimization Algorithm for Mixed-Integer Nonlinear Programs Having Separable Non-convexity
- Global optimization of mixed-integer nonlinear (polynomial) programming problems: The Bernstein polynomial approach
- Global optimization and constraint satisfaction: the branch-and-reduce approach
- scientific article; zbMATH DE number 1101647
Cited in
(only showing first 100 items - show all)- Editorial: Reformulation techniques in mathematical programming
- A global continuation algorithm for solving binary quadratic programming problems
- Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods
- A hybrid LP/NLP paradigm for global optimization relaxations
- On linear programming relaxations for solving polynomial programming problems
- 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 mean-risk mixed integer nonlinear program for transportation network protection
- Deterministic global optimization of process flowsheets in a reduced space using McCormick relaxations
- Domain reduction techniques for global NLP and MINLP optimization
- An efficient strategy for the activation of MIP relaxations in a multicore global MINLP solver
- Computing feasible points for binary MINLPs with MPECs
- Time-optimal velocity planning by a bound-tightening technique
- The demand weighted vehicle routing problem
- Global optimization of nonconvex problems with convex-transformable intermediates
- Single-source capacitated multi-facility Weber problem-an iterative two phase heuristic algorithm
- Rounding-based heuristics for nonconvex MINLPS
- An exact solution method for reliability optimization in complex systems
- A polyhedral branch-and-cut approach to global optimization
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
- A comparison of complete global optimization solvers
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Algorithms for linear programming with linear complementarity constraints
- Global optimization of nonlinear least-squares problems by branch-and-bound and optimality constraints
- Inexact solution of NLP subproblems in MINLP
- Convex envelopes generated from finitely many compact convex sets
- Explicit convex and concave envelopes through polyhedral subdivisions
- A review of deterministic optimization methods in engineering and management
- Portfolio optimization for wealth-dependent risk preferences
- On convex relaxations of quadrilinear terms
- Global optimization problems and domain reduction strategies
- A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs
- Valid inequalities for the topology optimization problem in gas network design
- Convergent upper bounds in global minimization with nonlinear equality constraints
- Performance safety enforcement in strongly connected timed event graphs
- Computing mixed strategies equilibria in presence of switching costs by the solution of nonconvex QP problems
- A geometric branch and bound method for robust maximization of convex functions
- Branch-and-price for a class of nonconvex mixed-integer nonlinear programs
- A multi-objective and multi-period optimization model for urban healthcare waste's reverse logistics network design
- Data-driven spatial branch-and-bound algorithms for box-constrained simulation-based optimization
- SDP-quality bounds via convex quadratic relaxations for global optimization of mixed-integer quadratic programs
- Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT
- Maximum feasible subsystems of distance geometry constraints
- Side-constrained minimum sum-of-squares clustering: mathematical programming and random projections
- On the implementation of a global optimization method for mixed-variable problems
- Deterministic global derivative-free optimization of black-box problems with bounded Hessian
- Optimality-based domain reduction for inequality-constrained NLP and MINLP problems
- Distance geometry and data science
- On the impact of running intersection inequalities for globally solving polynomial optimization problems
- A new framework to relax composite functions in nonlinear programs
- Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Models and solution techniques for production planning problems with increasing byproducts
- Multivariate McCormick relaxations
- Global optimization of general nonconvex problems with intermediate polynomial substructures
- A primal heuristic for optimizing the topology of gas networks based on dual information
- The location-allocation problem of drone base stations
- Tuning BARON using derivative-free optimization algorithms
- QPLIB: a library of quadratic programming instances
- A decomposition method for MINLPs with Lipschitz continuous nonlinearities
- Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints
- Global optimization of nonconvex problems with multilinear intermediates
- The optimization test environment
- Mixed-integer linear methods for layout-optimization of screening systems in recovered paper production
- Deterministic global optimization of binary hybrid distillation/melt-crystallization processes based on relaxed MINLP formulations
- Natural gas production network infrastructure development under uncertainty
- Three ideas for a feasibility pump for nonconvex MINLP
- Optimization and homotopy methods for the Gibbs free energy of simple magmatic mixtures
- A general framework for convexity analysis in deterministic global optimization
- Bound reduction using pairs of linear inequalities
- Mixed integer nonlinear programming tools: an updated practical overview
- Sufficient pruning conditions for MINLP in gas network design
- Enhancing the normalized multiparametric disaggregation technique for mixed-integer quadratic programming
- The unit commitment model with concave emissions costs: a hybrid Benders' decomposition with nonconvex master problems
- Relaxations of factorable functions with convex-transformable intermediates
- Undercover: a primal MINLP heuristic exploring a largest sub-MIP
- Optimization of a complex flexible multibody systems with composite materials
- Efficient interval partitioning-local search collaboration for constraint satisfaction
- Global optimization in stabilizing controller design
- Robust optimization of contaminant sensor placement for community water systems
- A local relaxation approach for the siting of electrical substations
- An optimization method for solving mixed discrete-continuous programming problems
- Reliability redundancy allocation: an improved realization for nonconvex nonlinear programming problems
- Accelerating branch-and-bound through a modeling language construct for relaxation-specific constraints
- Perspective reformulations of mixed integer nonlinear programs with indicator variables
- Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
- Supply capacity acquisition and allocation with uncertain customer demands
- A computational study on QP problems with general linear constraints
- Exact and fast algorithms for mixed-integer nonlinear programming
- On minimal valid inequalities for mixed integer conic programs
- Global solution of bilevel programming problems
- Solving chance-constrained optimization problems with stochastic quadratic inequalities
- Valid inequalities and convex hulls for multilinear functions
- Extended reverse-convex programming: an approximate enumeration approach to global optimization
- Theoretical and computational results about optimality-based domain reductions
- Perspective reformulation and applications
- Disjunctive Cuts for Nonconvex MINLP
- Global optimization of mixed-integer signomial programming problems
- Validation of nominations in gas network optimization: models, methods, and solutions
- Alternative branching rules for some nonconvex problems
This page was built for publication: Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1881050)
