Pages that link to "Item:Q3757690"

The following pages link to An outer-approximation algorithm for a class of mixed-integer nonlinear programs (Q3757690):

Displaying 50 items.

• Multi-Tree Decomposition Methods for Large-Scale Mixed Integer Nonlinear Optimization (Q3296380) (← links)
• An Outer Approximation Algorithm for Capacitated Disassembly Scheduling Problem with Parts Commonality and Random Demand (Q3296385) (← links)
• A flexible platform for mixed‐integer non‐linear programming problems (Q3579678) (← links)
• A two‐step method for mixed‐integer nonlinear programming problems (Q4009311) (← links)
• The MINLP optimization approach to structural synthesis. I: A general view on simultaneous topology and parameter optimization. II: Simultaneous topology, parameter and standard dimension optimization by the use of the linked two-phase MINLP strategy. III (Q4253792) (← links)
• Global solution of non-convex quadratically constrained quadratic programs (Q4646675) (← links)
• Challenges in Optimal Control Problems for Gas and Fluid Flow in Networks of Pipes and Canals: From Modeling to Industrial Applications (Q4686738) (← links)
• Concurrent processing of mixed‐integer non‐linear programming problems (Q4932950) (← links)
• Improving the performance of DICOPT in convex MINLP problems using a feasibility pump (Q4972550) (← links)
• Extended cutting plane method for a class of nonsmooth nonconvex MINLP problems (Q4981878) (← links)
• High-Performance Prototyping of Decomposition Methods in GAMS (Q4995054) (← links)
• Conflict Analysis for MINLP (Q4995080) (← links)
• Genomic feature selection by coverage design optimization (Q5036376) (← links)
• Optimal design of multivariate acceptance sampling plans by variables (Q5040527) (← links)
• Constructing Lattice-Free Gradient Polyhedra in Dimension Two (Q5041758) (← links)
• (Q5054600) (← links)
• Using projected cutting planes in the extended cutting plane method (Q5057972) (← links)
• Stochastic Cutting Planes for Data-Driven Optimization (Q5057985) (← links)
• Mixed-Projection Conic Optimization: A New Paradigm for Modeling Rank Constraints (Q5060505) (← links)
• Mixed-Integer Convex Representability (Q5076722) (← links)
• A method combining norm-relaxed QCQP subproblems with active set identification for inequality constrained optimization (Q5085233) (← links)
• An Exact Algorithm for Large-Scale Continuous Nonlinear Resource Allocation Problems with Minimax Regret Objectives (Q5085488) (← links)
• A Scalable Algorithm for Sparse Portfolio Selection (Q5087719) (← links)
• Optimal exact design of double acceptance sampling plans by attributes (Q5107524) (← links)
• An Extended Mixed-Integer Programming Formulation and Dynamic Cut Generation Approach for the Stochastic Lot-Sizing Problem (Q5136076) (← links)
• A new approach for solving mixed integer DC programs using a continuous relaxation with no integrality gap and smoothing techniques (Q5151528) (← links)
• A Unified Approach to Mixed-Integer Optimization Problems With Logical Constraints (Q5158761) (← links)
• Generating Feasible Points for Mixed-Integer Convex Optimization Problems by Inner Parallel Cuts (Q5158763) (← links)
• Smoothing and Regularization for Mixed-Integer Second-Order Cone Programming with Applications in Portfolio Optimization (Q5172959) (← links)
• Two-stage stochastic optimization for optimal power flow under renewable generation uncertainty (Q5176910) (← links)
• Penalty Alternating Direction Methods for Mixed-Integer Optimization: A New View on Feasibility Pumps (Q5348468) (← links)
• Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods (Q5351613) (← links)
• On the generalization of ECP and OA methods to nonsmooth convex MINLP problems (Q5495574) (← links)
• A solution procedure for mixed-integer nonlinear programming formulation of supply chain planning with quantity discounts under demand uncertainty (Q5499840) (← links)
• Outer-approximation algorithms for nonsmooth convex MINLP problems (Q5745165) (← links)
• COMPARISON BETWEEN FIVE MINLP SOLVERS AND NEW RESULTS RELATED TO TRIGONOMETRIC FUNCTIONS (Q5880744) (← links)
• The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming (Q5964241) (← links)
• Preface (Q5970730) (← links)
• Disjunctive cuts in mixed-integer conic optimization (Q6038657) (← links)
• Modeling design and control problems involving neural network surrogates (Q6043129) (← links)
• Joint location and cost planning in maximum capture facility location under random utilities (Q6047876) (← links)
• A successive linear relaxation method for MINLPs with multivariate Lipschitz continuous nonlinearities (Q6050153) (← links)
• Fill‐rate service level constrained distribution network design (Q6060687) (← links)
• Sparse convex optimization toolkit: a mixed-integer framework (Q6087059) (← links)
• An exact cutting plane method for the Euclidean max-sum diversity problem (Q6096568) (← links)
• Nonconvex sensitivity-based generalized Benders decomposition (Q6102174) (← links)
• A survey on mixed-integer programming techniques in bilevel optimization (Q6114905) (← links)
• A solution algorithm for chance-constrained problems with integer second-stage recourse decisions (Q6126651) (← links)
• Adaptive piecewise linear relaxations for enclosure computations for nonconvex multiobjective mixed-integer quadratically constrained programs (Q6166099) (← links)
• Mixed-integer programming techniques for the minimum sum-of-squares clustering problem (Q6166100) (← links)