Pages that link to "Item:Q951092"

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

Displaying 50 items.

• A primal heuristic for optimizing the topology of gas networks based on dual information (Q2260914) (← links)
• QPLIB: a library of quadratic programming instances (Q2281448) (← links)
• Branching with hyperplanes in the criterion space: the frontier partitioner algorithm for biobjective integer programming (Q2286918) (← links)
• Majority judgment over a convex candidate space (Q2294328) (← links)
• Optimal number and location of storage hubs and biogas production reactors in farmlands with allocation of multiple feedstocks (Q2295155) (← links)
• Using regularization and second order information in outer approximation for convex MINLP (Q2297649) (← links)
• Granularity in nonlinear mixed-integer optimization (Q2302751) (← links)
• Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting (Q2304553) (← links)
• Template polyhedra and bilinear optimization (Q2322312) (← links)
• On support vector machines under a multiple-cost scenario (Q2324253) (← links)
• Ten years of feasibility pump, and counting (Q2329705) (← links)
• A decomposition method for MINLPs with Lipschitz continuous nonlinearities (Q2330657) (← links)
• Extrapolating curvature lines in rough concept sketches using mixed-integer nonlinear optimization (Q2331356) (← links)
• Global optimality bounds for the placement of control valves in water supply networks (Q2331359) (← links)
• Maximizing the storage capacity of gas networks: a global MINLP approach (Q2331362) (← links)
• Operational decisions for multi-period industrial gas pipeline networks under uncertainty (Q2331366) (← links)
• Optimal location of green zones in metropolitan areas to control the urban heat island (Q2352331) (← links)
• An empirical evaluation of a walk-relax-round heuristic for mixed integer convex programs (Q2352416) (← links)
• Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints (Q2355020) (← links)
• Three ideas for a feasibility pump for nonconvex MINLP (Q2361121) (← links)
• On handling indicator constraints in mixed integer programming (Q2374361) (← links)
• Bound reduction using pairs of linear inequalities (Q2392123) (← links)
• Deterministic global optimization in ab-initio quantum chemistry (Q2392771) (← links)
• Mixed integer nonlinear programming tools: an updated practical overview (Q2393446) (← links)
• SDP-based branch-and-bound for non-convex quadratic integer optimization (Q2416574) (← links)
• A partial outer convexification approach to control transmission lines (Q2419514) (← links)
• On solving nonsmooth mixed-integer nonlinear programming problems by outer approximation and generalized benders decomposition (Q2420817) (← links)
• On the Weber facility location problem with limited distances and side constraints (Q2448124) (← links)
• Undercover: a primal MINLP heuristic exploring a largest sub-MIP (Q2452383) (← links)
• On combining machine learning with decision making (Q2512894) (← links)
• When is rounding allowed in integer nonlinear optimization? (Q2514870) (← links)
• A Lagrangian decomposition approach for the pump scheduling problem in water networks (Q2629691) (← links)
• Perspective reformulations of mixed integer nonlinear programs with indicator variables (Q2638370) (← links)
• Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations (Q2638381) (← links)
• Solving a production-routing problem with price-dependent demand using an outer approximation method (Q2664354) (← links)
• Two linear approximation algorithms for convex mixed integer nonlinear programming (Q2675735) (← links)
• On Minimal Valid Inequalities for Mixed Integer Conic Programs (Q2806815) (← links)
• Global Solution of Bilevel Programming Problems (Q2807010) (← links)
• Firefly penalty-based algorithm for bound constrained mixed-integer nonlinear programming (Q2810112) (← links)
• Static Analysis by Abstract Interpretation: A Mathematical Programming Approach (Q2814107) (← links)
• A Feasible Active Set Method with Reoptimization for Convex Quadratic Mixed-Integer Programming (Q2817838) (← links)
• An overview of exact algorithms for the Euclidean Steiner tree problem in<i>n</i>-space (Q2827758) (← links)
• (Q2861545) (← links)
• (Q2861546) (← links)
• Algorithms and Software for Convex Mixed Integer Nonlinear Programs (Q2897292) (← links)
• 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)