AlphaECP

swMATH4940MaRDI QIDQ17091FDOQ17091

Author name not available (Why is that?)

Cited In (51)

• Reformulation and convex relaxation techniques for global optimization
• Using projected cutting planes in the extended cutting plane method
• Mixed integer nonlinear programming tools: a practical overview
• QPLIB: a library of quadratic programming instances
• A trust region SQP algorithm for mixed-integer nonlinear programming
• Generalized Benders Decomposition for one Class of MINLPs with Vector Conic Constraint
• Outer-approximation algorithms for nonsmooth convex MINLP problems
• Solving convex MINLP optimization problems using a sequential cutting plane algorithm
• Generalized Disjunctive Programming: A Framework for Formulation and Alternative Algorithms for MINLP Optimization
• A new achievement scalarizing function based on parameterization in multiobjective optimization
• Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT
• Trajectory planning for autonomous underwater vehicles in the presence of obstacles and a nonlinear flow field using mixed integer nonlinear programming
• Optimizing Call Center Staffing Using Simulation and Analytic Center Cutting-Plane Methods
• Relax-tighten-round algorithm for optimal placement and control of valves and chlorine boosters in water networks
• Extended ant colony optimization for non-convex mixed integer nonlinear programming
• Reformulations for utilizing separability when solving convex MINLP problems
• An adaptive neighborhood search metaheuristic for the integrated railway rapid transit network design and line planning problem
• A global MINLP approach to symbolic regression
• The unit commitment model with concave emissions costs: a hybrid Benders' decomposition with nonconvex master problems
• A decomposition method for MINLPs with Lipschitz continuous nonlinearities
• Optimization of the Design and Partial-Load Operation of Power Plants Using Mixed-Integer Nonlinear Programming
• A finite \(\epsilon\)-convergence algorithm for two-stage stochastic convex nonlinear programs with mixed-binary first and second-stage variables
• Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support
• Using regularization and second order information in outer approximation for convex MINLP
• The supporting hyperplane optimization toolkit for convex MINLP
• A dynamic convexized method for nonconvex mixed integer nonlinear programming
• Solving a dynamic separation problem using MINLP techniques
• A disjunctive cut strengthening technique for convex MINLP
• Solving pseudo-convex mixed integer optimization problems by cutting plane techniques
• Some transformation techniques with applications in global optimization
• A hierarchy of relaxations for nonlinear convex generalized disjunctive programming
• Chapter 12: Computational results for validation of nominations
• On solving generalized convex MINLP problems using supporting hyperplane techniques
• Method for solving generalized convex nonsmooth mixed-integer nonlinear programming problems
• An improved Bernstein global optimization algorithm for MINLP problems with application in process industry
• A hybrid LP/NLP paradigm for global optimization relaxations
• Algorithms and Software for Convex Mixed Integer Nonlinear Programs
• Minotaur: a mixed-integer nonlinear optimization toolkit
• The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming
• Point-to-point shortest paths on dynamic time-dependent road networks
• Convex mixed integer nonlinear programming problems and an outer approximation algorithm
• Relaxation and decomposition methods for mixed integer nonlinear programming.
• Finding multiple solutions to general integer linear programs
• A short-turning policy for the management of demand disruptions in rapid transit systems
• A trajectory-based method for mixed integer nonlinear programming problems
• A comparative study of SQP-type algorithms for nonlinear and nonconvex mixed-integer optimization
• Regularized optimization methods for convex MINLP problems
• A sequential cutting plane algorithm for solving convex NLP problems
• Maximizing the storage capacity of gas networks: a global MINLP approach
• Mixed integer nonlinear programming tools: an updated practical overview
• Inexact solution of NLP subproblems in MINLP

This page was built for software: AlphaECP