Pages that link to "Item:Q4389207"

The following pages link to Numerical Experience with Lower Bounds for MIQP Branch-And-Bound (Q4389207):

Displaying 42 items.

• OSQP: An Operator Splitting Solver for Quadratic Programs (Q78613) (← links)
• A recipe for finding good solutions to MINLPs (Q384810) (← links)
• Risky traveling salesman problem (Q418099) (← links)
• A line search exact penalty method using steering rules (Q431002) (← links)
• Networked control design for coalitional schemes using game-theoretic methods (Q518344) (← links)
• Modeling and control of switching max-plus-linear systems with random and deterministic switching (Q692382) (← links)
• A nonmonotone filter method for nonlinear optimization (Q694518) (← links)
• Convex relaxations for mixed integer predictive control (Q710707) (← links)
• Optimization of workcell layouts in a mixed-model assembly line environment (Q850882) (← links)
• On the existence of solutions to the quadratic mixed-integer mean-variance portfolio selection problem (Q853084) (← links)
• Sequential penalty quadratic programming filter methods for nonlinear programming (Q864206) (← links)
• A heuristic for the label printing problem (Q875404) (← links)
• Simultaneous state and input estimation of hybrid systems with unknown inputs (Q875973) (← links)
• Using a risk-based approach to project scheduling: a case illustration from semiconductor manufacturing (Q928039) (← links)
• A projection-filter method for solving nonlinear complementarity problems (Q961587) (← links)
• A new filter-Levenberg-Marquardt method with disturbance for solving nonlinear complementarity problems (Q963957) (← links)
• Predictive control for hybrid systems. Implications of polyhedral pre-computations (Q1003540) (← links)
• A computational framework for image-based constrained registration (Q1025865) (← links)
• On solving generalized convex MINLP problems using supporting hyperplane techniques (Q1668811) (← links)
• Variable neighborhood search: basics and variants (Q1707084) (← links)
• Mixed integer programming for a special logic constrained optimal control problem (Q1780957) (← links)
• On the equivalence of linear complementarity problems (Q1866003) (← links)
• A receding horizon event-driven control strategy for intelligent traffic management (Q2058578) (← links)
• Side-constrained minimum sum-of-squares clustering: mathematical programming and random projections (Q2131141) (← links)
• FBstab: a proximally stabilized semismooth algorithm for convex quadratic programming (Q2173976) (← links)
• Optimal exact designs of experiments via mixed integer nonlinear programming (Q2302472) (← links)
• A trust region filter method for general non-linear programming (Q2489398) (← links)
• Solving convex MINLP optimization problems using a sequential cutting plane algorithm (Q2506191) (← links)
• Orthogonal drawings of graphs with vertex and edge labels (Q2573336) (← links)
• Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations (Q2638381) (← links)
• A Feasible Active Set Method with Reoptimization for Convex Quadratic Mixed-Integer Programming (Q2817838) (← links)
• Modeling and Predictive Control of Nonlinear Hybrid Systems Using Mixed Logical Dynamical Formalism (Q2977679) (← links)
• Hybrid predictive control of a DC-DC boost converter in both continuous and discontinuous current modes of operation (Q3013956) (← links)
• Active Set Methods with Reoptimization for Convex Quadratic Integer Programming (Q3195322) (← links)
• Global hybrid modeling and control of a buck converter: A novel concept (Q3401310) (← links)
• MPC for discrete-event systems with soft and hard synchronization constraints (Q4800354) (← links)
• Optimal design of multivariate acceptance sampling plans by variables (Q5040527) (← links)
• Binary Optimal Control of Single-Flux-Quantum Pulse Sequences (Q5047936) (← links)
• A Scalable Algorithm for Sparse Portfolio Selection (Q5087719) (← links)
• Optimal exact design of double acceptance sampling plans by attributes (Q5107524) (← links)
• On the generalization of ECP and OA methods to nonsmooth convex MINLP problems (Q5495574) (← links)
• Preface (Q5970730) (← links)