Pages that link to "Item:Q951092"

The following pages link to An algorithmic framework for convex mixed integer nonlinear programs (Q951092):

Displaying 50 items.

• Subgradient Based Outer Approximation for Mixed Integer Second Order Cone Programming (Q2897293) (← links)
• Using Interior-Point Methods within an Outer Approximation Framework for Mixed Integer Nonlinear Programming (Q2897298) (← links)
• An Algorithmic Framework for MINLP with Separable Non-Convexity (Q2897302) (← links)
• An interior point method for nonlinear programming with infeasibility detection capabilities (Q2926056) (← links)
• Interactive dynamic optimization server – connecting one modelling language with many solvers (Q2926076) (← links)
• A Decomposition-Based Heuristic for Collaborative Scheduling in a Network of Open-Pit Mines (Q2940058) (← links)
• Validation of nominations in gas network optimization: models, methods, and solutions (Q2943808) (← links)
• Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2 (Q2943816) (← links)
• Generalized Benders Decomposition for one Class of MINLPs with Vector Conic Constraint (Q2947228) (← links)
• An Outer-Inner Approximation for Separable Mixed-Integer Nonlinear Programs (Q2967613) (← links)
• Lift-and-Project Cuts for Mixed Integer Convex Programs (Q3009750) (← links)
• Lagrangean-based decomposition algorithms for multicommodity network design problems with penalized constraints (Q3057143) (← links)
• Route optimization for multiple searchers (Q3065632) (← links)
• Mixed integer nonlinear programming using interior-point methods (Q3096887) (← links)
• Extended Formulations in Mixed-Integer Convex Programming (Q3186495) (← links)
• Active Set Methods with Reoptimization for Convex Quadratic Integer Programming (Q3195322) (← links)
• An Outer Approximation Algorithm for Capacitated Disassembly Scheduling Problem with Parts Commonality and Random Demand (Q3296385) (← links)
• Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables (Q3503836) (← links)
• Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs (Q3503837) (← links)
• Convex relaxations for mixed-integer nonlinear programs (Q4605948) (← links)
• SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework (Q4637831) (← links)
• A framework for solving mixed-integer semidefinite programs (Q4637832) (← links)
• Global solution of non-convex quadratically constrained quadratic programs (Q4646675) (← links)
• (Q4788630) (← links)
• The travelling salesman problem with neighbourhoods: MINLP solution (Q4924121) (← links)
• The capacitated transshipment location problem with stochastic handling utilities at the facilities (Q4929090) (← links)
• Improving the performance of DICOPT in convex MINLP problems using a feasibility pump (Q4972550) (← links)
• Conflict Analysis for MINLP (Q4995080) (← links)
• A Mixed-Integer Fractional Optimization Approach to Best Subset Selection (Q4995087) (← links)
• Genomic feature selection by coverage design optimization (Q5036376) (← links)
• Constructing Lattice-Free Gradient Polyhedra in Dimension Two (Q5041758) (← links)
• Mixed-Projection Conic Optimization: A New Paradigm for Modeling Rank Constraints (Q5060505) (← links)
• Mixed-Integer Convex Representability (Q5076722) (← links)
• Approximation Properties and Tight Bounds for Constrained Mixed-Integer Optimal Control (Q5111073) (← links)
• Quadratic Combinatorial Optimization Using Separable Underestimators (Q5136070) (← 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)
• An Algorithm Model for Mixed Variable Programming (Q5317537) (← links)
• Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods (Q5351613) (← links)
• Outer-approximation algorithms for nonsmooth convex MINLP problems (Q5745165) (← links)
• Global Optimization and Constraint Satisfaction (Q5897039) (← links)
• The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming (Q5964241) (← links)
• Disjunctive cuts in mixed-integer conic optimization (Q6038657) (← links)
• A successive linear relaxation method for MINLPs with multivariate Lipschitz continuous nonlinearities (Q6050153) (← links)
• Scheduling of network tasks to minimize the consumed energy (Q6070417) (← links)
• Complex portfolio selection via convex mixed‐integer quadratic programming: a survey (Q6070970) (← links)
• MINLP‐based hybrid strategy for operating mode selection of TES‐backed‐up refrigeration systems (Q6078905) (← links)
• Sparse convex optimization toolkit: a mixed-integer framework (Q6087059) (← links)
• A survey on mixed-integer programming techniques in bilevel optimization (Q6114905) (← links)