Numerical Experience with Lower Bounds for MIQP Branch-And-Bound
From MaRDI portal
Publication:4389207
DOI10.1137/S1052623494268455zbMath0912.90225OpenAlexW2053862301MaRDI QIDQ4389207
Publication date: 12 May 1998
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s1052623494268455
Convex programming (90C25) Integer programming (90C10) Mixed integer programming (90C11) Quadratic programming (90C20)
Related Items (42)
Optimal design of multivariate acceptance sampling plans by variables ⋮ Side-constrained minimum sum-of-squares clustering: mathematical programming and random projections ⋮ Binary Optimal Control of Single-Flux-Quantum Pulse Sequences ⋮ MPC for discrete-event systems with soft and hard synchronization constraints ⋮ Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations ⋮ Optimization of workcell layouts in a mixed-model assembly line environment ⋮ On the existence of solutions to the quadratic mixed-integer mean-variance portfolio selection problem ⋮ Active Set Methods with Reoptimization for Convex Quadratic Integer Programming ⋮ Sequential penalty quadratic programming filter methods for nonlinear programming ⋮ On solving generalized convex MINLP problems using supporting hyperplane techniques ⋮ A heuristic for the label printing problem ⋮ Simultaneous state and input estimation of hybrid systems with unknown inputs ⋮ FBstab: a proximally stabilized semismooth algorithm for convex quadratic programming ⋮ A Scalable Algorithm for Sparse Portfolio Selection ⋮ A recipe for finding good solutions to MINLPs ⋮ Optimal exact design of double acceptance sampling plans by attributes ⋮ Risky traveling salesman problem ⋮ A line search exact penalty method using steering rules ⋮ Variable neighborhood search: basics and variants ⋮ Modeling and Predictive Control of Nonlinear Hybrid Systems Using Mixed Logical Dynamical Formalism ⋮ Using a risk-based approach to project scheduling: a case illustration from semiconductor manufacturing ⋮ Hybrid predictive control of a DC-DC boost converter in both continuous and discontinuous current modes of operation ⋮ Networked control design for coalitional schemes using game-theoretic methods ⋮ A projection-filter method for solving nonlinear complementarity problems ⋮ Modeling and control of switching max-plus-linear systems with random and deterministic switching ⋮ A new filter-Levenberg-Marquardt method with disturbance for solving nonlinear complementarity problems ⋮ A nonmonotone filter method for nonlinear optimization ⋮ OSQP: An Operator Splitting Solver for Quadratic Programs ⋮ A trust region filter method for general non-linear programming ⋮ Convex relaxations for mixed integer predictive control ⋮ Mixed integer programming for a special logic constrained optimal control problem ⋮ Solving convex MINLP optimization problems using a sequential cutting plane algorithm ⋮ Predictive control for hybrid systems. Implications of polyhedral pre-computations ⋮ Preface ⋮ Optimal exact designs of experiments via mixed integer nonlinear programming ⋮ A Feasible Active Set Method with Reoptimization for Convex Quadratic Mixed-Integer Programming ⋮ A receding horizon event-driven control strategy for intelligent traffic management ⋮ A computational framework for image-based constrained registration ⋮ Global hybrid modeling and control of a buck converter: A novel concept ⋮ On the generalization of ECP and OA methods to nonsmooth convex MINLP problems ⋮ Orthogonal drawings of graphs with vertex and edge labels ⋮ On the equivalence of linear complementarity problems
This page was built for publication: Numerical Experience with Lower Bounds for MIQP Branch-And-Bound
