Bonmin

swMATH4766MaRDI QIDQ16933FDOQ16933

Author name not available (Why is that?)

Cited In (only showing first 100 items - show all)

• A Mixed-Integer Fractional Optimization Approach to Best Subset Selection
• Adaptive sampling line search for local stochastic optimization with integer variables
• Submodularity and local search approaches for maximum capture problems under generalized extreme value models
• A branch and bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation
• Approximation properties and tight bounds for constrained mixed-integer optimal control
• Outer-approximation algorithms for nonsmooth convex MINLP problems
• On support vector machines under a multiple-cost scenario
• A note on solving DiDi's driver-order matching problem
• Constructing lattice-free gradient polyhedra in dimension two
• Nonlinear chance-constrained problems with applications to hydro scheduling
• A partial outer convexification approach to control transmission lines
• Optimal design and dispatch of a system of diesel generators, photovoltaics and batteries for remote locations
• Penalty and relaxation methods for the optimal placement and operation of control valves in water supply networks
• Conflict Analysis for MINLP
• Trajectory planning for autonomous underwater vehicles in the presence of obstacles and a nonlinear flow field using mixed integer nonlinear programming
• The demand weighted vehicle routing problem
• An adaptive neighborhood search metaheuristic for the integrated railway rapid transit network design and line planning problem
• Optimization of supply chain systems with price elasticity of demand
• Active network management for electrical distribution systems: problem formulation, benchmark, and approximate solution
• Global solution of non-convex quadratically constrained quadratic programs
• Optimization of the Design and Partial-Load Operation of Power Plants Using Mixed-Integer Nonlinear Programming
• Preprocessing and cutting planes with conflict graphs
• Using regularization and second order information in outer approximation for convex MINLP
• Optimal number and location of storage hubs and biogas production reactors in farmlands with allocation of multiple feedstocks
• A multicut outer-approximation approach for competitive facility location under random utilities
• The Chvátal-Gomory Closure of an Ellipsoid Is a Polyhedron
• Ten years of feasibility pump, and counting
• On speed scaling via integer programming
• An effective procedure for feature subset selection in logistic regression based on information criteria
• Outer approximation for global optimization of mixed-integer quadratic bilevel problems
• Two-stage stochastic optimization for optimal power flow under renewable generation uncertainty
• Discrete dynamical system approaches for Boolean polynomial optimization
• A note on ``A superior representation method for piecewise linear functions
• Embedded optimal control of robot manipulators with passive joints
• Partially distributed outer approximation
• Mixed-integer second-order cone programming for lower hedging of American contingent claims in incomplete markets
• On the Weber facility location problem with limited distances and side constraints
• Product allocation to different types of distribution center in retail logistics networks
• Virtuous smoothing for global optimization
• Finding a Hamiltonian cycle by finding the global minimizer of a linearly constrained problem
• An exact algorithm for a resource allocation problem in mobile wireless communications
• Quadratic Combinatorial Optimization Using Separable Underestimators
• Exact optimization and decomposition approaches for shelf space allocation
• Pump scheduling in drinking water distribution networks with an LP/NLP-based branch and bound
• Improving the performance of DICOPT in convex MINLP problems using a feasibility pump
• The capacitated transshipment location problem with stochastic handling utilities at the facilities
• Alternative regularizations for outer-approximation algorithms for convex MINLP
• An algorithmic framework for MINLP with separable non-convexity
• An overview of exact algorithms for the Euclidean Steiner tree problem in \(n\)-space
• Linearization and parallelization schemes for convex mixed-integer nonlinear optimization
• On minimal valid inequalities for mixed integer conic programs
• An algorithm for two-stage stochastic mixed-integer nonlinear convex problems
• An overview of MINLP algorithms and their implementation in Muriqui optimizer
• Optimal location of green zones in metropolitan areas to control the urban heat island
• A mixed-integer PDE-constrained optimization formulation for electromagnetic cloaking
• An MINLP Solution Method for a Water Network Problem
• QPLIB: a library of quadratic programming instances
• Towards an objective feasibility pump for convex minlps
• A primal heuristic for optimizing the topology of gas networks based on dual information
• Combination of nonlinear and linear optimization of transient gas networks
• Using the analytic center in the feasibility pump
• Heuristics for convex mixed integer nonlinear programs
• FilMINT: an outer approximation-based solver for convex mixed-integer nonlinear programs
• Finite Disjunctive Programming Characterizations for General Mixed-Integer Linear Programs
• An algorithmic framework for convex mixed integer nonlinear programs
• A feasibility pump for mixed integer nonlinear programs
• Semidefinite relaxations for non-convex quadratic mixed-integer programming
• On combining machine learning with decision making
• Sparse classification: a scalable discrete optimization perspective
• The integer approximation error in mixed-integer optimal control
• A branch-and-cut algorithm for mixed-integer bilinear programming
• Communication protocols for options and results in a distributed optimization environment
• An improved column generation algorithm for minimum sum-of-squares clustering
• Global optimization with spline constraints: a new branch-and-bound method based on B-splines
• A storm of feasibility pumps for nonconvex MINLP
• The travelling salesman problem with neighbourhoods: MINLP solution
• The supporting hyperplane optimization toolkit for convex MINLP
• A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in \(n\)-space
• Mathematical programming techniques in water network optimization
• An interior point constraint generation algorithm for semi-infinite optimization with health-care application
• Extending the QCR method to general mixed-integer programs
• On the optimal design of water distribution networks: a practical MINLP approach
• Perspective reformulations of mixed integer nonlinear programs with indicator variables
• Finding all solutions of nonlinearly constrained systems of equations
• Integrating nonlinear branch-and-bound and outer approximation for convex mixed integer nonlinear programming
• Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
• Strict linear prices in non-convex European day-ahead electricity markets
• A recipe for finding good solutions to MINLPs
• A framework for globally optimizing mixed-integer signomial programs
• A hierarchy of relaxations for nonlinear convex generalized disjunctive programming
• Title not available (Why is that?)
• SO-MI: a surrogate model algorithm for computationally expensive nonlinear mixed-integer black-box global optimization problems
• Conic mixed-integer rounding cuts
• A 3D optimal control problem related to the urban heat islands
• GLOMIQO: global mixed-integer quadratic optimizer
• Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
• A comparison of complete global optimization solvers
• RENS. The optimal rounding
• Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
• An exact solution approach for portfolio optimization problems under stochastic and integer constraints

This page was built for software: Bonmin